| /include/drm/ |
| D | drm_vma_manager.h | 72 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 void drm_vma_node_revoke(struct drm_vma_offset_node *node,
79 bool drm_vma_node_is_allowed(struct drm_vma_offset_node *node,
99 struct drm_vma_offset_node *node; in drm_vma_offset_exact_lookup_locked() local
101 node = drm_vma_offset_lookup_locked(mgr, start, pages); in drm_vma_offset_exact_lookup_locked()
102 return (node && node->vm_node.start == start) ? node : NULL; in drm_vma_offset_exact_lookup_locked()
147 static inline void drm_vma_node_reset(struct drm_vma_offset_node *node) in drm_vma_node_reset() argument
149 memset(node, 0, sizeof(*node)); in drm_vma_node_reset()
[all …]
|
| D | spsc_queue.h | 65 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()
73 tail = (struct spsc_node **)atomic_long_xchg(&queue->tail, (long)&node->next); in spsc_queue_push()
74 WRITE_ONCE(*tail, node); in spsc_queue_push()
91 struct spsc_node *next, *node; in spsc_queue_pop() local
96 node = READ_ONCE(queue->head); in spsc_queue_pop()
98 if (!node) in spsc_queue_pop()
101 next = READ_ONCE(node->next); in spsc_queue_pop()
108 (long)&node->next, (long) &queue->head) != (long)&node->next) { in spsc_queue_pop()
112 } while (unlikely(!(queue->head = READ_ONCE(node->next)))); in spsc_queue_pop()
[all …]
|
| D | drm_of.h | 27 struct device_node *node);
31 int drm_of_encoder_active_endpoint(struct device_node *node,
55 struct device_node *node) in drm_of_component_match_add() argument
67 static inline int drm_of_encoder_active_endpoint(struct device_node *node, in drm_of_encoder_active_endpoint() argument
110 static inline int drm_of_encoder_active_endpoint_id(struct device_node *node, in drm_of_encoder_active_endpoint_id() argument
114 int ret = drm_of_encoder_active_endpoint(node, encoder, in drm_of_encoder_active_endpoint_id()
120 static inline int drm_of_encoder_active_port_id(struct device_node *node, in drm_of_encoder_active_port_id() argument
124 int ret = drm_of_encoder_active_endpoint(node, encoder, in drm_of_encoder_active_port_id()
|
| D | drm_mm.h | 196 void (*color_adjust)(const struct drm_mm_node *node,
254 static inline bool drm_mm_node_allocated(const struct drm_mm_node *node) in drm_mm_node_allocated() argument
256 return node->allocated; in drm_mm_node_allocated()
289 static inline bool drm_mm_hole_follows(const struct drm_mm_node *node) in drm_mm_hole_follows() argument
291 return node->hole_size; in drm_mm_hole_follows()
402 int drm_mm_reserve_node(struct drm_mm *mm, struct drm_mm_node *node);
404 struct drm_mm_node *node,
430 drm_mm_insert_node_generic(struct drm_mm *mm, struct drm_mm_node *node, in drm_mm_insert_node_generic() argument
435 return drm_mm_insert_node_in_range(mm, node, in drm_mm_insert_node_generic()
455 struct drm_mm_node *node, in drm_mm_insert_node() argument
[all …]
|
| /include/linux/ |
| D | interval_tree_generic.h | 38 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 …]
|
| D | timerqueue.h | 10 struct rb_node node; member
20 struct timerqueue_node *node);
22 struct timerqueue_node *node);
24 struct timerqueue_node *node);
38 return rb_entry(leftmost, struct timerqueue_node, node); in timerqueue_getnext()
41 static inline void timerqueue_init(struct timerqueue_node *node) in timerqueue_init() argument
43 RB_CLEAR_NODE(&node->node); in timerqueue_init()
46 static inline bool timerqueue_node_queued(struct timerqueue_node *node) in timerqueue_node_queued() argument
48 return !RB_EMPTY_NODE(&node->node); in timerqueue_node_queued()
51 static inline bool timerqueue_node_expires(struct timerqueue_node *node) in timerqueue_node_expires() argument
[all …]
|
| D | rbtree_latch.h | 41 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 = <n->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(<n->node[idx], <r->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 …]
|
| D | topology.h | 39 #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))
100 static inline void set_numa_node(int node) in set_numa_node() argument
102 this_cpu_write(numa_node, node); in set_numa_node()
107 static inline void set_cpu_numa_node(int cpu, int node) in set_cpu_numa_node() argument
109 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 …]
|
| D | rbtree.h | 43 #define RB_EMPTY_NODE(node) \ argument
44 ((node)->__rb_parent_color == (unsigned long)(node))
45 #define RB_CLEAR_NODE(node) \ argument
46 ((node)->__rb_parent_color = (unsigned long)(node))
69 static inline void rb_link_node(struct rb_node *node, struct rb_node *parent, in rb_link_node() argument
72 node->__rb_parent_color = (unsigned long)parent; in rb_link_node()
73 node->rb_left = node->rb_right = NULL; in rb_link_node()
75 *rb_link = node; in rb_link_node()
78 static inline void rb_link_node_rcu(struct rb_node *node, struct rb_node *parent, in rb_link_node_rcu() argument
81 node->__rb_parent_color = (unsigned long)parent; in rb_link_node_rcu()
[all …]
|
| D | of_graph.h | 41 int of_graph_parse_endpoint(const struct device_node *node,
44 struct device_node *of_graph_get_port_by_id(struct device_node *node, u32 id);
50 const struct device_node *node);
51 struct device_node *of_graph_get_port_parent(struct device_node *node);
53 const struct device_node *node);
54 struct device_node *of_graph_get_remote_port(const struct device_node *node);
55 struct device_node *of_graph_get_remote_node(const struct device_node *node,
59 static inline int of_graph_parse_endpoint(const struct device_node *node, in of_graph_parse_endpoint() argument
71 struct device_node *node, u32 id) in of_graph_get_port_by_id() argument
90 const struct device_node *node) in of_graph_get_remote_endpoint() argument
[all …]
|
| D | of_fdt.h | 39 extern u64 of_flat_dt_translate_address(unsigned long node);
45 extern int of_scan_flat_dt(int (*it)(unsigned long node, const char *uname,
48 extern int of_scan_flat_dt_subnodes(unsigned long node,
49 int (*it)(unsigned long node,
53 extern int of_get_flat_dt_subnode_by_name(unsigned long node,
55 extern const void *of_get_flat_dt_prop(unsigned long node, const char *name,
57 extern int of_flat_dt_is_compatible(unsigned long node, const char *name);
59 extern uint32_t of_get_flat_dt_phandle(unsigned long node);
82 extern int early_init_dt_scan_chosen(unsigned long node, const char *uname,
84 extern int early_init_dt_scan_memory(unsigned long node, const char *uname,
[all …]
|
| D | nodemask.h | 127 #define node_set(node, dst) __node_set((node), &(dst)) argument
128 static __always_inline void __node_set(int node, volatile nodemask_t *dstp) in __node_set() argument
130 set_bit(node, dstp->bits); in __node_set()
133 #define node_clear(node, dst) __node_clear((node), &(dst)) argument
134 static inline void __node_clear(int node, volatile nodemask_t *dstp) in __node_clear() argument
136 clear_bit(node, dstp->bits); in __node_clear()
152 #define node_isset(node, nodemask) test_bit((node), (nodemask).bits) argument
154 #define node_test_and_set(node, nodemask) \ argument
155 __node_test_and_set((node), &(nodemask))
156 static inline int __node_test_and_set(int node, nodemask_t *addr) in __node_test_and_set() argument
[all …]
|
| D | rbtree_augmented.h | 28 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()
80 RBSTRUCT *node = rb_entry(rb, RBSTRUCT, RBFIELD); \
81 if (RBCOMPUTE(node, true)) \
83 rb = rb_parent(&node->RBFIELD); \
[all …]
|
| D | reset.h | 22 struct reset_control *__of_reset_control_get(struct device_node *node,
83 struct device_node *node, in __of_reset_control_get() argument
229 struct device_node *node, const char *id) in of_reset_control_get_exclusive() argument
231 return __of_reset_control_get(node, id, 0, false, false, true); in of_reset_control_get_exclusive()
254 struct device_node *node, const char *id) in of_reset_control_get_shared() argument
256 return __of_reset_control_get(node, id, 0, true, false, false); in of_reset_control_get_shared()
271 struct device_node *node, int index) in of_reset_control_get_exclusive_by_index() argument
273 return __of_reset_control_get(node, NULL, index, false, false, true); in of_reset_control_get_exclusive_by_index()
299 struct device_node *node, int index) in of_reset_control_get_shared_by_index() argument
301 return __of_reset_control_get(node, NULL, index, true, false, false); in of_reset_control_get_shared_by_index()
[all …]
|
| D | of_pdt.h | 18 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);
|
| D | llist.h | 114 #define llist_for_each(pos, node) \ argument
115 for ((pos) = (node); pos; (pos) = (pos)->next)
133 #define llist_for_each_safe(pos, n, node) \ argument
134 for ((pos) = (node); (pos) && ((n) = (pos)->next, true); (pos) = (n))
151 #define llist_for_each_entry(pos, node, member) \ argument
152 for ((pos) = llist_entry((node), typeof(*(pos)), member); \
173 #define llist_for_each_entry_safe(pos, n, node, member) \ argument
174 for (pos = llist_entry((node), typeof(*pos), member); \
192 static inline struct llist_node *llist_next(struct llist_node *node) in llist_next() argument
194 return node->next; in llist_next()
|
| D | plist.h | 110 #define PLIST_NODE_INIT(node, __prio) \ argument
113 .prio_list = LIST_HEAD_INIT((node).prio_list), \
114 .node_list = LIST_HEAD_INIT((node).node_list), \
132 static inline void plist_node_init(struct plist_node *node, int prio) in plist_node_init() argument
134 node->prio = prio; in plist_node_init()
135 INIT_LIST_HEAD(&node->prio_list); in plist_node_init()
136 INIT_LIST_HEAD(&node->node_list); in plist_node_init()
139 extern void plist_add(struct plist_node *node, struct plist_head *head);
140 extern void plist_del(struct plist_node *node, struct plist_head *head);
142 extern void plist_requeue(struct plist_node *node, struct plist_head *head);
[all …]
|
| D | resource_ext.h | 24 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)
|
| D | interconnect-provider.h | 50 int (*aggregate)(struct icc_node *node, u32 tag, u32 avg_bw,
52 void (*pre_aggregate)(struct icc_node *node);
97 int icc_link_create(struct icc_node *node, const int dst_id);
99 void icc_node_add(struct icc_node *node, struct icc_provider *provider);
100 void icc_node_del(struct icc_node *node);
115 static inline int icc_link_create(struct icc_node *node, const int dst_id) in icc_link_create() argument
125 void icc_node_add(struct icc_node *node, struct icc_provider *provider) in icc_node_add() argument
129 void icc_node_del(struct icc_node *node) in icc_node_del() argument
|
| D | compaction.h | 241 struct node;
243 extern int compaction_register_node(struct node *node);
244 extern void compaction_unregister_node(struct node *node);
248 static inline int compaction_register_node(struct node *node) in compaction_register_node() argument
253 static inline void compaction_unregister_node(struct node *node) in compaction_unregister_node() argument
|
| D | cpuhotplug.h | 268 struct hlist_node *node), in cpuhp_setup_state_multi() argument
270 struct hlist_node *node)) in cpuhp_setup_state_multi()
277 int __cpuhp_state_add_instance(enum cpuhp_state state, struct hlist_node *node,
280 struct hlist_node *node, bool invoke);
293 struct hlist_node *node) in cpuhp_state_add_instance() argument
295 return __cpuhp_state_add_instance(state, node, true); in cpuhp_state_add_instance()
308 struct hlist_node *node) in cpuhp_state_add_instance_nocalls() argument
310 return __cpuhp_state_add_instance(state, node, false); in cpuhp_state_add_instance_nocalls()
315 struct hlist_node *node) in cpuhp_state_add_instance_nocalls_cpuslocked() argument
317 return __cpuhp_state_add_instance_cpuslocked(state, node, false); in cpuhp_state_add_instance_nocalls_cpuslocked()
[all …]
|
| D | hashtable.h | 60 #define hash_add(hashtable, node, key) \ argument
61 hlist_add_head(node, &hashtable[hash_min(key, HASH_BITS(hashtable))])
69 #define hash_add_rcu(hashtable, node, key) \ argument
70 hlist_add_head_rcu(node, &hashtable[hash_min(key, HASH_BITS(hashtable))])
76 static inline bool hash_hashed(struct hlist_node *node) in hash_hashed() argument
78 return !hlist_unhashed(node); in hash_hashed()
105 static inline void hash_del(struct hlist_node *node) in hash_del() argument
107 hlist_del_init(node); in hash_del()
114 static inline void hash_del_rcu(struct hlist_node *node) in hash_del_rcu() argument
116 hlist_del_init_rcu(node); in hash_del_rcu()
|
| D | interval_tree.h | 15 interval_tree_insert(struct interval_tree_node *node,
19 interval_tree_remove(struct interval_tree_node *node,
27 interval_tree_iter_next(struct interval_tree_node *node,
|
| /include/asm-generic/ |
| D | topology.h | 38 #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/linux/regulator/ |
| D | of_regulator.h | 23 struct device_node *node,
25 extern int of_regulator_match(struct device *dev, struct device_node *node,
31 struct device_node *node, in of_get_regulator_init_data() argument
38 struct device_node *node, in of_regulator_match() argument
|