Lines Matching +defs:entry +defs:start
28 vtd_table_entry_t entry;
38 entry = bf->tables[0][next];
39 vtassert(entry.free.free);
40 next = entry.free.next;
46 vtd_bchunk_free(vtd_space_t * bf, vtd_baddr_t start, vtd_baddr_t size)
48 vtd_table_entry_t entry;
51 vtassert(start < (1U << bf->bheads_count));
52 // vtd_space_fault(bf, start, 1);
58 bf->tables[0][next].free.prev = start;
60 entry.bits = 0;
61 entry.free.free = 1;
62 entry.free.size = size;
63 entry.free.prev = size;
64 entry.free.next = next;
65 bf->tables[0][start] = entry;
66 bf->bheads[size].free.next = start;
74 vtd_table_entry_t entry;
89 entry = bf->tables[0][buddy];
90 if (!entry.free.free) break;
91 if (entry.free.size != list) break;
93 vtassert(entry.free.prev < (1U << bf->bheads_count));
94 bf->tables[0][entry.free.prev].free.next = entry.free.next;
95 vtassert(entry.free.next < (1U << bf->bheads_count));
96 bf->tables[0][entry.free.next].free.prev = entry.free.prev;
118 vtd_table_entry_t entry;
134 entry = bf->tables[0][addr];
135 entry.free.free = 0;
139 next = entry.free.next;
179 vtd_table_entry_t entry;
185 vtd_baddr_t start;
195 entry = bf->tables[0][chunk];
196 next = entry.free.next;
198 start = (chunk < addr) ? addr : chunk;
201 if (finish > start)
204 vtassert(entry.free.prev < (1U << bf->bheads_count));
205 bf->tables[0][entry.free.prev].free.next = next;
207 bf->tables[0][next].free.prev = entry.free.prev;
210 // vtd_space_fault(bf, start, finish - start);
211 for (head = start; head < finish; head++)
219 if (1) while (head != start)
221 rem = vtd_log2down(start - head);