Lines Matching refs:NewNode
41 Node* call = graph()->NewNode(common()->Call(kCallDescriptor), p0, p1, in TEST_F()
43 Node* if_success = graph()->NewNode(common()->IfSuccess(), call); in TEST_F()
44 Node* ret = graph()->NewNode(common()->Return(), call, call, if_success); in TEST_F()
63 Node* call = graph()->NewNode(common()->Call(kCallDescriptor), p0, p1, in TEST_F()
65 Node* if_success = graph()->NewNode(common()->IfSuccess(), call); in TEST_F()
66 Node* if_exception = graph()->NewNode( in TEST_F()
68 Node* ret = graph()->NewNode(common()->Return(), call, call, if_success); in TEST_F()
69 Node* end = graph()->NewNode(common()->End(1), if_exception); in TEST_F()
89 Node* call = graph()->NewNode(common()->Call(kCallDescriptor), p0, p1, in TEST_F()
91 Node* if_success = graph()->NewNode(common()->IfSuccess(), call); in TEST_F()
92 Node* ret = graph()->NewNode(common()->Return(), call, call, if_success); in TEST_F()
113 Node* call = graph()->NewNode(common()->Call(kCallDescriptor), p0, p1, in TEST_F()
115 Node* if_success = graph()->NewNode(common()->IfSuccess(), call); in TEST_F()
116 Node* ret = graph()->NewNode(common()->Return(), call, call, if_success); in TEST_F()
135 Node* call = graph()->NewNode(common()->Call(kCallDescriptor), p0, p1, in TEST_F()
137 Node* if_success = graph()->NewNode(common()->IfSuccess(), call); in TEST_F()
138 Node* if_exception = graph()->NewNode( in TEST_F()
140 Node* ret = graph()->NewNode(common()->Return(), call, call, if_success); in TEST_F()
141 Node* end = graph()->NewNode(common()->End(1), if_exception); in TEST_F()
161 Node* call = graph()->NewNode(common()->Call(kCallDescriptor), p0, p1, in TEST_F()
163 Node* if_success = graph()->NewNode(common()->IfSuccess(), call); in TEST_F()
164 Node* ret = graph()->NewNode(common()->Return(), call, call, if_success); in TEST_F()