Home
last modified time | relevance | path

Searched refs:new_entry (Results 1 – 9 of 9) sorted by relevance

/external/fio/
Dflist.h46 static inline void __flist_add(struct flist_head *new_entry, in __flist_add() argument
50 next->prev = new_entry; in __flist_add()
51 new_entry->next = next; in __flist_add()
52 new_entry->prev = prev; in __flist_add()
53 prev->next = new_entry; in __flist_add()
64 static inline void flist_add(struct flist_head *new_entry, in flist_add() argument
67 __flist_add(new_entry, head, head->next); in flist_add()
70 static inline void flist_add_tail(struct flist_head *new_entry, in flist_add_tail() argument
73 __flist_add(new_entry, head->prev, head); in flist_add_tail()
/external/skia/tools/
Djsondiff.py147 new_entry = {}
148 new_entry['old'] = old_dict.get(key)
149 new_entry['new'] = new_dict.get(key)
150 diff_dict[key] = new_entry
/external/chromium-trace/catapult/devil/devil/utils/
Dlsusb.py69 new_entry = {
73 cur[m.group(1)] = new_entry
74 depth_stack.append(new_entry)
/external/bison/lib/
Dhash.c913 struct hash_entry *new_entry = allocate_entry (dst); in transfer_entries() local
915 if (new_entry == NULL) in transfer_entries()
918 new_entry->data = data; in transfer_entries()
919 new_entry->next = new_bucket->next; in transfer_entries()
920 new_bucket->next = new_entry; in transfer_entries()
1096 struct hash_entry *new_entry = allocate_entry (table); in hash_insert_if_absent() local
1098 if (new_entry == NULL) in hash_insert_if_absent()
1103 new_entry->data = (void *) entry; in hash_insert_if_absent()
1104 new_entry->next = bucket->next; in hash_insert_if_absent()
1105 bucket->next = new_entry; in hash_insert_if_absent()
/external/e2fsprogs/lib/ext2fs/
Ddblist.c162 struct ext2_db_entry2 *new_entry; in ext2fs_add_dir_block2() local
179 new_entry = dblist->list + ( dblist->count++); in ext2fs_add_dir_block2()
180 new_entry->blk = blk; in ext2fs_add_dir_block2()
181 new_entry->ino = ino; in ext2fs_add_dir_block2()
182 new_entry->blockcnt = blockcnt; in ext2fs_add_dir_block2()
/external/wpa_supplicant_8/src/rsn_supp/
Dpmksa_cache.c347 struct rsn_pmksa_cache_entry *new_entry; in pmksa_cache_clone_entry() local
349 new_entry = pmksa_cache_add(pmksa, old_entry->pmk, old_entry->pmk_len, in pmksa_cache_clone_entry()
353 if (new_entry == NULL) in pmksa_cache_clone_entry()
357 new_entry->expiration = old_entry->expiration; in pmksa_cache_clone_entry()
358 new_entry->opportunistic = 1; in pmksa_cache_clone_entry()
360 return new_entry; in pmksa_cache_clone_entry()
/external/v8/src/compiler/
Dloop-peeling.cc229 Node* new_entry; in Peel() local
258 new_entry = merge; in Peel()
265 new_entry = peeling.map(loop_node->InputAt(1)); in Peel()
267 loop_node->ReplaceInput(0, new_entry); in Peel()
/external/v8/src/crankshaft/
Dhydrogen-check-elimination.cc181 HCheckTableEntry* new_entry = &copy->entries_[i]; in Copy() local
182 new_entry->object_ = old_entry->object_; in Copy()
183 new_entry->maps_ = old_entry->maps_; in Copy()
184 new_entry->state_ = old_entry->state_; in Copy()
188 new_entry->check_ = old_entry->check_; in Copy()
192 new_entry->check_ = NULL; in Copy()
/external/v8/src/
Dobjects.cc18776 int new_entry = nof + table->NumberOfDeletedElements(); in Add() local
18777 int new_index = table->EntryToIndex(new_entry); in Add()
18781 table->set(kHashTableStartIndex + bucket, Smi::FromInt(new_entry)); in Add()
18799 int new_entry = 0; in Rehash() local
18812 new_table->set(kHashTableStartIndex + bucket, Smi::FromInt(new_entry)); in Rehash()
18813 int new_index = new_table->EntryToIndex(new_entry); in Rehash()
18820 ++new_entry; in Rehash()