Lines Matching defs:CG
42 // The analysis requires construction of a "connection graph" (CG) for
49 // The CG contains 3 types of edges:
57 // PointsTo(n) - n is any CG node, it returns the set of JO that n could
171 inline PointsToNode(ConnectionGraph* CG, Node* n, EscapeState es, NodeType type);
241 LocalVarNode(ConnectionGraph *CG, Node* n, EscapeState es):
242 PointsToNode(CG, n, es, LocalVar) {}
247 JavaObjectNode(ConnectionGraph *CG, Node* n, EscapeState es):
248 PointsToNode(CG, n, es, JavaObject) {
260 FieldNode(ConnectionGraph *CG, Node* n, EscapeState es, int offs, bool is_oop):
261 PointsToNode(CG, n, es, Field),
282 ArraycopyNode(ConnectionGraph *CG, Node* n, EscapeState es):
283 PointsToNode(CG, n, es, Arraycopy) {}
344 Unique_Node_List ideal_nodes; // Used by CG construction and types splitting.
518 if (delayed_worklist != NULL) { // First iteration of CG construction
601 inline PointsToNode::PointsToNode(ConnectionGraph *CG, Node* n, EscapeState es, NodeType type):
602 _edges(CG->_compile->comp_arena(), 2, 0, NULL),
603 _uses (CG->_compile->comp_arena(), 2, 0, NULL),
606 _pidx(CG->next_pidx()),