Searched refs:next (Results 1 - 25 of 84) sorted by relevance

1234

/gem5/src/systemc/core/
H A Dpython.hh40 PythonReadyFunc *next; member in struct:sc_gem5::PythonReadyFunc
49 PythonInitFunc *next; member in struct:sc_gem5::PythonInitFunc
H A Dpython.cc60 for (auto ptr = firstReadyFunc(); ptr; ptr = ptr->next)
69 for (auto ptr = firstInitFunc(); ptr; ptr = ptr->next)
76 PythonReadyFunc::PythonReadyFunc() : next(firstReadyFunc())
81 PythonInitFunc::PythonInitFunc() : next(firstInitFunc())
/gem5/ext/libelf/
H A Delf_next.c37 off_t next; local
53 next = e->e_rawfile - parent->e_rawfile + e->e_rawsize;
54 next = (next + 1) & ~1; /* round up to an even boundary */
56 parent->e_u.e_ar.e_next = (next >= (off_t) parent->e_rawsize) ? (off_t) 0 : next;
/gem5/src/cpu/o3/
H A Ddep_graph.hh54 : inst(NULL), next(NULL)
60 DependencyEntry<DynInstPtr> *next; member in class:DependencyEntry
112 bool empty(PhysRegIndex idx) const { return !dependGraph[idx].next; }
162 curr = dependGraph[i].next;
168 curr = prev->next;
178 dependGraph[i].next = NULL;
193 new_entry->next = dependGraph[idx].next;
197 dependGraph[idx].next = new_entry;
209 DepEntry *curr = dependGraph[idx].next;
[all...]
/gem5/src/systemc/tests/tlm/multi_sockets/
H A DextensionPool.h29 next=NULL;
32 entry* next; member in struct:ExtensionPool::entry
41 e->next=unused;
56 unused=unused->next;
63 used=used->next;
83 unused=unused->next;
85 e->next=used;
93 used=e->next;
95 e->next=unused;
/gem5/ext/systemc/src/sysc/utils/
H A Dsc_hash.cpp55 sc_phash_elem* next; member in class:sc_core::sc_phash_elem
58 : key(k), contents(c), next(n) { }
59 sc_phash_elem() : key(0), contents(0), next(0) { }
107 sc_phash_elem* next; local
112 next = ptr->next;
114 ptr = next;
124 sc_phash_elem* next; local
141 next = ptr->next;
215 sc_phash_elem* next = ptr->next; local
231 sc_phash_elem* next = ptr->next; local
[all...]
H A Dsc_list.cpp47 sc_plist_elem() : data(0), prev(0), next(0)
50 data(d), prev(p), next(n)
60 sc_plist_elem* next; member in class:sc_core::sc_plist_elem
69 p = h->next;
79 p = h->next;
90 for( handle_t h = head; h != 0; h = h->next ) {
101 tail->next = q;
132 tail->next = 0;
145 head = head->next;
164 h->prev->next
[all...]
H A Dsc_mempool.cpp83 link* next; member in union:sc_core::sc_allocator::link
121 free_list = free_list->next;
134 new_block->next = (link*) block_list;
148 ((link*) p)->next = free_list;
156 for (link* b = (link*) block_list; b != 0; b = b->next)
/gem5/src/systemc/tests/tlm/nb2b_adapter/
H A Dmm.h27 free_list = free_list->next;
33 empties = empties->next;
47 access* next; member in struct:mm::access
62 free_list = free_list->next;
77 empties->next = free_list;
/gem5/src/systemc/tests/tlm/update_original/
H A Dmm.h27 free_list = free_list->next;
33 empties = empties->next;
47 access* next; member in struct:mm::access
62 free_list = free_list->next;
77 empties->next = free_list;
/gem5/ext/systemc/src/sysc/qt/
H A Dstp.c18 (re)initialization. Queue stuff: next thread in the queue
19 (next). */
24 struct stp_t *next; /* Next thread in the queue. */ member in struct:stp_t
67 q->t.next = q->tail = &q->t;
76 t = q->t.next;
77 q->t.next = t->next;
78 if (t->next == &q->t) {
91 q->tail->next = t;
92 t->next
117 stp_t *next; local
[all...]
/gem5/ext/googletest/googletest/samples/
H A Dsample3-inl.h47 // type E and a pointer to the next node.
56 // Gets the next node in the queue.
57 QueueNode* next() { return next_; } function in class:QueueNode
58 const QueueNode* next() const { return next_; } function in class:QueueNode
61 // Creates a node with a given element value. The next pointer is
87 QueueNode<E>* next = node->next(); local
90 node = next;
92 next = node->next();
[all...]
H A Dsample3_unittest.cc106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) {
/gem5/src/base/
H A Daddr_range_map.hh253 iterator next = tree.upper_bound(r);
254 if (next != end() && cond(next->first)) {
255 addNewEntryToCache(next);
256 return next;
258 if (next == begin())
260 next--;
264 i = next;
269 // Keep looking if the next range merges with the current one.
270 } while (next !
[all...]
H A Dfiber.cc178 Fiber *next = this; local
179 _currentFiber = next;
180 swapcontext(&prev->ctx, &next->ctx);
H A Dfiber.test.cc78 std::vector<Fiber *> next; member in class:SwitchingFiber
103 name(name), next(l)
118 for (auto &n : next) {
/gem5/ext/systemc/src/tlm_utils/
H A Dpeq_with_cb_and_phase.h43 struct element *next; member in struct:tlm_utils::time_ordered_list::element
67 struct element *e=empties->next;
83 empties->next=NULL;
87 empties=empties->next;
96 iterator=iterator->next;
99 e->next=list;
103 e->next=iterator;
104 ancestor->next=e;
112 list=list->next;
113 e->next
178 inline bool next(){ function in class:tlm_utils::peq_with_cb_and_phase::delta_list
[all...]
/gem5/src/systemc/ext/tlm_utils/
H A Dpeq_with_cb_and_phase.h41 struct element *next; member in struct:tlm_utils::time_ordered_list::element
64 struct element *e = empties->next;
84 empties->next=NULL;
88 empties = empties->next;
97 iterator = iterator->next;
100 e->next = list;
103 e->next = iterator;
104 ancestor->next = e;
114 list = list->next;
115 e->next
161 inline bool next() { return out < size; } function in class:tlm_utils::peq_with_cb_and_phase::delta_list
[all...]
/gem5/src/mem/cache/tags/
H A Dfa_lru.cc91 head->next = &(blks[1]);
97 blks[i].next = &(blks[i+1]);
106 tail->next = nullptr;
136 // Move the block to the tail to make it the next victim
240 assert(blk->next == nullptr);
242 tail->next = nullptr;
245 blk->prev->next = blk->next;
246 blk->next->prev = blk->prev;
250 blk->next
[all...]
/gem5/src/sim/
H A Deventq.cc107 // Since we're on the correct list, we need to point to the next list
144 Event *next = top->nextInBin; local
147 // and just remove the top item, fixing up the next bin pointer of
150 if (!next)
152 next->nextBin = top->nextBin;
153 return next;
157 // keep checking event against the next element.
158 while (event != next) {
159 if (!next)
162 curr = next;
208 Event *next = head->nextInBin; local
[all...]
/gem5/configs/example/
H A Dmemtest.py200 next = prev() variable
201 next.size = prev.size * scale
202 next.tag_latency = prev.tag_latency * 10
203 next.data_latency = prev.data_latency * 10
204 next.response_latency = prev.response_latency * 10
205 next.assoc = prev.assoc * scale
206 next.mshrs = prev.mshrs * scale
211 next.writeback_clean = not prev.writeback_clean
213 next.clusivity = 'mostly_excl'
215 next
[all...]
H A Dmemcheck.py190 next = prev() variable
191 next.size = prev.size * scale
192 next.tag_latency = prev.tag_latency * 10
193 next.data_latency = prev.data_latency * 10
194 next.response_latency = prev.response_latency * 10
195 next.assoc = prev.assoc * scale
196 next.mshrs = prev.mshrs * scale
197 cache_proto.insert(0, next)
231 # For each level, track the next subsys index to use
281 print("Error: No next
[all...]
/gem5/src/mem/
H A Dfs_translating_port_proxy.cc80 gen.next())
99 gen.next())
117 gen.next())
/gem5/src/mem/slicc/generate/
H A Dhtml.py63 # -- Proceed to next char. Yes I know that changing
65 i,c = gen.next()
/gem5/src/python/m5/util/
H A Dmultidict.py73 def next(self): member in class:multidict
78 for key,value in self.parent.next():
86 for item in self.next():
90 for key,value in self.next():
94 for key,value in self.next():

Completed in 28 milliseconds

1234