/aosp_15_r20/external/guava/android/guava/src/com/google/common/graph/ |
H A D | StandardValueGraph.java | 105 public Set<N> adjacentNodes(N node) { in adjacentNodes() 110 public Set<N> predecessors(N node) { in predecessors() 115 public Set<N> successors(N node) { in successors() 120 public Set<EndpointPair<N>> incidentEdges(N node) { in incidentEdges() 162 private final GraphConnections<N, V> checkedConnections(N node) { in checkedConnections() 171 final boolean containsNode(@CheckForNull N node) { in containsNode()
|
H A D | GraphConnections.java | 53 V value(N node); in value() 56 void removePredecessor(N node); in removePredecessor() 64 V removeSuccessor(N node); in removeSuccessor() 70 void addPredecessor(N node, V value); in addPredecessor() 79 V addSuccessor(N node, V value); in addSuccessor()
|
/aosp_15_r20/external/mesa3d/src/gallium/drivers/lima/ir/pp/ |
H A D | node_to_instr.c | 28 static bool create_new_instr(ppir_block *block, ppir_node *node) in create_new_instr() 48 static bool ppir_do_node_to_instr_try_insert(ppir_block *block, ppir_node *node) in ppir_do_node_to_instr_try_insert() 90 static bool ppir_do_one_node_to_instr(ppir_block *block, ppir_node *node) in ppir_do_one_node_to_instr() 231 static unsigned int ppir_node_score(ppir_node *node) in ppir_node_score() 283 ppir_node *node = ppir_ready_list_pick_best(block, &ready_list); in ppir_do_node_to_instr() local 343 ppir_node *node = instr->slots[i]; in ppir_build_instr_dependency() local
|
/aosp_15_r20/external/swiftshader/third_party/SPIRV-Tools/source/util/ |
H A D | ilist.h | 138 inline iterator_template(T* node) { node_ = node; } in iterator_template() 272 void IntrusiveList<NodeType>::push_back(NodeType* node) { in push_back() 290 NodeType* node = sentinel_.NextNode(); in front() local 297 NodeType* node = sentinel_.PreviousNode(); in back() local 304 NodeType* node = sentinel_.NextNode(); in front() local 311 NodeType* node = sentinel_.PreviousNode(); in back() local
|
/aosp_15_r20/external/guava/android/guava-tests/test/com/google/common/graph/ |
H A D | DefaultNetworkImplementationsTest.java | 205 public Set<N> adjacentNodes(N node) { in adjacentNodes() 210 public Set<N> predecessors(N node) { in predecessors() 215 public Set<N> successors(N node) { in successors() 220 public Set<E> incidentEdges(N node) { in incidentEdges() 225 public Set<E> inEdges(N node) { in inEdges() 230 public Set<E> outEdges(N node) { in outEdges()
|
/aosp_15_r20/system/extras/ioshark/ |
H A D | ioshark_bench.h | 68 files_db_update_size(void *node, u_int64_t new_size) in files_db_update_size() 77 files_db_update_filename(void *node, char *filename) in files_db_update_filename() 83 files_db_get_fileno(void *node) in files_db_get_fileno() 89 files_db_get_fd(void *node) in files_db_get_fd() 95 files_db_get_filename(void *node) in files_db_get_filename() 101 files_db_readonly(void *node) in files_db_readonly()
|
/aosp_15_r20/external/guava/guava/src/com/google/common/graph/ |
H A D | StandardValueGraph.java | 105 public Set<N> adjacentNodes(N node) { in adjacentNodes() 110 public Set<N> predecessors(N node) { in predecessors() 115 public Set<N> successors(N node) { in successors() 120 public Set<EndpointPair<N>> incidentEdges(N node) { in incidentEdges() 162 private final GraphConnections<N, V> checkedConnections(N node) { in checkedConnections() 171 final boolean containsNode(@CheckForNull N node) { in containsNode()
|
H A D | GraphConnections.java | 53 V value(N node); in value() 56 void removePredecessor(N node); in removePredecessor() 64 V removeSuccessor(N node); in removeSuccessor() 70 void addPredecessor(N node, V value); in addPredecessor() 79 V addSuccessor(N node, V value); in addSuccessor()
|
/aosp_15_r20/external/deqp-deps/SPIRV-Tools/source/util/ |
D | ilist.h | 138 inline iterator_template(T* node) { node_ = node; } in iterator_template() 272 void IntrusiveList<NodeType>::push_back(NodeType* node) { in push_back() 290 NodeType* node = sentinel_.NextNode(); in front() local 297 NodeType* node = sentinel_.PreviousNode(); in back() local 304 NodeType* node = sentinel_.NextNode(); in front() local 311 NodeType* node = sentinel_.PreviousNode(); in back() local
|
/aosp_15_r20/external/guava/guava-tests/test/com/google/common/graph/ |
H A D | DefaultNetworkImplementationsTest.java | 205 public Set<N> adjacentNodes(N node) { in adjacentNodes() 210 public Set<N> predecessors(N node) { in predecessors() 215 public Set<N> successors(N node) { in successors() 220 public Set<E> incidentEdges(N node) { in incidentEdges() 225 public Set<E> inEdges(N node) { in inEdges() 230 public Set<E> outEdges(N node) { in outEdges()
|
/aosp_15_r20/external/chromium-trace/catapult/third_party/polymer/components/webcomponentsjs/ |
H A D | MutationObserver.js | 83 function wrapIfNeeded(node) { argument 105 observer.nodes_.forEach(function(node) { argument 159 this.nodes_.forEach(function(node) { argument 246 addListeners_: function(node) { argument 256 removeListeners_: function(node) { argument 263 addTransientObserver: function(node) { argument 274 transientObservedNodes.forEach(function(node) { argument
|
/aosp_15_r20/external/jemalloc_new/src/ |
H A D | rtree.c | 38 rtree_node_dalloc_impl(tsdn_t *tsdn, rtree_t *rtree, rtree_node_elm_t *node) { in rtree_node_dalloc_impl() 68 rtree_node_elm_t *node = in rtree_delete_subtree() local 109 rtree_node_elm_t *node = atomic_load_p(elmp, ATOMIC_RELAXED); in rtree_node_init() local 155 rtree_node_valid(rtree_node_elm_t *node) { in rtree_node_valid() 166 rtree_node_elm_t *node; in rtree_child_node_tryread() local 183 rtree_node_elm_t *node; in rtree_child_node_read() local 225 rtree_node_elm_t *node; in rtree_leaf_elm_lookup_hard() local
|
/aosp_15_r20/external/chromium-trace/catapult/third_party/polymer/components/shadycss/src/ |
H A D | scoping-shim.js | 303 _styleOwnerForNode(node) { argument 315 _isRootOwner(node) { argument 507 _styleInfoForNode(node) { argument 514 scopeNode(node, scope) { argument 521 unscopeNode(node, scope) { argument 528 scopeForNode(node) { argument 535 currentScopeForNode(node) { argument
|
/aosp_15_r20/external/tensorflow/tensorflow/core/grappler/optimizers/ |
H A D | function_optimizer_test.cc | 128 for (const NodeDef& node : output.node()) { in TEST_F() local 177 for (const NodeDef& node : output.node()) { in TEST_F() local 231 for (const NodeDef& node : output.node()) { in TEST_F() local 283 for (const NodeDef& node : output.node()) { in TEST_F() local 328 for (const NodeDef& node : output.node()) { in TEST_F() local 381 for (const NodeDef& node : output.node()) { in TEST_F() local 430 for (const NodeDef& node : output.node()) { in TEST_F() local 1312 return absl::c_count_if(optimized_graph.node(), [&](const NodeDef& node) { in TEST_F() 1375 return absl::c_count_if(optimized_graph.node(), [&](const NodeDef& node) { in TEST_F() 1458 for (const NodeDef& node : output.node()) { in TEST_F() local [all …]
|
H A D | constant_folding_test.cc | 93 const NodeDef& node = output.node(i); in SimpleNeutralElementTest() local 181 for (const auto& node : output.node()) { in MulConvPushDownTest() local 195 for (const auto& node : output.node()) { in MulConvPushDownTest() local 357 for (const auto& node : output.node()) { in TEST_F() local 430 for (const auto& node : output.node()) { in TEST_F() local 581 for (const auto& node : output.node()) { in TEST_F() local 842 const NodeDef& node = output.node(i); in TEST_F() local 1019 const NodeDef& node = output.node(i); in TEST_F() local 1109 const NodeDef& node = output.node(i); in TEST_F() local 1181 const NodeDef& node = output.node(i); in TEST_F() local [all …]
|
/aosp_15_r20/external/jsilver/src/com/google/clearsilver/jsilver/syntax/ |
H A D | TypeResolver.java | 78 public void caseAAddExpression(AAddExpression node) { in caseAAddExpression() 88 public void caseAEqExpression(AEqExpression node) { in caseAEqExpression() 98 public void caseANeExpression(ANeExpression node) { in caseANeExpression() 111 static boolean isNumeric(PExpression node) { in isNumeric() 127 static boolean isNumericFunction(PExpression node) { in isNumericFunction()
|
/aosp_15_r20/external/apache-xml/src/main/java/org/apache/xpath/objects/ |
H A D | XNodeSet.java | 163 int node = item(0); in num() local 176 int node = nextNode(); in numWithSideEffects() local 239 int node = item(0); in dispatchCharactersEvents() local 255 int node = item(0); in xstr() local 279 int node = item(0); in str() local 568 int node; in compare() local 587 int node; in compare() local 613 int node; in compare() local
|
/aosp_15_r20/external/tensorflow/tensorflow/core/grappler/utils/ |
H A D | canonicalizer_test.cc | 25 NodeDef node; in MakeNode() local 37 void Verify(const NodeDef& node) { in Verify() 53 NodeDef node = MakeNode("Div"); in TEST() local 59 NodeDef node = MakeNode("Mul"); in TEST() local 69 for (auto node : graph.node()) { in TEST() local
|
/aosp_15_r20/external/mesa3d/src/util/tests/ |
H A D | dag_test.cpp | 50 struct node: public dag_node { struct 54 struct node &operator>>(struct node &child) { in operator >>() argument 60 void add_edge(struct node &child, uintptr_t data) { in add_edge() argument 65 void add_edge_max_data(struct node &child, uintptr_t data) { in add_edge_max_data() argument 73 struct node *node = static_cast<struct node *>(dag_node); in output_cb() local
|
/aosp_15_r20/external/tensorflow/tensorflow/lite/ |
H A D | simple_planner.cc | 54 TfLiteStatus SimplePlanner::ResetAllocationsAfter(int node) { in ResetAllocationsAfter() 78 auto allocate = [this](int node, int tensor) -> TfLiteStatus { in PlanAllocations() 88 auto deallocate = [this](int node, int tensor) -> TfLiteStatus { in PlanAllocations() 130 const TfLiteNode& node = graph_info_->node(i); in PlanAllocations() local 142 const TfLiteNode& node = graph_info_->node(i); in PlanAllocations() local 178 const TfLiteNode& node = graph_info_->node(i); in ExecuteAllocations() local
|
H A D | interpreter_test.cc | 623 reg.prepare = [](TfLiteContext* context, TfLiteNode* node) { in GetPassthroughOpRegistration() 652 reg.invoke = [](TfLiteContext* context, TfLiteNode* node) { in GetPassthroughOpRegistration() 787 reg_copy.invoke = [](TfLiteContext* context, TfLiteNode* node) { in TEST() 801 reg_len.prepare = [](TfLiteContext* context, TfLiteNode* node) { in TEST() 808 reg_len.invoke = [](TfLiteContext* context, TfLiteNode* node) { in TEST() 860 reg.prepare = [](TfLiteContext* context, TfLiteNode* node) { in TEST() 868 reg.invoke = [](TfLiteContext* context, TfLiteNode* node) { in TEST() 979 registration.prepare = [](TfLiteContext* context, TfLiteNode* node) { in TEST() 986 TfLiteNode* node; in TEST() local 1122 registration.prepare = [](TfLiteContext* context, TfLiteNode* node) { in TEST() [all …]
|
/aosp_15_r20/external/tensorflow/tensorflow/python/autograph/pyct/ |
H A D | gast_util.py | 27 def _is_constant_gast_2(node): argument 32 def _is_constant_gast_3(node): argument 36 def is_literal(node): argument 49 def _is_ellipsis_gast_2(node): argument 53 def _is_ellipsis_gast_3(node): argument
|
/aosp_15_r20/frameworks/base/apct-tests/perftests/core/src/android/graphics/perftests/ |
H A D | RenderNodePerfTest.java | 36 final RenderNode node = RenderNode.create("benchmark", null); in testMeasureRenderNodeJniOverhead() local 47 RenderNode node = RenderNode.create("LinearLayout", null); in testIsValid() local 56 RenderNode node = RenderNode.create("LinearLayout", null); in testStartEnd() local 84 RenderNode node = RenderNode.create("LinearLayout", null); in testHasIdentityMatrix() local 93 RenderNode node = RenderNode.create("LinearLayout", null); in testSetOutline() local
|
/aosp_15_r20/external/libxml2/ |
H A D | xmlschemas.c | 311 #define IS_SCHEMA(node, type) \ argument 524 xmlNodePtr node; member 540 xmlNodePtr node; member 650 xmlNodePtr node; member 670 xmlNodePtr node; member 686 xmlNodePtr node; member 706 xmlNodePtr node; member 740 xmlNodePtr node; member 783 xmlNodePtr node; member 882 xmlNodePtr node; member [all …]
|
/aosp_15_r20/external/python/cpython2/Lib/lib2to3/fixes/ |
D | fix_idioms.py | 79 def match(self, node): argument 90 def transform(self, node, results): argument 100 def transform_isinstance(self, node, results): argument 112 def transform_while(self, node, results): argument 116 def transform_sort(self, node, results): argument
|