Cross Reference: /external/v8/src/compiler/control-equivalence.h

Lines Matching refs:node
10 #include "src/compiler/node.h"
43   // Run the main algorithm starting from the {exit} control node. This causes
52   size_t ClassOf(Node* node) {
53     DCHECK_NE(kInvalidClass, GetClass(node));
54     return GetClass(node);
69   // The set of brackets for each node during the DFS walk.
76     Node* parent_node;                 // Parent node of entry during DFS walk.
77     Node* node;                        // Node that this stack entry belongs to.
84     size_t class_number;  // Equivalence class number assigned to node.
85     size_t dfs_number;    // Pre-order DFS number assigned to node.
86     bool visited;         // Indicates node has already been visited.
87     bool on_stack;        // Indicates node is on DFS stack during walk.
88     bool participates;    // Indicates node participates in DFS walk.
89     BracketList blist;    // List of brackets per node.
92   // The per-node data computed during the DFS walk.
96   void VisitPre(Node* node);
99   void VisitMid(Node* node, DFSDirection direction);
102   void VisitPost(Node* node, Node* parent_node, DFSDirection direction);
123   void DetermineParticipationEnqueue(ZoneQueue<Node*>& queue, Node* node);
127   NodeData* GetData(Node* node) { return &node_data_[node->id()]; }
131   // Template used to initialize per-node data.
136   // Accessors for the DFS number stored within the per-node data.
137   size_t GetNumber(Node* node) { return GetData(node)->dfs_number; }
138   void SetNumber(Node* node, size_t number) {
139     GetData(node)->dfs_number = number;
142   // Accessors for the equivalence class stored within the per-node data.
143   size_t GetClass(Node* node) { return GetData(node)->class_number; }
144   void SetClass(Node* node, size_t number) {
145     GetData(node)->class_number = number;
148   // Accessors for the bracket list stored within the per-node data.
149   BracketList& GetBracketList(Node* node) { return GetData(node)->blist; }
150   void SetBracketList(Node* node, BracketList& list) {
151     GetData(node)->blist = list;
155   void DFSPush(DFSStack& stack, Node* node, Node* from, DFSDirection dir);
158   void DFSPop(DFSStack& stack, Node* node);
167   Data node_data_;    // Per-node data stored as a side-table.