Home
last modified time | relevance | path

Searched refs:node (Results 1 – 25 of 142) sorted by relevance

123456

/include/linux/
Dinterval_tree_generic.h45 static inline ITTYPE ITPREFIX ## _compute_subtree_last(ITSTRUCT *node) \
47 ITTYPE max = ITLAST(node), subtree_last; \
48 if (node->ITRB.rb_left) { \
49 subtree_last = rb_entry(node->ITRB.rb_left, \
54 if (node->ITRB.rb_right) { \
55 subtree_last = rb_entry(node->ITRB.rb_right, \
68 ITSTATIC void ITPREFIX ## _insert(ITSTRUCT *node, struct rb_root *root) \
71 ITTYPE start = ITSTART(node), last = ITLAST(node); \
85 node->ITSUBTREE = last; \
86 rb_link_node(&node->ITRB, rb_parent, link); \
[all …]
Dtimerqueue.h9 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_CLEAR_NODE(&node->node); in timerqueue_init()
Dnodemask.h101 #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 …]
Drbtree.h55 #define RB_EMPTY_NODE(node) \ argument
56 ((node)->__rb_parent_color == (unsigned long)(node))
57 #define RB_CLEAR_NODE(node) \ argument
58 ((node)->__rb_parent_color = (unsigned long)(node))
79 static inline void rb_link_node(struct rb_node * node, struct rb_node * parent, in rb_link_node() argument
82 node->__rb_parent_color = (unsigned long)parent; in rb_link_node()
83 node->rb_left = node->rb_right = NULL; in rb_link_node()
85 *rb_link = node; in rb_link_node()
Dof_fdt.h67 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);
115 extern int early_init_dt_scan_chosen(unsigned long node, const char *uname,
117 extern void early_init_dt_check_for_initrd(unsigned long node);
118 extern int early_init_dt_scan_memory(unsigned long node, const char *uname,
[all …]
Drbtree_augmented.h39 void (*propagate)(struct rb_node *node, struct rb_node *stop);
44 extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
47 rb_insert_augmented(struct rb_node *node, struct rb_root *root, in rb_insert_augmented() argument
50 __rb_insert_augmented(node, root, augment->rotate); in rb_insert_augmented()
59 rbstruct *node = rb_entry(rb, rbstruct, rbfield); \
60 rbtype augmented = rbcompute(node); \
61 if (node->rbaugmented == augmented) \
63 node->rbaugmented = augmented; \
64 rb = rb_parent(&node->rbfield); \
127 __rb_erase_augmented(struct rb_node *node, struct rb_root *root, in __rb_erase_augmented() argument
[all …]
Dtopology.h42 #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))
197 static inline void set_numa_node(int node) in set_numa_node() argument
199 this_cpu_write(numa_node, node); in set_numa_node()
204 static inline void set_cpu_numa_node(int cpu, int node) in set_cpu_numa_node() argument
206 per_cpu(numa_node, cpu) = node; in set_cpu_numa_node()
232 static inline void set_numa_mem(int node) in set_numa_mem() argument
234 this_cpu_write(_numa_mem_, node); in set_numa_mem()
[all …]
Dof_pdt.h22 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);
Dplist.h105 #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 …]
Dvexpress.h71 void *(*func_get)(struct device *dev, struct device_node *node);
79 struct device_node *node,
91 struct device_node *node);
94 #define vexpress_config_func_get_by_node(node) \ argument
95 __vexpress_config_func_get(NULL, node)
111 #define vexpress_get_site_by_node(node) __vexpress_get_site(NULL, node) argument
113 unsigned __vexpress_get_site(struct device *dev, struct device_node *node);
121 void vexpress_osc_of_setup(struct device_node *node);
Dnode.h21 struct node { struct
30 extern struct node *node_devices[]; argument
31 typedef void (*node_registration_func_t)(struct node *);
33 extern void unregister_node(struct node *node);
82 #define to_node(device) container_of(device, struct node, dev)
Dof_i2c.h21 extern struct i2c_client *of_find_i2c_device_by_node(struct device_node *node);
25 struct device_node *node);
33 static inline struct i2c_client *of_find_i2c_device_by_node(struct device_node *node) in of_find_i2c_device_by_node() argument
40 struct device_node *node) in of_find_i2c_adapter_by_node() argument
Dhashtable.h55 #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()
Dcompaction.h108 extern int compaction_register_node(struct node *node);
109 extern void compaction_unregister_node(struct node *node);
113 static inline int compaction_register_node(struct node *node) in compaction_register_node() argument
118 static inline void compaction_unregister_node(struct node *node) in compaction_unregister_node() argument
Dslob_def.h6 void *kmem_cache_alloc_node(struct kmem_cache *, gfp_t flags, int node);
14 void *__kmalloc_node(size_t size, gfp_t flags, int node);
16 static __always_inline void *kmalloc_node(size_t size, gfp_t flags, int node) in kmalloc_node() argument
18 return __kmalloc_node(size, flags, node); in kmalloc_node()
Dllist.h104 #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()
Dinterval_tree.h14 interval_tree_insert(struct interval_tree_node *node, struct rb_root *root);
17 interval_tree_remove(struct interval_tree_node *node, struct rb_root *root);
24 interval_tree_iter_next(struct interval_tree_node *node,
Dmigrate.h95 extern int migrate_misplaced_page(struct page *page, int node);
96 extern int migrate_misplaced_page(struct page *page, int node);
97 extern bool migrate_ratelimited(int node);
99 static inline int migrate_misplaced_page(struct page *page, int node) in migrate_misplaced_page() argument
103 static inline bool migrate_ratelimited(int node) in migrate_ratelimited() argument
114 struct page *page, int node);
120 struct page *page, int node) in migrate_misplaced_transhuge_page() argument
Dcpuset.h30 extern int __cpuset_node_allowed_softwall(int node, gfp_t gfp_mask);
31 extern int __cpuset_node_allowed_hardwall(int node, gfp_t gfp_mask);
33 static inline int cpuset_node_allowed_softwall(int node, gfp_t gfp_mask) in cpuset_node_allowed_softwall() argument
36 __cpuset_node_allowed_softwall(node, gfp_mask); in cpuset_node_allowed_softwall()
39 static inline int cpuset_node_allowed_hardwall(int node, gfp_t gfp_mask) in cpuset_node_allowed_hardwall() argument
42 __cpuset_node_allowed_hardwall(node, gfp_mask); in cpuset_node_allowed_hardwall()
153 static inline int cpuset_node_allowed_softwall(int node, gfp_t gfp_mask) in cpuset_node_allowed_softwall() argument
158 static inline int cpuset_node_allowed_hardwall(int node, gfp_t gfp_mask) in cpuset_node_allowed_hardwall() argument
Dslub_def.h104 struct kmem_cache_node *node[MAX_NUMNODES]; member
178 void *__kmalloc_node(size_t size, gfp_t flags, int node);
179 void *kmem_cache_alloc_node(struct kmem_cache *, gfp_t flags, int node);
184 int node, size_t size);
189 int node, size_t size) in kmem_cache_alloc_node_trace() argument
191 return kmem_cache_alloc_node(s, gfpflags, node); in kmem_cache_alloc_node_trace()
195 static __always_inline void *kmalloc_node(size_t size, gfp_t flags, int node) in kmalloc_node() argument
205 flags, node, size); in kmalloc_node()
207 return __kmalloc_node(size, flags, node); in kmalloc_node()
/include/asm-generic/
Dtopology.h38 #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/media/
Dv4l2-of.h75 void v4l2_of_parse_endpoint(const struct device_node *node,
80 const struct device_node *node);
81 struct device_node *v4l2_of_get_remote_port(const struct device_node *node);
84 static inline int v4l2_of_parse_endpoint(const struct device_node *node, in v4l2_of_parse_endpoint() argument
98 const struct device_node *node) in v4l2_of_get_remote_port_parent() argument
104 const struct device_node *node) in v4l2_of_get_remote_port() argument
/include/linux/regulator/
Dof_regulator.h19 struct device_node *node);
20 extern int of_regulator_match(struct device *dev, struct device_node *node,
26 struct device_node *node) in of_get_regulator_init_data() argument
32 struct device_node *node, in of_regulator_match() argument
/include/linux/irqchip/
Dversatile-fpga.h9 struct device_node *node);
10 int fpga_irq_of_init(struct device_node *node,
/include/xen/
Dxenbus.h55 const char *node; member
129 const char *dir, const char *node, unsigned int *num);
131 const char *dir, const char *node, unsigned int *len);
133 const char *dir, const char *node, const char *string);
135 const char *dir, const char *node);
137 const char *dir, const char *node);
138 int xenbus_rm(struct xenbus_transaction t, const char *dir, const char *node);
145 const char *dir, const char *node, const char *fmt, ...);
150 const char *dir, const char *node, const char *fmt, ...);

123456