Searched refs:new_node (Results 1 - 5 of 5) sorted by relevance

/gem5/src/base/
H A Dtrie.hh219 Node *new_node; local
222 new_node = new Node(key, new_mask, val);
223 new_node->parent = node;
224 kid = new_node;
225 return new_node;
245 new_node = new Node(key, cur_mask, NULL);
246 new_node->parent = node;
247 kid->parent = new_node;
248 new_node->kids[0] = kid;
249 kid = new_node;
[all...]
/gem5/ext/googletest/googletest/samples/
H A Dsample3-inl.h117 QueueNode<E>* new_node = new QueueNode<E>(element); local
120 head_ = last_ = new_node;
123 last_->next_ = new_node;
124 last_ = new_node;
/gem5/ext/mcpat/regression/
H A Dverify_output.py186 new_node = Component()
188 root = new_node
189 curr_node = new_node
202 new_node.set_name_and_level(line)
204 (new_node.hierarchy_level <= curr_node.hierarchy_level) and
207 new_node.parent = curr_node
208 curr_node.children.append(new_node)
209 curr_node = new_node
/gem5/src/cpu/trace/
H A Dtrace_cpu.cc367 GraphNode* new_node = new GraphNode; local
372 if (!trace.read(new_node)) {
379 addDepsOnParent(new_node, new_node->robDep, new_node->numRobDep);
382 addDepsOnParent(new_node, new_node->regDep, new_node->numRegDep);
386 depGraph[new_node->seqNum] = new_node;
401 addDepsOnParent(GraphNode *new_node, T& dep_array, uint8_t& num_dep) argument
891 occupy(const GraphNode* new_node) argument
[all...]
H A Dtrace_cpu.hh717 void occupy(const GraphNode* new_node);
735 bool isAvailable(const GraphNode* new_node) const;
911 * @param new_node new node to add to the graph
917 template<typename T> void addDepsOnParent(GraphNode *new_node,

Completed in 13 milliseconds