102             InsertTailList(&t->itemlist, &td->list_entry);  in load_tree()
135             InsertTailList(&t->itemlist, &td->list_entry);  in load_tree()
144     InsertTailList(&Vcb->trees, &t->list_entry);  in load_tree()
282         tree_data* td = CONTAINING_RECORD(RemoveHeadList(&t->itemlist), tree_data, list_entry);  in free_tree()
290     RemoveEntryList(&t->list_entry);  in free_tree()
328     return CONTAINING_RECORD(le, tree_data, list_entry);  in first_item()
333     LIST_ENTRY* le = td->list_entry.Blink;  in prev_item()
338     return CONTAINING_RECORD(le, tree_data, list_entry);  in prev_item()
343     LIST_ENTRY* le = td->list_entry.Flink;  in next_item()
348     return CONTAINING_RECORD(le, tree_data, list_entry);  in next_item()
716     return CONTAINING_RECORD(le, tree_data, list_entry);  in last_item()
790             tree* t = CONTAINING_RECORD(le, tree, list_entry);  in free_trees_root()
828             tree* t = CONTAINING_RECORD(le, tree, list_entry);  in free_trees()
872     InsertTailList(rollback, &ri->list_entry);  in add_rollback()
956         tree_data* td2 = CONTAINING_RECORD(le, tree_data, list_entry);
965         InsertHeadList(&tp.tree->itemlist, &td->list_entry);
977 …InsertHeadList(tp.item->list_entry.Blink, &td->list_entry); // make sure non-deleted item is befor…
979         InsertHeadList(&tp.item->list_entry, &td->list_entry);
1054         rollback_item* ri = CONTAINING_RECORD(le, rollback_item, list_entry);  in clear_rollback()
1079         ri = CONTAINING_RECORD(le, rollback_item, list_entry);  in do_rollback()
1183                         rollback_item* ri2 = CONTAINING_RECORD(le2, rollback_item, list_entry);  in do_rollback()
1198                                 RemoveEntryList(&ri2->list_entry);  in do_rollback()
1237         if (pi->list_entry.Flink != &p->parent->itemlist) {  in find_tree_end()
1238             tree_data* td = CONTAINING_RECORD(pi->list_entry.Flink, tree_data, list_entry);  in find_tree_end()
1255         batch_root* br = CONTAINING_RECORD(le, batch_root, list_entry);  in clear_batch_list()
1258 …atch_item_ind* bii = CONTAINING_RECORD(RemoveHeadList(&br->items_ind), batch_item_ind, list_entry);  in clear_batch_list()
1261 …           batch_item* bi = CONTAINING_RECORD(RemoveHeadList(&bii->items), batch_item, list_entry);  in clear_batch_list()
1307     le = bi->list_entry.Flink;  in add_delete_inode_extref()
1309         batch_item* bi3 = CONTAINING_RECORD(le, batch_item, list_entry);  in add_delete_inode_extref()
1312             InsertHeadList(le->Blink, &bi2->list_entry);  in add_delete_inode_extref()
1319     InsertTailList(listhead, &bi2->list_entry);  in add_delete_inode_extref()
1482                         le = bi->list_entry.Flink;  in handle_batch_collision()
1484                             batch_item* bi3 = CONTAINING_RECORD(le, batch_item, list_entry);  in handle_batch_collision()
1487                                 InsertHeadList(le->Blink, &bi2->list_entry);  in handle_batch_collision()
1495                             InsertTailList(listhead, &bi2->list_entry);  in handle_batch_collision()
1601                                 InsertHeadList(td->list_entry.Blink, &td2->list_entry);  in handle_batch_collision()
1688                                 InsertHeadList(td->list_entry.Blink, &td2->list_entry);  in handle_batch_collision()
1782                                 InsertHeadList(td->list_entry.Blink, &td2->list_entry);  in handle_batch_collision()
1853                                 InsertHeadList(td->list_entry.Blink, &td2->list_entry);  in handle_batch_collision()
1896             InsertHeadList(td->list_entry.Blink, &newtd->list_entry);  in handle_batch_collision()
1920 …atch_item_ind* bii = CONTAINING_RECORD(RemoveHeadList(&br->items_ind), batch_item_ind, list_entry);
1932         batch_item* bi = CONTAINING_RECORD(le, batch_item, list_entry);
1969                 le2 = tp.item->list_entry.Flink;
1971                     td = CONTAINING_RECORD(le2, tree_data, list_entry);
1998                     le2 = &tp.item->list_entry;
2000                         td = CONTAINING_RECORD(le2, tree_data, list_entry);
2046                 le2 = tp.item->list_entry.Flink;
2048                     td = CONTAINING_RECORD(le2, tree_data, list_entry);
2075                     le2 = &tp.item->list_entry;
2077                         td = CONTAINING_RECORD(le2, tree_data, list_entry);
2108                 le2 = tp.item->list_entry.Flink;
2110                     td = CONTAINING_RECORD(le2, tree_data, list_entry);
2137                     le2 = &tp.item->list_entry;
2139                         td = CONTAINING_RECORD(le2, tree_data, list_entry);
2181                     InsertHeadList(&tp.tree->itemlist, &td->list_entry);
2196                         InsertHeadList(tp.item->list_entry.Blink, &td->list_entry);
2212                 InsertHeadList(&tp.item->list_entry, &td->list_entry);
2228             while (listhead->list_entry.Blink != &tp.tree->itemlist) {
2229 …          tree_data* prevtd = CONTAINING_RECORD(listhead->list_entry.Blink, tree_data, list_entry);
2239                 batch_item* bi2 = CONTAINING_RECORD(le2, batch_item, list_entry);
2267                     le3 = &listhead->list_entry;
2269                         tree_data* td2 = CONTAINING_RECORD(le3, tree_data, list_entry);
2276                                     InsertHeadList(le3->Blink, &td->list_entry);
2296                                 InsertHeadList(le3->Blink, &td->list_entry);
2309                             InsertTailList(&tp.tree->itemlist, &td->list_entry);
2321                     while (listhead->list_entry.Blink != &tp.tree->itemlist) {
2322 …          tree_data* prevtd = CONTAINING_RECORD(listhead->list_entry.Blink, tree_data, list_entry);
2355         batch_item* bi = CONTAINING_RECORD(RemoveHeadList(&items), batch_item, list_entry);
2373         batch_root* br2 = CONTAINING_RECORD(le, batch_root, list_entry);