Home
last modified time | relevance | path

Searched refs:graph (Results 126 - 150 of 319) sorted by relevance

12345678910>>...13

/third_party/node/deps/v8/src/compiler/
H A Ddecompression-optimizer.cc7 #include "src/compiler/graph.h"
45 DecompressionOptimizer::DecompressionOptimizer(Zone* zone, Graph* graph, in DecompressionOptimizer() argument
48 : graph_(graph), in DecompressionOptimizer()
51 states_(graph, static_cast<uint32_t>(State::kNumberOfStates)), in DecompressionOptimizer()
56 MaybeMarkAndQueueForRevisit(graph()->end(), State::kOnly32BitsObserved); in MarkNodes()
H A Dgraph-trimmer.h18 // Trims dead nodes from the node graph.
21 GraphTrimmer(Zone* zone, Graph* graph);
26 // Trim nodes in the {graph} that are not reachable from {graph->end()}.
29 // Trim nodes in the {graph} that are not reachable from either {graph->end()}
50 Graph* graph() const { return graph_; } in graph() function in v8::internal::compiler::final
H A Ddead-code-elimination.cc8 #include "src/compiler/graph.h"
17 DeadCodeElimination::DeadCodeElimination(Editor* editor, Graph* graph, in DeadCodeElimination() argument
21 graph_(graph), in DeadCodeElimination()
23 dead_(graph->NewNode(common->Dead())), in DeadCodeElimination()
247 // to the graph end and delete the corresponding inputs from the merge and in ReduceEffectPhi()
300 : graph()->start(); in ReduceEffectNode()
302 graph()->NewNode(common()->Unreachable(), effect, control); in ReduceEffectNode()
326 effect = graph()->NewNode(common()->Unreachable(), effect, control); in ReduceDeoptimizeOrReturnOrTerminateOrTailCall()
380 Node* dead_value = graph()->NewNode(common()->DeadValue(rep), node); in DeadValue()
H A Dgraph-visualizer.h102 JSONGraphWriter(std::ostream& os, const Graph* graph,
130 : graph(g), positions(p), origins(o) {} in GraphAsJSON()
131 const Graph& graph; member
146 explicit AsRPO(const Graph& g) : graph(g) {} in AsRPO()
147 const Graph& graph; member
H A Dadd-type-assertions-reducer.cc17 visited_(jsgraph->graph()->NodeCount(), zone) {} in AddTypeAssertionsReducer()
35 Node* assertion = graph()->NewNode(simplified()->AssertType(type), node); in Reduce()
H A Dcontrol-flow-optimizer.h27 ControlFlowOptimizer(Graph* graph, CommonOperatorBuilder* common,
43 Graph* graph() const { return graph_; } in graph() function in v8::internal::compiler::final
H A Ddecompression-optimizer.h27 // The phase needs to be run when Machine are present in the graph, i.e
38 DecompressionOptimizer(Zone* zone, Graph* graph,
103 Graph* graph() const { return graph_; } in graph() function in v8::internal::compiler::final
H A Dselect-lowering.cc9 #include "src/compiler/graph-assembler.h"
10 #include "src/compiler/graph.h"
18 SelectLowering::SelectLowering(JSGraphAssembler* graph_assembler, Graph* graph) in SelectLowering() argument
19 : graph_assembler_(graph_assembler), start_(graph->start()) {} in SelectLowering()
H A Dframe-states.h177 JSGraph* graph, Builtin name, Node* context, Node* const* parameters,
189 JSGraph* graph, const SharedFunctionInfoRef& shared, Builtin name,
195 JSGraph* graph, const SharedFunctionInfoRef& shared, Node* target,
H A Dcontrol-equivalence.h10 #include "src/compiler/graph.h"
21 // - Build a program structure tree (PST) for controls in the graph.
22 // - Determine single-entry single-exit (SESE) regions within the graph.
36 ControlEquivalence(Zone* zone, Graph* graph) in ControlEquivalence() argument
38 graph_(graph), in ControlEquivalence()
41 node_data_(graph->NodeCount(), zone) {} in ControlEquivalence()
44 // the following iterations over control edges of the graph:
111 // Performs and undirected DFS walk of the graph. Conceptually all nodes are
H A Dloop-analysis.cc9 #include "src/compiler/graph.h"
55 // This loop finding algorithm works by traversing the graph in two directions,
65 LoopFinderImpl(Graph* graph, LoopTree* loop_tree, TickCounter* tick_counter, in LoopFinderImpl() argument
68 end_(graph->end()), in LoopFinderImpl()
70 queued_(graph, 2), in LoopFinderImpl()
71 info_(graph->NodeCount(), {nullptr, nullptr, false}, zone), in LoopFinderImpl()
73 loop_num_(graph->NodeCount(), -1, zone),
539 LoopTree* LoopFinder::BuildLoopTree(Graph* graph, TickCounter* tick_counter, in BuildLoopTree() argument
542 graph->zone()->New<LoopTree>(graph in BuildLoopTree()
[all...]
H A Djs-create-lowering.cc12 #include "src/compiler/js-graph.h"
152 Node* const control = graph()->start(); in ReduceJSCreateArguments()
168 graph()->NewNode(simplified()->ArgumentsLength()); in ReduceJSCreateArguments()
198 graph()->NewNode(simplified()->ArgumentsLength()); in ReduceJSCreateArguments()
200 Node* const elements = effect = graph()->NewNode( in ReduceJSCreateArguments()
224 graph()->NewNode(simplified()->ArgumentsLength()); in ReduceJSCreateArguments()
225 Node* const rest_length = graph()->NewNode(simplified()->RestLength( in ReduceJSCreateArguments()
228 Node* const elements = effect = graph()->NewNode( in ReduceJSCreateArguments()
479 length = effect = graph()->NewNode( in ReduceNewArray()
485 length = effect = graph() in ReduceNewArray()
1949 Graph* JSCreateLowering::graph() const { return jsgraph()->graph(); } graph() function in v8::internal::compiler::JSCreateLowering
[all...]
H A Dcommon-operator-reducer.h11 #include "src/compiler/graph-reducer.h"
28 CommonOperatorReducer(Editor* editor, Graph* graph, JSHeapBroker* broker,
56 Graph* graph() const { return graph_; } in graph() function in v8::internal::compiler::final
H A Ddead-code-elimination.h11 #include "src/compiler/graph-reducer.h"
20 // Propagates {Dead} control and {DeadValue} values through the graph and
27 // {Unreachable} nodes to the graph end, since this is much easier if there is
38 // In contrast to {DeadValue}, {Dead} can never remain in the graph.
42 DeadCodeElimination(Editor* editor, Graph* graph,
73 Graph* graph() const { return graph_; } in graph() function in v8::internal::compiler::final
/third_party/rust/crates/bindgen/bindgen/ir/analysis/
H A Dmod.rs77 /// The type of node in our dependency graph.
190 // We reverse our natural IR graph edges to find dependencies in generate_dependencies()
220 // This is our test graph:
250 // reachable from it within the test graph:
300 graph: &'a Graph,
309 fn new(graph: &'a Graph) -> ReachableFrom { in new()
310 let reversed = graph.reverse(); in new()
313 graph,
319 self.graph.0.keys().cloned().collect() in initial_worklist()
338 for sub_node in self.graph in constrain()
[all...]
/third_party/rust/crates/clap/src/util/
H A Dmod.rs5 mod graph; modules
14 pub(crate) use self::graph::ChildGraph;
/kernel/linux/linux-5.10/include/media/
H A Dmedia-entity.h24 * enum media_gobj_type - type of a graph object
43 /* Structs to represent the objects that belong to a media graph */
46 * struct media_gobj - Define a graph object.
55 * All objects on the media graph should have this struct embedded
78 * struct media_graph - Media graph traversal state
83 * @stack.entity: pointer to &struct media_entity at the graph.
102 * @graph: Media graph walk during pipeline start / stop
106 struct media_graph graph; member
110 * struct media_link - A link object part of a media graph
[all...]
/third_party/python/Lib/test/
H A Dtest_graphlib.py8 def _test_graph(self, graph, expected):
17 ts = graphlib.TopologicalSorter(graph)
20 ts = graphlib.TopologicalSorter(graph)
29 def _assert_cycle(self, graph, cycle):
31 for node, dependson in graph.items():
127 # Cycle in the middle of the graph
/third_party/node/deps/v8/src/maglev/
H A Dmaglev-code-generator.cc15 #include "src/maglev/maglev-graph-labeller.h"
16 #include "src/maglev/maglev-graph-printer.h"
17 #include "src/maglev/maglev-graph-processor.h"
18 #include "src/maglev/maglev-graph.h"
50 void PreProcessGraph(MaglevCompilationUnit*, Graph* graph) { in PreProcessGraph() argument
67 code_gen_state_->SetVregSlots(graph->stack_slots()); in PreProcessGraph()
321 Graph* graph) { in Generate()
322 return MaglevCodeGeneratorImpl(compilation_unit, graph).Generate(); in Generate()
329 MaglevCodeGeneratorImpl(MaglevCompilationUnit* compilation_unit, Graph* graph) in MaglevCodeGeneratorImpl() argument
334 graph_(graph) {} in MaglevCodeGeneratorImpl()
320 Generate(MaglevCompilationUnit* compilation_unit, Graph* graph) Generate() argument
664 Generate( MaglevCompilationUnit* compilation_unit, Graph* graph) Generate() argument
[all...]
H A Dmaglev-regalloc.cc13 #include "src/maglev/maglev-graph-labeller.h"
14 #include "src/maglev/maglev-graph-printer.h"
15 #include "src/maglev/maglev-graph-processor.h"
16 #include "src/maglev/maglev-graph.h"
81 MaglevCompilationUnit* compilation_unit, Graph* graph) in StraightForwardRegisterAllocator()
83 ComputePostDominatingHoles(graph); in StraightForwardRegisterAllocator()
84 AllocateRegisters(graph); in StraightForwardRegisterAllocator()
85 graph->set_stack_slots(top_of_stack_); in StraightForwardRegisterAllocator()
150 Graph* graph) { in ComputePostDominatingHoles()
153 for (BasicBlock* block : base::Reversed(*graph)) { in ComputePostDominatingHoles()
80 StraightForwardRegisterAllocator( MaglevCompilationUnit* compilation_unit, Graph* graph) StraightForwardRegisterAllocator() argument
149 ComputePostDominatingHoles( Graph* graph) ComputePostDominatingHoles() argument
211 AllocateRegisters(Graph* graph) AllocateRegisters() argument
[all...]
/third_party/ffmpeg/libavfilter/
H A Dinternal.h44 void ff_avfilter_graph_update_heap(AVFilterGraph *graph, AVFilterLink *link);
362 * Remove a filter from a graph;
364 void ff_filter_graph_remove_filter(AVFilterGraph *graph, AVFilterContext *filter);
373 * Run one round of processing on a filter graph.
375 int ff_filter_graph_run_once(AVFilterGraph *graph);
379 * This number is always same or less than graph->nb_threads.
/third_party/python/Lib/
H A Dgraphlib.py28 exist in the working graph.
33 of nodes, such that each node is, in the graph, an immediate predecessor of the
42 """Provides functionality to topologically sort a graph of hashable nodes"""
44 def __init__(self, graph=None):
50 if graph is not None:
51 for node, predecessors in graph.items():
60 """Add a new node and its predecessors to the graph.
69 is included among *predecessors* it will be automatically added to the graph with
87 """Mark the graph as finished and check for cycles in the graph
[all...]
/third_party/googletest/googlemock/test/
H A Dgmock-matchers-misc_test.cc495 MatchMatrix graph(nodes, nodes); in TEST_P()
497 ElementMatcherPairs matches = internal::FindMaxBipartiteMatching(graph); in TEST_P()
498 EXPECT_EQ(FindBacktrackingMaxBPM(graph).size(), matches.size()) in TEST_P()
499 << "graph: " << graph.DebugString(); in TEST_P()
500 // Check that all elements of matches are in the graph. in TEST_P()
502 std::vector<bool> seen_element(graph.LhsSize()); in TEST_P()
503 std::vector<bool> seen_matcher(graph.RhsSize()); in TEST_P()
508 EXPECT_TRUE(graph.HasEdge(ilhs, irhs)); in TEST_P()
514 } while (graph in TEST_P()
[all...]
/kernel/linux/linux-5.10/arch/csky/kernel/
H A Dperf_callchain.c27 int graph = 0; in unwind_frame_kernel() local
29 frame->lr = ftrace_graph_ret_addr(NULL, &graph, frame->lr, in unwind_frame_kernel()
79 * $ perf record -e cpu-clock --call-graph fp ./program
80 * $ perf report --call-graph
/kernel/linux/linux-6.6/arch/csky/kernel/
H A Dperf_callchain.c27 int graph = 0; in unwind_frame_kernel() local
29 frame->lr = ftrace_graph_ret_addr(NULL, &graph, frame->lr, in unwind_frame_kernel()
79 * $ perf record -e cpu-clock --call-graph fp ./program
80 * $ perf report --call-graph

Completed in 15 milliseconds

12345678910>>...13