| /include/asm-generic/ |
| D | topology.h | 38 #define parent_node(node) ((void)(node),0) argument
41 #define node_to_cpumask(node) ((void)node, cpu_online_map) argument
44 #define cpumask_of_node(node) ((void)node, cpu_online_mask) argument
47 #define node_to_first_cpu(node) ((void)(node),0) argument
74 #define node_to_cpumask_ptr(v, node) \ argument
75 cpumask_t _##v = node_to_cpumask(node); \
78 #define node_to_cpumask_ptr_next(v, node) \ argument
79 _##v = node_to_cpumask(node)
|
| /include/linux/ |
| D | prio_tree.h | 89 static inline int prio_tree_root(const struct prio_tree_node *node) in prio_tree_root() argument
91 return node->parent == node; in prio_tree_root()
94 static inline int prio_tree_left_empty(const struct prio_tree_node *node) in prio_tree_left_empty() argument
96 return node->left == node; in prio_tree_left_empty()
99 static inline int prio_tree_right_empty(const struct prio_tree_node *node) in prio_tree_right_empty() argument
101 return node->right == node; in prio_tree_right_empty()
106 struct prio_tree_node *old, struct prio_tree_node *node);
108 struct prio_tree_node *node);
109 void prio_tree_remove(struct prio_tree_root *root, struct prio_tree_node *node);
112 #define raw_prio_tree_replace(root, old, node) \ argument
[all …]
|
| D | nodemask.h | 95 #define node_set(node, dst) __node_set((node), &(dst)) argument
96 static inline void __node_set(int node, volatile nodemask_t *dstp) in __node_set() argument
98 set_bit(node, dstp->bits); in __node_set()
101 #define node_clear(node, dst) __node_clear((node), &(dst)) argument
102 static inline void __node_clear(int node, volatile nodemask_t *dstp) in __node_clear() argument
104 clear_bit(node, dstp->bits); in __node_clear()
120 #define node_isset(node, nodemask) test_bit((node), (nodemask).bits) argument
122 #define node_test_and_set(node, nodemask) \ argument
123 __node_test_and_set((node), &(nodemask))
124 static inline int __node_test_and_set(int node, nodemask_t *addr) in __node_test_and_set() argument
[all …]
|
| D | node.h | 25 struct node { struct
30 extern struct node node_devices[]; argument
32 extern int register_node(struct node *, int, struct node *);
33 extern void unregister_node(struct node *node);
70 #define to_node(sys_device) container_of(sys_device, struct node, sysdev)
|
| D | rbtree.h | 136 #define RB_EMPTY_NODE(node) (rb_parent(node) == node) argument
137 #define RB_CLEAR_NODE(node) (rb_set_parent(node, node)) argument
152 static inline void rb_link_node(struct rb_node * node, struct rb_node * parent, in rb_link_node() argument
155 node->rb_parent_color = (unsigned long )parent; in rb_link_node()
156 node->rb_left = node->rb_right = NULL; in rb_link_node()
158 *rb_link = node; in rb_link_node()
|
| D | plist.h | 116 #define PLIST_NODE_INIT(node, __prio) \ argument
119 .plist = PLIST_HEAD_INIT((node).plist, NULL), \
142 static inline void plist_node_init(struct plist_node *node, int prio) in plist_node_init() argument
144 node->prio = prio; in plist_node_init()
145 plist_head_init(&node->plist, NULL); in plist_node_init()
148 extern void plist_add(struct plist_node *node, struct plist_head *head);
149 extern void plist_del(struct plist_node *node, struct plist_head *head);
204 static inline int plist_node_empty(const struct plist_node *node) in plist_node_empty() argument
206 return plist_head_empty(&node->plist); in plist_node_empty()
|
| D | slob_def.h | 4 void *kmem_cache_alloc_node(struct kmem_cache *, gfp_t flags, int node);
11 void *__kmalloc_node(size_t size, gfp_t flags, int node);
13 static inline void *kmalloc_node(size_t size, gfp_t flags, int node) in kmalloc_node() argument
15 return __kmalloc_node(size, flags, node); in kmalloc_node()
|
| D | slab.h | 229 static inline void *kmalloc_node(size_t size, gfp_t flags, int node) in kmalloc_node() argument
234 static inline void *__kmalloc_node(size_t size, gfp_t flags, int node) in __kmalloc_node() argument
242 gfp_t flags, int node) in kmem_cache_alloc_node() argument
276 #define kmalloc_node_track_caller(size, flags, node) \ argument
277 __kmalloc_node_track_caller(size, flags, node, \
280 #define kmalloc_node_track_caller(size, flags, node) \ argument
281 __kmalloc_node(size, flags, node)
286 #define kmalloc_node_track_caller(size, flags, node) \ argument
315 static inline void *kzalloc_node(size_t size, gfp_t flags, int node) in kzalloc_node() argument
317 return kmalloc_node(size, flags | __GFP_ZERO, node); in kzalloc_node()
|
| D | slab_def.h | 59 extern void *__kmalloc_node(size_t size, gfp_t flags, int node);
60 extern void *kmem_cache_alloc_node(struct kmem_cache *, gfp_t flags, int node);
62 static inline void *kmalloc_node(size_t size, gfp_t flags, int node) in kmalloc_node() argument
82 flags, node); in kmalloc_node()
85 flags, node); in kmalloc_node()
87 return __kmalloc_node(size, flags, node); in kmalloc_node()
|
| D | of.h | 52 extern struct device_node *of_get_parent(const struct device_node *node);
53 extern struct device_node *of_get_next_parent(struct device_node *node);
54 extern struct device_node *of_get_next_child(const struct device_node *node,
72 extern const void *of_get_property(const struct device_node *node,
78 const struct of_device_id *matches, const struct device_node *node);
79 extern int of_modalias_node(struct device_node *node, char *modalias, int len);
|
| D | slub_def.h | 38 int node; /* The node of the page (or -1 for debug) */ member
103 struct kmem_cache_node *node[MAX_NUMNODES]; member
231 void *__kmalloc_node(size_t size, gfp_t flags, int node);
232 void *kmem_cache_alloc_node(struct kmem_cache *, gfp_t flags, int node);
234 static __always_inline void *kmalloc_node(size_t size, gfp_t flags, int node) in kmalloc_node() argument
243 return kmem_cache_alloc_node(s, flags, node); in kmalloc_node()
245 return __kmalloc_node(size, flags, node); in kmalloc_node()
|
| D | topology.h | 41 #define nr_cpus_node(node) \ argument
43 node_to_cpumask_ptr(__tmp__, node); \
48 #define for_each_node_with_cpus(node) \ argument
49 for_each_online_node(node) \
50 if (nr_cpus_node(node))
|
| D | thermal.h | 62 struct list_head node; member
76 struct list_head node; member
95 struct list_head node; member
|
| D | tipc.h | 48 __u32 node; member
64 unsigned int node) in tipc_addr() argument
66 return (zone << 24) | (cluster << 12) | node; in tipc_addr()
|
| D | swap.h | 245 extern int scan_unevictable_register_node(struct node *node);
246 extern void scan_unevictable_unregister_node(struct node *node);
258 static inline int scan_unevictable_register_node(struct node *node) in scan_unevictable_register_node() argument
263 static inline void scan_unevictable_unregister_node(struct node *node) { } in scan_unevictable_unregister_node() argument
|
| D | vmalloc.h | 42 int node, pgprot_t prot);
55 extern void *vmalloc_node(unsigned long size, int node);
92 unsigned long flags, int node,
|
| D | of_i2c.h | 21 struct i2c_client *of_find_i2c_device_by_node(struct device_node *node);
|
| D | rio.h | 140 struct list_head node; member
171 struct list_head node; /* node in global list of ports */ member
200 struct list_head node; /* node in list of networks */ member
218 struct list_head node; member
276 struct list_head node; member
|
| /include/asm-m32r/ |
| D | mmzone.h | 44 int node; in pfn_to_nid() local
46 for (node = 0 ; node < MAX_NUMNODES ; node++) in pfn_to_nid()
47 if (pfn >= node_start_pfn(node) && pfn <= node_end_pfn(node)) in pfn_to_nid()
50 return node; in pfn_to_nid()
|
| /include/sound/ |
| D | soc-of-simple.h | 17 struct device_node *node);
20 struct device_node *node,
|
| /include/xen/ |
| D | xenbus.h | 53 const char *node; member
140 const char *dir, const char *node, unsigned int *num);
142 const char *dir, const char *node, unsigned int *len);
144 const char *dir, const char *node, const char *string);
146 const char *dir, const char *node);
148 const char *dir, const char *node);
149 int xenbus_rm(struct xenbus_transaction t, const char *dir, const char *node);
155 const char *dir, const char *node, const char *fmt, ...)
160 const char *dir, const char *node, const char *fmt, ...)
|
| /include/net/ |
| D | netrom.h | 158 #define nr_neigh_for_each(__nr_neigh, node, list) \ argument
159 hlist_for_each_entry(__nr_neigh, node, list, neigh_node)
161 #define nr_neigh_for_each_safe(__nr_neigh, node, node2, list) \ argument
162 hlist_for_each_entry_safe(__nr_neigh, node, node2, list, neigh_node)
164 #define nr_node_for_each(__nr_node, node, list) \ argument
165 hlist_for_each_entry(__nr_node, node, list, node_node)
167 #define nr_node_for_each_safe(__nr_node, node, node2, list) \ argument
168 hlist_for_each_entry_safe(__nr_node, node, node2, list, node_node)
|
| D | inet_timewait_sock.h | 177 #define inet_twsk_for_each(tw, node, head) \ argument
178 hlist_nulls_for_each_entry(tw, node, head, tw_node)
180 #define inet_twsk_for_each_inmate(tw, node, jail) \ argument
181 hlist_for_each_entry(tw, node, jail, tw_death_node)
183 #define inet_twsk_for_each_inmate_safe(tw, node, safe, jail) \ argument
184 hlist_for_each_entry_safe(tw, node, safe, jail, tw_death_node)
|
| D | ipx.h | 19 __u8 node[IPX_NODE_LEN]; member
70 struct list_head node; /* node in ipx_interfaces list */ member
78 struct list_head node; /* node in ipx_routes list */ member
102 unsigned char node[IPX_NODE_LEN]; member
|
| D | datalink.h | 15 struct list_head node; member
|