Lines Matching refs:prev
71 bo->prev = NULL;
106 /* NOTE: All nodes on free rbtree have a 'prev' that points to NULL.
116 * yes: change the related 'next/prev' pointer,
122 temp_bo->next->prev = this;
124 temp_bo->prev = NULL;
195 bo->prev = this;
198 this->next->prev = bo;
272 * 1. if bo->next && bo->prev == NULL, bo is a rbtree node
276 if (!bo->prev && !bo->next) {
278 /* 2. when bo->next != NULL && bo->prev == NULL, bo is a rbtree node,
283 } else if (!bo->prev && bo->next) {
284 bo->next->prev = NULL;
288 /* 3. when bo->prev != NULL && bo->next == NULL, bo is not a rbtree
290 * node, to take off this bo, we just need set the "prev/next"
293 } else if (bo->prev && !bo->next) {
294 bo->prev->next = NULL;
295 bo->prev = NULL;
296 /* 4. when bo->prev != NULL && bo->next != NULL ,bo is not a rbtree
298 * to take off this bo, we just set take the "prev/next" pointers
301 } else if (bo->prev && bo->next) {
302 bo->next->prev = bo->prev;
303 bo->prev->next = bo->next;
305 bo->prev = NULL;
478 prev_bo = list_entry(bo->list.prev, struct hmm_buffer_object, list);
481 if (bo->list.prev != &bdev->entire_bo_list &&