| /include/linux/ |
| D | hashtable.h | 55 #define hash_add(hashtable, node, key) \ argument
56 hlist_add_head(node, &hashtable[hash_min(key, HASH_BITS(hashtable))])
64 #define hash_add_rcu(hashtable, node, key) \ argument
65 hlist_add_head_rcu(node, &hashtable[hash_min(key, HASH_BITS(hashtable))])
71 static inline bool hash_hashed(struct hlist_node *node) in hash_hashed() argument
73 return !hlist_unhashed(node); in hash_hashed()
100 static inline void hash_del(struct hlist_node *node) in hash_del() argument
102 hlist_del_init(node); in hash_del()
109 static inline void hash_del_rcu(struct hlist_node *node) in hash_del_rcu() argument
111 hlist_del_init_rcu(node); in hash_del_rcu()
[all …]
|
| 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 | 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
150 typedef void (*rb_augment_f)(struct rb_node *node, void *data);
152 extern void rb_augment_insert(struct rb_node *node,
154 extern struct rb_node *rb_augment_erase_begin(struct rb_node *node);
155 extern void rb_augment_erase_end(struct rb_node *node,
168 static inline void rb_link_node(struct rb_node * node, struct rb_node * parent, in rb_link_node() argument
171 node->rb_parent_color = (unsigned long )parent; in rb_link_node()
172 node->rb_left = node->rb_right = NULL; in rb_link_node()
174 *rb_link = node; in rb_link_node()
|
| D | timerqueue.h | 9 struct rb_node node; member
20 struct timerqueue_node *node);
22 struct timerqueue_node *node);
24 struct timerqueue_node *node);
40 static inline void timerqueue_init(struct timerqueue_node *node) in timerqueue_init() argument
42 rb_init_node(&node->node); in timerqueue_init()
|
| D | nodemask.h | 101 #define node_set(node, dst) __node_set((node), &(dst)) argument
102 static inline void __node_set(int node, volatile nodemask_t *dstp) in __node_set() argument
104 set_bit(node, dstp->bits); in __node_set()
107 #define node_clear(node, dst) __node_clear((node), &(dst)) argument
108 static inline void __node_clear(int node, volatile nodemask_t *dstp) in __node_clear() argument
110 clear_bit(node, dstp->bits); in __node_clear()
126 #define node_isset(node, nodemask) test_bit((node), (nodemask).bits) argument
128 #define node_test_and_set(node, nodemask) \ argument
129 __node_test_and_set((node), &(nodemask))
130 static inline int __node_test_and_set(int node, nodemask_t *addr) in __node_test_and_set() argument
[all …]
|
| D | of_fdt.h | 67 unsigned long node,
71 unsigned long node,
73 extern int of_fdt_match(struct boot_param_header *blob, unsigned long node,
85 extern int of_scan_flat_dt(int (*it)(unsigned long node, const char *uname,
88 extern void *of_get_flat_dt_prop(unsigned long node, const char *name,
90 extern int of_flat_dt_is_compatible(unsigned long node, const char *name);
91 extern int of_flat_dt_match(unsigned long node, const char *const *matches);
94 extern int early_init_dt_scan_chosen(unsigned long node, const char *uname,
96 extern void early_init_dt_check_for_initrd(unsigned long node);
97 extern int early_init_dt_scan_memory(unsigned long node, const char *uname,
[all …]
|
| D | node.h | 21 struct node { struct
30 extern struct node node_devices[]; argument
31 typedef void (*node_registration_func_t)(struct node *);
33 extern int register_node(struct node *, int, struct node *);
34 extern void unregister_node(struct node *node);
83 #define to_node(device) container_of(device, struct node, dev)
|
| D | plist.h | 105 #define PLIST_NODE_INIT(node, __prio) \ argument
108 .prio_list = LIST_HEAD_INIT((node).prio_list), \
109 .node_list = LIST_HEAD_INIT((node).node_list), \
127 static inline void plist_node_init(struct plist_node *node, int prio) in plist_node_init() argument
129 node->prio = prio; in plist_node_init()
130 INIT_LIST_HEAD(&node->prio_list); in plist_node_init()
131 INIT_LIST_HEAD(&node->node_list); in plist_node_init()
134 extern void plist_add(struct plist_node *node, struct plist_head *head);
135 extern void plist_del(struct plist_node *node, struct plist_head *head);
190 static inline int plist_node_empty(const struct plist_node *node) in plist_node_empty() argument
[all …]
|
| D | of_pdt.h | 22 int (*nextprop)(phandle node, char *prev, char *buf);
25 int (*getproplen)(phandle node, const char *prop);
26 int (*getproperty)(phandle node, const char *prop, char *buf,
31 phandle (*getsibling)(phandle node);
34 int (*pkg2path)(phandle node, char *buf, const int buflen, int *len);
|
| D | topology.h | 42 #define nr_cpus_node(node) cpumask_weight(cpumask_of_node(node)) argument
45 #define for_each_node_with_cpus(node) \ argument
46 for_each_online_node(node) \
47 if (nr_cpus_node(node))
240 static inline void set_numa_node(int node) in set_numa_node() argument
242 percpu_write(numa_node, node); in set_numa_node()
247 static inline void set_cpu_numa_node(int cpu, int node) in set_cpu_numa_node() argument
249 per_cpu(numa_node, cpu) = node; in set_cpu_numa_node()
275 static inline void set_numa_mem(int node) in set_numa_mem() argument
277 percpu_write(_numa_mem_, node); in set_numa_mem()
[all …]
|
| D | compaction.h | 94 extern int compaction_register_node(struct node *node);
95 extern void compaction_unregister_node(struct node *node);
99 static inline int compaction_register_node(struct node *node) in compaction_register_node() argument
104 static inline void compaction_unregister_node(struct node *node) in compaction_unregister_node() argument
|
| D | slab.h | 272 static inline void *kmalloc_node(size_t size, gfp_t flags, int node) in kmalloc_node() argument
277 static inline void *__kmalloc_node(size_t size, gfp_t flags, int node) in __kmalloc_node() argument
285 gfp_t flags, int node) in kmem_cache_alloc_node() argument
321 #define kmalloc_node_track_caller(size, flags, node) \ argument
322 __kmalloc_node_track_caller(size, flags, node, \
325 #define kmalloc_node_track_caller(size, flags, node) \ argument
326 __kmalloc_node(size, flags, node)
331 #define kmalloc_node_track_caller(size, flags, node) \ argument
360 static inline void *kzalloc_node(size_t size, gfp_t flags, int node) in kzalloc_node() argument
362 return kmalloc_node(size, flags | __GFP_ZERO, node); in kzalloc_node()
|
| D | slob_def.h | 4 void *kmem_cache_alloc_node(struct kmem_cache *, gfp_t flags, int node);
12 void *__kmalloc_node(size_t size, gfp_t flags, int node);
14 static __always_inline void *kmalloc_node(size_t size, gfp_t flags, int node) in kmalloc_node() argument
16 return __kmalloc_node(size, flags, node); in kmalloc_node()
|
| D | llist.h | 104 #define llist_for_each(pos, node) \ argument
105 for ((pos) = (node); pos; (pos) = (pos)->next)
122 #define llist_for_each_entry(pos, node, member) \ argument
123 for ((pos) = llist_entry((node), typeof(*(pos)), member); \
140 static inline struct llist_node *llist_next(struct llist_node *node) in llist_next() argument
142 return node->next; in llist_next()
|
| D | cpuset.h | 31 extern int __cpuset_node_allowed_softwall(int node, gfp_t gfp_mask);
32 extern int __cpuset_node_allowed_hardwall(int node, gfp_t gfp_mask);
34 static inline int cpuset_node_allowed_softwall(int node, gfp_t gfp_mask) in cpuset_node_allowed_softwall() argument
37 __cpuset_node_allowed_softwall(node, gfp_mask); in cpuset_node_allowed_softwall()
40 static inline int cpuset_node_allowed_hardwall(int node, gfp_t gfp_mask) in cpuset_node_allowed_hardwall() argument
43 __cpuset_node_allowed_hardwall(node, gfp_mask); in cpuset_node_allowed_hardwall()
155 static inline int cpuset_node_allowed_softwall(int node, gfp_t gfp_mask) in cpuset_node_allowed_softwall() argument
160 static inline int cpuset_node_allowed_hardwall(int node, gfp_t gfp_mask) in cpuset_node_allowed_hardwall() argument
|
| D | slub_def.h | 51 int node; /* The node of the page (or -1 for debug) */ member
112 struct kmem_cache_node *node[MAX_NUMNODES]; member
287 void *__kmalloc_node(size_t size, gfp_t flags, int node);
288 void *kmem_cache_alloc_node(struct kmem_cache *, gfp_t flags, int node);
293 int node, size_t size);
298 int node, size_t size) in kmem_cache_alloc_node_trace() argument
300 return kmem_cache_alloc_node(s, gfpflags, node); in kmem_cache_alloc_node_trace()
304 static __always_inline void *kmalloc_node(size_t size, gfp_t flags, int node) in kmalloc_node() argument
313 return kmem_cache_alloc_node_trace(s, flags, node, size); in kmalloc_node()
315 return __kmalloc_node(size, flags, node); in kmalloc_node()
|
| D | of.h | 76 extern struct device_node *of_node_get(struct device_node *node);
77 extern void of_node_put(struct device_node *node);
80 static inline struct device_node *of_node_get(struct device_node *node) in of_node_get() argument
82 return node; in of_node_get()
84 static inline void of_node_put(struct device_node *node) { } in of_node_put() argument
100 static inline bool of_node_is_root(const struct device_node *node) in of_node_is_root() argument
102 return node && (node->parent == NULL); in of_node_is_root()
188 extern struct device_node *of_get_parent(const struct device_node *node);
189 extern struct device_node *of_get_next_parent(struct device_node *node);
190 extern struct device_node *of_get_next_child(const struct device_node *node,
[all …]
|
| D | hrtimer.h | 109 struct timerqueue_node node; member
197 timer->node.expires = time; in hrtimer_set_expires()
204 timer->node.expires = ktime_add_safe(time, delta); in hrtimer_set_expires_range()
210 timer->node.expires = ktime_add_safe(time, ns_to_ktime(delta)); in hrtimer_set_expires_range_ns()
215 timer->node.expires.tv64 = tv64; in hrtimer_set_expires_tv64()
221 timer->node.expires = ktime_add_safe(timer->node.expires, time); in hrtimer_add_expires()
227 timer->node.expires = ktime_add_ns(timer->node.expires, ns); in hrtimer_add_expires_ns()
233 return timer->node.expires; in hrtimer_get_expires()
243 return timer->node.expires.tv64; in hrtimer_get_expires_tv64()
252 return ktime_to_ns(timer->node.expires); in hrtimer_get_expires_ns()
[all …]
|
| D | udp.h | 91 #define udp_portaddr_for_each_entry(__sk, node, list) \ argument
92 hlist_nulls_for_each_entry(__sk, node, list, __sk_common.skc_portaddr_node)
94 #define udp_portaddr_for_each_entry_rcu(__sk, node, list) \ argument
95 hlist_nulls_for_each_entry_rcu(__sk, node, list, __sk_common.skc_portaddr_node)
|
| D | kthread.h | 10 int node,
64 struct list_head node; member
76 .node = LIST_HEAD_INIT((work).node), \
118 INIT_LIST_HEAD(&(work)->node); \
|
| /include/asm-generic/ |
| D | topology.h | 38 #define set_numa_node(node) argument
41 #define set_cpu_numa_node(cpu, node) argument
48 #define parent_node(node) ((void)(node),0) argument
51 #define cpumask_of_node(node) ((void)node, cpu_online_mask) argument
68 #define set_numa_mem(node) argument
71 #define set_cpu_numa_mem(cpu, node) argument
|
| /include/drm/ |
| D | drm_mm.h | 78 static inline bool drm_mm_node_allocated(struct drm_mm_node *node) in drm_mm_node_allocated() argument
80 return node->allocated; in drm_mm_node_allocated()
100 extern struct drm_mm_node *drm_mm_get_block_generic(struct drm_mm_node *node,
105 struct drm_mm_node *node,
143 extern int drm_mm_insert_node(struct drm_mm *mm, struct drm_mm_node *node,
146 struct drm_mm_node *node,
150 extern void drm_mm_remove_node(struct drm_mm_node *node);
180 int drm_mm_scan_add_block(struct drm_mm_node *node);
181 int drm_mm_scan_remove_block(struct drm_mm_node *node);
|
| /include/xen/ |
| D | xenbus.h | 55 const char *node; member
128 const char *dir, const char *node, unsigned int *num);
130 const char *dir, const char *node, unsigned int *len);
132 const char *dir, const char *node, const char *string);
134 const char *dir, const char *node);
136 const char *dir, const char *node);
137 int xenbus_rm(struct xenbus_transaction t, const char *dir, const char *node);
144 const char *dir, const char *node, const char *fmt, ...);
149 const char *dir, const char *node, const char *fmt, ...);
|
| /include/linux/regulator/ |
| D | of_regulator.h | 12 struct device_node *node);
16 struct device_node *node) in of_get_regulator_init_data() argument
|
| /include/net/ |
| D | netrom.h | 157 #define nr_neigh_for_each(__nr_neigh, node, list) \ argument
158 hlist_for_each_entry(__nr_neigh, node, list, neigh_node)
160 #define nr_neigh_for_each_safe(__nr_neigh, node, node2, list) \ argument
161 hlist_for_each_entry_safe(__nr_neigh, node, node2, list, neigh_node)
163 #define nr_node_for_each(__nr_node, node, list) \ argument
164 hlist_for_each_entry(__nr_node, node, list, node_node)
166 #define nr_node_for_each_safe(__nr_node, node, node2, list) \ argument
167 hlist_for_each_entry_safe(__nr_node, node, node2, list, node_node)
|