Home
last modified time | relevance | path

Searched refs:node (Results 976 - 1000 of 12430) sorted by relevance

1...<<31323334353637383940>>...498

/third_party/glslang/glslang/MachineIndependent/
H A DintermOut.cpp62 // Use this class to carry along data from node to node in
75 virtual bool visitBinary(TVisit, TIntermBinary* node);
76 virtual bool visitUnary(TVisit, TIntermUnary* node);
77 virtual bool visitAggregate(TVisit, TIntermAggregate* node);
78 virtual bool visitSelection(TVisit, TIntermSelection* node);
79 virtual void visitConstantUnion(TIntermConstantUnion* node);
80 virtual void visitSymbol(TIntermSymbol* node);
81 virtual bool visitLoop(TVisit, TIntermLoop* node);
82 virtual bool visitBranch(TVisit, TIntermBranch* node);
97 OutputTreeText(TInfoSink& infoSink, const TIntermNode* node, const int depth) OutputTreeText() argument
120 visitBinary(TVisit , TIntermBinary* node) visitBinary() argument
201 visitUnary(TVisit , TIntermUnary* node) visitUnary() argument
682 visitAggregate(TVisit , TIntermAggregate* node) visitAggregate() argument
1162 visitSelection(TVisit , TIntermSelection* node) visitSelection() argument
1259 OutputConstantUnion(TInfoSink& out, const TIntermTyped* node, const TConstUnionArray& constUnion, TOutputTraverser::EExtraOutput extra, int depth) OutputConstantUnion() argument
1365 visitConstantUnion(TIntermConstantUnion* node) visitConstantUnion() argument
1373 visitSymbol(TIntermSymbol* node) visitSymbol() argument
1388 visitLoop(TVisit , TIntermLoop* node) visitLoop() argument
1436 visitBranch(TVisit , TIntermBranch* node) visitBranch() argument
1467 visitSwitch(TVisit , TIntermSwitch* node) visitSwitch() argument
[all...]
/third_party/node/deps/cares/src/lib/
H A Dares_process.c76 ares__slist_node_t *node; in server_increment_failures() local
79 node = ares__slist_node_find(channel->servers, server); in server_increment_failures()
80 if (node == NULL) { in server_increment_failures()
84 ares__slist_node_reinsert(node); in server_increment_failures()
89 ares__slist_node_t *node; in server_set_good() local
96 node = ares__slist_node_find(channel->servers, server); in server_set_good()
97 if (node == NULL) { in server_set_good()
102 ares__slist_node_reinsert(node); in server_set_good()
213 ares__slist_node_t *node; in write_tcp_data() local
220 for (node in write_tcp_data()
388 ares__llist_node_t *node; channel_socket_list() local
485 ares__llist_node_t *node = NULL; read_packets() local
548 ares__slist_node_t *node = process_timeouts() local
789 ares__slist_node_t *node; ares__random_server() local
949 ares__llist_node_t *node = ares__llist_node_first(server->connections); ares__send_query() local
[all...]
/third_party/protobuf/src/google/protobuf/util/
H A Dfield_mask_util.cc182 // In the tree, each leaf node represents a field path.
194 // node), it means the tree already matches the given path so nothing will
195 // be added to the tree. If the path matches an existing non-leaf node in the
196 // tree, that non-leaf node will be turned into a leaf node with all its
197 // children removed because the path matches all the node's children.
203 // specified path. If the path matches an existing node in the tree, this node
265 // by all leaf nodes descended from "node" to mask.
266 void MergeToFieldMask(const std::string& prefix, const Node* node,
307 MergeToFieldMask(const std::string& prefix, const Node* node, FieldMask* out) MergeToFieldMask() argument
331 Node* node = &root_; AddPath() local
365 Node* node = &root_; RemovePath() local
416 const Node* node = &root_; IntersectPath() local
437 MergeLeafNodesToTree(const std::string& prefix, const Node* node, FieldMaskTree* out) MergeLeafNodesToTree() argument
450 MergeMessage(const Node* node, const Message& source, const FieldMaskUtil::MergeOptions& options, Message* destination) MergeMessage() argument
553 AddRequiredFieldPath(Node* node, const Descriptor* descriptor) AddRequiredFieldPath() argument
588 TrimMessage(const Node* node, Message* message) TrimMessage() argument
[all...]
/device/soc/rockchip/rk2206/hdf_driver/spi/
H A Dspi_driver.c76 static int32_t spidrv_readdrs(struct DeviceResourceNode *node, struct spi_params *params) in spidrv_readdrs() argument
81 if (node == NULL) { in spidrv_readdrs()
82 PRINT_ERR("%s: node is null\n", __func__); in spidrv_readdrs()
102 ret = iface->GetUint32(node, "bus", &params->bus, 0); in spidrv_readdrs()
108 ret = iface->GetUint32(node, "id", &params->id, 0); in spidrv_readdrs()
114 ret = iface->GetUint32(node, "func_mode", &params->func_mode, 0); in spidrv_readdrs()
120 ret = iface->GetUint32(node, "cs_gpio", &params->cs_gpio, 0); in spidrv_readdrs()
126 ret = iface->GetUint32(node, "cs_func", &params->cs_func, 0); in spidrv_readdrs()
132 ret = iface->GetUint32(node, "cs_type", &params->cs_type, 0); in spidrv_readdrs()
138 ret = iface->GetUint32(node, "cs_dr in spidrv_readdrs()
[all...]
/third_party/node/deps/v8/third_party/jinja2/
H A Dnodes.py3 some node tree helper functions used by the parser and compiler in order
41 """Raised if the node could not perform a requested action."""
82 def get_eval_context(node, ctx):
84 if node.environment is None:
87 "node must have an attached "
90 return EvalContext(node.environment)
101 - :class:`Template`: the outermost wrapper node
105 positional arguments, attributes as keyword arguments. Each node has
106 two attributes: `lineno` (the line number of the node) and `environment`.
156 """Iterates over all direct child nodes of the node
[all...]
/third_party/skia/third_party/externals/jinja2/
H A Dnodes.py3 some node tree helper functions used by the parser and compiler in order
41 """Raised if the node could not perform a requested action."""
82 def get_eval_context(node, ctx):
84 if node.environment is None:
87 "node must have an attached "
90 return EvalContext(node.environment)
101 - :class:`Template`: the outermost wrapper node
105 positional arguments, attributes as keyword arguments. Each node has
106 two attributes: `lineno` (the line number of the node) and `environment`.
156 """Iterates over all direct child nodes of the node
[all...]
/device/soc/hisilicon/hi3861v100/sdk_liteos/include/
H A Dhi_list.h41 * Initialize the head node. Note that this node is used only for management, not the data node entered by the user.
51 * Function description: Inserts a node as the first node in the list.
52 * CNcomment:功能描述：把node插入为list的第一个节点
54 __attribute__((always_inline)) static inline hi_void hi_list_head_insert(hi_list *node, hi_list *list) in hi_list_head_insert() argument
56 node->next = list->next; in hi_list_head_insert()
57 node->prev = list; in hi_list_head_insert()
58 list->next->prev = node; in hi_list_head_insert()
66 hi_list_tail_insert(hi_list *node, hi_list *list) hi_list_tail_insert() argument
75 hi_list_delete(hi_list *node) hi_list_delete() argument
[all...]
/kernel/linux/linux-5.10/arch/loongarch/mm/
H A Dkasan_init.c83 static phys_addr_t __init kasan_alloc_zeroed_page(int node) in kasan_alloc_zeroed_page() argument
87 MEMBLOCK_ALLOC_ACCESSIBLE, node); in kasan_alloc_zeroed_page()
91 static pte_t *kasan_pte_offset(pmd_t *pmdp, unsigned long addr, int node, in kasan_pte_offset() argument
97 : kasan_alloc_zeroed_page(node); in kasan_pte_offset()
113 static pmd_t *kasan_pmd_offset(pgd_t *pgdp, unsigned long addr, int node, in kasan_pmd_offset() argument
119 : kasan_alloc_zeroed_page(node); in kasan_pmd_offset()
130 unsigned long end, int node, bool early) in kasan_pte_populate()
133 pte_t *ptep = kasan_pte_offset(pmdp, addr, node, early); in kasan_pte_populate()
138 : kasan_alloc_zeroed_page(node); in kasan_pte_populate()
145 unsigned long end, int node, boo in kasan_pmd_populate()
129 kasan_pte_populate(pmd_t *pmdp, unsigned long addr, unsigned long end, int node, bool early) kasan_pte_populate() argument
144 kasan_pmd_populate(pgd_t *pgdp, unsigned long addr, unsigned long end, int node, bool early) kasan_pmd_populate() argument
156 kasan_pgd_populate(unsigned long addr, unsigned long end, int node, bool early) kasan_pgd_populate() argument
178 kasan_map_populate(unsigned long start, unsigned long end, int node) kasan_map_populate() argument
[all...]
/kernel/linux/linux-5.10/arch/powerpc/kexec/
H A Dcore.c245 static void __init export_crashk_values(struct device_node *node) in export_crashk_values() argument
249 of_remove_property(node, of_find_property(node, in export_crashk_values()
251 of_remove_property(node, of_find_property(node, in export_crashk_values()
256 of_add_property(node, &crashk_base_prop); in export_crashk_values()
258 of_add_property(node, &crashk_size_prop); in export_crashk_values()
266 of_update_property(node, &memory_limit_prop); in export_crashk_values()
271 struct device_node *node; in kexec_setup() local
273 node in kexec_setup()
[all...]
/kernel/linux/linux-5.10/drivers/acpi/acpica/
H A Devrgnini.c167 parent_node = region_obj->region.node->parent; in acpi_ev_pci_config_region_setup()
182 if (handler_obj->address_space.node == acpi_gbl_root_node) { in acpi_ev_pci_config_region_setup()
217 /* PCI root bridge not found, use namespace root node */ in acpi_ev_pci_config_region_setup()
219 pci_root_node = handler_obj->address_space.node; in acpi_ev_pci_config_region_setup()
244 pci_device_node = region_obj->region.node; in acpi_ev_pci_config_region_setup()
290 region_obj->region.node); in acpi_ev_pci_config_region_setup()
304 * PARAMETERS: node - Device node being examined
313 u8 acpi_ev_is_pci_root_bridge(struct acpi_namespace_node *node) in acpi_ev_is_pci_root_bridge() argument
323 status = acpi_ut_execute_HID(node, in acpi_ev_is_pci_root_bridge()
481 struct acpi_namespace_node *node; acpi_ev_initialize_region() local
[all...]
/kernel/linux/linux-6.6/arch/powerpc/kexec/
H A Dcore.c236 static void __init export_crashk_values(struct device_node *node) in export_crashk_values() argument
240 of_remove_property(node, of_find_property(node, in export_crashk_values()
242 of_remove_property(node, of_find_property(node, in export_crashk_values()
247 of_add_property(node, &crashk_base_prop); in export_crashk_values()
249 of_add_property(node, &crashk_size_prop); in export_crashk_values()
257 of_update_property(node, &memory_limit_prop); in export_crashk_values()
262 struct device_node *node; in kexec_setup() local
264 node in kexec_setup()
[all...]
/kernel/linux/linux-6.6/drivers/gpu/drm/omapdrm/dss/
H A Dbase.c45 static bool omapdss_device_is_registered(struct device_node *node) in omapdss_device_is_registered() argument
53 if (dssdev->dev->of_node == node) { in omapdss_device_is_registered()
76 struct omap_dss_device *omapdss_find_device_by_node(struct device_node *node) in omapdss_find_device_by_node() argument
81 if (dssdev->dev->of_node == node) in omapdss_find_device_by_node()
196 struct device_node *node; member
201 static bool omapdss_list_contains(const struct device_node *node) in omapdss_list_contains() argument
206 if (comp->node == node) in omapdss_list_contains()
213 static void omapdss_walk_device(struct device *dev, struct device_node *node, in omapdss_walk_device() argument
221 ret = of_property_read_string(node, "compatibl in omapdss_walk_device()
[all...]
/third_party/icu/icu4c/source/common/
H A Ducharstrieiterator.cpp66 // Pending linear-match node, append remaining UChars to str_. in Iterator()
111 // the branch node. in next()
128 // We only get here if we started in a pending linear-match node in next()
133 int32_t node=*pos++; in next() local
134 if(node>=kMinValueLead) { in next()
136 pos=skipNodeValue(pos, node); in next()
137 node&=kNodeTypeMask; in next()
141 UBool isFinal=(UBool)(node>>15); in next()
143 value_=readValue(pos, node&0x7fff); in next()
145 value_=readNodeValue(pos, node); in next()
199 int32_t node=*pos++; branchNext() local
[all...]
/third_party/node/deps/icu-small/source/common/
H A Ducharstrieiterator.cpp66 // Pending linear-match node, append remaining UChars to str_. in Iterator()
111 // the branch node. in next()
128 // We only get here if we started in a pending linear-match node in next()
133 int32_t node=*pos++; in next() local
134 if(node>=kMinValueLead) { in next()
136 pos=skipNodeValue(pos, node); in next()
137 node&=kNodeTypeMask; in next()
141 UBool isFinal=(UBool)(node>>15); in next()
143 value_=readValue(pos, node&0x7fff); in next()
145 value_=readNodeValue(pos, node); in next()
199 int32_t node=*pos++; branchNext() local
[all...]
/third_party/node/deps/v8/src/compiler/
H A Dloop-unrolling.cc44 // node, except Terminate nodes which will be deleted anyway. in UnrollLoop()
45 for (Node* node : copies) { in UnrollLoop()
46 if (IrOpcode::IsGraphTerminator(node->opcode()) && in UnrollLoop()
47 node->opcode() != IrOpcode::kTerminate && node->UseCount() == 0) { in UnrollLoop()
48 NodeProperties::MergeControlToEnd(graph, common, node); in UnrollLoop()
52 #define COPY(node, n) copier.map(node, n) in UnrollLoop()
55 for (Node* node : loop_node->uses()) { in UnrollLoop()
56 switch (node in UnrollLoop()
[all...]
/third_party/node/deps/v8/src/regexp/
H A Dregexp-dotprinter.cc20 void PrintNode(const char* label, RegExpNode* node);
21 void Visit(RegExpNode* node);
31 void DotPrinterImpl::PrintNode(const char* label, RegExpNode* node) { in PrintNode() argument
47 Visit(node); in PrintNode()
51 void DotPrinterImpl::Visit(RegExpNode* node) { in Visit() argument
52 if (node->info()->visited) return; in Visit()
53 node->info()->visited = true; in Visit()
54 node->Accept(this); in Visit()
107 os_ << " n" << that << " -> n" << alt.node(); in VisitChoice()
111 alt.node() in VisitChoice()
139 RegExpCharacterClass* node = elm.char_class(); VisitText() local
244 DotPrint(const char* label, RegExpNode* node) DotPrint() argument
[all...]
/third_party/rust/crates/bindgen/bindgen/ir/analysis/
H A Dmod.rs77 /// The type of node in our dependency graph.
103 /// Update the analysis for the given node.
110 fn constrain(&mut self, node: Self::Node) -> ConstrainResult; in constrain()
112 /// For each node `d` that depends on the given `node`'s current answer when
114 /// queue up in the worklist when `constrain(node)` reports updated
116 fn each_depending_on<F>(&self, node: Self::Node, f: F) in each_depending_on()
165 while let Some(node) = worklist.pop() { in analyze()
166 if let ConstrainResult::Changed = analysis.constrain(node) { in analyze()
167 analysis.each_depending_on(node, |needs_wor in analyze()
[all...]
/third_party/skia/third_party/externals/angle2/src/tests/deqp_support/
H A DtcuRandomOrderExecutor.cpp68 const bool isPkg = curEntry.node->getNodeType() == NODETYPE_PACKAGE; in pruneStack()
72 if (curEntry.node) // Just in case we are in in pruneStack()
76 if (curEntry.node->getNodeType() == NODETYPE_GROUP) in pruneStack()
77 m_inflater.leaveGroupNode(static_cast<TestCaseGroup *>(curEntry.node)); in pruneStack()
78 else if (curEntry.node->getNodeType() == NODETYPE_PACKAGE) in pruneStack()
79 m_inflater.leaveTestPackage(static_cast<TestPackage *>(curEntry.node)); in pruneStack()
83 curEntry.node = DE_NULL; in pruneStack()
96 for (vector<TestNode *>::const_iterator node = nodes.begin(); node != nodes.end(); ++node) in findNodeByName()
[all...]
/third_party/skia/third_party/externals/icu/source/common/
H A Ducharstrieiterator.cpp66 // Pending linear-match node, append remaining UChars to str_. in Iterator()
111 // the branch node. in next()
128 // We only get here if we started in a pending linear-match node in next()
133 int32_t node=*pos++; in next() local
134 if(node>=kMinValueLead) { in next()
136 pos=skipNodeValue(pos, node); in next()
137 node&=kNodeTypeMask; in next()
141 UBool isFinal=(UBool)(node>>15); in next()
143 value_=readValue(pos, node&0x7fff); in next()
145 value_=readNodeValue(pos, node); in next()
199 int32_t node=*pos++; branchNext() local
[all...]
/third_party/rust/crates/syn/codegen/src/
H A Deq.rs19 fn expand_impl_body(defs: &Definitions, node: &Node) -> TokenStream { in expand_impl_body()
20 let type_name = &node.ident; in expand_impl_body()
23 match &node.data { in expand_impl_body()
60 if node.ident == "Expr" { in expand_impl_body()
62 if !lookup::node(defs, ty).features.any.contains("derive") { in expand_impl_body()
111 fn expand_impl(defs: &Definitions, node: &Node) -> TokenStream { in expand_impl()
112 if node.ident == "Member" || node.ident == "Index" || node.ident == "Lifetime" { in expand_impl()
116 let ident = Ident::new(&node in expand_impl()
[all...]
/kernel/linux/linux-5.10/arch/powerpc/kernel/
H A Dsecure_boot.c24 struct device_node *node; in is_ppc_secureboot_enabled() local
28 node = get_ppc_fw_sb_node(); in is_ppc_secureboot_enabled()
29 enabled = of_property_read_bool(node, "os-secureboot-enforcing"); in is_ppc_secureboot_enabled()
30 of_node_put(node); in is_ppc_secureboot_enabled()
46 struct device_node *node; in is_ppc_trustedboot_enabled() local
50 node = get_ppc_fw_sb_node(); in is_ppc_trustedboot_enabled()
51 enabled = of_property_read_bool(node, "trusted-enabled"); in is_ppc_trustedboot_enabled()
52 of_node_put(node); in is_ppc_trustedboot_enabled()
/kernel/linux/linux-6.6/arch/powerpc/kernel/
H A Dsecure_boot.c24 struct device_node *node; in is_ppc_secureboot_enabled() local
28 node = get_ppc_fw_sb_node(); in is_ppc_secureboot_enabled()
29 enabled = of_property_read_bool(node, "os-secureboot-enforcing"); in is_ppc_secureboot_enabled()
30 of_node_put(node); in is_ppc_secureboot_enabled()
46 struct device_node *node; in is_ppc_trustedboot_enabled() local
50 node = get_ppc_fw_sb_node(); in is_ppc_trustedboot_enabled()
51 enabled = of_property_read_bool(node, "trusted-enabled"); in is_ppc_trustedboot_enabled()
52 of_node_put(node); in is_ppc_trustedboot_enabled()
/kernel/liteos_a/drivers/mtd/multi_partition/src/
H A Dmtd_shellcmd.c42 mtd_partition *node = NULL; in osShellCmdPartitionShow() local
67 LOS_DL_LIST_FOR_EACH_ENTRY(node, &param->partition_head->node_info, mtd_partition, node_info) { in osShellCmdPartitionShow()
69 fs, node->patitionnum, node->blockdriver_name, node->mountpoint_name, in osShellCmdPartitionShow()
70 (node->start_block * param->block_size), in osShellCmdPartitionShow()
71 ((node->end_block - node->start_block) + 1) * param->block_size); in osShellCmdPartitionShow()
/third_party/node/tools/inspector_protocol/jinja2/
H A Doptimizer.py23 def optimize(node, environment):
27 return optimizer.visit(node)
35 def fold(self, node, eval_ctx=None):
37 node = self.generic_visit(node)
39 return nodes.Const.from_untrusted(node.as_const(eval_ctx),
40 lineno=node.lineno,
43 return node
/third_party/skia/third_party/externals/sfntly/cpp/src/test/
H A Dtest_xml_utils.cc23 void InternalGetNodesWithName(const TiXmlNode* node, const std::string& name, in InternalGetNodesWithName() argument
25 if (node->ValueStr() == name) in InternalGetNodesWithName()
26 wanted_nodes->push_back(node); in InternalGetNodesWithName()
27 for (const TiXmlNode* child = node->FirstChild(); in InternalGetNodesWithName()
33 TiXmlNodeVector* GetNodesWithName(const TiXmlNode* node, in GetNodesWithName() argument
36 InternalGetNodesWithName(node, name, wanted_nodes); in GetNodesWithName()
40 const TiXmlAttribute* GetAttribute(const TiXmlNode* node, in GetAttribute() argument
42 for (const TiXmlAttribute* attribute = node->ToElement()->FirstAttribute(); in GetAttribute()

Completed in 16 milliseconds

1...<<31323334353637383940>>...498