Quentin Deslandes
cf32bd9e7c
Implement the spread policy for IRQ affinity distribution using a topology-aware algorithm. The algorithm: 1. Discovers CPU topology from sysfs (NUMA node, package, die/L3, core) 2. Groups CPUs by L3 cache domain (die) with equidistant ordering 3. Round-robins across dies, spreading IRQs across the system 4. Uses first hyperthread of each core before second hyperthreads 5. Applies IRQ affinity via /proc/irq/<n>/smp_affinity When there are more IRQs than CPUs, queues wrap around using round-robin.
48 lines
2.5 KiB
C
48 lines
2.5 KiB
C
/* SPDX-License-Identifier: LGPL-2.1-or-later */
|
|
#pragma once
|
|
|
|
#include "basic-forward.h"
|
|
|
|
void *xbsearch_r(const void *key, const void *base, size_t nmemb, size_t size,
|
|
comparison_userdata_fn_t compar, void *arg);
|
|
|
|
#define typesafe_bsearch_r(k, b, n, func, userdata) \
|
|
({ \
|
|
const typeof((b)[0]) *_k = k; \
|
|
int (*_func_)(const typeof((b)[0])*, const typeof((b)[0])*, typeof(userdata)) = func; \
|
|
(typeof((b)[0])*) xbsearch_r((const void*) _k, (b), (n), sizeof((b)[0]), (comparison_userdata_fn_t) _func_, userdata); \
|
|
})
|
|
|
|
void* bsearch_safe_internal(const void *key, const void *base, size_t nmemb, size_t size, comparison_fn_t compar);
|
|
#define bsearch_safe(key, base, nmemb, size, compar) \
|
|
const_generic((base), bsearch_safe_internal(key, base, nmemb, size, compar))
|
|
|
|
#define typesafe_bsearch(k, b, n, func) \
|
|
({ \
|
|
const typeof((b)[0]) *_k = k; \
|
|
int (*_func_)(const typeof((b)[0])*, const typeof((b)[0])*) = func; \
|
|
(typeof((b)[0])*) bsearch_safe((const void*) _k, (b), (n), sizeof((b)[0]), (comparison_fn_t) _func_); \
|
|
})
|
|
|
|
void qsort_safe(void *base, size_t nmemb, size_t size, comparison_fn_t compar);
|
|
|
|
/* A wrapper around the above, but that adds typesafety: the element size is automatically derived from the type and so
|
|
* is the prototype for the comparison function */
|
|
#define typesafe_qsort(p, n, func) \
|
|
({ \
|
|
int (*_func_)(const typeof((p)[0])*, const typeof((p)[0])*) = func; \
|
|
qsort_safe((p), (n), sizeof((p)[0]), (comparison_fn_t) _func_); \
|
|
})
|
|
|
|
void qsort_r_safe(void *base, size_t nmemb, size_t size, comparison_userdata_fn_t compar, void *userdata);
|
|
|
|
#define typesafe_qsort_r(p, n, func, userdata) \
|
|
({ \
|
|
int (*_func_)(const typeof((p)[0])*, const typeof((p)[0])*, typeof(userdata)) = func; \
|
|
qsort_r_safe((p), (n), sizeof((p)[0]), (comparison_userdata_fn_t) _func_, userdata); \
|
|
})
|
|
|
|
int cmp_int(const int *a, const int *b);
|
|
int cmp_uint16(const uint16_t *a, const uint16_t *b);
|
|
int cmp_unsigned(const unsigned *a, const unsigned *b);
|