| /aosp_15_r20/external/aws-sdk-java-v2/core/imds/src/test/java/software/amazon/awssdk/imds/internal/unmarshall/document/ |
| H A D | DocumentUnmarshallerTest.java | 36 JsonNode node = JsonNode.parser().parse("100"); in testDocumentFromNumberNode() local
43 JsonNode node = JsonNode.parser().parse("true"); in testDocumentFromBoolean() local
49 JsonNode node = JsonNode.parser().parse("\"100.00\""); in testDocumentFromString() local
55 JsonNode node = JsonNode.parser().parse("null"); in testDocumentFromNull() local
67 …JsonNode node = JsonNode.parser().parse("{\"firstKey\": \"firstValue\", \"secondKey\": \"secondVal… in testDocumentFromObjectNode() local
79 JsonNode node = JsonNode.parser().parse("[\"One\", 10, true, null]"); in testDocumentFromArrayNode() local
|
| /aosp_15_r20/external/openscreen/third_party/abseil/src/absl/strings/ |
| H A D | cord.cc | 179 static inline bool IsRootBalanced(CordRep* node) { in IsRootBalanced()
198 static inline CordRep* VerifyTree(CordRep* node) { in VerifyTree()
892 static CordRep* RemovePrefixFrom(CordRep* node, size_t n) { in RemovePrefixFrom()
933 static CordRep* RemoveSuffixFrom(CordRep* node, size_t n) { in RemoveSuffixFrom()
1009 CordRep* node; // nullptr means concat last 2 results. member
1014 static CordRep* NewSubRange(CordRep* node, size_t pos, size_t n) { in NewSubRange()
1099 CordRep* node = pending.back(); in Build() local
1129 for (auto* node : trees_) { in ConcatNodes() local
1141 CordRep* AppendNode(CordRep* node, CordRep* sum) { in AppendNode()
1145 CordRep* PrependNode(CordRep* node, CordRep* sum) { in PrependNode()
[all …]
|
| /aosp_15_r20/system/libufdt/include/ |
| H A D | ufdt_types.h | 23 #define for_each(it, node) \ argument
28 #define for_each_child(it, node) \ argument
33 #define for_each_prop(it, node) \ argument
36 #define for_each_node(it, node) \ argument
45 #define ufdt_node_name(node) \ argument
50 #define ufdt_node_tag(node) \ argument
71 struct ufdt_node *node; member
|
| /aosp_15_r20/external/tensorflow/tensorflow/core/grappler/optimizers/ |
| H A D | memory_optimizer.cc | 95 for (const auto& node : graph->node()) { in FindCandidateRecomputeNodes() local
216 [&unpruned_recompute_nodes](const NodeDef& node) { in GetOpGroupsToRecompute()
463 [&recomputation_targets_name_scope](const NodeDef& node) { in RecomputationRewritingPass()
485 [&cheap_to_recompute_ops, &feeds, &is_target](const NodeDef& node) { in RecomputationRewritingPass()
494 [&feeds, &is_target](const NodeDef& node) { in RecomputationRewritingPass()
632 const NodeDef* node = view.GetNode(node_name); in SchedulingPass() local
743 Status BuildSwapPair(NodeDef* node, int input_to_swap, in BuildSwapPair()
806 const NodeDef* node, const SwapInfo& swap_info, in FindSwapInTrigger()
887 const NodeDef& node = *output.node; in IsSwappable() local
924 const NodeDef* node, int input_id, const MutableGraphView& view, in FindSwapOutTrigger()
[all …]
|
| /aosp_15_r20/external/tensorflow/tensorflow/compiler/tf2tensorrt/segment/ |
| H A D | segment.cc | 152 SimpleNode::SimpleNode(const Node* node, const int id) : node_(node), id_(id) { in SimpleNode()
255 const SimpleNode* node; in StableDFS() member
290 for (const SimpleNode* node : nodes_sorted) { in StableDFS() local
332 for (const SimpleNode* node : dst->in_nodes()) { in CanContractEdge() local
472 const Node* node, const std::vector<OpInfo::TensorProperties>& all_inputs) { in GetInputsToDeterminateBatchSize()
516 const grappler::GraphProperties* graph_properties, const Node* node) { in OperationCanBeTranslatedToImplicitBatch()
565 const grappler::GraphProperties* graph_properties, const Node* node) { in OperationHasDynamicNonBatchDimension()
640 const grappler::GraphProperties* graph_properties, const Node* node, in GetClusterBatchSizeForNode()
674 SimpleNode* node, in AddSegmentForNode()
894 SimpleNode* node = graph->FindNodeId(i); in SegmentGraph() local
[all …]
|
| /aosp_15_r20/external/mesa3d/src/asahi/compiler/ |
| H A D | agx_spill.c | 77 set_next_use(struct next_uses *nu, unsigned node, dist_t dist) in set_next_use()
90 search_next_uses(const struct next_uses *nu, unsigned node) in search_next_uses()
100 #define foreach_next_use(nu, node, dist) \ argument
211 node_size(struct spill_ctx *ctx, unsigned node) in node_size()
270 reconstruct_index(struct spill_ctx *ctx, unsigned node) in reconstruct_index()
288 remat_to(agx_builder *b, agx_index dst, struct spill_ctx *ctx, unsigned node) in remat_to()
304 insert_spill(agx_builder *b, struct spill_ctx *ctx, unsigned node) in insert_spill()
314 unsigned node) in insert_reload()
359 unsigned node; member
507 unsigned node = I->src[s].value; in insert_coupling_code() local
[all …]
|
| /aosp_15_r20/external/kmod/libkmod/ |
| H A D | libkmod-index.c | 238 struct index_node_f *node; in index_read() local
300 static void index_close(struct index_node_f *node) in index_close()
365 static void index_dump_node(struct index_node_f *node, struct strbuf *buf, in index_dump_node()
410 static char *index_search__node(struct index_node_f *node, const char *key, int i) in index_search__node()
469 static void index_searchwild__allvalues(struct index_node_f *node, in index_searchwild__allvalues()
484 static void index_searchwild__all(struct index_node_f *node, int j, in index_searchwild__all()
524 static void index_searchwild__node(struct index_node_f *node, in index_searchwild__node()
671 struct index_mm_node *node; in index_mm_read_node() local
737 static void index_mm_free_node(struct index_mm_node *node) in index_mm_free_node()
844 static void index_mm_dump_node(struct index_mm_node *node, struct strbuf *buf, in index_mm_dump_node()
[all …]
|
| H A D | libkmod-list.c | 30 static inline struct list_node *list_node_init(struct list_node *node) in list_node_init()
39 struct list_node *node) in list_node_append()
52 static inline struct list_node *list_node_remove(struct list_node *node) in list_node_remove()
64 struct list_node *node) in list_node_insert_after()
78 struct list_node *node) in list_node_insert_before()
191 struct list_node *node; in kmod_list_remove() local
209 struct list_node *node; in kmod_list_remove_data() local
|
| /aosp_15_r20/out/soong/.intermediates/libcore/core_oj_api_files/gen/22/libcore/ojluni/src/main/java/java/util/stream/ |
| D | Nodes.java | 147 static <T> Node<T> node(T[] array) { in node() method in Nodes
160 static <T> Node<T> node(Collection<T> c) { in node() method in Nodes
200 static Node.OfInt node(int[] array) { in node() method in Nodes
237 static Node.OfLong node(final long[] array) { in node() method in Nodes
274 static Node.OfDouble node(final double[] array) { in node() method in Nodes
336 Node<P_OUT> node = new CollectorTask.OfRef<>(helper, generator, spliterator).invoke(); in collect() local
374 Node.OfInt node = new CollectorTask.OfInt<>(helper, spliterator).invoke(); in collectInt() local
412 Node.OfLong node = new CollectorTask.OfLong<>(helper, spliterator).invoke(); in collectLong() local
450 Node.OfDouble node = new CollectorTask.OfDouble<>(helper, spliterator).invoke(); in collectDouble() local
472 public static <T> Node<T> flatten(Node<T> node, IntFunction<T[]> generator) { in flatten()
[all …]
|
| /aosp_15_r20/out/soong/.intermediates/libcore/core_oj_api_files/gen/gensrcs/libcore/ojluni/src/main/java/java/util/stream/ |
| D | Nodes.java | 147 static <T> Node<T> node(T[] array) { in node() method in Nodes
160 static <T> Node<T> node(Collection<T> c) { in node() method in Nodes
200 static Node.OfInt node(int[] array) { in node() method in Nodes
237 static Node.OfLong node(final long[] array) { in node() method in Nodes
274 static Node.OfDouble node(final double[] array) { in node() method in Nodes
336 Node<P_OUT> node = new CollectorTask.OfRef<>(helper, generator, spliterator).invoke(); in collect() local
374 Node.OfInt node = new CollectorTask.OfInt<>(helper, spliterator).invoke(); in collectInt() local
412 Node.OfLong node = new CollectorTask.OfLong<>(helper, spliterator).invoke(); in collectLong() local
450 Node.OfDouble node = new CollectorTask.OfDouble<>(helper, spliterator).invoke(); in collectDouble() local
472 public static <T> Node<T> flatten(Node<T> node, IntFunction<T[]> generator) { in flatten()
[all …]
|
| /aosp_15_r20/libcore/ojluni/src/main/java/java/util/stream/ |
| H A D | Nodes.java | 147 static <T> Node<T> node(T[] array) { in node() method in Nodes
160 static <T> Node<T> node(Collection<T> c) { in node() method in Nodes
200 static Node.OfInt node(int[] array) { in node() method in Nodes
237 static Node.OfLong node(final long[] array) { in node() method in Nodes
274 static Node.OfDouble node(final double[] array) { in node() method in Nodes
336 Node<P_OUT> node = new CollectorTask.OfRef<>(helper, generator, spliterator).invoke(); in collect() local
374 Node.OfInt node = new CollectorTask.OfInt<>(helper, spliterator).invoke(); in collectInt() local
412 Node.OfLong node = new CollectorTask.OfLong<>(helper, spliterator).invoke(); in collectLong() local
450 Node.OfDouble node = new CollectorTask.OfDouble<>(helper, spliterator).invoke(); in collectDouble() local
472 public static <T> Node<T> flatten(Node<T> node, IntFunction<T[]> generator) { in flatten()
[all …]
|
| /aosp_15_r20/external/apache-commons-math/src/main/java/org/apache/commons/math3/geometry/euclidean/twod/ |
| H A D | PolygonsSet.java | 322 final BSPTree<Euclidean2D> node, in insertEdges()
524 private BSPTree<Euclidean2D> node; field in PolygonsSet.Edge
568 public void setNode(final BSPTree<Euclidean2D> node) { in setNode()
789 final BSPTree<Euclidean2D> node = segment.getNode(); in naturalFollowerConnections() local
949 private final BSPTree<Euclidean2D> node; field in PolygonsSet.ConnectableSegment
975 final BSPTree<Euclidean2D> node, in ConnectableSegment()
1070 public Order visitOrder(final BSPTree<Euclidean2D> node) { in visitOrder()
1075 public void visitInternalNode(final BSPTree<Euclidean2D> node) { in visitInternalNode()
1080 addContribution(attribute.getPlusOutside(), node, splitters, false); in visitInternalNode() local
1083 addContribution(attribute.getPlusInside(), node, splitters, true); in visitInternalNode() local
[all …]
|
| /aosp_15_r20/external/tensorflow/tensorflow/core/tfrt/utils/ |
| H A D | tfrt_graph_execution_state.cc | 217 NodeDef CreateNewIdentityNode(const NodeDef& node, in CreateNewIdentityNode()
320 for (const Node* node : graph->nodes()) { in IsTpuGraph() local
477 for (const Node* node : result.graph->nodes()) { in CreateOptimizedGraph() local
515 const NodeDef* node = name_to_node.at(node_name); in FindLoopCondFromExitNode() local
533 const NodeDef* node = name_to_node.at(node_name); in FindLoopCondFromExitNode() local
583 const NodeDef* node = name_to_node[grappler::NodeName(tensor_name)]; in PruneGraphDef() local
594 const NodeDef* node = name_to_node[grappler::NodeName(tensor_name)]; in PruneGraphDef() local
608 NodeDef* node = name_to_node[grappler::NodeName(tensor_name)]; in PruneGraphDef() local
631 const NodeDef* node = queue.back(); in PruneGraphDef() local
657 for (auto& node : keep) { in PruneGraphDef() local
[all …]
|
| /aosp_15_r20/external/tensorflow/tensorflow/compiler/xla/python/ |
| H A D | pytree.cc | 136 Node node; in FlattenIntoImpl() local
243 for (const Node& node : traversal_) { in UnflattenImpl() local
295 /*static*/ py::object PyTreeDef::MakeNode(const PyTreeDef::Node& node, in MakeNode()
359 const Node& node = *it; in FlattenUpTo() local
497 for (const Node& node : traversal_) { in Walk() local
545 const Node& node = **it; in FromIterableTreeHelper() local
602 Node node; in Tuple() local
621 const Node& node = traversal_.at(pos - 1); in Children() local
638 for (const Node& node : traversal_) { in ToString() local
713 for (const auto& node : traversal_) { in ToPickleable() local
[all …]
|
| /aosp_15_r20/external/wpa_supplicant_8/hs20/client/ |
| H A D | spp_client.c | 34 static char * get_spp_attr_value(struct xml_node_ctx *ctx, xml_node_t *node, in get_spp_attr_value()
41 static int hs20_spp_validate(struct hs20_osu_client *ctx, xml_node_t *node, in hs20_spp_validate()
78 xml_node_t *node; in add_mo_container() local
150 xml_node_t *node, *parent, *tnds, *unode; in process_update_node() local
332 xml_node_t *node, *ret_node; in hs20_spp_upload_mo() local
440 xml_node_t *node, *ret_node; in hs20_spp_user_input_completed() local
478 xml_node_t *node, *ret_node; in hs20_spp_get_certificate() local
599 enum spp_post_dev_data_use use, xml_node_t *node, in process_spp_post_dev_data_response()
824 xml_node_t *node) in process_spp_exchange_complete()
868 xml_node_t *spp_node, *node; in build_spp_update_response() local
[all …]
|
| /aosp_15_r20/packages/modules/Bluetooth/system/test/fake/ |
| D | fake_osi.cc | 74 static list_node_t* list_free_node_(list_t* l, list_node_t* node) { in list_free_node_()
131 for (auto node = l->head_; node;) { in FakeOsi() local
141 auto node = test::mock::osi_list::list_foreach( in FakeOsi() local
168 auto node = new list_node_t(data, prev_node->next_); in FakeOsi() local
180 auto node = new list_node_t(data, l->head_); in FakeOsi() local
192 auto node = new list_node_t(data, nullptr); in FakeOsi() local
219 for (auto prev = l->head_, node = l->head_->next_; node; prev = node, node = node->next_) { in FakeOsi() local
233 for (auto node = l->head_; node;) { in FakeOsi() local
250 test::mock::osi_list::list_next.body = [](const list_node_t* node) { in FakeOsi()
254 test::mock::osi_list::list_node.body = [](const list_node_t* node) { in FakeOsi()
|
| /aosp_15_r20/external/mesa3d/src/nouveau/codegen/ |
| H A D | nv50_ir_graph.cpp | 44 void Graph::insert(Node *node) in insert()
95 void Graph::Node::attach(Node *node, Edge::Type kind) in attach()
129 bool Graph::Node::detach(Graph::Node *node) in detach()
169 Graph::Node::reachableBy(const Node *node, const Node *term) const in reachableBy() argument
220 void search(Graph::Node *node, const bool preorder, const int sequence) in search()
284 void search(Graph::Node *node, const int sequence) in search()
353 Node *node = reinterpret_cast<Node *>(it->get()); in classifyEdges() local
366 Graph::Node *node; in classifyDFS() local
|
| /aosp_15_r20/external/ruy/ruy/profiler/ |
| H A D | treeview.cc | 32 void SortNode(TreeView::Node* node) { in SortNode()
46 void AddStack(const detail::Stack& stack, TreeView::Node* node, int level) { in AddStack()
69 void AddOther(TreeView::Node* node) { in AddOther()
117 void PrintTreeBelow(const TreeView::Node& node, const TreeView::Node& root, in PrintTreeBelow()
144 int DepthOfTreeBelow(const TreeView::Node& node) { in DepthOfTreeBelow()
157 const TreeView::Node& node, in WeightBelowNodeMatchingFunction()
169 int WeightBelowNodeMatchingUnformatted(const TreeView::Node& node, in WeightBelowNodeMatchingUnformatted()
175 int WeightBelowNodeMatchingFormatted(const TreeView::Node& node, in WeightBelowNodeMatchingFormatted()
|
| /aosp_15_r20/external/tensorflow/tensorflow/lite/kernels/ |
| H A D | reshape.cc | 36 TfLiteStatus ResizeOutput(TfLiteContext* context, TfLiteNode* node) { in ResizeOutput()
90 TfLiteNode* node) { in GetOutputShapeFromTensor()
103 TfLiteNode* node) { in GetOutputShapeFromParam()
124 inline bool ShapeIsVector(TfLiteContext* context, TfLiteNode* node) { in ShapeIsVector()
130 TfLiteIntArray* GetOutputShape(TfLiteContext* context, TfLiteNode* node) { in GetOutputShape()
138 TfLiteStatus Prepare(TfLiteContext* context, TfLiteNode* node) { in Prepare()
160 TfLiteStatus Eval(TfLiteContext* context, TfLiteNode* node) { in Eval()
|
| /aosp_15_r20/external/sdv/vsomeip/third_party/boost/iterator/example/ |
| D | node.hpp | 47 struct node : node_base struct
49 node(T x) in node() function
53 void print(std::ostream& s) const { s << this->m_value; } in print()
54 void double_me() { m_value += m_value; } in double_me()
57 T m_value;
|
| /aosp_15_r20/out/soong/.intermediates/external/apache-velocity-engine/apache-velocity-engine-core/android_common_apex33/javac/ |
| D | apache-velocity-engine-core.jar | META-INF/
META-INF/MANIFEST.MF
org/
org/apache/
org/ ... |
| /aosp_15_r20/external/skia/modules/canvaskit/npm_build/ |
| H A D | package-lock.json | 68 "node": ">=6 <7 || >=8" string
133 "node": ">=0.10.0" string
145 "node": ">=4" string
223 "node": ">=0.8" string
238 "node": "*" string
264 "node": ">=0.10.0" string
280 "node": ">=0.10.0" string
289 "node": ">=0.8.0" string
384 "node": ">=0.10.0" string
399 "node": ">=6" string
[all …]
|
| /aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r530567b/include/lldb/Symbol/ |
| D | PostfixExpression.h | 70 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/prebuilts/clang/host/linux-x86/clang-r522817/include/lldb/Symbol/ |
| D | PostfixExpression.h | 70 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/prebuilts/clang/host/linux-x86/clang-r530567/include/lldb/Symbol/ |
| D | PostfixExpression.h | 70 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()
|