Home
last modified time | relevance | path

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

1234567891011

/include/linux/
A Drbtree.h34 ((node)->__rb_parent_color == (unsigned long)(node))
36 ((node)->__rb_parent_color = (unsigned long)(node))
63 node->rb_left = node->rb_right = NULL; in rb_link_node()
72 node->rb_left = node->rb_right = NULL; in rb_link_node_rcu()
338 node = node->rb_left; in rb_find()
340 node = node->rb_right; in rb_find()
400 node = node->rb_left; in rb_find_first()
402 node = node->rb_right; in rb_find_first()
421 node = rb_next(node); in rb_next_match()
422 if (node && cmp(key, node)) in rb_next_match()
[all …]
A Dinterval_tree_generic.h42 ITTYPE start = ITSTART(node), last = ITLAST(node); \
59 node->ITSUBTREE = last; \
88 if (node->ITRB.rb_left) { \
100 node = left; \
107 node = rb_entry(node->ITRB.rb_right, ITSTRUCT, ITRB); \
118 ITSTRUCT *node, *leftmost; \
137 if (node->ITSUBTREE < start) \
169 rb = rb_parent(&node->ITRB); \
172 prev = &node->ITRB; \
174 rb = node->ITRB.rb_right; \
[all …]
A Drbtree_latch.h41 struct rb_node node[2]; member
72 return container_of(node, struct latch_tree_node, node[idx]); in __lt_from_rb()
81 struct rb_node *node = &ltn->node[idx]; in __lt_insert() local
96 rb_insert_color(node, root); in __lt_insert()
113 while (node) { in __lt_find()
118 node = rcu_dereference_raw(node->rb_left); in __lt_find()
120 node = rcu_dereference_raw(node->rb_right); in __lt_find()
177 __lt_erase(node, root, 0); in latch_tree_erase()
179 __lt_erase(node, root, 1); in latch_tree_erase()
205 struct latch_tree_node *node; in latch_tree_find() local
[all …]
A Dtimerqueue.h9 struct timerqueue_node *node);
11 struct timerqueue_node *node);
13 struct timerqueue_node *node);
27 return rb_entry_safe(leftmost, struct timerqueue_node, node); in timerqueue_getnext()
30 static inline void timerqueue_init(struct timerqueue_node *node) in timerqueue_init() argument
32 RB_CLEAR_NODE(&node->node); in timerqueue_init()
35 static inline bool timerqueue_node_queued(struct timerqueue_node *node) in timerqueue_node_queued() argument
37 return !RB_EMPTY_NODE(&node->node); in timerqueue_node_queued()
A Dbootconfig.h69 int __init xbc_node_index(struct xbc_node *node);
73 const char * __init xbc_node_get_data(struct xbc_node *node);
83 return node->data & XBC_VALUE; in xbc_node_is_value()
94 return !xbc_node_is_value(node); in xbc_node_is_key()
105 return xbc_node_is_value(node) && node->child != 0; in xbc_node_is_array()
119 return xbc_node_is_key(node) && in xbc_node_is_leaf()
120 (!node->child || xbc_node_is_value(xbc_node_get_child(node))); in xbc_node_is_leaf()
174 struct xbc_node *child = xbc_node_get_child(node); in xbc_node_get_subkey()
249 #define xbc_node_for_each_key_value(node, knode, value) \ argument
266 struct xbc_node *node, char *buf, size_t size);
[all …]
A Dtopology.h40 #define nr_cpus_node(node) cpumask_weight(cpumask_of_node(node)) argument
98 static inline void set_numa_node(int node) in set_numa_node() argument
100 this_cpu_write(numa_node, node); in set_numa_node()
107 per_cpu(numa_node, cpu) = node; in set_cpu_numa_node()
133 static inline void set_numa_mem(int node) in set_numa_mem() argument
135 this_cpu_write(_numa_mem_, node); in set_numa_mem()
157 per_cpu(_numa_mem_, cpu) = node; in set_cpu_numa_mem()
308 for (int __start = (node), \
310 (node) < MAX_NUMNODES; \
311 node_clear((node), (unvisited)), \
[all …]
A Dunion_find.h20 #define UF_INIT_NODE(node) {.parent = &node, .rank = 0} argument
29 static inline void uf_node_init(struct uf_node *node) in uf_node_init() argument
31 node->parent = node; in uf_node_init()
32 node->rank = 0; in uf_node_init()
36 struct uf_node *uf_find(struct uf_node *node);
A Drbtree_augmented.h59 root->rb_leftmost = node; in rb_insert_augmented_cached()
74 if (less(node, parent)) { in rb_add_augmented_cached()
82 rb_link_node(node, parent, link); in rb_add_augmented_cached()
86 return leftmost ? node : NULL; in rb_add_augmented_cached()
107 if (RBCOMPUTE(node, true)) \
240 pc = node->__rb_parent_color; in __rb_erase_augmented()
273 augment->copy(node, successor); in __rb_erase_augmented()
299 augment->copy(node, successor); in __rb_erase_augmented()
303 tmp = node->rb_left; in __rb_erase_augmented()
307 pc = node->__rb_parent_color; in __rb_erase_augmented()
[all …]
A Dnodemask.h124 #define node_set(node, dst) __node_set((node), &(dst)) argument
130 #define node_clear(node, dst) __node_clear((node), &(dst)) argument
149 #define node_isset(node, nodemask) test_bit((node), (nodemask).bits) argument
376 (node) = next_node((node), (mask)))
379 for ((node) = 0; (node) < 1 && !nodes_empty(mask); (node)++)
461 return node == 0; in node_state()
478 for ( (node) = 0; (node) == 0; (node) = 1)
487 #define node_set_online(node) node_set_state((node), N_ONLINE) argument
497 return node < MAX_NUMNODES ? node : NUMA_NO_NODE; in node_random()
508 #define node_online(node) node_state((node), N_ONLINE) argument
[all …]
A Dof_graph.h66 bool of_graph_is_present(const struct device_node *node);
67 int of_graph_parse_endpoint(const struct device_node *node,
81 const struct device_node *node);
84 const struct device_node *node);
90 static inline bool of_graph_is_present(const struct device_node *node) in of_graph_is_present() argument
112 struct device_node *node, u32 id) in of_graph_get_port_by_id() argument
145 const struct device_node *node) in of_graph_get_remote_endpoint() argument
151 struct device_node *node) in of_graph_get_port_parent() argument
157 const struct device_node *node) in of_graph_get_remote_port_parent() argument
163 const struct device_node *node) in of_graph_get_remote_port() argument
[all …]
A Dmemory-tiers.h44 void init_node_memory_type(int node, struct memory_dev_type *default_type);
45 void clear_node_memory_type(int node, struct memory_dev_type *memtype);
48 int mt_calc_adistance(int node, int *adist);
56 int next_demotion_node(int node);
58 bool node_is_toptier(int node);
60 static inline int next_demotion_node(int node) in next_demotion_node() argument
70 static inline bool node_is_toptier(int node) in node_is_toptier() argument
99 static inline void clear_node_memory_type(int node, struct memory_dev_type *memtype) in clear_node_memory_type() argument
104 static inline int next_demotion_node(int node) in next_demotion_node() argument
114 static inline bool node_is_toptier(int node) in node_is_toptier() argument
[all …]
A Dllist.h84 static inline void init_llist_node(struct llist_node *node) in init_llist_node() argument
86 WRITE_ONCE(node->next, node); in init_llist_node()
98 static inline bool llist_on_list(const struct llist_node *node) in llist_on_list() argument
100 return READ_ONCE(node->next) != node; in llist_on_list()
143 #define llist_for_each(pos, node) \ argument
144 for ((pos) = (node); pos; (pos) = (pos)->next)
162 #define llist_for_each_safe(pos, n, node) \ argument
180 #define llist_for_each_entry(pos, node, member) \ argument
181 for ((pos) = llist_entry((node), typeof(*(pos)), member); \
203 for (pos = llist_entry((node), typeof(*pos), member); \
[all …]
A Dcompaction.h136 struct node;
138 extern int compaction_register_node(struct node *node);
139 extern void compaction_unregister_node(struct node *node);
143 static inline int compaction_register_node(struct node *node) in compaction_register_node() argument
148 static inline void compaction_unregister_node(struct node *node) in compaction_unregister_node() argument
A Dof_fdt.h40 extern u64 of_flat_dt_translate_address(unsigned long node);
46 extern int of_scan_flat_dt(int (*it)(unsigned long node, const char *uname,
49 extern int of_scan_flat_dt_subnodes(unsigned long node,
50 int (*it)(unsigned long node,
54 extern int of_get_flat_dt_subnode_by_name(unsigned long node,
56 extern const void *of_get_flat_dt_prop(unsigned long node, const char *name,
58 extern int of_flat_dt_is_compatible(unsigned long node, const char *name);
60 extern uint32_t of_get_flat_dt_phandle(unsigned long node);
A Dinterconnect-provider.h24 struct icc_node *node; member
64 int (*aggregate)(struct icc_node *node, u32 tag, u32 avg_bw,
66 void (*pre_aggregate)(struct icc_node *node);
67 int (*get_bw)(struct icc_node *node, u32 *avg, u32 *peak);
117 int icc_std_aggregate(struct icc_node *node, u32 tag, u32 avg_bw,
124 int icc_link_create(struct icc_node *node, const int dst_id);
125 void icc_node_add(struct icc_node *node, struct icc_provider *provider);
126 void icc_node_del(struct icc_node *node);
136 static inline int icc_std_aggregate(struct icc_node *node, u32 tag, u32 avg_bw, in icc_std_aggregate() argument
167 static inline int icc_link_create(struct icc_node *node, const int dst_id) in icc_link_create() argument
[all …]
A Dof_pdt.h18 int (*nextprop)(phandle node, char *prev, char *buf);
21 int (*getproplen)(phandle node, const char *prop);
22 int (*getproperty)(phandle node, const char *prop, char *buf,
27 phandle (*getsibling)(phandle node);
30 int (*pkg2path)(phandle node, char *buf, const int buflen, int *len);
A Dplist.h103 #define PLIST_NODE_INIT(node, __prio) \ argument
106 .prio_list = LIST_HEAD_INIT((node).prio_list), \
107 .node_list = LIST_HEAD_INIT((node).node_list), \
125 static inline void plist_node_init(struct plist_node *node, int prio) in plist_node_init() argument
127 node->prio = prio; in plist_node_init()
128 INIT_LIST_HEAD(&node->prio_list); in plist_node_init()
129 INIT_LIST_HEAD(&node->node_list); in plist_node_init()
132 extern void plist_add(struct plist_node *node, struct plist_head *head);
133 extern void plist_del(struct plist_node *node, struct plist_head *head);
212 static inline int plist_node_empty(const struct plist_node *node) in plist_node_empty() argument
[all …]
A Dnuma.h32 int numa_nearest_node(int node, unsigned int state);
34 int nearest_node_nodemask(int node, nodemask_t *mask);
47 static inline int numa_nearest_node(int node, unsigned int state) in numa_nearest_node() argument
52 static inline int nearest_node_nodemask(int node, nodemask_t *mask) in nearest_node_nodemask() argument
69 #define numa_map_to_online_node(node) numa_nearest_node(node, N_ONLINE) argument
A Dresource_ext.h24 struct list_head node; member
37 list_add(&entry->node, head); in resource_list_add()
43 list_add_tail(&entry->node, head); in resource_list_add_tail()
48 list_del(&entry->node); in resource_list_del()
64 list_for_each_entry((entry), (list), node)
67 list_for_each_entry_safe((entry), (tmp), (list), node)
/include/drm/
A Ddrm_vma_manager.h74 struct drm_vma_offset_node *node);
100 struct drm_vma_offset_node *node; in drm_vma_offset_exact_lookup_locked() local
103 return (node && node->vm_node.start == start) ? node : NULL; in drm_vma_offset_exact_lookup_locked()
150 memset(node, 0, sizeof(*node)); in drm_vma_node_reset()
151 node->vm_files = RB_ROOT; in drm_vma_node_reset()
152 rwlock_init(&node->vm_lock); in drm_vma_node_reset()
171 return node->vm_node.start; in drm_vma_node_start()
188 return node->vm_node.size; in drm_vma_node_size()
223 if (drm_mm_node_allocated(&node->vm_node)) in drm_vma_node_unmap()
225 drm_vma_node_offset_addr(node), in drm_vma_node_unmap()
[all …]
A Dspsc_queue.h65 static inline bool spsc_queue_push(struct spsc_queue *queue, struct spsc_node *node) in spsc_queue_push() argument
69 node->next = NULL; in spsc_queue_push()
76 tail = (struct spsc_node **)atomic_long_xchg(&queue->tail, (long)&node->next); in spsc_queue_push()
77 WRITE_ONCE(*tail, node); in spsc_queue_push()
93 struct spsc_node *next, *node; in spsc_queue_pop() local
98 node = READ_ONCE(queue->head); in spsc_queue_pop()
100 if (!node) in spsc_queue_pop()
103 next = READ_ONCE(node->next); in spsc_queue_pop()
110 (long)&node->next, (long) &queue->head) != (long)&node->next) { in spsc_queue_pop()
114 } while (unlikely(!(queue->head = READ_ONCE(node->next)))); in spsc_queue_pop()
[all …]
/include/trace/events/
A Dqrtr.h14 unsigned int node, unsigned int port),
16 TP_ARGS(service, instance, node, port),
21 __field(unsigned int, node)
28 __entry->node = node;
41 unsigned int node, unsigned int port),
43 TP_ARGS(service, instance, node, port),
48 __field(unsigned int, node)
55 __entry->node = node;
70 TP_ARGS(service, instance, node, port),
75 __field(unsigned int, node)
[all …]
A Dmaple_tree.h25 __field(void *, node)
34 __entry->node = mas->node;
39 (void *) __entry->node,
58 __field(void *, node)
67 __entry->node = mas->node;
72 (void *) __entry->node,
95 __field(void *, node)
106 __entry->node = mas->node;
111 (void *) __entry->node,
/include/asm-generic/
A Dtopology.h38 #define set_numa_node(node) argument
41 #define set_cpu_numa_node(cpu, node) argument
49 #define cpumask_of_node(node) ((node) == 0 ? cpu_online_mask : cpu_none_mask) argument
51 #define cpumask_of_node(node) ((void)(node), cpu_online_mask) argument
69 #define set_numa_mem(node) argument
72 #define set_cpu_numa_mem(cpu, node) argument
A Dnuma.h21 const struct cpumask *cpumask_of_node(int node);
24 static inline const struct cpumask *cpumask_of_node(int node) in cpumask_of_node() argument
26 if (node == NUMA_NO_NODE) in cpumask_of_node()
29 return node_to_cpumask_map[node]; in cpumask_of_node()
53 void debug_cpumask_set_cpu(unsigned int cpu, int node, bool enable);

Completed in 607 milliseconds

1234567891011