Home
last modified time | relevance | path

Searched refs:graph (Results 176 - 200 of 274) sorted by relevance

1234567891011

/third_party/node/deps/v8/tools/
H A Drun-perf.sh57 --call-graph $CALL_GRAPH_METHOD \
/third_party/node/deps/v8/src/compiler/
H A Dverifier.h20 // Verifies properties of a graph, such as the well-formedness of inputs to
31 static void Run(Graph* graph, Typing typing = TYPED,
H A Dcsa-load-elimination.h11 #include "src/compiler/graph-reducer.h"
12 #include "src/compiler/js-graph.h"
35 node_states_(jsgraph->graph()->NodeCount(), zone), in CsaLoadElimination()
172 Graph* graph() const;
H A Deffect-control-linearizer.cc17 #include "src/compiler/graph-assembler.h"
18 #include "src/compiler/js-graph.h"
327 Graph* graph() const { return js_graph_->graph(); } in graph() function in v8::internal::compiler::EffectControlLinearizer
454 Graph* graph, CommonOperatorBuilder* common, in TryCloneBranch()
461 // input graph as shown below and clones the Branch node for every predecessor in TryCloneBranch()
489 // The resulting graph (modulo the Phi and EffectPhi nodes) looks like this: in TryCloneBranch()
547 Node** const inputs = graph->zone()->NewArray<Node*>(2 * input_count); in TryCloneBranch()
553 Node* branch1 = graph->NewNode(common->Branch(hint), cond1, control1); in TryCloneBranch()
554 merge_true_inputs[index] = graph in TryCloneBranch()
453 TryCloneBranch(Node* node, BasicBlock* block, Zone* temp_zone, Graph* graph, CommonOperatorBuilder* common, BlockEffectControlMap* block_effects, SourcePositionTable* source_positions, NodeOriginTable* node_origins) TryCloneBranch() argument
6708 LinearizeEffectControl(JSGraph* graph, Schedule* schedule, Zone* temp_zone, SourcePositionTable* source_positions, NodeOriginTable* node_origins, JSHeapBroker* broker) LinearizeEffectControl() argument
[all...]
H A Dsimplified-operator-reducer.h11 #include "src/compiler/graph-reducer.h"
56 Graph* graph() const;
H A Djs-generic-lowering.h8 #include "src/compiler/graph-reducer.h"
58 Graph* graph() const;
H A Dproperty-access-builder.h69 Graph* graph() const;
H A Dcompiler-source-position-table.h45 explicit SourcePositionTable(Graph* graph);
H A Djs-inlining.h8 #include "src/compiler/graph-reducer.h"
9 #include "src/compiler/js-graph.h"
21 // The JSInliner provides the core graph inlining machinery. Note that this
22 // class only deals with the mechanics of how to inline one graph into another,
53 Graph* graph() const;
H A Dmemory-optimizer.h8 #include "src/compiler/graph-assembler.h"
46 // path through the graph.
79 Graph* graph() const;
H A Dmemory-optimizer.cc10 #include "src/compiler/js-graph.h"
197 EnqueueUses(graph()->start(), empty_state()); in Optimize()
213 // Allocate nodes were purged from the graph in effect-control in VisitNode()
340 // In case of replacement, the replacement graph should not require futher in VisitLoadField()
341 // lowering, so we can proceed iterating the graph from the node uses. in VisitLoadField()
405 // an unschedulable graph. in MergeStates()
479 Graph* MemoryOptimizer::graph() const { return jsgraph()->graph(); } in graph() function in v8::internal::compiler::MemoryOptimizer
/foundation/distributeddatamgr/kv_store/frameworks/libs/distributeddb/common/include/
H A Ddb_common.h115 const std::map<std::string, std::map<std::string, bool>> &graph,
158 static void InsertNodesByScore(const std::map<std::string, std::map<std::string, bool>> &graph,
/foundation/distributeddatamgr/udmf/framework/common/
H A Dutd_cfgs_checker.cpp203 auto graph = UtdGraph::GetInstance().ConstructNewGraph(allTypeCfgs); in CanConstructDAG() local
204 if (graph->IsDAG()) { in CanConstructDAG()
/drivers/peripheral/camera/vdi_base/common/include/
H A Dbuffer_tracking.h70 static void DumpBufferTrace(const int32_t id, BufferTraceGraph& graph);
/foundation/arkui/ace_engine/test/tools/event_tree_to_graph/
H A Dmain.py26 from src.graph.graph_converter import generate_all_graphs
/third_party/ffmpeg/libavfilter/
H A Dvf_zscale.c134 zimg_filter_graph *alpha_graph[MAX_THREADS], *graph[MAX_THREADS]; member
536 /* returns 0 if graph builder parameters are the same and 1 otherwise */
605 if (s->graph[job_nr]) { in graphs_build()
606 zimg_filter_graph_free(s->graph[job_nr]); in graphs_build()
608 s->graph[job_nr] = zimg_filter_graph_build(&src_format, &dst_format, &s->params); in graphs_build()
609 if (!s->graph[job_nr]) in graphs_build()
612 ret = zimg_filter_graph_get_tmp_size(s->graph[job_nr], &size); in graphs_build()
742 if (!s->graph[job_nr]) in filter_slice()
744 ret = zimg_filter_graph_process(s->graph[job_nr], &src_buf, &dst_buf, s->tmp[job_nr], 0, 0, 0, 0); in filter_slice()
933 if (s->graph[ in uninit()
[all...]
/foundation/ai/neural_network_runtime/frameworks/native/neural_network_runtime/
H A Dhdi_device_v2_1.cpp477 OH_NN_ReturnCode HDIDeviceV2_1::GetOfflineModelFromLiteGraph(std::shared_ptr<const mindspore::lite::LiteGraph> graph, in GetOfflineModelFromLiteGraph() argument
480 // graph has been checked in PrepareOfflineModel, no need to check twice. in GetOfflineModelFromLiteGraph()
483 const size_t inputNum = graph->all_nodes_[0]->input_indices_.size(); in GetOfflineModelFromLiteGraph()
490 uint32_t index = graph->all_nodes_[0]->input_indices_[inputNum - 1]; in GetOfflineModelFromLiteGraph()
491 mindspore::lite::TensorPtr pTensor = graph->all_tensors_[index]; in GetOfflineModelFromLiteGraph()
632 LOGE("Error happens when getting offline models from lite graph."); in PrepareOfflineModel()
H A Dhdi_device_v2_0.cpp482 OH_NN_ReturnCode HDIDeviceV2_0::GetOfflineModelFromLiteGraph(std::shared_ptr<const mindspore::lite::LiteGraph> graph, in GetOfflineModelFromLiteGraph() argument
485 // graph has been checked in PrepareOfflineModel, no need to check twice. in GetOfflineModelFromLiteGraph()
488 const size_t inputNum = graph->all_nodes_[0]->input_indices_.size(); in GetOfflineModelFromLiteGraph()
495 uint32_t index = graph->all_nodes_[0]->input_indices_[inputNum - 1]; in GetOfflineModelFromLiteGraph()
496 mindspore::lite::TensorPtr pTensor = graph->all_tensors_[index]; in GetOfflineModelFromLiteGraph()
637 LOGE("Error happens when getting offline models from lite graph."); in PrepareOfflineModel()
/third_party/vk-gl-cts/external/vulkan-docs/src/scripts/spec_tools/
H A Dconsistency_tools.py657 self.graph = nx.DiGraph()
684 return shortest_path(self.graph, source=source, target=target)
702 # Update graph
703 self.graph.add_node(type_name)
704 self.graph.add_edges_from((type_name, t)
/third_party/skia/third_party/externals/tint/src/resolver/
H A Ddependency_graph.cc119 /// @param graph the dependency graph to populate with resolved symbols
125 DependencyGraph& graph, in DependencyScanner()
130 graph_(graph), in DependencyScanner()
472 DependencyGraph& graph) in DependencyAnalysis()
473 : symbols_(symbols), diagnostics_(diagnostics), graph_(graph) {} in DependencyAnalysis()
482 // Traverse the named globals to build the dependency graph in Run()
488 // Dump the dependency graph if TINT_DUMP_DEPENDENCY_GRAPH is non-zero in Run()
764 /// The resulting dependency graph
122 DependencyScanner(const SymbolTable& syms, const GlobalMap& globals_by_name, diag::List& diagnostics, DependencyGraph& graph, DependencyEdges& edges) DependencyScanner() argument
/foundation/distributeddatamgr/kv_store/frameworks/libs/distributeddb/common/src/
H A Ddb_common.cpp508 * 1. select a point which in-degree is 0 in the graph and record it;
510 * 3. repeat step 1 and 2, until the graph is empty or there is no point with a zero degree
564 void DBCommon::InsertNodesByScore(const std::map<std::string, std::map<std::string, bool>> &graph, in InsertNodesByScore() argument
568 auto copyGraph = graph; in InsertNodesByScore()
579 LOGW("[DBCommon] not find score in graph"); in InsertNodesByScore()
591 const std::map<std::string, std::map<std::string, bool>> &graph, in GenerateNodesByNodeWeight()
604 if (graph.find(source) == graph.end()) { in GenerateNodesByNodeWeight()
607 for (const auto &[target, reach] : graph.at(source)) { in GenerateNodesByNodeWeight()
620 InsertNodesByScore(graph, generateNode in GenerateNodesByNodeWeight()
590 GenerateNodesByNodeWeight(const std::vector<std::string> &nodes, const std::map<std::string, std::map<std::string, bool>> &graph, const std::map<std::string, int> &nodeWeight) GenerateNodesByNodeWeight() argument
[all...]
/third_party/node/deps/v8/src/heap/cppgc-js/
H A Dcpp-snapshot.cc49 // consumers of the graph may merge a node and its wrapper node. in SetWrapperNode()
143 // dependencies on ancestors in the sub graph which ensures that there will be
383 // graph with hidden nodes that do not carry information. For that reason, the
386 // In this case the (hidden) objects are filtered from the graph. The trickiest
413 CppGraphBuilderImpl(CppHeap& cpp_heap, v8::EmbedderGraph& graph) in CppGraphBuilderImpl() argument
414 : cpp_heap_(cpp_heap), graph_(graph) {} in CppGraphBuilderImpl()
482 // pointing back to the object. Set up a wrapper node for the graph so in AddEdge()
589 // the object graph.
801 // In case the names are visible, the graph is not traversed in this phase. in VisitForVisibility()
861 // First pass: Figure out which objects should be included in the graph in Run()
904 Run(v8::Isolate* isolate, v8::EmbedderGraph* graph, void* data) Run() argument
[all...]
/third_party/ffmpeg/fftools/
H A Dffmpeg_hw.c574 for (i = 0; i < fg->graph->nb_filters; i++) { in hw_device_setup_for_filter()
575 fg->graph->filters[i]->hw_device_ctx = in hw_device_setup_for_filter()
577 if (!fg->graph->filters[i]->hw_device_ctx) in hw_device_setup_for_filter()
H A Dffmpeg.h245 struct FilterGraph *graph; member
269 struct FilterGraph *graph; member
294 AVFilterGraph *graph; member
/third_party/node/src/
H A Dheap_utils.cc213 JSGraph graph(env->isolate()); in BuildEmbedderGraph()
214 Environment::BuildEmbedderGraph(env->isolate(), &graph, env); in BuildEmbedderGraph()
216 if (graph.CreateObject().ToLocal(&ret)) in BuildEmbedderGraph()

Completed in 24 milliseconds

1234567891011