| /third_party/node/deps/v8/src/compiler/ |
| H A D | memory-lowering.h | 8 #include "src/compiler/graph-assembler.h"
9 #include "src/compiler/graph-reducer.h"
32 // An allocation state is propagated on the effect paths through the graph.
117 Graph* graph() const { return graph_; } in graph() function in v8::internal::compiler::final
|
| H A D | code-assembler.cc | 15 #include "src/compiler/graph.h"
16 #include "src/compiler/js-graph.h"
85 isolate, raw_assembler_->graph(), raw_assembler_->common(), in CodeAssemblerState()
130 Graph* graph = raw_assembler()->graph(); in BreakOnNode() local
131 Zone* zone = graph->zone(); in BreakOnNode()
134 graph->AddDecorator(decorator); in BreakOnNode()
177 Graph* graph = rasm->ExportForOptimization(); in GenerateCode() local
180 rasm->isolate(), rasm->call_descriptor(), graph, state->jsgraph_, in GenerateCode()
|
| H A D | raw-machine-assembler.h | 15 #include "src/compiler/graph.h"
35 // The RawMachineAssembler produces a low-level IR graph. All nodes are wired
36 // into a graph and also placed into a schedule immediately, hence subsequent
43 // Also note that the generated graph is only valid together with the generated
44 // schedule, using one without the other is invalid as the graph is inherently
49 Isolate* isolate, Graph* graph, CallDescriptor* call_descriptor,
62 Graph* graph() const { return graph_; } in graph() function in v8::internal::compiler::RawMachineAssembler
63 Zone* zone() const { return graph()->zone(); } in zone()
73 // Finalizes the schedule and transforms it into a graph that's suitable for
1056 return AddNode(common()->Phi(rep, 2), n1, n2, graph() in Phi()
[all...] |
| H A D | state-values-utils.cc | 94 graph()->NewNode(common()->StateValues(0, SparseInputMask::Dense())); in GetEmptyStateValues()
128 node = graph()->NewNode(common()->StateValues(node_count, mask), node_count, in GetValuesNodeFromCache()
|
| H A D | escape-analysis.h | 10 #include "src/compiler/graph-reducer.h"
11 #include "src/compiler/js-graph.h"
43 EffectGraphReducer(Graph* graph,
54 // part of the graph.
106 // An object that can track the nodes in the graph whose current reduction
136 // dead nodes in the graph. This is a workaround that should be removed in FieldAt()
|
| H A D | js-create-lowering.h | 10 #include "src/compiler/graph-reducer.h"
122 Graph* graph() const;
|
| H A D | machine-operator-reducer.h | 10 #include "src/compiler/graph-reducer.h"
120 Graph* graph() const;
|
| H A D | machine-graph-verifier.cc | 5 #include "src/compiler/machine-graph-verifier.h"
8 #include "src/compiler/graph.h"
24 MachineRepresentationInferrer(Schedule const* schedule, Graph const* graph, in MachineRepresentationInferrer() argument
28 representation_vector_(graph->NodeCount(), MachineRepresentation::kNone, in MachineRepresentationInferrer()
718 << " in the machine graph is not being checked."; in Run()
995 // TODO(turbofan): At the moment, the machine graph doesn't contain in IsCompatible()
1040 void MachineGraphVerifier::Run(Graph* graph, Schedule const* const schedule, in Run() argument
1043 MachineRepresentationInferrer representation_inferrer(schedule, graph, in Run()
|
| /third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/regex/ |
| H A D | RegexGenerator.java | 25 import com.google.common.graph.ValueGraph;
71 * DFA graph in an attempt to reduce the number of problematic terminating states. This results
81 * DFA graph in an attempt to identify and handle subgroups which would cause repetition. This
92 * NFA graph to factor out common trailing paths. This results in a small size improvement to
122 // graph (i.e. we can generate "(?:<re>)?" but only if "<re>" is non-empty). We just get in toRegex()
|
| /third_party/skia/third_party/externals/tint/src/resolver/ |
| H A D | dependency_graph_test.cc | 35 DependencyGraph graph; in Build() local
37 this->Diagnostics(), graph, in Build()
45 return graph; in Build()
1154 auto graph = in TEST_P() local
1159 auto* resolved_symbol = graph.resolved_symbols[use]; in TEST_P()
1327 auto graph = Build(); in TEST_F() local
1329 auto* resolved_symbol = graph.resolved_symbols[use.use]; in TEST_F()
|
| /foundation/distributeddatamgr/udmf/framework/innerkitsimpl/client/ |
| H A D | utd_client.cpp | 426 auto graph = UtdGraph::GetInstance().ConstructNewGraph(allTypeCfgs); in UpdateGraph() local
428 UtdGraph::GetInstance().Update(std::move(graph)); in UpdateGraph()
|
| /third_party/node/tools/gyp/pylib/gyp/ |
| H A D | common.py | 595 def TopologicallySorted(graph, get_edges):
599 graph: A list of node names.
603 A list containing all of the node in graph in topological order.
609 graph = {'a': '$(b) $(c)', 'b': 'hi', 'c': '$(b)'}
611 return re.findall(r'\$\(([^))]\)', graph[node])
612 print TopologicallySorted(graph.keys(), GetEdges)
633 for node in sorted(graph):
|
| /third_party/node/deps/npm/node_modules/node-gyp/gyp/pylib/gyp/ |
| H A D | common.py | 589 def TopologicallySorted(graph, get_edges):
593 graph: A list of node names.
597 A list containing all of the node in graph in topological order.
603 graph = {'a': '$(b) $(c)', 'b': 'hi', 'c': '$(b)'}
605 return re.findall(r'\$\(([^))]\)', graph[node])
606 print TopologicallySorted(graph.keys(), GetEdges)
627 for node in sorted(graph):
|
| /kernel/linux/linux-5.10/tools/bootconfig/scripts/ |
| H A D | ftrace2bconf.sh | 186 nodisplay-graph
|
| /kernel/linux/linux-6.6/tools/bootconfig/scripts/ |
| H A D | ftrace2bconf.sh | 203 nodisplay-graph
|
| /third_party/ffmpeg/libavfilter/ |
| H A D | f_zmq.c | 179 ret = avfilter_graph_send_command(inlink->graph, in filter_frame()
|
| H A D | f_graphmonitor.c | 343 for (int i = 0; i < ctx->graph->nb_filters; i++) { in create_frame()
344 AVFilterContext *filter = ctx->graph->filters[i]; in create_frame()
|
| /third_party/libphonenumber/metadata/src/test/java/com/google/i18n/phonenumbers/metadata/regex/ |
| H A D | RangeTreeConverterTest.java | 28 import com.google.common.graph.ValueGraph;
146 // Follows the given edge from a node (which must be in the graph), returning the target node
147 // (or null if the edge does not exist in the graph).
|
| /third_party/node/deps/v8/tools/ |
| H A D | run_perf.py | 366 # A regular expression for results. If the parent graph provides a
450 """Changes the cwd to to path defined in the current graph.
526 """Factory method for making graph configuration objects."""
531 # A main file makes this graph runnable. Empty strings are accepted.
533 # This graph has subgraphs (traces).
536 # This graph has no subgraphs, it's a leaf.
546 """Builds a tree structure of graph objects that corresponds to the suite
554 graph = MakeGraphConfig(suite, arch, parent)
556 BuildGraphConfigs(subsuite, arch, graph)
557 parent.AppendChild(graph)
[all...] |
| /third_party/ninja/src/ |
| H A D | ninja.cc | 44 #include "graph.h"
386 GraphViz graph(&state_, &disk_interface_);
in ToolGraph()
387 graph.Start();
in ToolGraph()
389 graph.AddTarget(*n);
in ToolGraph()
390 graph.Finish();
in ToolGraph()
1110 { "browse", "browse dependency graph in a web browser",
in ChooseTool()
1126 { "graph", "output graphviz dot file for targets",
in ChooseTool()
|
| /kernel/linux/linux-5.10/tools/perf/ |
| H A D | builtin-ftrace.c | 414 pr_err("invalid graph depth: %d\n", ftrace->graph_depth); in set_tracing_depth()
531 pr_err("failed to set graph depth\n"); in set_tracing_options()
820 { .name = "call-graph", .value_ptr = &ftrace->func_stack_trace }, in parse_func_tracer_opts()
861 bool graph = !list_empty(&ftrace->graph_funcs) || in select_tracer() local
867 if (graph) in select_tracer()
911 "Function tracer options, available options: call-graph,irq-info", in cmd_ftrace()
913 OPT_CALLBACK('G', "graph-funcs", &ftrace.graph_funcs, "func", in cmd_ftrace()
918 OPT_CALLBACK(0, "graph-opts", &ftrace, "options", in cmd_ftrace()
|
| /kernel/linux/linux-5.10/tools/perf/ui/ |
| H A D | browser.c | 663 int graph) in ui_browser__write_graph()
666 SLsmg_write_char(graph); in ui_browser__write_graph()
662 ui_browser__write_graph(struct ui_browser *browser __maybe_unused, int graph) ui_browser__write_graph() argument
|
| /kernel/linux/linux-6.6/tools/perf/ui/ |
| H A D | browser.c | 663 int graph) in ui_browser__write_graph()
666 SLsmg_write_char(graph); in ui_browser__write_graph()
662 ui_browser__write_graph(struct ui_browser *browser __maybe_unused, int graph) ui_browser__write_graph() argument
|
| /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()
|