| /foundation/ai/neural_network_runtime/frameworks/native/neural_network_runtime/ |
| H A D | lite_graph_to_hdi_model_v2_0.cpp | 1005 LOGE("MindIR_LiteGraph_To_Model v2 failed, lite graph is nullptr."); in LiteGraph_To_HDIModel()
1066 for (auto graph : liteGraph->sub_graphs_) { in LiteGraph_To_HDIModel()
1068 tmp.name = graph->name_; in LiteGraph_To_HDIModel()
1069 tmp.inputIndices = std::vector<uint32_t>(graph->input_indices_); in LiteGraph_To_HDIModel()
1070 tmp.outputIndices = std::vector<uint32_t>(graph->output_indices_); in LiteGraph_To_HDIModel()
1071 tmp.nodeIndices = std::vector<uint32_t>(graph->node_indices_); in LiteGraph_To_HDIModel()
|
| H A D | lite_graph_to_hdi_model_v1_0.cpp | 1004 LOGE("MindIR_LiteGraph_To_Model v1 failed, lite graph is nullptr."); in LiteGraph_To_HDIModel()
1065 for (auto graph : liteGraph->sub_graphs_) { in LiteGraph_To_HDIModel()
1067 tmp.name = graph->name_; in LiteGraph_To_HDIModel()
1068 tmp.inputIndices = std::vector<uint32_t>(graph->input_indices_); in LiteGraph_To_HDIModel()
1069 tmp.outputIndices = std::vector<uint32_t>(graph->output_indices_); in LiteGraph_To_HDIModel()
1070 tmp.nodeIndices = std::vector<uint32_t>(graph->node_indices_); in LiteGraph_To_HDIModel()
|
| H A D | lite_graph_to_hdi_model_v2_1.cpp | 1809 LOGE("MindIR_LiteGraph_To_Model v2_1 failed, lite graph is nullptr.");
in LiteGraph_To_HDIModel()
1871 for (auto graph : liteGraph->sub_graphs_) {
in LiteGraph_To_HDIModel()
1873 tmp.name = graph->name_;
in LiteGraph_To_HDIModel()
1874 tmp.inputIndices = std::vector<uint32_t>(graph->input_indices_);
in LiteGraph_To_HDIModel()
1875 tmp.outputIndices = std::vector<uint32_t>(graph->output_indices_);
in LiteGraph_To_HDIModel()
1876 tmp.nodeIndices = std::vector<uint32_t>(graph->node_indices_);
in LiteGraph_To_HDIModel()
|
| /third_party/node/deps/v8/src/compiler/ |
| H A D | load-elimination.cc | 9 #include "src/compiler/js-graph.h"
948 NodeProperties::GetType(replacement), graph()->zone()); in ReduceLoadField()
950 graph()->NewNode(common()->TypeGuard(replacement_type), in ReduceLoadField()
1019 graph()->NewNode(common()->Unreachable(), effect, control); in ReduceStoreField()
1454 Graph* LoadElimination::graph() const { return jsgraph()->graph(); } in graph() function in v8::internal::compiler::LoadElimination
|
| H A D | js-native-context-specialization.h | 10 #include "src/compiler/graph-reducer.h"
239 Graph* graph() const;
|
| H A D | verifier.cc | 15 #include "src/compiler/graph.h"
283 // All inputs are graph terminators. in Check()
290 // Dead is never connected to the graph. in Check()
358 // stay connected to the graph end. in Check()
453 // Type is merged from other values in the graph and could be any. in Check()
1874 void Verifier::Run(Graph* graph, Typing typing, CheckInputs check_inputs, in Run() argument
1876 CHECK_NOT_NULL(graph->start()); in Run()
1877 CHECK_NOT_NULL(graph->end()); in Run()
1878 Zone zone(graph->zone()->allocator(), ZONE_NAME); in Run()
1880 AllNodes all(&zone, graph); in Run()
[all...] |
| H A D | js-call-reducer.h | 11 #include "src/compiler/graph-reducer.h"
70 // JSCallReducer outsources much work to a graph assembler.
256 Graph* graph() const;
|
| H A D | load-elimination.h | 11 #include "src/compiler/graph-reducer.h"
47 // effect paths through the graph.
128 // the effect paths through the graph.
176 // effect paths through the graph.
334 Graph* graph() const;
|
| /kernel/linux/linux-5.10/tools/perf/util/ |
| H A D | annotate.h | 212 void (*write_graph)(void *obj, int graph);
|
| /kernel/linux/linux-6.6/tools/perf/util/ |
| H A D | annotate.h | 213 void (*write_graph)(void *obj, int graph);
|
| /third_party/ffmpeg/libavdevice/ |
| H A D | dshow_capture.h | 290 IGraphBuilder *graph; member
|
| /kernel/linux/linux-5.10/arch/nds32/kernel/ |
| H A D | perf_event_cpu.c | 1202 int graph = 0; in unwind_frame_kernel() local
1209 * The array index is based on the ABI, the below graph in unwind_frame_kernel()
1228 (NULL, &graph, frame->lp, NULL); in unwind_frame_kernel()
1255 (tsk, &graph, frame->lp, NULL); in unwind_frame_kernel()
1358 * $ perf record -e cpu-clock --call-graph fp ./program
1359 * $ perf report --call-graph
|
| /third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/tool/locale/ |
| H A D | LocaleDistanceBuilder.java | 55 /** Directed, acyclic containment graph. Maps each container to its direct contents. */
56 final Multimap<String, String> graph = TreeMultimap.create(); field in LocaleDistanceBuilder.TerritoryContainment
61 /** The leaves of the graph. */
88 graph.put(container, s); in addContainments()
97 Set<String> contained = graph.get(region); in resolve()
|
| /third_party/icu/icu4j/tools/misc/src/com/ibm/icu/dev/tool/locale/ |
| H A D | LocaleDistanceBuilder.java | 55 /** Directed, acyclic containment graph. Maps each container to its direct contents. */
56 final Multimap<String, String> graph = TreeMultimap.create(); field in LocaleDistanceBuilder.TerritoryContainment
61 /** The leaves of the graph. */
88 graph.put(container, s); in addContainments()
97 Set<String> contained = graph.get(region); in resolve()
|
| /kernel/linux/linux-5.10/tools/perf/ui/browsers/ |
| H A D | annotate.c | 77 static void annotate_browser__write_graph(void *browser, int graph) in annotate_browser__write_graph() argument
79 ui_browser__write_graph(browser, graph); in annotate_browser__write_graph()
|
| /kernel/linux/linux-6.6/tools/perf/ |
| H A D | builtin-ftrace.c | 392 pr_err("invalid graph depth: %d\n", ftrace->graph_depth); in set_tracing_depth()
509 pr_err("failed to set graph depth\n"); in set_tracing_options()
548 bool graph = !list_empty(&ftrace->graph_funcs) || in select_tracer() local
554 if (graph) in select_tracer()
1076 { .name = "call-graph", .value_ptr = &ftrace->func_stack_trace }, in parse_func_tracer_opts()
1155 "Function tracer options, available options: call-graph,irq-info", in cmd_ftrace()
1157 OPT_CALLBACK('G', "graph-funcs", &ftrace.graph_funcs, "func", in cmd_ftrace()
1162 OPT_CALLBACK(0, "graph-opts", &ftrace, "options", in cmd_ftrace()
|
| /kernel/linux/linux-6.6/tools/perf/ui/browsers/ |
| H A D | annotate.c | 72 static void annotate_browser__write_graph(void *browser, int graph) in annotate_browser__write_graph() argument
74 ui_browser__write_graph(browser, graph); in annotate_browser__write_graph()
|
| /third_party/alsa-lib/src/topology/ |
| H A D | dapm.c | 250 /* add graph to manifest */ in tplg_build_routes()
377 SNDERR("compound is expected for dapm graph definition"); in tplg_parse_dapm_graph()
400 SNDERR("failed to parse dapm graph %s, missing index", in tplg_parse_dapm_graph()
406 SNDERR("failed to parse dapm graph %s", in tplg_parse_dapm_graph()
417 /* save DAPM graph */
767 struct snd_tplg_graph_template *gt = t->graph; in tplg_add_graph_object()
1062 SNDERR("dapm graph: small size %d", size); in tplg_decode_dapm_graph()
1069 tplg_log(tplg, 'D', pos, "dapm graph: src='%s' ctl='%s' sink='%s'", in tplg_decode_dapm_graph()
1076 t.graph = gt; in tplg_decode_dapm_graph()
|
| /third_party/littlefs/scripts/ |
| H A D | stack.py | 172 for k, graph in vcg:
173 if k != 'graph':
175 for k, info in graph:
|
| /kernel/linux/linux-5.10/arch/mips/include/asm/sn/ |
| H A D | klconfig.h | 40 //#include <sys/graph.h>
47 #include <sys/graph.h>
|
| /kernel/linux/linux-6.6/arch/mips/include/asm/sn/ |
| H A D | klconfig.h | 40 //#include <sys/graph.h>
47 #include <sys/graph.h>
|
| /third_party/ffmpeg/libavfilter/ |
| H A D | f_sendcmd.c | 559 ret = avfilter_graph_send_command(inlink->graph, in filter_frame()
|
| H A D | buffersink.c | 137 ret = ff_filter_graph_run_once(ctx->graph); in get_frame_internal()
411 .description = NULL_IF_CONFIG_SMALL("Buffer video frames, and make them available to the end of the filter graph."),
430 .description = NULL_IF_CONFIG_SMALL("Buffer audio frames, and make them available to the end of the filter graph."),
|
| /third_party/node/src/ |
| H A D | memory_tracker-inl.h | 31 if (!obj.IsEmpty()) wrapper_node_ = tracker->graph()->V8Node(obj); in MemoryRetainerNode()
|
| /third_party/node/deps/v8/include/v8-include/ |
| H A D | v8-profiler.h | 65 * CpuProfileNode represents a node in a call graph.
541 * graph nodes: from retainers to retained nodes.
577 * HeapGraphNode represents a node in a heap graph.
637 /** Returns the root node of the heap graph. */
710 * This is structured as a call-graph.
727 * Represents a node in the call-graph.
778 * List of self allocations done by this node in the call-graph.
810 * Returns the root node of the call-graph. The root node corresponds to an
824 * An object graph consisting of embedder objects and V8 objects.
825 * Edges of the graph ar
[all...] |