mirror of
https://github.com/Qortal/Brooklyn.git
synced 2025-02-20 22:25:54 +00:00
a94b3d14aa
Changes included (and more): 1. Dynamic RAM merge 2. Real-time page scan and allocation 3. Cache compression 4. Real-time IRQ checks 5. Dynamic I/O allocation for Java heap 6. Java page migration 7. Contiguous memory allocation 8. Idle pages tracking 9. Per CPU RAM usage tracking 10. ARM NEON scalar multiplication library 11. NEON/ARMv8 crypto extensions 12. NEON SHA, Blake, RIPEMD crypto extensions 13. Parallel NEON crypto engine for multi-algo based CPU stress reduction
31 lines
938 B
C
31 lines
938 B
C
/* SPDX-License-Identifier: GPL-2.0 */
|
|
#ifndef __LIBPERF_INTERNAL_CPUMAP_H
|
|
#define __LIBPERF_INTERNAL_CPUMAP_H
|
|
|
|
#include <linux/refcount.h>
|
|
#include <perf/cpumap.h>
|
|
|
|
/**
|
|
* A sized, reference counted, sorted array of integers representing CPU
|
|
* numbers. This is commonly used to capture which CPUs a PMU is associated
|
|
* with. The indices into the cpumap are frequently used as they avoid having
|
|
* gaps if CPU numbers were used. For events associated with a pid, rather than
|
|
* a CPU, a single dummy map with an entry of -1 is used.
|
|
*/
|
|
struct perf_cpu_map {
|
|
refcount_t refcnt;
|
|
/** Length of the map array. */
|
|
int nr;
|
|
/** The CPU values. */
|
|
struct perf_cpu map[];
|
|
};
|
|
|
|
#ifndef MAX_NR_CPUS
|
|
#define MAX_NR_CPUS 2048
|
|
#endif
|
|
|
|
int perf_cpu_map__idx(const struct perf_cpu_map *cpus, struct perf_cpu cpu);
|
|
bool perf_cpu_map__is_subset(const struct perf_cpu_map *a, const struct perf_cpu_map *b);
|
|
|
|
#endif /* __LIBPERF_INTERNAL_CPUMAP_H */
|