• Home
  • Raw
  • Download

Lines Matching refs:node

128 #define node_set(node, dst) __node_set((node), &(dst))  argument
129 static __always_inline void __node_set(int node, volatile nodemask_t *dstp) in __node_set() argument
131 set_bit(node, dstp->bits); in __node_set()
134 #define node_clear(node, dst) __node_clear((node), &(dst)) argument
135 static __always_inline void __node_clear(int node, volatile nodemask_t *dstp) in __node_clear() argument
137 clear_bit(node, dstp->bits); in __node_clear()
153 #define node_isset(node, nodemask) test_bit((node), (nodemask).bits) argument
155 #define node_test_and_set(node, nodemask) \ argument
156 __node_test_and_set((node), &(nodemask))
157 static __always_inline bool __node_test_and_set(int node, nodemask_t *addr) in __node_test_and_set() argument
159 return test_and_set_bit(node, addr->bits); in __node_test_and_set()
280 static __always_inline unsigned int __next_node_in(int node, const nodemask_t *srcp) in __next_node_in() argument
282 unsigned int ret = __next_node(node, srcp); in __next_node_in()
289 static __always_inline void init_nodemask_of_node(nodemask_t *mask, int node) in init_nodemask_of_node() argument
292 node_set(node, *mask); in init_nodemask_of_node()
295 #define nodemask_of_node(node) \ argument
299 m.bits[0] = 1UL << (node); \
301 init_nodemask_of_node(&m, (node)); \
386 #define for_each_node_mask(node, mask) \ argument
387 for ((node) = first_node(mask); \
388 (node) < MAX_NUMNODES; \
389 (node) = next_node((node), (mask)))
391 #define for_each_node_mask(node, mask) \ argument
392 for ((node) = 0; (node) < 1 && !nodes_empty(mask); (node)++)
421 static __always_inline int node_state(int node, enum node_states state) in node_state() argument
423 return node_isset(node, node_states[state]); in node_state()
426 static __always_inline void node_set_state(int node, enum node_states state) in node_set_state() argument
428 __node_set(node, &node_states[state]); in node_set_state()
431 static __always_inline void node_clear_state(int node, enum node_states state) in node_clear_state() argument
433 __node_clear(node, &node_states[state]); in node_clear_state()
472 static __always_inline int node_state(int node, enum node_states state) in node_state() argument
474 return node == 0; in node_state()
477 static __always_inline void node_set_state(int node, enum node_states state) in node_set_state() argument
481 static __always_inline void node_clear_state(int node, enum node_states state) in node_clear_state() argument
490 #define for_each_node_state(node, __state) \ argument
491 for ( (node) = 0; (node) == 0; (node) = 1)
500 #define node_set_online(node) node_set_state((node), N_ONLINE) argument
501 #define node_set_offline(node) node_clear_state((node), N_ONLINE) argument
533 #define node_online(node) node_state((node), N_ONLINE) argument
534 #define node_possible(node) node_state((node), N_POSSIBLE) argument
536 #define for_each_node(node) for_each_node_state(node, N_POSSIBLE) argument
537 #define for_each_online_node(node) for_each_node_state(node, N_ONLINE) argument