Lines Matching defs:zone
11 Node::OutOfLineInputs* Node::OutOfLineInputs::New(Zone* zone, int capacity) {
15 reinterpret_cast<intptr_t>(zone->Allocate<Node::OutOfLineInputs>(size));
58 Node* Node::NewImpl(Zone* zone, NodeId id, const Operator* op, int input_count,
60 // Node uses compressed pointers, so zone must support pointer compression.
61 DCHECK_IMPLIES(kCompressGraphZone, zone->supports_compression());
81 OutOfLineInputs* outline = OutOfLineInputs::New(zone, capacity);
84 void* node_buffer = zone->Allocate<NodeWithOutOfLineInputs>(
106 reinterpret_cast<intptr_t>(zone->Allocate<NodeWithInLineInputs>(size));
131 Node* Node::New(Zone* zone, NodeId id, const Operator* op, int input_count,
133 return NewImpl(zone, id, op, input_count, inputs, has_extensible_inputs);
136 Node* Node::Clone(Zone* zone, NodeId id, const Node* node) {
141 Node* const clone = NewImpl(zone, id, node->op(), input_count, inputs, false);
154 void Node::AppendInput(Zone* zone, Node* new_to) {
155 DCHECK_NOT_NULL(zone);
175 outline = OutOfLineInputs::New(zone, input_count * 2 + 3);
185 outline = OutOfLineInputs::New(zone, input_count * 2 + 3);
203 void Node::InsertInput(Zone* zone, int index, Node* new_to) {
204 DCHECK_NOT_NULL(zone);
207 AppendInput(zone, InputAt(InputCount() - 1));
215 void Node::InsertInputs(Zone* zone, int index, int count) {
216 DCHECK_NOT_NULL(zone);
221 AppendInput(zone, InputAt(std::max(InputCount() - count, 0)));
274 void Node::EnsureInputCount(Zone* zone, int new_input_count) {
282 AppendInput(zone, dummy);