Home
last modified time | relevance | path

Searched refs:node (Results 1951 - 1975 of 10048) sorted by relevance

1...<<71727374757677787980>>...402

/kernel/linux/linux-5.10/drivers/usb/host/
H A Dfhci-q.c64 list_add_tail(&td->node, &ed->td_list); in fhci_add_tds_to_ed()
75 td = list_entry(ed->td_list.next, struct td, node); in peek_td_from_ed()
112 td = list_entry(ed->td_list.next, struct td, node); in fhci_remove_td_from_ed()
118 node); in fhci_remove_td_from_ed()
132 td = list_entry(p_list->done_list.next, struct td, node); in fhci_remove_td_from_done_list()
145 list_del_init(&td->node); in fhci_move_td_from_ed_to_done_list()
149 ed->td_head = list_entry(ed->td_list.next, struct td, node); in fhci_move_td_from_ed_to_done_list()
155 list_add_tail(&td->node, &usb->hc_list->done_list); in fhci_move_td_from_ed_to_done_list()
168 list_del_init(&urb_priv->tds[i]->node); in free_urb_priv()
174 ed->td_head = list_entry(ed->td_list.next, struct td, node); in free_urb_priv()
[all...]
/kernel/linux/linux-5.10/scripts/dtc/
H A Ddtc-parser.y41 struct node *node;
42 struct node *nodelist;
78 %type <node> devicetree
79 %type <node> nodedef
80 %type <node> subnode
179 struct node *target = get_node_by_ref($1, $3);
198 struct node *target = get_node_by_ref($1, $2);
209 struct node *target = get_node_by_ref($1, $2);
228 struct node *targe
[all...]
/kernel/linux/linux-6.6/drivers/usb/host/
H A Dfhci-q.c64 list_add_tail(&td->node, &ed->td_list); in fhci_add_tds_to_ed()
75 td = list_entry(ed->td_list.next, struct td, node); in peek_td_from_ed()
112 td = list_entry(ed->td_list.next, struct td, node); in fhci_remove_td_from_ed()
118 node); in fhci_remove_td_from_ed()
132 td = list_entry(p_list->done_list.next, struct td, node); in fhci_remove_td_from_done_list()
145 list_del_init(&td->node); in fhci_move_td_from_ed_to_done_list()
149 ed->td_head = list_entry(ed->td_list.next, struct td, node); in fhci_move_td_from_ed_to_done_list()
155 list_add_tail(&td->node, &usb->hc_list->done_list); in fhci_move_td_from_ed_to_done_list()
168 list_del_init(&urb_priv->tds[i]->node); in free_urb_priv()
174 ed->td_head = list_entry(ed->td_list.next, struct td, node); in free_urb_priv()
[all...]
/kernel/linux/linux-6.6/drivers/clk/ti/
H A Dclk-dra7-atl.c163 static void __init of_dra7_atl_clock_setup(struct device_node *node) in of_dra7_atl_clock_setup() argument
179 name = ti_dt_clk_name(node); in of_dra7_atl_clock_setup()
183 init.num_parents = of_clk_get_parent_count(node); in of_dra7_atl_clock_setup()
187 node); in of_dra7_atl_clock_setup()
192 clk = of_ti_clk_register(node, &clk_hw->hw, name); in of_dra7_atl_clock_setup()
195 of_clk_add_provider(node, of_clk_src_simple_get, clk); in of_dra7_atl_clock_setup()
205 struct device_node *node = pdev->dev.of_node; in of_dra7_atl_clk_probe() local
210 if (!node) in of_dra7_atl_clk_probe()
217 cinfo->iobase = of_iomap(node, 0); in of_dra7_atl_clk_probe()
232 rc = of_parse_phandle_with_args(node, "t in of_dra7_atl_clk_probe()
[all...]
/kernel/linux/linux-6.6/drivers/clk/sunxi/
H A Dclk-factors.c176 static struct clk *__sunxi_factors_register(struct device_node *node, in __sunxi_factors_register() argument
187 const char *clk_name = node->name; in __sunxi_factors_register()
192 i = of_clk_parent_fill(node, parents, FACTORS_MAX_PARENTS); in __sunxi_factors_register()
201 of_property_read_string(node, "clock-output-names", &clk_name); in __sunxi_factors_register()
253 ret = of_clk_add_provider(node, of_clk_src_simple_get, clk); in __sunxi_factors_register()
272 struct clk *sunxi_factors_register(struct device_node *node, in sunxi_factors_register() argument
277 return __sunxi_factors_register(node, data, lock, reg, 0); in sunxi_factors_register()
280 struct clk *sunxi_factors_register_critical(struct device_node *node, in sunxi_factors_register_critical() argument
285 return __sunxi_factors_register(node, data, lock, reg, CLK_IS_CRITICAL); in sunxi_factors_register_critical()
288 void sunxi_factors_unregister(struct device_node *node, struc argument
[all...]
/kernel/linux/linux-6.6/drivers/net/ethernet/cisco/enic/
H A Denic_clsf.c97 hlist_for_each_entry_safe(n, tmp, hhead, node) { in enic_rfs_flw_tbl_free()
99 hlist_del(&n->node); in enic_rfs_flw_tbl_free()
117 hlist_for_each_entry_safe(n, tmp, hhead, node) in htbl_fltr_search()
139 hlist_for_each_entry_safe(n, tmp, hhead, node) { in enic_flow_may_expire()
146 hlist_del(&n->node); in enic_flow_may_expire()
161 hlist_for_each_entry(tpos, h, node) in htbl_key_search()
216 hlist_del(&n->node); in enic_rx_flow_steer()
241 INIT_HLIST_NODE(&d->node); in enic_rx_flow_steer()
242 hlist_add_head(&d->node, head); in enic_rx_flow_steer()
277 INIT_HLIST_NODE(&n->node); in enic_rx_flow_steer()
[all...]
/kernel/linux/linux-6.6/drivers/hwtracing/stm/
H A Dp_sys-t.c86 struct sys_t_policy_node node; member
107 memcpy(&opriv->node, pn, sizeof(opriv->node)); in sys_t_output_open()
240 if (op->node.ts_interval && in sys_t_need_ts()
241 time_after(jiffies, op->ts_jiffies + op->node.ts_interval)) { in sys_t_need_ts()
252 if (op->node.clocksync_interval && in sys_t_need_clock_sync()
254 op->clocksync_jiffies + op->node.clocksync_interval)) { in sys_t_need_clock_sync()
298 /* We require an existing policy node to proceed */ in sys_t_write()
308 if (op->node.do_len) in sys_t_write()
326 export_uuid(uuid, &op->node in sys_t_write()
[all...]
/kernel/linux/linux-6.6/drivers/irqchip/
H A Dirq-sun6i-r.c308 static int __init sun6i_r_intc_init(struct device_node *node, in sun6i_r_intc_init() argument
316 /* Extract the NMI hwirq number from the OF node. */ in sun6i_r_intc_init()
317 ret = of_irq_parse_one(node, 0, &nmi_parent); in sun6i_r_intc_init()
331 pr_err("%pOF: Failed to obtain parent domain\n", node); in sun6i_r_intc_init()
335 base = of_io_request_and_map(node, 0, NULL); in sun6i_r_intc_init()
337 pr_err("%pOF: Failed to map MMIO region\n", node); in sun6i_r_intc_init()
341 domain = irq_domain_add_hierarchy(parent_domain, 0, 0, node, in sun6i_r_intc_init()
344 pr_err("%pOF: Failed to allocate domain\n", node); in sun6i_r_intc_init()
363 static int __init sun6i_a31_r_intc_init(struct device_node *node, in sun6i_a31_r_intc_init() argument
366 return sun6i_r_intc_init(node, paren in sun6i_a31_r_intc_init()
376 sun50i_h6_r_intc_init(struct device_node *node, struct device_node *parent) sun50i_h6_r_intc_init() argument
[all...]
/kernel/linux/linux-6.6/scripts/dtc/
H A Ddtc-parser.y47 struct node *node;
48 struct node *nodelist;
84 %type <node> devicetree
85 %type <node> nodedef
86 %type <node> subnode
187 struct node *target = get_node_by_ref($1, $3);
211 struct node *target = get_node_by_ref($1, $2);
222 struct node *target = get_node_by_ref($1, $2);
241 struct node *targe
[all...]
/third_party/node/deps/v8/src/profiler/
H A Dallocation-tracker.cc26 for (AllocationTraceNode* node : children_) delete node; in ~AllocationTraceNode()
32 for (AllocationTraceNode* node : children_) { in FindChild()
33 if (node->function_info_index() == function_info_index) return node; in FindChild()
67 for (AllocationTraceNode* node : children_) { in Print()
68 node->Print(indent, tracker); in Print()
80 AllocationTraceNode* node = root(); in AddPathFromEnd() local
83 node = node in AddPathFromEnd()
[all...]
/third_party/skia/third_party/externals/angle2/src/compiler/translator/
H A DOutputHLSL.h94 bool visitSwizzle(Visit visit, TIntermSwizzle *node) override;
101 void visitFunctionPrototype(TIntermFunctionPrototype *node) override;
102 bool visitFunctionDefinition(Visit visit, TIntermFunctionDefinition *node) override;
104 bool visitBlock(Visit visit, TIntermBlock *node) override;
106 TIntermGlobalQualifierDeclaration *node) override;
107 bool visitDeclaration(Visit visit, TIntermDeclaration *node) override;
111 bool handleExcessiveLoop(TInfoSinkBase &out, TIntermLoop *node);
123 void outputConstructor(TInfoSinkBase &out, Visit visit, TIntermAggregate *node);
143 void writeIfElse(TInfoSinkBase &out, TIntermIfElse *node);
276 ImmutableString samplerNamePrefixFromStruct(TIntermTyped *node);
[all...]
/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Dscalar_analysis.h38 // instructions. Each node is hashed as it is added so like node (for instance,
39 // two induction variables i=0,i++ and j=0,j++) become the same node. After
46 // Create a unary negative node on |operand|.
53 // Create an addition node between two operands. The |simplify| when set will
58 // Create a multiply node between two operands.
61 // Create a node representing a constant integer.
64 // Create a value unknown node, such as a load.
70 // Create a new recurrent node with |offset| and |coefficient|, with respect
78 // Simplify the |node| b
178 SExpression(SENode* node) SExpression() argument
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Dscalar_analysis.h38 // instructions. Each node is hashed as it is added so like node (for instance,
39 // two induction variables i=0,i++ and j=0,j++) become the same node. After
46 // Create a unary negative node on |operand|.
53 // Create an addition node between two operands. The |simplify| when set will
58 // Create a multiply node between two operands.
61 // Create a node representing a constant integer.
64 // Create a value unknown node, such as a load.
70 // Create a new recurrent node with |offset| and |coefficient|, with respect
78 // Simplify the |node| b
178 SExpression(SENode* node) SExpression() argument
[all...]
/third_party/spirv-tools/source/opt/
H A Dscalar_analysis.h38 // instructions. Each node is hashed as it is added so like node (for instance,
39 // two induction variables i=0,i++ and j=0,j++) become the same node. After
46 // Create a unary negative node on |operand|.
53 // Create an addition node between two operands. The |simplify| when set will
58 // Create a multiply node between two operands.
61 // Create a node representing a constant integer.
64 // Create a value unknown node, such as a load.
70 // Create a new recurrent node with |offset| and |coefficient|, with respect
78 // Simplify the |node| b
178 SExpression(SENode* node) SExpression() argument
[all...]
/kernel/linux/linux-5.10/tools/perf/util/
H A Dhist.c336 struct rb_node *node = rb_first_cached(&he->hroot_out); in hists__decay_entry() local
337 while (node) { in hists__decay_entry()
338 child = rb_entry(node, struct hist_entry, rb_node); in hists__decay_entry()
339 node = rb_next(node); in hists__decay_entry()
489 INIT_LIST_HEAD(&he->pairs.node); in hist_entry__init()
1064 struct callchain_cursor_node *node; in iter_next_cumulative_entry() local
1066 node = callchain_cursor_current(&callchain_cursor); in iter_next_cumulative_entry()
1067 if (node == NULL) in iter_next_cumulative_entry()
1070 return fill_callchain_info(al, node, ite in iter_next_cumulative_entry()
1517 struct perf_hpp_list_node *node; hists__hierarchy_insert_entry() local
1724 struct rb_node *node; hierarchy_recalc_total_periods() local
1785 struct rb_node *node; hists__hierarchy_output_resort() local
1975 rb_hierarchy_last(struct rb_node *node) rb_hierarchy_last() argument
1986 __rb_hierarchy_next(struct rb_node *node, enum hierarchy_move_dir hmd) __rb_hierarchy_next() argument
2005 rb_hierarchy_prev(struct rb_node *node) rb_hierarchy_prev() argument
2022 struct rb_node *node; hist_entry__has_hierarchy_children() local
2799 struct rb_node *node; hists__delete_remaining_entries() local
2823 struct perf_hpp_list_node *node, *tmp; hists_evsel__exit() local
[all...]
/kernel/linux/linux-6.6/tools/perf/util/
H A Dhist.c346 struct rb_node *node = rb_first_cached(&he->hroot_out); in hists__decay_entry() local
347 while (node) { in hists__decay_entry()
348 child = rb_entry(node, struct hist_entry, rb_node); in hists__decay_entry()
349 node = rb_next(node); in hists__decay_entry()
500 INIT_LIST_HEAD(&he->pairs.node); in hist_entry__init()
1090 struct callchain_cursor_node *node; in iter_next_cumulative_entry() local
1092 node = callchain_cursor_current(get_tls_callchain_cursor()); in iter_next_cumulative_entry()
1093 if (node == NULL) in iter_next_cumulative_entry()
1096 return fill_callchain_info(al, node, ite in iter_next_cumulative_entry()
1550 struct perf_hpp_list_node *node; hists__hierarchy_insert_entry() local
1766 struct rb_node *node; hierarchy_recalc_total_periods() local
1827 struct rb_node *node; hists__hierarchy_output_resort() local
2017 rb_hierarchy_last(struct rb_node *node) rb_hierarchy_last() argument
2028 __rb_hierarchy_next(struct rb_node *node, enum hierarchy_move_dir hmd) __rb_hierarchy_next() argument
2047 rb_hierarchy_prev(struct rb_node *node) rb_hierarchy_prev() argument
2064 struct rb_node *node; hist_entry__has_hierarchy_children() local
2862 struct rb_node *node; hists__delete_remaining_entries() local
2886 struct perf_hpp_list_node *node, *tmp; hists_evsel__exit() local
[all...]
/kernel/linux/linux-6.6/drivers/scsi/elx/efct/
H A Defct_scsi.c17 io->node->display_name, io->instance_index,\
30 efct_scsi_io_alloc(struct efct_node *node) in efct_scsi_io_alloc() argument
37 efct = node->efct; in efct_scsi_io_alloc()
54 io->node = node; in efct_scsi_io_alloc()
55 kref_get(&node->ref); in efct_scsi_io_alloc()
64 /* Add to node's active_ios list */ in efct_scsi_io_alloc()
66 spin_lock_irqsave(&node->active_ios_lock, flags); in efct_scsi_io_alloc()
67 list_add(&io->list_entry, &node->active_ios); in efct_scsi_io_alloc()
69 spin_unlock_irqrestore(&node in efct_scsi_io_alloc()
79 struct efct_node *node = io->node; _efct_scsi_io_free() local
873 struct efct_node *node = io->node; efct_target_send_bls_resp() local
921 struct efct_node *node = io->node; efct_bls_send_rjt() local
[all...]
/kernel/linux/linux-6.6/sound/soc/intel/avs/
H A Dpath.c23 list_for_each_entry(acomp, &adev->comp_list, node) in avs_path_find_tplg()
34 list_for_each_entry(mod, &ppl->mod_list, node) in avs_path_find_module()
45 list_for_each_entry(ppl, &path->ppl_list, node) in avs_path_find_pipeline()
62 list_for_each_entry(pos, &tplg->path_tmpl_list, node) { in avs_path_find_path()
73 list_for_each_entry(path, &adev->path_list, node) { in avs_path_find_path()
101 list_for_each_entry(variant, &template->path_list, node) { in avs_path_find_variant()
575 INIT_LIST_HEAD(&mod->node); in avs_path_module_create()
656 INIT_LIST_HEAD(&binding->node); in avs_path_binding_create()
666 list_for_each_entry(mod, &ppl->mod_list, node) { in avs_path_pipeline_arm()
675 struct avs_path_module, node)) in avs_path_pipeline_arm()
[all...]
/kernel/linux/linux-6.6/net/tipc/
H A Dname_table.c48 #include "node.h"
56 * @max: largest 'upper' in this node subtree
57 * @local_publ: list of identical publications made from this node
59 * @all_publ: all publications identical to this one, whatever node and scope
121 * @n: the root node of service range rbtree for searching
125 * Return: the leftmost service range node in the rbtree that overlaps the
141 /* A leftmost overlap range node must be one in the left in service_range_match_first()
149 /* No one in the left subtree can match, return if this node is in service_range_match_first()
171 * @n: a node in service range rbtree from which the searching starts
175 * Return: the next service range node t
337 u32 node = p->sk.node; tipc_service_insert_publ() local
388 u32 node = sk->node; tipc_service_remove_publ() local
1141 tipc_dest_find(struct list_head *l, u32 node, u32 port) tipc_dest_find() argument
1152 tipc_dest_push(struct list_head *l, u32 node, u32 port) tipc_dest_push() argument
1168 tipc_dest_pop(struct list_head *l, u32 *node, u32 *port) tipc_dest_pop() argument
1184 tipc_dest_del(struct list_head *l, u32 node, u32 port) tipc_dest_del() argument
[all...]
/third_party/gn/src/gn/
H A Dcommand_format.cc155 void PrintSuffixComments(const ParseNode* node);
173 // Traverse a binary op node tree and apply a callback to each leaf node.
174 void TraverseBinaryOpNode(const ParseNode* node,
357 void Printer::PrintSuffixComments(const ParseNode* node) { in PrintSuffixComments() argument
358 if (node->comments() && !node->comments()->suffix().empty()) { in PrintSuffixComments()
361 PrintTrailingCommentsWrapped(node->comments()->suffix()); in PrintSuffixComments()
415 TraverseBinaryOpNode(binop->right(), [](const ParseNode* node) { in SortIfApplicable()
416 const ListNode* list = node in SortIfApplicable()
430 TraverseBinaryOpNode( const ParseNode* node, std::function<void(const ParseNode*)> callback) TraverseBinaryOpNode() argument
520 const PARSENODE* node = statements[i].get(); SortImports() local
535 SuffixCommentTreeWalk(const ParseNode* node) SuffixCommentTreeWalk() argument
[all...]
/kernel/linux/linux-5.10/fs/ocfs2/cluster/
H A Dtcp.c36 * Connections are initiated between a pair of nodes when the node with the
37 * higher node number gets a heartbeat callback which indicates that the lower
38 * numbered node has started heartbeating. The lower numbered node is passive
39 * and only accepts the connection if the higher numbered node is heartbeating.
63 #define SC_NODEF_FMT "node %s (num %u) at %pI4:%u"
85 mlog(ML_SOCKET, "[sc %p refs %d sock %p node %u page %p " \
104 * tears down all the node's sock containers, preventing future shutdowns
135 u32 msgkey, struct task_struct *task, u8 node) in o2net_init_nst()
141 nst->st_node = node; in o2net_init_nst()
134 o2net_init_nst(struct o2net_send_tracking *nst, u32 msgtype, u32 msgkey, struct task_struct *task, u8 node) o2net_init_nst() argument
412 sc_alloc(struct o2nm_node *node) sc_alloc() argument
998 int node, ret; o2net_fill_node_map() local
1552 struct o2nm_node *node = NULL, *mynode = NULL; o2net_start_connect() local
1692 o2net_disconnect_node(struct o2nm_node *node) o2net_disconnect_node() argument
1710 o2net_hb_node_down_cb(struct o2nm_node *node, int node_num, void *data) o2net_hb_node_down_cb() argument
1724 o2net_hb_node_up_cb(struct o2nm_node *node, int node_num, void *data) o2net_hb_node_up_cb() argument
1782 struct o2nm_node *node = NULL; o2net_accept_one() local
2025 o2net_start_listening(struct o2nm_node *node) o2net_start_listening() argument
2052 o2net_stop_listening(struct o2nm_node *node) o2net_stop_listening() argument
2067 struct o2nm_node *node = o2nm_get_node_by_num(i); o2net_stop_listening() local
[all...]
/kernel/linux/linux-6.6/fs/ocfs2/cluster/
H A Dtcp.c34 * Connections are initiated between a pair of nodes when the node with the
35 * higher node number gets a heartbeat callback which indicates that the lower
36 * numbered node has started heartbeating. The lower numbered node is passive
37 * and only accepts the connection if the higher numbered node is heartbeating.
62 #define SC_NODEF_FMT "node %s (num %u) at %pI4:%u"
84 mlog(ML_SOCKET, "[sc %p refs %d sock %p node %u page %p " \
103 * tears down all the node's sock containers, preventing future shutdowns
134 u32 msgkey, struct task_struct *task, u8 node) in o2net_init_nst()
140 nst->st_node = node; in o2net_init_nst()
133 o2net_init_nst(struct o2net_send_tracking *nst, u32 msgtype, u32 msgkey, struct task_struct *task, u8 node) o2net_init_nst() argument
411 sc_alloc(struct o2nm_node *node) sc_alloc() argument
1002 int node, ret; o2net_fill_node_map() local
1553 struct o2nm_node *node = NULL, *mynode = NULL; o2net_start_connect() local
1694 o2net_disconnect_node(struct o2nm_node *node) o2net_disconnect_node() argument
1712 o2net_hb_node_down_cb(struct o2nm_node *node, int node_num, void *data) o2net_hb_node_down_cb() argument
1726 o2net_hb_node_up_cb(struct o2nm_node *node, int node_num, void *data) o2net_hb_node_up_cb() argument
1784 struct o2nm_node *node = NULL; o2net_accept_one() local
2029 o2net_start_listening(struct o2nm_node *node) o2net_start_listening() argument
2056 o2net_stop_listening(struct o2nm_node *node) o2net_stop_listening() argument
2071 struct o2nm_node *node = o2nm_get_node_by_num(i); o2net_stop_listening() local
[all...]
/kernel/linux/linux-6.6/drivers/md/persistent-data/
H A Ddm-btree.c86 static int insert_at(size_t value_size, struct btree_node *node, unsigned int index,
90 uint32_t nr_entries = le32_to_cpu(node->header.nr_entries); in __dm_written_to_disk()
91 uint32_t max_entries = le32_to_cpu(node->header.max_entries); in __dm_written_to_disk()
97 DMERR("too many entries in btree node for insert"); in __dm_written_to_disk()
104 array_insert(node->keys, sizeof(*node->keys), nr_entries, index, &key_le); in __dm_written_to_disk()
105 array_insert(value_base(node), value_size, nr_entries, index, value); in __dm_written_to_disk()
106 node->header.nr_entries = cpu_to_le32(nr_entries + 1); in __dm_written_to_disk()
227 * This is a shared node, so we can just decrement it's in push_frame()
424 struct dm_block *node; in dm_btree_lookup_next_single() local
713 struct btree_node *node; shadow_child() local
978 struct btree_node *node; get_node_free_space() local
1063 contains_key(struct btree_node *node, uint64_t key) contains_key() argument
1078 has_space_for_insert(struct btree_node *node, uint64_t key) has_space_for_insert() argument
1097 struct btree_node *node; btree_insert_raw() local
1160 struct btree_node *node; __btree_get_overwrite_leaf() local
1227 need_insert(struct btree_node *node, uint64_t *keys, unsigned int level, unsigned int index) need_insert() argument
1427 struct dm_block *node; walk_node() local
[all...]
/kernel/linux/linux-5.10/arch/ia64/include/asm/
H A Dtopology.h26 * Returns a bitmask of CPUs on Node 'node'.
28 #define cpumask_of_node(node) ((node) == -1 ? \
30 &node_to_cpu_mask[node])
33 * Determines the node for a given pci bus
35 #define pcibus_to_node(bus) PCI_CONTROLLER(bus)->node
/kernel/linux/linux-5.10/arch/mips/pic32/pic32mzda/
H A Dtime.c26 struct device_node *node; in pic32_xlate_core_timer_irq() local
29 node = of_find_matching_node(NULL, pic32_infra_match); in pic32_xlate_core_timer_irq()
31 if (WARN_ON(!node)) in pic32_xlate_core_timer_irq()
34 irq = irq_of_parse_and_map(node, 0); in pic32_xlate_core_timer_irq()

Completed in 24 milliseconds

1...<<71727374757677787980>>...402