aboutsummaryrefslogtreecommitdiffstats
path: root/include
diff options
context:
space:
mode:
Diffstat (limited to 'include')
-rw-r--r--include/litmus/affinity.h10
1 files changed, 5 insertions, 5 deletions
diff --git a/include/litmus/affinity.h b/include/litmus/affinity.h
index 19e927dc656f..ca2e442eb547 100644
--- a/include/litmus/affinity.h
+++ b/include/litmus/affinity.h
@@ -24,9 +24,9 @@ void init_topology(void); /* called by Litmus module's _init_litmus() */
24 24
25/* Works like: 25/* Works like:
26void get_nearest_available_cpu( 26void get_nearest_available_cpu(
27 cpu_entry_t* nearest, 27 cpu_entry_t **nearest,
28 cpu_entry_t* start, 28 cpu_entry_t *start,
29 cpu_entry_t* entries, 29 cpu_entry_t *entries,
30 int release_master) 30 int release_master)
31 31
32Set release_master = NO_CPU for no Release Master. 32Set release_master = NO_CPU for no Release Master.
@@ -49,13 +49,13 @@ dissertation.)
49 int __level; \ 49 int __level; \
50 int __cpu; \ 50 int __cpu; \
51 int __release_master = ((release_master) == NO_CPU) ? -1 : (release_master); \ 51 int __release_master = ((release_master) == NO_CPU) ? -1 : (release_master); \
52 struct neighborhood* __neighbors = &neigh_info[(start)->cpu]; \ 52 struct neighborhood *__neighbors = &neigh_info[(start)->cpu]; \
53 \ 53 \
54 for (__level = 0; (__level < NUM_CACHE_LEVELS) && !(nearest); ++__level) { \ 54 for (__level = 0; (__level < NUM_CACHE_LEVELS) && !(nearest); ++__level) { \
55 if (__neighbors->size[__level] > 1) { \ 55 if (__neighbors->size[__level] > 1) { \
56 for_each_cpu(__cpu, __neighbors->neighbors[__level]) { \ 56 for_each_cpu(__cpu, __neighbors->neighbors[__level]) { \
57 if (__cpu != __release_master) { \ 57 if (__cpu != __release_master) { \
58 cpu_entry_t* __entry = &per_cpu((entries), __cpu); \ 58 cpu_entry_t *__entry = &per_cpu((entries), __cpu); \
59 if (!__entry->linked) { \ 59 if (!__entry->linked) { \
60 (nearest) = __entry; \ 60 (nearest) = __entry; \
61 break; \ 61 break; \