| /include/drm/ |
| D | drm_vma_manager.h | 61 struct drm_vma_offset_node *node, unsigned long pages);
63 struct drm_vma_offset_node *node);
65 int drm_vma_node_allow(struct drm_vma_offset_node *node, struct file *filp);
66 void drm_vma_node_revoke(struct drm_vma_offset_node *node, struct file *filp);
67 bool drm_vma_node_is_allowed(struct drm_vma_offset_node *node,
87 struct drm_vma_offset_node *node; in drm_vma_offset_exact_lookup_locked() local
89 node = drm_vma_offset_lookup_locked(mgr, start, pages); in drm_vma_offset_exact_lookup_locked()
90 return (node && node->vm_node.start == start) ? node : NULL; in drm_vma_offset_exact_lookup_locked()
135 static inline void drm_vma_node_reset(struct drm_vma_offset_node *node) in drm_vma_node_reset() argument
137 memset(node, 0, sizeof(*node)); in drm_vma_node_reset()
[all …]
|
| D | drm_mm.h | 93 void (*color_adjust)(struct drm_mm_node *node, unsigned long color,
107 static inline bool drm_mm_node_allocated(struct drm_mm_node *node) in drm_mm_node_allocated() argument
109 return node->allocated; in drm_mm_node_allocated()
221 int drm_mm_reserve_node(struct drm_mm *mm, struct drm_mm_node *node);
224 struct drm_mm_node *node,
247 struct drm_mm_node *node, in drm_mm_insert_node() argument
252 return drm_mm_insert_node_generic(mm, node, size, alignment, 0, flags, in drm_mm_insert_node()
257 struct drm_mm_node *node,
284 struct drm_mm_node *node, in drm_mm_insert_node_in_range() argument
291 return drm_mm_insert_node_in_range_generic(mm, node, size, alignment, in drm_mm_insert_node_in_range()
[all …]
|
| /include/linux/ |
| D | interval_tree_generic.h | 45 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 …]
|
| D | rbtree_latch.h | 39 struct rb_node node[2]; member
68 __lt_from_rb(struct rb_node *node, int idx) in __lt_from_rb() argument
70 return container_of(node, struct latch_tree_node, node[idx]); in __lt_from_rb()
79 struct rb_node *node = <n->node[idx]; in __lt_insert() local
93 rb_link_node_rcu(node, parent, link); in __lt_insert()
94 rb_insert_color(node, root); in __lt_insert()
100 rb_erase(<n->node[idx], <r->tree[idx]); in __lt_erase()
105 int (*comp)(void *key, struct latch_tree_node *node)) in __lt_find() argument
107 struct rb_node *node = rcu_dereference_raw(ltr->tree[idx].rb_node); in __lt_find() local
111 while (node) { in __lt_find()
[all …]
|
| 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))
89 static inline void set_numa_node(int node) in set_numa_node() argument
91 this_cpu_write(numa_node, node); in set_numa_node()
96 static inline void set_cpu_numa_node(int cpu, int node) in set_cpu_numa_node() argument
98 per_cpu(numa_node, cpu) = node; in set_cpu_numa_node()
125 static inline void set_numa_mem(int node) in set_numa_mem() argument
127 this_cpu_write(_numa_mem_, node); in set_numa_mem()
[all …]
|
| D | rbtree.h | 56 #define RB_EMPTY_NODE(node) \ argument
57 ((node)->__rb_parent_color == (unsigned long)(node))
58 #define RB_CLEAR_NODE(node) \ argument
59 ((node)->__rb_parent_color = (unsigned long)(node))
80 static inline void rb_link_node(struct rb_node *node, struct rb_node *parent, in rb_link_node() argument
83 node->__rb_parent_color = (unsigned long)parent; in rb_link_node()
84 node->rb_left = node->rb_right = NULL; in rb_link_node()
86 *rb_link = node; in rb_link_node()
89 static inline void rb_link_node_rcu(struct rb_node *node, struct rb_node *parent, in rb_link_node_rcu() argument
92 node->__rb_parent_color = (unsigned long)parent; in rb_link_node_rcu()
[all …]
|
| 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_CLEAR_NODE(&node->node); in timerqueue_init()
|
| D | nodemask.h | 115 #define node_set(node, dst) __node_set((node), &(dst)) argument
116 static __always_inline void __node_set(int node, volatile nodemask_t *dstp) in __node_set() argument
118 set_bit(node, dstp->bits); in __node_set()
121 #define node_clear(node, dst) __node_clear((node), &(dst)) argument
122 static inline void __node_clear(int node, volatile nodemask_t *dstp) in __node_clear() argument
124 clear_bit(node, dstp->bits); in __node_clear()
140 #define node_isset(node, nodemask) test_bit((node), (nodemask).bits) argument
142 #define node_test_and_set(node, nodemask) \ argument
143 __node_test_and_set((node), &(nodemask))
144 static inline int __node_test_and_set(int node, nodemask_t *addr) in __node_test_and_set() argument
[all …]
|
| D | of_fdt.h | 30 unsigned long node,
34 unsigned long node,
37 unsigned long node);
38 extern int of_fdt_match(const void *blob, unsigned long node,
52 extern int of_scan_flat_dt(int (*it)(unsigned long node, const char *uname,
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);
58 extern int of_flat_dt_match(unsigned long node, const char *const *matches);
83 extern int early_init_dt_scan_chosen(unsigned long node, const char *uname,
85 extern int early_init_dt_scan_memory(unsigned long node, const char *uname,
[all …]
|
| D | of_graph.h | 43 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_remote_port(const struct device_node *node);
55 static inline int of_graph_parse_endpoint(const struct device_node *node, in of_graph_parse_endpoint() argument
62 struct device_node *node, u32 id) in of_graph_get_port_by_id() argument
81 const struct device_node *node) in of_graph_get_remote_port_parent() argument
87 const struct device_node *node) in of_graph_get_remote_port() argument
|
| D | rbtree_augmented.h | 39 void (*propagate)(struct rb_node *node, struct rb_node *stop);
44 extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
57 rb_insert_augmented(struct rb_node *node, struct rb_root *root, in rb_insert_augmented() argument
60 __rb_insert_augmented(node, root, augment->rotate); in rb_insert_augmented()
69 rbstruct *node = rb_entry(rb, rbstruct, rbfield); \
70 rbtype augmented = rbcompute(node); \
71 if (node->rbaugmented == augmented) \
73 node->rbaugmented = augmented; \
74 rb = rb_parent(&node->rbfield); \
137 __rb_erase_augmented(struct rb_node *node, struct rb_root *root, in __rb_erase_augmented() 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 | node.h | 21 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)
|
| D | plist.h | 112 #define PLIST_NODE_INIT(node, __prio) \ argument
115 .prio_list = LIST_HEAD_INIT((node).prio_list), \
116 .node_list = LIST_HEAD_INIT((node).node_list), \
134 static inline void plist_node_init(struct plist_node *node, int prio) in plist_node_init() argument
136 node->prio = prio; in plist_node_init()
137 INIT_LIST_HEAD(&node->prio_list); in plist_node_init()
138 INIT_LIST_HEAD(&node->node_list); in plist_node_init()
141 extern void plist_add(struct plist_node *node, struct plist_head *head);
142 extern void plist_del(struct plist_node *node, struct plist_head *head);
144 extern void plist_requeue(struct plist_node *node, struct plist_head *head);
[all …]
|
| D | resource_ext.h | 32 struct list_head node; member
45 list_add(&entry->node, head); in resource_list_add()
51 list_add_tail(&entry->node, head); in resource_list_add_tail()
56 list_del(&entry->node); in resource_list_del()
72 list_for_each_entry((entry), (list), node)
75 list_for_each_entry_safe((entry), (tmp), (list), node)
|
| D | compaction.h | 90 extern int compaction_register_node(struct node *node);
91 extern void compaction_unregister_node(struct node *node);
95 static inline int compaction_register_node(struct node *node) in compaction_register_node() argument
100 static inline void compaction_unregister_node(struct node *node) in compaction_unregister_node() argument
|
| D | llist.h | 121 #define llist_for_each(pos, node) \ argument
122 for ((pos) = (node); pos; (pos) = (pos)->next)
139 #define llist_for_each_entry(pos, node, member) \ argument
140 for ((pos) = llist_entry((node), typeof(*(pos)), member); \
161 #define llist_for_each_entry_safe(pos, n, node, member) \ argument
162 for (pos = llist_entry((node), typeof(*pos), member); \
180 static inline struct llist_node *llist_next(struct llist_node *node) in llist_next() argument
182 return node->next; in llist_next()
|
| D | hashtable.h | 59 #define hash_add(hashtable, node, key) \ argument
60 hlist_add_head(node, &hashtable[hash_min(key, HASH_BITS(hashtable))])
68 #define hash_add_rcu(hashtable, node, key) \ argument
69 hlist_add_head_rcu(node, &hashtable[hash_min(key, HASH_BITS(hashtable))])
75 static inline bool hash_hashed(struct hlist_node *node) in hash_hashed() argument
77 return !hlist_unhashed(node); in hash_hashed()
104 static inline void hash_del(struct hlist_node *node) in hash_del() argument
106 hlist_del_init(node); in hash_del()
113 static inline void hash_del_rcu(struct hlist_node *node) in hash_del_rcu() argument
115 hlist_del_init_rcu(node); in hash_del_rcu()
|
| D | interval_tree.h | 14 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,
|
| D | slab.h | 340 void *__kmalloc_node(size_t size, gfp_t flags, int node) __assume_kmalloc_alignment;
341 void *kmem_cache_alloc_node(struct kmem_cache *, gfp_t flags, int node) __assume_slab_alignment;
343 static __always_inline void *__kmalloc_node(size_t size, gfp_t flags, int node) in __kmalloc_node() argument
348 static __always_inline void *kmem_cache_alloc_node(struct kmem_cache *s, gfp_t flags, int node) in kmem_cache_alloc_node() argument
360 int node, size_t size) __assume_slab_alignment;
365 int node, size_t size) in kmem_cache_alloc_node_trace() argument
384 int node, size_t size) in kmem_cache_alloc_node_trace() argument
386 void *ret = kmem_cache_alloc_node(s, gfpflags, node); in kmem_cache_alloc_node_trace()
504 static __always_inline void *kmalloc_node(size_t size, gfp_t flags, int node) in kmalloc_node() argument
515 flags, node, size); in kmalloc_node()
[all …]
|
| D | irqdomain.h | 94 int (*match)(struct irq_domain *d, struct device_node *node,
98 int (*xlate)(struct irq_domain *d, struct device_node *node,
209 static inline struct fwnode_handle *of_node_to_fwnode(struct device_node *node) in of_node_to_fwnode() argument
211 return node ? &node->fwnode : NULL; in of_node_to_fwnode()
214 static inline struct irq_domain *irq_find_matching_host(struct device_node *node, in irq_find_matching_host() argument
217 return irq_find_matching_fwnode(of_node_to_fwnode(node), bus_token); in irq_find_matching_host()
220 static inline struct irq_domain *irq_find_host(struct device_node *node) in irq_find_host() argument
222 return irq_find_matching_host(node, DOMAIN_BUS_ANY); in irq_find_host()
348 struct device_node *node, in irq_domain_add_hierarchy() argument
353 of_node_to_fwnode(node), in irq_domain_add_hierarchy()
[all …]
|
| /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
52 #define cpumask_of_node(node) ((node) == 0 ? cpu_online_mask : cpu_none_mask) argument
54 #define cpumask_of_node(node) ((void)(node), cpu_online_mask) argument
72 #define set_numa_mem(node) argument
75 #define set_cpu_numa_mem(cpu, node) argument
|
| /include/media/ |
| D | v4l2-of.h | 90 int v4l2_of_parse_endpoint(const struct device_node *node,
93 const struct device_node *node);
95 int v4l2_of_parse_link(const struct device_node *node,
100 static inline int v4l2_of_parse_endpoint(const struct device_node *node, in v4l2_of_parse_endpoint() argument
107 const struct device_node *node) in v4l2_of_alloc_parse_endpoint() argument
116 static inline int v4l2_of_parse_link(const struct device_node *node, in v4l2_of_parse_link() argument
|
| /include/linux/regulator/ |
| D | of_regulator.h | 22 struct device_node *node,
24 extern int of_regulator_match(struct device *dev, struct device_node *node,
30 struct device_node *node, in of_get_regulator_init_data() argument
37 struct device_node *node, in of_regulator_match() argument
|
| /include/linux/clk/ |
| D | clk-conf.h | 15 int of_clk_set_defaults(struct device_node *node, bool clk_supplier);
17 static inline int of_clk_set_defaults(struct device_node *node, in of_clk_set_defaults() argument
|