| /external/chromium_org/v8/src/compiler/ |
| change-lowering.cc | 8 #include "src/compiler/js-graph.h"
18 Node* control = graph()->start();
71 Node* effect = graph()->NewNode(common()->ValueEffect(1), value);
77 Node* heap_number = graph()->NewNode(
81 Node* store = graph()->NewNode(
84 return graph()->NewNode(common()->Finish(1), heap_number, store);
89 value = graph()->NewNode(machine()->WordSar(), value, SmiShiftBitsConstant());
91 value = graph()->NewNode(machine()->TruncateInt64ToInt32(), value);
98 return graph()->NewNode(machine()->Load(kMachFloat64), value,
100 graph()->NewNode(common()->ControlEffect(), control))
242 Graph* ChangeLowering::graph() const { return jsgraph()->graph(); } function in class:v8::internal::compiler::ChangeLowering
[all...] |
| machine-operator-reducer.cc | 9 #include "src/compiler/graph.h"
10 #include "src/compiler/js-graph.h"
25 return graph()->NewNode(common()->Float32Constant(value));
40 return graph()->NewNode(common()->Int64Constant(value));
500 Graph* MachineOperatorReducer::graph() const { return jsgraph()->graph(); } function in class:v8::internal::compiler::MachineOperatorReducer
|
| raw-machine-assembler.h | 11 #include "src/compiler/graph-builder.h"
47 RawMachineAssembler(Graph* graph, MachineSignature* machine_sig,
52 Zone* zone() const { return graph()->zone(); }
|
| verifier.cc | 13 #include "src/compiler/graph-inl.h"
14 #include "src/compiler/graph.h"
141 // Dead is never connected to the graph.
237 void Verifier::Run(Graph* graph) {
238 Visitor visitor(graph->zone());
240 CHECK_NE(NULL, graph->start());
242 graph->VisitNodeUsesFromStart(&visitor);
243 CHECK_NE(NULL, graph->end());
245 graph->VisitNodeInputsFromEnd(&visitor)
[all...] |
| js-typed-lowering.cc | 6 #include "src/compiler/graph-inl.h"
25 // TODO(turbofan): replace the effect input to {node} with {graph->start()}.
72 node_->ReplaceInput(1, graph()->NewNode(machine()->Word32And(), rnum,
103 Node* value = graph()->NewNode(simplified()->BooleanNot(), node_);
135 Graph* graph() { return lowering_->graph(); } function in class:v8::internal::compiler::JSBinopReduction
150 Node* n = graph()->NewNode(javascript()->ToString(), node, context(),
160 Node* n = graph()->NewNode(javascript()->ToNumber(), node, context(),
214 Node* n = graph()->NewNode(op, node)
[all...] |
| /external/chromium_org/v8/test/cctest/compiler/ |
| test-js-constant-cache.cc | 7 #include "src/compiler/js-graph.h"
25 Graph main_graph_;
|
| test-js-context-specialization.cc | 13 #include "test/cctest/compiler/graph-builder-tester.h"
22 : DirectGraphBuilder(new (main_zone()) Graph(main_zone())),
28 jsgraph_(graph(), common(), &javascript_, &typer_, &machine_),
53 t.graph()->SetStart(start);
125 t.graph()->SetStart(start);
195 t.graph()->SetStart(start);
229 t.graph()->SetEnd(end);
231 // Double check the above graph is what we expect, or the test is broken.
235 // Perform the substitution on the entire graph.
|
| test-phi-reducer.cc | 9 #include "src/compiler/graph-inl.h"
20 graph(main_zone()),
21 self(graph.NewNode(common.Start(num_parameters))),
22 dead(graph.NewNode(common.Dead())) {
23 graph.SetStart(self);
28 Graph graph; member in class:PhiReducerTester
44 return graph.NewNode(common.Int32Constant(val));
48 return graph.NewNode(common.Float64Constant(val));
52 return graph.NewNode(common.Parameter(index), graph.start())
[all...] |
| test-representation-change.cc | 9 #include "test/cctest/compiler/graph-builder-tester.h"
32 Node* s = graph()->NewNode(common()->Start(num_parameters));
33 graph()->SetStart(s);
42 Graph* graph() { return main_graph_; } function in class:v8::internal::compiler::RepresentationChangerTester
68 return graph()->NewNode(common()->Parameter(index), graph()->start());
|
| test-instruction.cc | 10 #include "src/compiler/graph.h"
31 graph(zone()),
41 Graph graph; member in class:InstructionTester
57 code = new TestInstrSeq(&linkage, &graph, &schedule);
61 Node* node = graph.NewNode(common.Int32Constant(val));
67 Node* node = graph.NewNode(common.Float64Constant(val));
73 Node* node = graph.NewNode(common.Parameter(which));
79 Node* node = graph.NewNode(common.Int32Constant(111));
103 R.Int32Constant(i); // Add some nodes to the graph
[all...] |
| test-machine-operator-reducer.cc | 8 #include "src/compiler/graph-inl.h"
9 #include "src/compiler/js-graph.h"
57 graph(main_zone()),
60 jsgraph(&graph, &common, &javascript, &typer, &machine),
62 Node* s = graph.NewNode(common.Start(num_parameters));
63 graph.SetStart(s);
71 Graph graph; member in class:ReducerTester
79 return graph.NewNode(NewConstantOperator<T>(&common, value));
99 Node* n = graph.NewNode(binop, a, b)
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| ScheduleDAG.h | 41 template<class Graph> class GraphWriter;
268 // Preds/Succs - The SUnits before/after us in the graph.
|
| /external/clang/include/clang/Analysis/ |
| CFG.h | [all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_peephole.cpp | [all...] |
| nv50_ir_lowering_nv50.cpp | 713 currBB->cfg.attach(&texiBB->cfg, Graph::Edge::FORWARD);
716 currBB->cfg.attach(&laneBB->cfg, Graph::Edge::TREE);
|
| nv50_ir_emit_nv50.cpp | [all...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_peephole.cpp | [all...] |
| nv50_ir_lowering_nv50.cpp | 713 currBB->cfg.attach(&texiBB->cfg, Graph::Edge::FORWARD);
716 currBB->cfg.attach(&laneBB->cfg, Graph::Edge::TREE);
|
| nv50_ir_emit_nv50.cpp | [all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nvc0/codegen/ |
| nv50_ir_emit_nvc0.cpp | [all...] |
| /external/mesa3d/src/gallium/drivers/nvc0/codegen/ |
| nv50_ir_emit_nvc0.cpp | [all...] |
| /external/llvm/lib/CodeGen/ |
| MachineFunction.cpp | 387 const MachineFunction *Graph) {
[all...] |
| /external/opencv/cvaux/include/ |
| cvaux.h | 312 CvGraph* graph; member in struct:CvCliqueFinder
314 int N; //graph size
342 /*CVAPI(void) cvStartFindCliques( CvGraph* graph, CvCliqueFinder* finder, int reverse,
347 CVAPI(void) cvBronKerbosch( CvGraph* graph );*/
353 // Purpose: finds weight of subgraph in a graph
356 // graph - input graph.
364 // weight_vtx - optional vector of floats, with size = graph->total.
368 // that vertices of graph are inherited from CvGraphWeightedVtx.
369 // weight_edge - optional matrix of floats, of width and height = graph->total
[all...] |
| /external/srec/tools/grxmlcompile/ |
| grxmldoc.cpp | 27 #include "grph.h" // The word graph object and interface
28 #include "sub_grph.h" // The sub-graph object and interface
123 // Create the container for the word graph.
127 m_pGraph = new Graph("XML grammar");
439 // Create a Word Graph node for each rule node
636 // We can now treat a forward-referenced graph as if it was defined.
715 // not in subgraph but in graph?!
716 //graph.BeginCount(n);
1141 printf ("\nCreating semantic graph file\n");
[all...] |
| /external/chromium_org/v8/test/cctest/ |
| test-regexp.cc | [all...] |
