Searched refs:node (Results 1 - 25 of 165) sorted by relevance

1234567

/include/asm-generic/
H A Dtopology.h38 #define set_numa_node(node)
41 #define set_cpu_numa_node(cpu, node)
48 #define parent_node(node) ((void)(node),0)
51 #define cpumask_of_node(node) ((void)node, cpu_online_mask)
68 #define set_numa_mem(node)
71 #define set_cpu_numa_mem(cpu, node)
/include/linux/clk/
H A Dclk-conf.h13 int of_clk_set_defaults(struct device_node *node, bool clk_supplier);
15 static inline int of_clk_set_defaults(struct device_node *node, argument
/include/drm/
H A Ddrm_vma_manager.h64 struct drm_vma_offset_node *node, unsigned long pages);
66 struct drm_vma_offset_node *node);
68 int drm_vma_node_allow(struct drm_vma_offset_node *node, struct file *filp);
69 void drm_vma_node_revoke(struct drm_vma_offset_node *node, struct file *filp);
70 bool drm_vma_node_is_allowed(struct drm_vma_offset_node *node,
74 * drm_vma_offset_exact_lookup() - Look up node by exact address
79 * Same as drm_vma_offset_lookup() but does not allow any offset into the node.
90 struct drm_vma_offset_node *node; local
92 node = drm_vma_offset_lookup(mgr, start, pages);
93 return (node
145 drm_vma_node_reset(struct drm_vma_offset_node *node) argument
166 drm_vma_node_start(struct drm_vma_offset_node *node) argument
183 drm_vma_node_size(struct drm_vma_offset_node *node) argument
196 drm_vma_node_has_offset(struct drm_vma_offset_node *node) argument
213 drm_vma_node_offset_addr(struct drm_vma_offset_node *node) argument
230 drm_vma_node_unmap(struct drm_vma_offset_node *node, struct address_space *file_mapping) argument
251 drm_vma_node_verify_access(struct drm_vma_offset_node *node, struct file *filp) argument
[all...]
H A Ddrm_mm.h80 * according to the (increasing) start address of the memory node. */
93 void (*color_adjust)(struct drm_mm_node *node, unsigned long color,
98 * drm_mm_node_allocated - checks whether a node is allocated
99 * @node: drm_mm_node to check
105 * True if the @node is allocated.
107 static inline bool drm_mm_node_allocated(struct drm_mm_node *node) argument
109 return node->allocated;
133 * drm_mm_hole_node_start - computes the start of the hole following @node
138 * follows by looking at node->hole_follows.
156 * drm_mm_hole_node_end - computes the end of the hole following @node
246 drm_mm_insert_node(struct drm_mm *mm, struct drm_mm_node *node, unsigned long size, unsigned alignment, enum drm_mm_search_flags flags) argument
283 drm_mm_insert_node_in_range(struct drm_mm *mm, struct drm_mm_node *node, unsigned long size, unsigned alignment, unsigned long start, unsigned long end, enum drm_mm_search_flags flags) argument
[all...]
/include/linux/
H A Dtimerqueue.h9 struct rb_node node; member in struct:timerqueue_node
20 struct timerqueue_node *node);
22 struct timerqueue_node *node);
24 struct timerqueue_node *node);
31 * Returns a pointer to the timer node that has the
40 static inline void timerqueue_init(struct timerqueue_node *node) argument
42 RB_CLEAR_NODE(&node->node);
H A Dinterval_tree_generic.h31 * ITSTART(n): start endpoint of ITSTRUCT node n
32 * ITLAST(n): last endpoint of ITSTRUCT node n
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), las
[all...]
H A Dtopology.h42 #define nr_cpus_node(node) cpumask_weight(cpumask_of_node(node))
45 #define for_each_node_with_cpus(node) \
46 for_each_online_node(node) \
47 if (nr_cpus_node(node))
89 static inline void set_numa_node(int node) argument
91 this_cpu_write(numa_node, node);
96 static inline void set_cpu_numa_node(int cpu, int node) argument
98 per_cpu(numa_node, cpu) = node;
125 static inline void set_numa_mem(int node) argument
133 node_to_mem_node(int node) argument
155 set_cpu_numa_mem(int cpu, int node) argument
173 node_to_mem_node(int node) argument
[all...]
H A Dof_graph.h30 int of_graph_parse_endpoint(const struct device_node *node,
35 const struct device_node *node);
36 struct device_node *of_graph_get_remote_port(const struct device_node *node);
39 static inline int of_graph_parse_endpoint(const struct device_node *node, argument
53 const struct device_node *node)
59 const struct device_node *node)
52 of_graph_get_remote_port_parent( const struct device_node *node) argument
58 of_graph_get_remote_port( const struct device_node *node) argument
H A 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);
H A Dof_fdt.h30 unsigned long node,
34 unsigned long node,
36 extern int of_fdt_match(const void *blob, unsigned long node,
50 extern int of_scan_flat_dt(int (*it)(unsigned long node, const char *uname,
53 extern const void *of_get_flat_dt_prop(unsigned long node, const char *name,
55 extern int of_flat_dt_is_compatible(unsigned long node, const char *name);
56 extern int of_flat_dt_match(unsigned long node, const char *const *matches);
81 extern int early_init_dt_scan_chosen(unsigned long node, const char *uname,
83 extern int early_init_dt_scan_memory(unsigned long node, const char *uname,
93 extern int early_init_dt_scan_root(unsigned long node, cons
[all...]
H A Dnode.h2 * include/linux/node.h - generic node definition
5 * basic 'struct node' here, which can be embedded in per-arch
8 * Basic handling of the devices is done in drivers/base/node.c
11 * Nodes are exported via driverfs in the class/node/devices/
21 struct node { struct
30 extern struct node *node_devices[];
31 typedef void (*node_registration_func_t)(struct node *);
33 extern void unregister_node(struct node *node);
[all...]
H A 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,
H A Drbtree.h55 #define RB_EMPTY_NODE(node) \
56 ((node)->__rb_parent_color == (unsigned long)(node))
57 #define RB_CLEAR_NODE(node) \
58 ((node)->__rb_parent_color = (unsigned long)(node))
75 /* Fast replacement of a single node without remove/rebalance/add/rebalance */
79 static inline void rb_link_node(struct rb_node * node, struct rb_node * parent, argument
82 node->__rb_parent_color = (unsigned long)parent;
83 node
[all...]
H A Dnodemask.h22 * void node_set(node, mask) turn on bit 'node' in mask
23 * void node_clear(node, mask) turn off bit 'node' in mask
26 * int node_isset(node, mask) true iff bit 'node' set in mask
27 * int node_test_and_set(node, mask) test and set bit 'node' in mask
46 * int next_node(node, mask) Next node pas
111 __node_set(int node, volatile nodemask_t *dstp) argument
117 __node_clear(int node, volatile nodemask_t *dstp) argument
139 __node_test_and_set(int node, nodemask_t *addr) argument
257 init_nodemask_of_node(nodemask_t *mask, int node) argument
409 node_state(int node, enum node_states state) argument
414 node_set_state(int node, enum node_states state) argument
419 node_clear_state(int node, enum node_states state) argument
460 node_state(int node, enum node_states state) argument
465 node_set_state(int node, enum node_states state) argument
469 node_clear_state(int node, enum node_states state) argument
[all...]
H A Dplist.h19 * This is a priority-sorted list of nodes; each node has a
22 * Addition is O(K), removal is O(1), change of priority of a node is
54 * Addition means: look for the prio_list node in the prio_list
55 * for the priority of the node and insert it before the node_list
56 * entry of the next prio_list node. If it is the first node of
109 * @node: struct plist_node variable name
110 * @__prio: initial node priority
112 #define PLIST_NODE_INIT(node, __prio) \
115 .prio_list = LIST_HEAD_INIT((node)
134 plist_node_init(struct plist_node *node, int prio) argument
221 plist_node_empty(const struct plist_node *node) argument
[all...]
H A Dllist.h93 * @node: the first entry of deleted list entries
104 #define llist_for_each(pos, node) \
105 for ((pos) = (node); pos; (pos) = (pos)->next)
110 * @node: the fist entry of deleted list entries.
122 #define llist_for_each_entry(pos, node, member) \
123 for ((pos) = llist_entry((node), typeof(*(pos)), member); \
132 * @node: the first entry of deleted list entries.
144 #define llist_for_each_entry_safe(pos, n, node, member) \
145 for (pos = llist_entry((node), typeof(*pos), member); \
163 static inline struct llist_node *llist_next(struct llist_node *node) argument
[all...]
H A 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,
50 * leading to the inserted node, then call rb_link_node() as usual and
57 rb_insert_augmented(struct rb_node *node, struct rb_root *root, argument
60 __rb_insert_augmented(node, root, augment->rotate);
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
137 __rb_erase_augmented(struct rb_node *node, struct rb_root *root, const struct rb_augment_callbacks *augment) argument
234 rb_erase_augmented(struct rb_node *node, struct rb_root *root, const struct rb_augment_callbacks *augment) argument
[all...]
H A Dcompaction.h136 extern int compaction_register_node(struct node *node);
137 extern void compaction_unregister_node(struct node *node);
141 static inline int compaction_register_node(struct node *node) argument
146 static inline void compaction_unregister_node(struct node *node) argument
H A Dof_pci.h17 int of_pci_parse_bus_range(struct device_node *node, struct resource *res);
18 int of_get_pci_domain_nr(struct device_node *node);
43 of_pci_parse_bus_range(struct device_node *node, struct resource *res) argument
49 of_get_pci_domain_nr(struct device_node *node) argument
H A Dsyscore_ops.h15 struct list_head node; member in struct:syscore_ops
/include/linux/irqchip/
H A Dversatile-fpga.h9 struct device_node *node);
10 int fpga_irq_of_init(struct device_node *node,
/include/linux/regulator/
H A 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)
32 struct device_node *node,
25 of_get_regulator_init_data(struct device *dev, struct device_node *node) argument
31 of_regulator_match(struct device *dev, struct device_node *node, struct of_regulator_match *matches, unsigned int num_matches) argument
/include/drm/bridge/
H A Dptn3460.h25 struct i2c_client *client, struct device_node *node);
30 struct device_node *node)
28 ptn3460_init(struct drm_device *dev, struct drm_encoder *encoder, struct i2c_client *client, struct device_node *node) argument
/include/linux/platform_data/
H A Dgpio-dwapb.h18 struct device_node *node; member in struct:dwapb_port_property
/include/media/
H A Dv4l2-of.h70 int v4l2_of_parse_endpoint(const struct device_node *node,
74 static inline int v4l2_of_parse_endpoint(const struct device_node *node, argument

Completed in 277 milliseconds

1234567