Home
last modified time | relevance | path

Searched refs:node (Results 2976 - 3000 of 10048) sorted by relevance

1...<<111112113114115116117118119120>>...402

/kernel/linux/linux-6.6/fs/ubifs/
H A Dreplay.c30 * @lnum: logical eraseblock number of the node
31 * @offs: node offset
32 * @len: node length
33 * @deletion: non-zero if this entry corresponds to a node deletion
34 * @sqnum: node sequence number
36 * @key: node key
67 * @sqnum: reference node sequence number
364 * insert_node - insert a node to the replay list
366 * @lnum: node logical eraseblock number
367 * @offs: node offse
987 const struct ubifs_cs_node *node; replay_log_leb() local
[all...]
/kernel/linux/linux-6.6/fs/
H A Dseq_file.c975 struct hlist_node *node; in seq_hlist_start() local
977 hlist_for_each(node, head) in seq_hlist_start()
979 return node; in seq_hlist_start()
1012 struct hlist_node *node = v; in seq_hlist_next() local
1018 return node->next; in seq_hlist_next()
1036 struct hlist_node *node; in seq_hlist_start_rcu() local
1038 __hlist_for_each_rcu(node, head) in seq_hlist_start_rcu()
1040 return node; in seq_hlist_start_rcu()
1083 struct hlist_node *node = v; in seq_hlist_next_rcu() local
1089 return rcu_dereference(node in seq_hlist_next_rcu()
1104 struct hlist_node *node; seq_hlist_start_percpu() local
1129 struct hlist_node *node = v; seq_hlist_next_percpu() local
[all...]
/kernel/linux/linux-6.6/net/netfilter/
H A Dnft_set_hash.c30 struct rhash_head node; member
72 .head_offset = offsetof(struct nft_rhash_elem, node),
140 prev = rhashtable_lookup_get_insert_key(&priv->ht, &arg, &he->node, in nft_rhash_update()
176 prev = rhashtable_lookup_get_insert_key(&priv->ht, &arg, &he->node, in nft_rhash_insert()
234 rhashtable_remove_fast(&priv->ht, &he->node, nft_rhash_params); in nft_rhash_remove()
479 struct hlist_node node; member
494 hlist_for_each_entry_rcu(he, &priv->table[hash], node) { in nft_hash_lookup()
514 hlist_for_each_entry_rcu(he, &priv->table[hash], node) { in nft_hash_get()
535 hlist_for_each_entry_rcu(he, &priv->table[hash], node) { in nft_hash_lookup_fast()
573 hlist_for_each_entry(he, &priv->table[hash], node) { in nft_hash_insert()
[all...]
/kernel/linux/linux-6.6/net/ipv4/
H A Dudp_tunnel_nic.c683 struct udp_tunnel_nic_shared_node *node; in udp_tunnel_nic_replay() local
698 list_for_each_entry(node, &info->shared->devices, list) in udp_tunnel_nic_replay()
699 udp_tunnel_get_rx_info(node->dev); in udp_tunnel_nic_replay()
769 struct udp_tunnel_nic_shared_node *node = NULL; in udp_tunnel_nic_register() local
801 node = kzalloc(sizeof(*node), GFP_KERNEL); in udp_tunnel_nic_register()
802 if (!node) in udp_tunnel_nic_register()
805 node->dev = dev; in udp_tunnel_nic_register()
813 kfree(node); in udp_tunnel_nic_register()
824 list_add_tail(&node in udp_tunnel_nic_register()
846 struct udp_tunnel_nic_shared_node *node, *first; udp_tunnel_nic_unregister() local
[all...]
/third_party/mesa3d/src/gallium/tools/trace/
H A Ddump_state.py113 def visit(self, node):
115 node.visit(self)
118 def visit_literal(self, node):
119 self.result = node.value
121 def visit_blob(self, node):
122 self.result = node
124 def visit_named_constant(self, node):
125 self.result = node.name
127 def visit_array(self, node):
129 for element in node
[all...]
/third_party/mesa3d/src/mesa/state_tracker/
H A Dst_context.c239 list_addtail(&entry->node, &st->zombie_sampler_views.list.node); in st_save_zombie_sampler_view()
272 list_addtail(&entry->node, &st->zombie_shaders.list.node); in st_save_zombie_shader()
285 if (list_is_empty(&st->zombie_sampler_views.list.node)) { in free_zombie_sampler_views()
292 &st->zombie_sampler_views.list.node, node) { in free_zombie_sampler_views()
293 list_del(&entry->node); // remove this entry from the list in free_zombie_sampler_views()
301 assert(list_is_empty(&st->zombie_sampler_views.list.node)); in free_zombie_sampler_views()
315 if (list_is_empty(&st->zombie_shaders.list.node)) { in free_zombie_shaders()
[all...]
/third_party/skia/third_party/externals/spirv-tools/test/opt/
H A Dscalar_analysis.cpp128 const SENode* node = analysis.AnalyzeInstruction(child); in TEST_F() local
130 EXPECT_NE(node, nullptr); in TEST_F()
132 // Unsimplified node should have the form of ADD(REC(0,1), 1) in TEST_F()
133 EXPECT_EQ(node->GetType(), SENode::Add); in TEST_F()
135 const SENode* child_1 = node->GetChild(0); in TEST_F()
139 const SENode* child_2 = node->GetChild(1); in TEST_F()
143 SENode* simplified = analysis.SimplifyExpression(const_cast<SENode*>(node)); in TEST_F()
251 // const SENode* node = in TEST_F()
254 const SENode* node = analysis.AnalyzeInstruction(child); in TEST_F() local
256 EXPECT_NE(node, nullpt in TEST_F()
368 const SENode* node = analysis.AnalyzeInstruction(child); TEST_F() local
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/test/opt/
H A Dscalar_analysis.cpp128 const SENode* node = analysis.AnalyzeInstruction(child); in TEST_F() local
130 EXPECT_NE(node, nullptr); in TEST_F()
132 // Unsimplified node should have the form of ADD(REC(0,1), 1) in TEST_F()
133 EXPECT_EQ(node->GetType(), SENode::Add); in TEST_F()
135 const SENode* child_1 = node->GetChild(0); in TEST_F()
139 const SENode* child_2 = node->GetChild(1); in TEST_F()
143 SENode* simplified = analysis.SimplifyExpression(const_cast<SENode*>(node)); in TEST_F()
251 // const SENode* node = in TEST_F()
254 const SENode* node = analysis.AnalyzeInstruction(child); in TEST_F() local
256 EXPECT_NE(node, nullpt in TEST_F()
368 const SENode* node = analysis.AnalyzeInstruction(child); TEST_F() local
[all...]
/third_party/spirv-tools/test/opt/
H A Dscalar_analysis.cpp124 const SENode* node = analysis.AnalyzeInstruction(child); in TEST_F() local
126 EXPECT_NE(node, nullptr); in TEST_F()
128 // Unsimplified node should have the form of ADD(REC(0,1), 1) in TEST_F()
129 EXPECT_EQ(node->GetType(), SENode::Add); in TEST_F()
131 const SENode* child_1 = node->GetChild(0); in TEST_F()
135 const SENode* child_2 = node->GetChild(1); in TEST_F()
139 SENode* simplified = analysis.SimplifyExpression(const_cast<SENode*>(node)); in TEST_F()
247 // const SENode* node = in TEST_F()
250 const SENode* node = analysis.AnalyzeInstruction(child); in TEST_F() local
252 EXPECT_NE(node, nullpt in TEST_F()
364 const SENode* node = analysis.AnalyzeInstruction(child); TEST_F() local
[all...]
/kernel/linux/linux-5.10/drivers/infiniband/hw/qib/
H A Dqib_user_sdma.c61 struct rb_node node; member
144 struct rb_node *node = root->rb_node; in qib_user_sdma_rb_search() local
146 while (node) { in qib_user_sdma_rb_search()
147 sdma_rb_node = rb_entry(node, struct qib_user_sdma_rb_node, in qib_user_sdma_rb_search()
148 node); in qib_user_sdma_rb_search()
150 node = node->rb_left; in qib_user_sdma_rb_search()
152 node = node->rb_right; in qib_user_sdma_rb_search()
162 struct rb_node **node in qib_user_sdma_rb_insert() local
[all...]
/kernel/linux/linux-6.6/drivers/infiniband/hw/qib/
H A Dqib_user_sdma.c61 struct rb_node node; member
144 struct rb_node *node = root->rb_node; in qib_user_sdma_rb_search() local
146 while (node) { in qib_user_sdma_rb_search()
147 sdma_rb_node = rb_entry(node, struct qib_user_sdma_rb_node, in qib_user_sdma_rb_search()
148 node); in qib_user_sdma_rb_search()
150 node = node->rb_left; in qib_user_sdma_rb_search()
152 node = node->rb_right; in qib_user_sdma_rb_search()
162 struct rb_node **node in qib_user_sdma_rb_insert() local
[all...]
/third_party/node/src/
H A Djs_native_api_v8_inspector.cc27 #include "node/inspector/protocol/Protocol.h"
55 using node::ConditionVariable;
56 using node::Mutex;
57 using node::inspector::Utf8ToStringView;
430 using node::CheckedUvLoopClose;
431 using node::GetHumanReadableProcessName;
432 using node::InspectPublishUid;
433 using node::RegisterSignalHandler;
434 using node::inspector::FormatWsAddress;
435 using node
[all...]
/third_party/ninja/src/
H A Dninja.cc269 Node* node = state_.LookupNode(path); in RebuildManifest() local
270 if (!node) in RebuildManifest()
275 if (!builder.AddTarget(node, err)) in RebuildManifest()
286 if (!node->dirty()) { in RebuildManifest()
325 Node* node = state_.LookupNode(path); in CollectTarget() local
326 if (node) { in CollectTarget()
328 if (node->out_edges().empty()) { in CollectTarget()
329 Node* rev_deps = deps_log_.GetFirstReverseDepsNode(node); in CollectTarget()
334 node = rev_deps; in CollectTarget()
336 Edge* edge = node in CollectTarget()
370 Node* node = CollectTarget(argv[i], err); CollectTargetsFromArgs() local
405 Node* node = CollectTarget(argv[i], &err); ToolQuery() local
[all...]
/third_party/skia/third_party/externals/sfntly/cpp/src/test/tinyxml/
H A Dtinyxml.h117 false, <b>no children of this node or its sibilings</b> will be Visited.
145 /// Visit a text node
147 /// Visit a comment node
149 /// Visit an unknown node
226 /** Return the position, in the original source file, of this node or attribute.
419 Nodes have siblings, a parent, and children. A node can be
441 a node to a stream is very well defined. You'll get a nice stream
454 /// Appends the XML node or attribute to a std::string.
499 /** Changes the value of the node. Defined as:
515 /// Delete all the children of this node
1026 const TiXmlAttribute* node = attributeSet.Find( name ); QueryValueAttribute() local
1039 const TiXmlAttribute* node = attributeSet.Find( name ); QueryValueAttribute() local
1714 TiXmlNode* node; global() member in TiXmlHandle
[all...]
/third_party/python/Python/
H A Dast.c25 #define VALIDATE_POSITIONS(node) \
26 if (node->lineno > node->end_lineno) { \
28 "AST node line range (%d, %d) is not valid", \
29 node->lineno, node->end_lineno); \
32 if ((node->lineno < 0 && node->end_lineno != node->lineno) || \
33 (node
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/container/internal/
H A Dbtree_container.h154 // (i.e. not equal to end()). Return an iterator pointing to the node after
171 auto node = CommonAccess::Move<node_type>(get_allocator(), position.slot()); in extract() local
173 return node; in extract()
320 insert_return_type insert(node_type &&node) { in insert() argument
321 if (!node) return {this->end(), false, node_type()}; in insert()
323 this->tree_.insert_unique(params_type::key(CommonAccess::GetSlot(node)), in insert()
324 CommonAccess::GetSlot(node)); in insert()
326 CommonAccess::Destroy(&node); in insert()
329 return {res.first, false, std::move(node)}; in insert()
332 iterator insert(const_iterator hint, node_type &&node) { in insert() argument
606 insert(node_type &&node) insert() argument
614 insert(const_iterator hint, node_type &&node) insert() argument
[all...]
/third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_ops/apple/
H A DRewriteRowMajorMatrices.cpp85 // Determine if the node is an index node (array index or struct field selection). For the purposes
87 bool IsIndexNode(TIntermNode *node, TIntermNode *child) in IsIndexNode() argument
89 if (node->getAsSwizzleNode()) in IsIndexNode()
94 TIntermBinary *binaryNode = node->getAsBinaryNode(); in IsIndexNode()
107 TIntermTyped *node, in CopyToTempVariable()
110 TVariable *temp = CreateTempVariable(symbolTable, &node->getType()); in CopyToTempVariable()
111 TIntermDeclaration *tempDecl = CreateTempInitDeclarationNode(temp, node); in CopyToTempVariable()
130 TIntermNode *node, in GetIndex()
136 TIntermSwizzle *asSwizzle = node in GetIndex()
106 CopyToTempVariable(TSymbolTable *symbolTable, TIntermTyped *node, TIntermSequence *prependStatements) CopyToTempVariable() argument
129 GetIndex(TSymbolTable *symbolTable, TIntermNode *node, TIntermSequence *indices, TIntermSequence *prependStatements) GetIndex() argument
163 ReplicateIndexNode(TSymbolTable *symbolTable, TIntermNode *node, TIntermTyped *lhs, TIntermSequence *indices) ReplicateIndexNode() argument
183 GetIndexOp(TIntermNode *node) GetIndexOp() argument
483 convertInterfaceBlock(node); global() variable
558 convertInterfaceBlock(TIntermDeclaration *node) convertInterfaceBlock() argument
[all...]
/drivers/hdf_core/framework/tools/hc-gen/src/
H A Dmacro_gen.h32 std::string GenFullName(int32_t depth, const std::shared_ptr<AstObject> &node, const std::string &sep);
34 bool GenNodeForeach(int32_t depth, const std::shared_ptr<AstObject> &node);
49 bool GenArray(const std::string &arrName, uint32_t &arrSize, uint32_t type, const std::shared_ptr<AstObject> &node);
/drivers/peripheral/codec/hal/src/
H A Dcodec_component_capability_config.c22 int32_t InitDataNode(const struct DeviceResourceNode *node) in InitDataNode() argument
24 if (node == NULL) { in InitDataNode()
25 CODEC_LOGE("data node is null!"); in InitDataNode()
28 g_resourceNode = node; in InitDataNode()
/kernel/linux/linux-5.10/drivers/clk/mediatek/
H A Dclk-mt2712-img.c43 struct device_node *node = pdev->dev.of_node; in clk_mt2712_img_probe() local
47 mtk_clk_register_gates(node, img_clks, ARRAY_SIZE(img_clks), in clk_mt2712_img_probe()
50 r = of_clk_add_provider(node, of_clk_src_onecell_get, clk_data); in clk_mt2712_img_probe()
H A Dclk-mt2712-jpgdec.c39 struct device_node *node = pdev->dev.of_node; in clk_mt2712_jpgdec_probe() local
43 mtk_clk_register_gates(node, jpgdec_clks, ARRAY_SIZE(jpgdec_clks), in clk_mt2712_jpgdec_probe()
46 r = of_clk_add_provider(node, of_clk_src_onecell_get, clk_data); in clk_mt2712_jpgdec_probe()
H A Dclk-mt2712-mfg.c38 struct device_node *node = pdev->dev.of_node; in clk_mt2712_mfg_probe() local
42 mtk_clk_register_gates(node, mfg_clks, ARRAY_SIZE(mfg_clks), in clk_mt2712_mfg_probe()
45 r = of_clk_add_provider(node, of_clk_src_onecell_get, clk_data); in clk_mt2712_mfg_probe()
H A Dclk-mt8516-aud.c50 static void __init mtk_audsys_init(struct device_node *node) in mtk_audsys_init() argument
57 mtk_clk_register_gates(node, aud_clks, ARRAY_SIZE(aud_clks), clk_data); in mtk_audsys_init()
59 r = of_clk_add_provider(node, of_clk_src_onecell_get, clk_data); in mtk_audsys_init()
H A Dclk-mt8183-vdec.c44 struct device_node *node = pdev->dev.of_node; in clk_mt8183_vdec_probe() local
48 mtk_clk_register_gates(node, vdec_clks, ARRAY_SIZE(vdec_clks), in clk_mt8183_vdec_probe()
51 return of_clk_add_provider(node, of_clk_src_onecell_get, clk_data); in clk_mt8183_vdec_probe()
H A Dclk-mt8183-cam.c40 struct device_node *node = pdev->dev.of_node; in clk_mt8183_cam_probe() local
44 mtk_clk_register_gates(node, cam_clks, ARRAY_SIZE(cam_clks), in clk_mt8183_cam_probe()
47 return of_clk_add_provider(node, of_clk_src_onecell_get, clk_data); in clk_mt8183_cam_probe()

Completed in 25 milliseconds

1...<<111112113114115116117118119120>>...402