HomeSort by relevance Sort by last modified time
    Searched refs:GenericNode (Results 1 - 5 of 5) sorted by null

  /external/chromium_org/v8/src/compiler/
generic-node.h 20 // A GenericNode<> is the basic primitive of graphs. GenericNode's are
24 // Specializations of the templatized GenericNode<> class must provide a base
26 // specialized Node instance. GenericNode uses a mixin template pattern to
28 // rather than the GenericNode<B, S> type.
30 class GenericNode : public B {
41 inline void ReplaceInput(int index, GenericNode* new_input);
42 inline void AppendInput(Zone* zone, GenericNode* new_input);
43 inline void InsertInput(Zone* zone, int index, GenericNode* new_input);
55 inline void ReplaceUses(GenericNode* replace_to)
    [all...]
generic-node-inl.h 19 GenericNode<B, S>::GenericNode(GenericGraphBase* graph, int input_count)
30 inline void GenericNode<B, S>::AssignUniqueID(GenericGraphBase* graph) {
35 inline typename GenericNode<B, S>::Inputs::iterator
36 GenericNode<B, S>::Inputs::begin() {
37 return typename GenericNode<B, S>::Inputs::iterator(this->node_, 0);
41 inline typename GenericNode<B, S>::Inputs::iterator
42 GenericNode<B, S>::Inputs::end() {
43 return typename GenericNode<B, S>::Inputs::iterator(
48 inline typename GenericNode<B, S>::Uses::iterato
    [all...]
generic-algorithm.h 104 Control Pre(GenericNode<B, S>* node) { return CONTINUE; }
105 Control Post(GenericNode<B, S>* node) { return CONTINUE; }
106 void PreEdge(GenericNode<B, S>* from, int index, GenericNode<B, S>* to) {}
107 void PostEdge(GenericNode<B, S>* from, int index, GenericNode<B, S>* to) {}
node.h 50 class Node FINAL : public GenericNode<NodeData, Node> {
53 : GenericNode<NodeData, Node>(graph, input_count) {}
schedule.h 95 class BasicBlock FINAL : public GenericNode<BasicBlockData, BasicBlock> {
98 : GenericNode<BasicBlockData, BasicBlock>(graph, input_count) {}

Completed in 70 milliseconds