mirror of
https://github.com/Qortal/Brooklyn.git
synced 2025-01-31 07:12: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
35 lines
679 B
C
35 lines
679 B
C
/* SPDX-License-Identifier: (GPL-2.0 OR BSD-2-Clause) */
|
|
#include <linux/bpf.h>
|
|
#include <bpf/bpf_helpers.h>
|
|
|
|
struct {
|
|
__uint(type, BPF_MAP_TYPE_HASH);
|
|
__type(key, __u32);
|
|
__type(value, long);
|
|
__uint(max_entries, 2);
|
|
} htab SEC(".maps");
|
|
|
|
struct {
|
|
__uint(type, BPF_MAP_TYPE_ARRAY);
|
|
__type(key, __u32);
|
|
__type(value, long);
|
|
__uint(max_entries, 2);
|
|
} array SEC(".maps");
|
|
|
|
/* Sample program which should always load for testing control paths. */
|
|
SEC(".text") int func()
|
|
{
|
|
__u64 key64 = 0;
|
|
__u32 key = 0;
|
|
long *value;
|
|
|
|
value = bpf_map_lookup_elem(&htab, &key);
|
|
if (!value)
|
|
return 1;
|
|
value = bpf_map_lookup_elem(&array, &key64);
|
|
if (!value)
|
|
return 1;
|
|
|
|
return 0;
|
|
}
|