Home
last modified time | relevance | path

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

1234567891011

/include/linux/
Drbtree.h33 #define RB_EMPTY_NODE(node) \ argument
34 ((node)->__rb_parent_color == (unsigned long)(node))
35 #define RB_CLEAR_NODE(node) \ argument
36 ((node)->__rb_parent_color = (unsigned long)(node))
59 static inline void rb_link_node(struct rb_node *node, struct rb_node *parent, in rb_link_node() argument
62 node->__rb_parent_color = (unsigned long)parent; in rb_link_node()
63 node->rb_left = node->rb_right = NULL; in rb_link_node()
65 *rb_link = node; in rb_link_node()
68 static inline void rb_link_node_rcu(struct rb_node *node, struct rb_node *parent, in rb_link_node_rcu() argument
71 node->__rb_parent_color = (unsigned long)parent; in rb_link_node_rcu()
[all …]
Dinterval_tree_generic.h38 ITSTATIC void ITPREFIX ## _insert(ITSTRUCT *node, \
42 ITTYPE start = ITSTART(node), last = ITLAST(node); \
59 node->ITSUBTREE = last; \
60 rb_link_node(&node->ITRB, rb_parent, link); \
61 rb_insert_augmented_cached(&node->ITRB, root, \
65 ITSTATIC void ITPREFIX ## _remove(ITSTRUCT *node, \
68 rb_erase_augmented_cached(&node->ITRB, root, &ITPREFIX ## _augment); \
81 ITPREFIX ## _subtree_search(ITSTRUCT *node, ITTYPE start, ITTYPE last) \
88 if (node->ITRB.rb_left) { \
89 ITSTRUCT *left = rb_entry(node->ITRB.rb_left, \
[all …]
Drbtree_latch.h41 struct rb_node node[2]; member
70 __lt_from_rb(struct rb_node *node, int idx) in __lt_from_rb() argument
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
95 rb_link_node_rcu(node, parent, link); in __lt_insert()
96 rb_insert_color(node, root); in __lt_insert()
102 rb_erase(&ltn->node[idx], &ltr->tree[idx]); in __lt_erase()
107 int (*comp)(void *key, struct latch_tree_node *node)) in __lt_find() argument
109 struct rb_node *node = rcu_dereference_raw(ltr->tree[idx].rb_node); in __lt_find() local
113 while (node) { in __lt_find()
[all …]
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()
Dof_graph.h41 bool of_graph_is_present(const struct device_node *node);
42 int of_graph_parse_endpoint(const struct device_node *node,
45 struct device_node *of_graph_get_port_by_id(struct device_node *node, u32 id);
51 const struct device_node *node);
52 struct device_node *of_graph_get_port_parent(struct device_node *node);
54 const struct device_node *node);
55 struct device_node *of_graph_get_remote_port(const struct device_node *node);
56 struct device_node *of_graph_get_remote_node(const struct device_node *node,
60 static inline bool of_graph_is_present(const struct device_node *node) in of_graph_is_present() argument
65 static inline int of_graph_parse_endpoint(const struct device_node *node, in of_graph_parse_endpoint() argument
[all …]
Dbootconfig.h69 int __init xbc_node_index(struct xbc_node *node);
70 struct xbc_node * __init xbc_node_get_parent(struct xbc_node *node);
71 struct xbc_node * __init xbc_node_get_child(struct xbc_node *node);
72 struct xbc_node * __init xbc_node_get_next(struct xbc_node *node);
73 const char * __init xbc_node_get_data(struct xbc_node *node);
81 static inline __init bool xbc_node_is_value(struct xbc_node *node) in xbc_node_is_value() argument
83 return node->data & XBC_VALUE; in xbc_node_is_value()
92 static inline __init bool xbc_node_is_key(struct xbc_node *node) in xbc_node_is_key() argument
94 return !xbc_node_is_value(node); in xbc_node_is_key()
103 static inline __init bool xbc_node_is_array(struct xbc_node *node) in xbc_node_is_array() argument
[all …]
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);
Dtopology.h39 #define nr_cpus_node(node) cpumask_weight(cpumask_of_node(node)) argument
42 #define for_each_node_with_cpus(node) \ argument
43 for_each_online_node(node) \
44 if (nr_cpus_node(node))
101 static inline void set_numa_node(int node) in set_numa_node() argument
103 this_cpu_write(numa_node, node); in set_numa_node()
108 static inline void set_cpu_numa_node(int cpu, int node) in set_cpu_numa_node() argument
110 per_cpu(numa_node, cpu) = node; in set_cpu_numa_node()
136 static inline void set_numa_mem(int node) in set_numa_mem() argument
138 this_cpu_write(_numa_mem_, node); in set_numa_mem()
[all …]
Drbtree_augmented.h28 void (*propagate)(struct rb_node *node, struct rb_node *stop);
33 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()
54 rb_insert_augmented_cached(struct rb_node *node, in rb_insert_augmented_cached() argument
59 root->rb_leftmost = node; in rb_insert_augmented_cached()
60 rb_insert_augmented(node, &root->rb_root, augment); in rb_insert_augmented_cached()
64 rb_add_augmented_cached(struct rb_node *node, struct rb_root_cached *tree, in rb_add_augmented_cached() argument
74 if (less(node, parent)) { in rb_add_augmented_cached()
82 rb_link_node(node, parent, link); in rb_add_augmented_cached()
[all …]
Dnodemask.h128 #define node_set(node, dst) __node_set((node), &(dst)) argument
129 static __always_inline void __node_set(int node, volatile nodemask_t *dstp) in __node_set() argument
131 set_bit(node, dstp->bits); in __node_set()
134 #define node_clear(node, dst) __node_clear((node), &(dst)) argument
135 static __always_inline void __node_clear(int node, volatile nodemask_t *dstp) in __node_clear() argument
137 clear_bit(node, dstp->bits); in __node_clear()
153 #define node_isset(node, nodemask) test_bit((node), (nodemask).bits) argument
155 #define node_test_and_set(node, nodemask) \ argument
156 __node_test_and_set((node), &(nodemask))
157 static __always_inline bool __node_test_and_set(int node, nodemask_t *addr) in __node_test_and_set() argument
[all …]
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
94 static inline void init_node_memory_type(int node, struct memory_dev_type *default_type) in init_node_memory_type() 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
[all …]
Dllist.h84 static inline void init_llist_node(struct llist_node *node) in init_llist_node() argument
86 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 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
163 for ((pos) = (node); (pos) && ((n) = (pos)->next, true); (pos) = (n))
180 #define llist_for_each_entry(pos, node, member) \ argument
181 for ((pos) = llist_entry((node), typeof(*(pos)), member); \
[all …]
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
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);
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);
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);
135 extern void plist_requeue(struct plist_node *node, struct plist_head *head);
[all …]
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,
121 int icc_link_create(struct icc_node *node, const int dst_id);
122 void icc_node_add(struct icc_node *node, struct icc_provider *provider);
123 void icc_node_del(struct icc_node *node);
133 static inline int icc_std_aggregate(struct icc_node *node, u32 tag, u32 avg_bw, in icc_std_aggregate() argument
148 static inline int icc_link_create(struct icc_node *node, const int dst_id) in icc_link_create() argument
[all …]
Dreset.h44 struct reset_control *__of_reset_control_get(struct device_node *node,
118 struct device_node *node, in __of_reset_control_get() argument
452 struct device_node *node, const char *id) in of_reset_control_get_exclusive() argument
454 return __of_reset_control_get(node, id, 0, false, false, true); in of_reset_control_get_exclusive()
472 struct device_node *node, const char *id) in of_reset_control_get_optional_exclusive() argument
474 return __of_reset_control_get(node, id, 0, false, true, true); in of_reset_control_get_optional_exclusive()
497 struct device_node *node, const char *id) in of_reset_control_get_shared() argument
499 return __of_reset_control_get(node, id, 0, true, false, false); in of_reset_control_get_shared()
514 struct device_node *node, int index) in of_reset_control_get_exclusive_by_index() argument
516 return __of_reset_control_get(node, NULL, index, false, false, true); in of_reset_control_get_exclusive_by_index()
[all …]
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/
Ddrm_vma_manager.h72 struct drm_vma_offset_node *node, unsigned long pages);
74 struct drm_vma_offset_node *node);
76 int drm_vma_node_allow(struct drm_vma_offset_node *node, struct drm_file *tag);
77 int drm_vma_node_allow_once(struct drm_vma_offset_node *node, struct drm_file *tag);
78 void drm_vma_node_revoke(struct drm_vma_offset_node *node,
80 bool drm_vma_node_is_allowed(struct drm_vma_offset_node *node,
100 struct drm_vma_offset_node *node; in drm_vma_offset_exact_lookup_locked() local
102 node = drm_vma_offset_lookup_locked(mgr, start, pages); in drm_vma_offset_exact_lookup_locked()
103 return (node && node->vm_node.start == start) ? node : NULL; in drm_vma_offset_exact_lookup_locked()
148 static inline void drm_vma_node_reset(struct drm_vma_offset_node *node) in drm_vma_node_reset() argument
[all …]
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/
Dqrtr.h14 unsigned int node, unsigned int port),
16 TP_ARGS(service, instance, node, port),
21 __field(unsigned int, node)
28 __entry->node = node;
33 __entry->service, __entry->instance, __entry->node,
41 unsigned int node, unsigned int port),
43 TP_ARGS(service, instance, node, port),
48 __field(unsigned int, node)
55 __entry->node = node;
60 __entry->service, __entry->instance, __entry->node,
[all …]
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/
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
/include/trace/hooks/
Davc.h15 TP_PROTO(const struct avc_node *node),
16 TP_ARGS(node), 1);
19 TP_PROTO(const struct avc_node *node),
20 TP_ARGS(node), 1);
27 TP_PROTO(const struct avc_node *node, u32 ssid, u32 tsid, u16 tclass),
28 TP_ARGS(node, ssid, tsid, tclass), 1);

1234567891011