mirror of
https://github.com/Qortal/Brooklyn.git
synced 2025-01-30 23:02:18 +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
73 lines
1.5 KiB
C
73 lines
1.5 KiB
C
// SPDX-License-Identifier: (LGPL-2.1 OR BSD-2-Clause)
|
|
|
|
#include "util/bpf_map.h"
|
|
#include <bpf/bpf.h>
|
|
#include <bpf/libbpf.h>
|
|
#include <linux/err.h>
|
|
#include <linux/kernel.h>
|
|
#include <stdbool.h>
|
|
#include <stdlib.h>
|
|
#include <unistd.h>
|
|
|
|
static bool bpf_map__is_per_cpu(enum bpf_map_type type)
|
|
{
|
|
return type == BPF_MAP_TYPE_PERCPU_HASH ||
|
|
type == BPF_MAP_TYPE_PERCPU_ARRAY ||
|
|
type == BPF_MAP_TYPE_LRU_PERCPU_HASH ||
|
|
type == BPF_MAP_TYPE_PERCPU_CGROUP_STORAGE;
|
|
}
|
|
|
|
static void *bpf_map__alloc_value(const struct bpf_map *map)
|
|
{
|
|
if (bpf_map__is_per_cpu(bpf_map__type(map)))
|
|
return malloc(round_up(bpf_map__value_size(map), 8) *
|
|
sysconf(_SC_NPROCESSORS_CONF));
|
|
|
|
return malloc(bpf_map__value_size(map));
|
|
}
|
|
|
|
int bpf_map__fprintf(struct bpf_map *map, FILE *fp)
|
|
{
|
|
void *prev_key = NULL, *key, *value;
|
|
int fd = bpf_map__fd(map), err;
|
|
int printed = 0;
|
|
|
|
if (fd < 0)
|
|
return fd;
|
|
|
|
if (!map)
|
|
return PTR_ERR(map);
|
|
|
|
err = -ENOMEM;
|
|
key = malloc(bpf_map__key_size(map));
|
|
if (key == NULL)
|
|
goto out;
|
|
|
|
value = bpf_map__alloc_value(map);
|
|
if (value == NULL)
|
|
goto out_free_key;
|
|
|
|
while ((err = bpf_map_get_next_key(fd, prev_key, key) == 0)) {
|
|
int intkey = *(int *)key;
|
|
|
|
if (!bpf_map_lookup_elem(fd, key, value)) {
|
|
bool boolval = *(bool *)value;
|
|
if (boolval)
|
|
printed += fprintf(fp, "[%d] = %d,\n", intkey, boolval);
|
|
} else {
|
|
printed += fprintf(fp, "[%d] = ERROR,\n", intkey);
|
|
}
|
|
|
|
prev_key = key;
|
|
}
|
|
|
|
if (err == ENOENT)
|
|
err = printed;
|
|
|
|
free(value);
|
|
out_free_key:
|
|
free(key);
|
|
out:
|
|
return err;
|
|
}
|