Searched refs:new_item (Results 1 – 12 of 12) sorted by relevance
149 int ListWrapper::Insert(ListItem* existing_previous_item, ListItem* new_item) in Insert() argument151 if (!new_item) in Insert()165 PushBackImpl(new_item); in Insert()169 new_item->next_ = existing_previous_item->next_; in Insert()170 new_item->prev_ = existing_previous_item; in Insert()171 existing_previous_item->next_ = new_item; in Insert()174 next_item->prev_ = new_item; in Insert()178 last_ = new_item; in Insert()185 ListItem* new_item) in InsertBefore() argument187 if (!new_item) in InsertBefore()[all …]
76 MapNoStlItem* new_item = new MapNoStlItem(id, ptr); in Insert() local83 first_ = new_item; in Insert()84 last_ = new_item; in Insert()95 new_item->next_ = item; in Insert()96 item->prev_ = new_item; in Insert()99 first_ = new_item; in Insert()103 new_item->prev_ = item->prev_; in Insert()104 new_item->prev_->next_ = new_item; in Insert()111 item->next_ = new_item; in Insert()112 new_item->prev_ = item; in Insert()[all …]
181 ListItem* new_item) in Insert() argument191 if (!new_item) in Insert()206 list_.insert(insert_location,new_item); in Insert()211 ListItem* new_item) in InsertBefore() argument220 if (!new_item) in InsertBefore()231 list_.insert(insert_location,new_item); in InsertBefore()
57 int Insert(ListItem* existing_previous_item, ListItem* new_item);58 int InsertBefore(ListItem* existing_next_item, ListItem* new_item);
67 ListItem* new_item) { in Insert() argument68 const int retval = list_.Insert(existing_previous_item, new_item); in Insert()70 EXPECT_TRUE(DestroyListItem(new_item)); in Insert()76 ListItem* new_item) { in InsertBefore() argument77 const int retval = list_.InsertBefore(existing_next_item, new_item); in InsertBefore()79 EXPECT_TRUE(DestroyListItem(new_item)); in InsertBefore()
62 ListNoStlItem* new_item);65 ListNoStlItem* new_item);
391 struct compute_memory_item *new_item; in compute_memory_alloc() local395 new_item = (struct compute_memory_item *) in compute_memory_alloc()397 new_item->size_in_dw = size_in_dw; in compute_memory_alloc()398 new_item->start_in_dw = -1; /* mark pending */ in compute_memory_alloc()399 new_item->id = pool->next_id++; in compute_memory_alloc()400 new_item->pool = pool; in compute_memory_alloc()408 last_item->next = new_item; in compute_memory_alloc()409 new_item->prev = last_item; in compute_memory_alloc()412 pool->item_list = new_item; in compute_memory_alloc()415 return new_item; in compute_memory_alloc()
81 struct cil_list_item *new_item = cil_malloc(sizeof(*new_item)); in cil_list_item_init() local82 new_item->next = NULL; in cil_list_item_init()83 new_item->flavor = CIL_NONE; in cil_list_item_init()84 new_item->data = NULL; in cil_list_item_init()86 *item = new_item; in cil_list_item_init()
87 ListItem* new_item);94 ListItem* new_item);
165 ListItem* new_item = new ListItem(reinterpret_cast<void*>(&element_array[0])); in main() local166 FailTest(test_list.Insert(NULL,new_item) != 0); in main()
82 if ((method->new_item != NULL) && !method->new_item(ret)) in X509_LOOKUP_new()
140 int (*new_item)(X509_LOOKUP *ctx); member