Home
last modified time | relevance | path

Searched refs:GenericGraphBase (Results 1 – 7 of 7) sorted by relevance

/external/v8/src/compiler/
Dgeneric-graph.h17 class GenericGraphBase : public ZoneObject {
19 explicit GenericGraphBase(Zone* zone) : zone_(zone), next_node_id_(0) {} in GenericGraphBase() function
32 class GenericGraph : public GenericGraphBase {
35 : GenericGraphBase(zone), start_(NULL), end_(NULL) {} in GenericGraph()
Dgeneric-node.h16 class GenericGraphBase; variable
95 static S* New(GenericGraphBase* graph, int input_count, S** inputs);
98 friend class GenericGraphBase;
131 GenericNode(GenericGraphBase* graph, int input_count);
134 void AssignUniqueID(GenericGraphBase* graph);
Dgeneric-algorithm-inl.h27 static int max_id(GenericGraphBase* graph) { return graph->NodeCount(); } in max_id()
40 static int max_id(GenericGraphBase* graph) { return graph->NodeCount(); } in max_id()
Dgeneric-algorithm.h40 static void Visit(GenericGraphBase* graph, Zone* zone, in Visit()
96 static void Visit(GenericGraphBase* graph, Zone* zone, in Visit()
Dgeneric-node-inl.h19 GenericNode<B, S>::GenericNode(GenericGraphBase* graph, int input_count) in GenericNode()
30 inline void GenericNode<B, S>::AssignUniqueID(GenericGraphBase* graph) { in AssignUniqueID()
226 S* GenericNode<B, S>::New(GenericGraphBase* graph, int input_count, in New()
Dnode.h52 Node(GenericGraphBase* graph, int input_count) in Node()
Dschedule.h97 BasicBlock(GenericGraphBase* graph, int input_count) in BasicBlock()