Lines Matching refs:item
129 struct compute_memory_item *item;
136 for (item = pool->item_list; item; item = item->next) {
137 if (item->start_in_dw > -1) {
138 if (item->start_in_dw-last_end > size_in_dw) {
142 last_end = item->start_in_dw + item->size_in_dw;
161 struct compute_memory_item* item;
166 for (item = pool->item_list; item; item = item->next) {
167 if (item->next) {
168 if (item->start_in_dw < start_in_dw
169 && item->next->start_in_dw > start_in_dw) {
170 return item;
175 assert(item->start_in_dw < start_in_dw);
176 return item;
251 struct compute_memory_item *item, *next;
258 for (item = pool->item_list; item; item = item->next) {
259 COMPUTE_DBG("list: %i %p\n", item->start_in_dw, item->next);
262 for (item = pool->item_list; item; item = next) {
263 next = item->next;
266 if (item->start_in_dw == -1) {
268 end_p->next = item;
271 pending_list = item;
274 if (item->prev) {
275 item->prev->next = next;
282 next->prev = item->prev;
285 item->prev = end_p;
286 item->next = NULL;
287 end_p = item;
289 unallocated += item->size_in_dw+1024;
292 allocated += item->size_in_dw;
300 for (item = pending_list; item; item = next) {
301 next = item->next;
306 item->size_in_dw)) == -1) {
307 int64_t need = item->size_in_dw+2048 -
326 item->start_in_dw = start_in_dw;
327 item->next = NULL;
328 item->prev = NULL;
334 item->prev = pos;
335 item->next = pos->next;
336 pos->next = item;
338 if (item->next) {
339 item->next->prev = item;
343 pool->item_list = item;
346 allocated += item->size_in_dw;
353 struct compute_memory_item *item, *next;
357 for (item = pool->item_list; item; item = next) {
358 next = item->next;
360 if (item->id == id) {
361 if (item->prev) {
362 item->prev->next = item->next;
365 pool->item_list = item->next;
368 if (item->next) {
369 item->next->prev = item->prev;
372 free(item);
