Home
last modified time | relevance | path

Searched defs:node (Results 426 – 450 of 8398) sorted by relevance

1...<<11121314151617181920>>...336

/aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r536225/include/lldb/Symbol/
DPostfixExpression.h70 static bool classof(const Node *node) { return node->GetKind() == BinaryOp; } in classof()
83 static bool classof(const Node *node) { in classof()
95 static bool classof(const Node *node) { return node->GetKind() == Integer; } in classof()
111 static bool classof(const Node *node) { return node->GetKind() == Register; } in classof()
125 static bool classof(const Node *node) { return node->GetKind() == Symbol; } in classof()
146 static bool classof(const Node *node) { return node->GetKind() == UnaryOp; } in classof()
176 ResultT Dispatch(Node *&node) { in Dispatch()
/aosp_15_r20/external/snakeyaml/src/main/java/org/yaml/snakeyaml/representer/
H A DBaseRepresenter.java63 Node node = representData(data); in represent() local
73 Node node = representedObjects.get(objectToRepresent); in representData() local
79 Node node = nullRepresenter.representData(null); in representData() local
83 Node node; in representData() local
114 Node node = new ScalarNode(tag, value, null, null, style); in representScalar() local
129 SequenceNode node = new SequenceNode(tag, value, flowStyle); in representSequence() local
151 MappingNode node = new MappingNode(tag, value, flowStyle); in representMapping() local
/aosp_15_r20/external/pytorch/torch/csrc/jit/codegen/onednn/
H A Doperator.h14 Operator(const Node* node, dnnl::graph::op::kind kind) in Operator()
107 static float ScalarToFloat(const Node* node, size_t offset) { in ScalarToFloat()
111 static std::vector<int64_t> Ints(const Node* node, size_t offset) { in Ints()
115 static int64_t Int(const Node* node, size_t offset) { in Int()
119 static float Float(const Node* node, size_t offset) { in Float()
123 static bool Bool(const Node* node, size_t offset) { in Bool()
127 static uint64_t getId(const Node* node) { in getId()
/aosp_15_r20/libcore/luni/src/main/java/javax/xml/transform/dom/
H A DDOMResult.java71 public DOMResult(Node node) { in DOMResult()
91 public DOMResult(Node node, String systemId) { in DOMResult()
126 public DOMResult(Node node, Node nextSibling) { in DOMResult()
175 public DOMResult(Node node, Node nextSibling, String systemId) { in DOMResult()
216 public void setNode(Node node) { in setNode()
337 private Node node = null; field in DOMResult
/aosp_15_r20/external/tinycompress/
H A Dsnd_utils.c44 int snd_utils_get_int(struct snd_node *node, const char *prop, int *val) in snd_utils_get_int()
52 int snd_utils_get_str(struct snd_node *node, const char *prop, char **val) in snd_utils_get_str()
60 void snd_utils_put_dev_node(struct snd_node *node) in snd_utils_put_dev_node()
74 enum snd_node_type snd_utils_get_node_type(struct snd_node *node) in snd_utils_get_node_type()
87 static int snd_utils_resolve_symbols(struct snd_node *node) in snd_utils_resolve_symbols()
113 struct snd_node *node; in snd_utils_get_dev_node() local
/aosp_15_r20/external/icing/icing/scoring/advanced_scoring/
H A Dscoring-visitor.cc32 void ScoringVisitor::VisitString(const StringNode* node) { in VisitString()
36 void ScoringVisitor::VisitText(const TextNode* node) { in VisitText()
41 void ScoringVisitor::VisitMember(const MemberNode* node) { in VisitMember()
82 void ScoringVisitor::VisitFunctionHelper(const FunctionNode* node, in VisitFunctionHelper()
191 void ScoringVisitor::VisitUnaryOperator(const UnaryOperatorNode* node) { in VisitUnaryOperator()
215 void ScoringVisitor::VisitNaryOperator(const NaryOperatorNode* node) { in VisitNaryOperator()
/aosp_15_r20/external/google-java-format/core/src/main/java/com/google/googlejavaformat/java/java21/
H A DJava21InputAstVisitor.java40 protected ExpressionTree getGuard(final CaseTree node) { in getGuard()
45 public Void visitDefaultCaseLabel(DefaultCaseLabelTree node, Void unused) { in visitDefaultCaseLabel()
51 public Void visitPatternCaseLabel(PatternCaseLabelTree node, Void unused) { in visitPatternCaseLabel()
57 public Void visitConstantCaseLabel(ConstantCaseLabelTree node, Void aVoid) { in visitConstantCaseLabel()
63 public Void visitDeconstructionPattern(DeconstructionPatternTree node, Void unused) { in visitDeconstructionPattern()
85 public Void visitStringTemplate(StringTemplateTree node, Void aVoid) { in visitStringTemplate()
/aosp_15_r20/external/tinyalsa/
H A Dsnd_utils.c44 int snd_utils_get_int(struct snd_node *node, const char *prop, int *val) in snd_utils_get_int()
52 int snd_utils_get_str(struct snd_node *node, const char *prop, char **val) in snd_utils_get_str()
60 void snd_utils_put_dev_node(struct snd_node *node) in snd_utils_put_dev_node()
74 enum snd_node_type snd_utils_get_node_type(struct snd_node *node) in snd_utils_get_node_type()
87 static int snd_utils_resolve_symbols(struct snd_node *node) in snd_utils_resolve_symbols()
113 struct snd_node *node; in snd_utils_get_dev_node() local
/aosp_15_r20/external/icing/icing/query/advanced_query_parser/
H A Dabstract-syntax-tree-test-utils.h62 void VisitString(const StringNode* node) override { in VisitString()
65 void VisitText(const TextNode* node) override { in VisitText()
68 void VisitMember(const MemberNode* node) override { in VisitMember()
77 void VisitFunction(const FunctionNode* node) override { in VisitFunction()
83 void VisitUnaryOperator(const UnaryOperatorNode* node) override { in VisitUnaryOperator()
87 void VisitNaryOperator(const NaryOperatorNode* node) override { in VisitNaryOperator()
/aosp_15_r20/external/cronet/third_party/libxml/src/
H A Dxmlreader.c110 xmlNodePtr node; /* current node */ member
832 xmlNodePtr node = reader->node; in xmlTextReaderValidatePush() local
940 xmlNodePtr node = reader->node; in xmlTextReaderValidatePop() local
1010 xmlNodePtr node = reader->node; in xmlTextReaderValidateEntity() local
1163 xmlTextReaderCollectSiblings(xmlNodePtr node) in xmlTextReaderCollectSiblings()
1516 xmlNodePtr node = reader->node; in xmlTextReaderRead() local
1642 xmlNodePtr node, cur_node; in xmlTextReaderReadInnerXml() local
1694 xmlNodePtr node; in xmlTextReaderReadOuterXml() local
1739 xmlNodePtr node; in xmlTextReaderReadString() local
2664 xmlNodePtr node; in xmlTextReaderMoveToAttributeNs() local
[all …]
/aosp_15_r20/external/apache-commons-math/src/main/java/org/apache/commons/math3/geometry/partitioning/
H A DRegionFactory.java60 BSPTree<S> node = region.getTree(false); in buildConvex() local
175 private BSPTree<S> recurseComplement(final BSPTree<S> node) { in recurseComplement()
205 private BSPTree<S> recurseComplement(final BSPTree<S> node, in recurseComplement()
322 public BSPTree<S> fixNode(final BSPTree<S> node) { in fixNode()
337 public Order visitOrder(final BSPTree<S> node) { in visitOrder()
342 public void visitInternalNode(final BSPTree<S> node) { in visitInternalNode()
347 public void visitLeafNode(final BSPTree<S> node) { in visitLeafNode()
366 public BSPTree<S> fixNode(final BSPTree<S> node) { in fixNode()
H A DAbstractRegion.java167 BSPTree<S> node = tree; in AbstractRegion() local
198 private void insertCuts(final BSPTree<S> node, final Collection<SubHyperplane<S>> boundary) { in insertCuts()
254 public boolean isEmpty(final BSPTree<S> node) { in isEmpty()
276 public boolean isFull(final BSPTree<S> node) { in isFull()
328 protected Location checkPoint(final BSPTree<S> node, final Vector<S> point) { in checkPoint()
339 protected Location checkPoint(final BSPTree<S> node, final Point<S> point) { in checkPoint()
432 … private SubHyperplane<S> recurseIntersection(final BSPTree<S> node, final SubHyperplane<S> sub) { in recurseIntersection()
509 private BSPTree<S> recurseTransform(final BSPTree<S> node, final Transform<S, T> transform, in recurseTransform()
/aosp_15_r20/external/mesa3d/src/broadcom/compiler/
H A Dvir_register_allocate.c85 node_to_temp(struct v3d_compile *c, uint32_t node) in node_to_temp()
405 int node = ra_add_node(c->g, choose_reg_class(c, class_bits)); in add_node() local
469 int node = add_node(c, i, temp_class); in v3d_setup_spill_base() local
953 unsigned int node, in v3d_ra_select_rf()
1233 uint32_t node = temp_to_node(c, inst->dst.index); in update_graph_and_reg_classes_for_inst() local
1274 int node = temp_to_node(c, _i->dst.index); in update_graph_and_reg_classes_for_inst() local
1278 int node = temp_to_node(c, _i->src[0].index); in update_graph_and_reg_classes_for_inst() local
1282 int node = temp_to_node(c, _i->src[1].index); in update_graph_and_reg_classes_for_inst() local
1353 int node = temp_to_node(c, inst->src[i].index); in flag_program_end_nodes() local
1361 int node = temp_to_node(c, inst->src[i].index); in flag_program_end_nodes() local
[all …]
/aosp_15_r20/packages/providers/MediaProvider/jni/
Dnode_test.cpp21 uint32_t GetRefCount(node* node) { return node->refcount_; } in GetRefCount() argument
27 static void destroy(node* node) { delete node; } in destroy() argument
29 static void acquire(node* node) { node->Acquire(); } in acquire() argument
39 static class node* ForChild(class node* node, const std::string& name, in ForChild()
49 unique_node_ptr node = CreateNode(nullptr, "/path"); in TEST_F() local
70 node* node = node::Create(nullptr, "/path", "", true, 0, 0, &lock_, 0, &tracker_); in TEST_F() local
349 unique_node_ptr node = CreateNode(nullptr, "/path"); in TEST_F() local
370 unique_node_ptr node = CreateNode(nullptr, "/path"); in TEST_F() local
386 unique_node_ptr node = CreateNode(nullptr, "/path"); in TEST_F() local
400 unique_node_ptr node = CreateNode(nullptr, "/path"); in TEST_F() local
[all …]
/aosp_15_r20/external/mesa3d/src/util/
H A Ddag.c108 dag_prune_head(struct dag *dag, struct dag_node *node) in dag_prune_head()
124 dag_init_node(struct dag *dag, struct dag_node *node) in dag_init_node()
137 dag_traverse_bottom_up_node(struct dag_node *node, in dag_traverse_bottom_up_node()
194 dag_traverse_bottom_up(struct dag *dag, void (*cb)(struct dag_node *node, in dag_traverse_bottom_up()
232 dag_validate_node(struct dag_node *node, in dag_validate_node()
242 struct dag_node *node = *nodep; in dag_validate_node() local
266 dag_validate(struct dag *dag, void (*cb)(const struct dag_node *node, in dag_validate()
/aosp_15_r20/external/tensorflow/tensorflow/core/grappler/optimizers/
H A Dcommon_subgraph_elimination.cc62 NodeDef* FindOrAddRepresentative(NodeDef* node) { in FindOrAddRepresentative()
74 void RemoveRepresentative(NodeDef* node) { in RemoveRepresentative()
97 uint64 UniqueNodes::ComputeSignature(const NodeDef& node) { in ComputeSignature()
192 const auto is_continue_traversal = [&](const NodeDef* node) -> bool { in DedupComputations()
198 DfsCallbacks::PreOrder([&](const NodeDef* node) { in DedupComputations()
206 const NodeDef& node = optimized_graph->node(i); in DedupComputations() local
221 NodeDef* node = optimized_graph->mutable_node(i); in DedupComputations() local
H A Dimplementation_selector_test.cc77 for (const NodeDef& node : output.node()) { in TEST_F() local
101 for (const NodeDef& node : output.node()) { in TEST_F() local
128 for (const NodeDef& node : output.node()) { in TEST_F() local
157 for (const NodeDef& node : output.node()) { in TEST_F() local
181 for (const NodeDef& node : output.node()) { in TEST_F() local
226 for (const NodeDef& node : output.node()) { in TEST_F() local
282 for (const NodeDef& node : output.node()) { in TEST_F() local
330 for (const NodeDef& node : output.node()) { in TEST_F() local
368 for (const NodeDef& node : output.node()) { in TEST_F() local
/aosp_15_r20/external/sdv/vsomeip/third_party/boost/intrusive/include/boost/intrusive/detail/
Dbstree_algorithms_base.hpp33 typedef typename NodeTraits::node node; typedef in boost::intrusive::bstree_algorithms_base
45 static node_ptr next_node(const node_ptr & node) in next_node()
69 static node_ptr prev_node(const node_ptr & node) in prev_node()
95 static node_ptr minimum(node_ptr node) in minimum()
112 static node_ptr maximum(node_ptr node) in maximum()
153 static node_ptr get_header(const const_node_ptr & node) in get_header()
/aosp_15_r20/external/tensorflow/tensorflow/core/grappler/
H A Dutils_test.cc62 NodeDef node; in CreateConcatOffsetNode() local
87 NodeDef node; in CreateDequeueNode() local
126 NodeDef node; in CreateFusedBatchNormNode() local
220 NodeDef node; in TEST_F() local
254 auto is_neg = [&](const NodeDef& node) { return node.op() == "Neg"; }; in TEST_F()
262 auto is_neg_and_non_branching = [&](const NodeDef& node) { in TEST_F()
421 NodeDef node; in TEST() local
452 NodeDef node; in TEST() local
562 NodeDef node; in TEST_F() local
580 NodeDef node; in TEST_F() local
/aosp_15_r20/external/angle/src/compiler/translator/hlsl/
H A DShaderStorageBlockOutputHLSL.cpp42 void GetBlockLayoutInfo(TIntermTyped *node, in GetBlockLayoutInfo()
323 void ShaderStorageBlockOutputHLSL::outputStoreFunctionCallPrefix(TIntermTyped *node) in outputStoreFunctionCallPrefix()
328 void ShaderStorageBlockOutputHLSL::outputLoadFunctionCall(TIntermTyped *node) in outputLoadFunctionCall()
334 void ShaderStorageBlockOutputHLSL::outputLengthFunctionCall(TIntermTyped *node) in outputLengthFunctionCall()
340 void ShaderStorageBlockOutputHLSL::outputAtomicMemoryFunctionCallPrefix(TIntermTyped *node, in outputAtomicMemoryFunctionCallPrefix()
378 int ShaderStorageBlockOutputHLSL::getMatrixStride(TIntermTyped *node, in getMatrixStride()
409 void ShaderStorageBlockOutputHLSL::collectShaderStorageBlocks(TIntermTyped *node) in collectShaderStorageBlocks()
454 void ShaderStorageBlockOutputHLSL::traverseSSBOAccess(TIntermTyped *node, SSBOMethod method) in traverseSSBOAccess()
531 TIntermTyped *node, in traverseNode()
613 TIntermBinary *node, in writeEOpIndexDirectOrIndirectOutput()
/aosp_15_r20/external/tinyalsa_new/src/
H A Dsnd_card_plugin.c44 int snd_utils_get_int(struct snd_node *node, const char *prop, int *val) in snd_utils_get_int()
52 int snd_utils_get_str(struct snd_node *node, const char *prop, char **val) in snd_utils_get_str()
60 void snd_utils_close_dev_node(struct snd_node *node) in snd_utils_close_dev_node()
74 enum snd_node_type snd_utils_get_node_type(struct snd_node *node) in snd_utils_get_node_type()
86 static int snd_utils_resolve_symbols(struct snd_node *node) in snd_utils_resolve_symbols()
98 struct snd_node *node; in snd_utils_open_dev_node() local
/aosp_15_r20/external/guava/android/guava/src/com/google/common/graph/
H A DForwardingValueGraph.java69 public Set<N> adjacentNodes(N node) { in adjacentNodes()
74 public Set<N> predecessors(N node) { in predecessors()
79 public Set<N> successors(N node) { in successors()
84 public int degree(N node) { in degree()
89 public int inDegree(N node) { in inDegree()
94 public int outDegree(N node) { in outDegree()
/aosp_15_r20/external/selinux/libselinux/src/
H A Dstringrep.c34 struct discover_class_node *node = discover_class_cache; in get_class_cache_entry_name() local
43 struct discover_class_node *node = discover_class_cache; in get_class_cache_entry_value() local
59 struct discover_class_node *node; in discover_class() local
198 struct discover_class_node *node; in string_to_security_class() local
236 struct discover_class_node *node; in string_to_av_perm() local
253 struct discover_class_node *node; in security_class_to_string() local
267 struct discover_class_node *node; in security_av_perm_to_string() local
/aosp_15_r20/external/autotest/utils/
H A Drun_pylint.py171 def visit_importfrom(self, node): argument
180 def visit_module(self, node): argument
200 def visit_importfrom(self, node): argument
205 def visit_expr(self, node): argument
227 def visit_module(self, node): argument
236 def visit_functiondef(self, node): argument
451 def _is_test_case_method(node): argument
/aosp_15_r20/external/mesa3d/src/gallium/drivers/lima/ir/gp/
H A Dgpir.h198 gpir_node node; member
208 gpir_node node; member
218 gpir_node node; member
228 gpir_node node; member
383 gpir_node node; member
441 #define gpir_node_foreach_succ(node, dep) \ argument
443 #define gpir_node_foreach_succ_safe(node, dep) \ argument
445 #define gpir_node_foreach_pred(node, dep) \ argument
447 #define gpir_node_foreach_pred_safe(node, dep) \ argument
450 static inline bool gpir_node_is_root(gpir_node *node) in gpir_node_is_root()
[all …]

1...<<11121314151617181920>>...336