Lines Matching full:mask
20 * void node_set(node, mask) turn on bit 'node' in mask
21 * void node_clear(node, mask) turn off bit 'node' in mask
22 * void nodes_setall(mask) set all bits
23 * void nodes_clear(mask) clear all bits
24 * int node_isset(node, mask) true iff bit 'node' set in mask
25 * int node_test_and_set(node, mask) test and set bit 'node' in mask
36 * int nodes_empty(mask) Is mask empty (no bits sets)?
37 * int nodes_full(mask) Is mask full (all bits sets)?
38 * int nodes_weight(mask) Hamming weight - number of set bits
43 * int first_node(mask) Number lowest set bit, or MAX_NUMNODES
44 * int next_node(node, mask) Next node past 'node', or MAX_NUMNODES
45 * int first_unset_node(mask) First node not set in mask, or
51 * unsigned long *nodes_addr(mask) Array of unsigned long's in mask
53 * int nodemask_scnprintf(buf, len, mask) Format nodemask for printing
54 * int nodemask_parse(ubuf, ulen, mask) Parse ascii string as nodemask
55 * int nodelist_scnprintf(buf, len, mask) Format nodemask as list for printing
60 * for_each_node_mask(node, mask) for-loop node over mask
68 * int any_online_node(mask) First online node in mask
250 #define first_unset_node(mask) __first_unset_node(&(mask))
330 #define for_each_node_mask(node, mask) \
331 for ((node) = first_node(mask); \
333 (node) = next_node((node), (mask)))
335 #define for_each_node_mask(node, mask) \
336 if (!nodes_empty(mask)) \
364 #define any_online_node(mask) \
367 for_each_node_mask(node, (mask)) \
