| /external/e2fsprogs/lib/ss/ |
| D | invocation.c | 31 register ss_data *new_table; local
36 new_table = (ss_data *) malloc(sizeof(ss_data));
49 table[sci_idx] = new_table;
51 new_table->subsystem_name = subsystem_name;
52 new_table->subsystem_version = version_string;
53 new_table->argv = (char **)NULL;
54 new_table->current_request = (char *)NULL;
55 new_table->info_dirs = (char **)malloc(sizeof(char *));
56 *new_table->info_dirs = (char *)NULL;
57 new_table->info_ptr = info_ptr;
[all …]
|
| /external/bison/lib/ |
| D | hash.c | 946 Hash_table *new_table; in hash_rehash() local
953 new_table = &storage; in hash_rehash()
954 new_table->bucket = calloc (new_size, sizeof *new_table->bucket); in hash_rehash()
955 if (new_table->bucket == NULL) in hash_rehash()
957 new_table->n_buckets = new_size; in hash_rehash()
958 new_table->bucket_limit = new_table->bucket + new_size; in hash_rehash()
959 new_table->n_buckets_used = 0; in hash_rehash()
960 new_table->n_entries = 0; in hash_rehash()
961 new_table->tuning = table->tuning; in hash_rehash()
962 new_table->hasher = table->hasher; in hash_rehash()
[all …]
|
| /external/valgrind/main/callgrind/ |
| D | jumps.c | 88 jCC** new_table; in resize_jcc_table() local
93 new_table = (jCC**) CLG_MALLOC("cl.jumps.rjt.1", in resize_jcc_table()
96 if (!new_table) return; in resize_jcc_table()
99 new_table[i] = NULL; in resize_jcc_table()
111 curr_jcc->next_hash = new_table[new_idx]; in resize_jcc_table()
112 new_table[new_idx] = curr_jcc; in resize_jcc_table()
131 current_jccs.table = new_table; in resize_jcc_table()
|
| D | bb.c | 70 BB **new_table, *curr, *next; in resize_bb_table() local
74 new_table = (BB**) CLG_MALLOC("cl.bb.rbt.1", in resize_bb_table()
77 if (!new_table) return; in resize_bb_table()
80 new_table[i] = NULL; in resize_bb_table()
91 curr->next = new_table[new_idx]; in resize_bb_table()
92 new_table[new_idx] = curr; in resize_bb_table()
111 bbs.table = new_table; in resize_bb_table()
|
| D | context.c | 94 Context **new_table, *curr, *next; in resize_cxt_table() local
98 new_table = (Context**) CLG_MALLOC("cl.context.rct.1", in resize_cxt_table()
101 if (!new_table) return; in resize_cxt_table()
104 new_table[i] = NULL; in resize_cxt_table()
115 curr->next = new_table[new_idx]; in resize_cxt_table()
116 new_table[new_idx] = curr; in resize_cxt_table()
135 cxts.table = new_table; in resize_cxt_table()
|
| D | bbcc.c | 196 BBCC** new_table; in resize_bbcc_hash() local
201 new_table = (BBCC**) CLG_MALLOC("cl.bbcc.rbh.1", in resize_bbcc_hash()
204 if (!new_table) return; in resize_bbcc_hash()
207 new_table[i] = NULL; in resize_bbcc_hash()
220 curr_BBCC->next = new_table[new_idx]; in resize_bbcc_hash()
221 new_table[new_idx] = curr_BBCC; in resize_bbcc_hash()
240 current_bbccs.table = new_table; in resize_bbcc_hash()
|
| /external/sfntly/cpp/src/sample/subtly/ |
| D | stats.cc | 53 Ptr<FontDataTable> new_table = new_font->GetTable(it->first); in PrintComparison() local
56 if (new_table) { in PrintComparison()
57 new_size = new_table->DataLength(); in PrintComparison()
|
| /external/chromium_org/third_party/sfntly/cpp/src/sample/subtly/ |
| D | stats.cc | 53 Ptr<FontDataTable> new_table = new_font->GetTable(it->first); in PrintComparison() local
56 if (new_table) { in PrintComparison()
57 new_size = new_table->DataLength(); in PrintComparison()
|
| /external/chromium_org/ppapi/c/documentation/ |
| D | doxy_cleanup.py | 76 new_table = Tag(self.soup, name='table', attrs=table.attrs)
77 table_parent.insert(table_index + 1, new_table)
80 new_table.insert(index, row)
|
| /external/chromium_org/ppapi/cpp/documentation/ |
| D | doxy_cleanup.py | 75 new_table = Tag(self.soup, name='table', attrs=table.attrs)
76 table_parent.insert(table_index + 1, new_table)
79 new_table.insert(index, row)
|
| /external/qemu/block/ |
| D | qcow2-refcount.c | 339 uint64_t *new_table = qemu_mallocz(table_size * sizeof(uint64_t)); in alloc_refcount_block() local
344 memcpy(new_table, s->refcount_table, in alloc_refcount_block()
346 new_table[refcount_table_index] = new_block; in alloc_refcount_block()
350 new_table[blocks_used + i] = meta_offset + (i * s->cluster_size); in alloc_refcount_block()
371 cpu_to_be64s(&new_table[i]); in alloc_refcount_block()
375 ret = bdrv_pwrite_sync(bs->file, table_offset, new_table, in alloc_refcount_block()
382 cpu_to_be64s(&new_table[i]); in alloc_refcount_block()
401 s->refcount_table = new_table; in alloc_refcount_block()
418 qemu_free(new_table); in alloc_refcount_block()
|
| /external/chromium/chrome/browser/chromeos/input_method/ |
| D | candidate_window.cc | 368 const InputMethodLookupTable& new_table);
881 const InputMethodLookupTable& new_table) { in ShouldUpdateCandidateViews() argument
883 if (old_table.page_size == new_table.page_size && in ShouldUpdateCandidateViews()
884 old_table.orientation == new_table.orientation && in ShouldUpdateCandidateViews()
885 old_table.candidates == new_table.candidates && in ShouldUpdateCandidateViews()
886 old_table.labels == new_table.labels && in ShouldUpdateCandidateViews()
887 old_table.annotations == new_table.annotations && in ShouldUpdateCandidateViews()
889 ComputePageIndex(old_table) == ComputePageIndex(new_table)) { in ShouldUpdateCandidateViews()
|
| /external/e2fsprogs/lib/et/ |
| D | error_message.c | 311 add_to_error_table(struct et_list *new_table) in add_to_error_table() argument
313 add_error_table(new_table->table); in add_to_error_table()
|
| D | com_err.h | 49 extern void add_to_error_table(struct et_list *new_table);
|
| /external/openfst/src/include/fst/ |
| D | symbol-table.h | 511 SymbolTable *new_table = new SymbolTable( in RelabelSymbolTable() local
516 new_table->AddSymbol(table->Find(pairs[i].first), pairs[i].second); in RelabelSymbolTable()
518 return new_table; in RelabelSymbolTable()
|
| /external/sfntly/cpp/src/sfntly/table/bitmap/ |
| D | eblc_table.cc | 268 Ptr<EblcTable> new_table = new EblcTable(header(), data); in SubBuildTable() local
269 return new_table.Detach(); in SubBuildTable()
|
| /external/chromium_org/third_party/sfntly/cpp/src/sfntly/table/bitmap/ |
| D | eblc_table.cc | 268 Ptr<EblcTable> new_table = new EblcTable(header(), data); in SubBuildTable() local
269 return new_table.Detach(); in SubBuildTable()
|
| /external/v8/src/ |
| D | heap.cc | 5157 Object* new_table; in LookupSymbol() local
5160 if (!maybe_new_table->ToObject(&new_table)) return maybe_new_table; in LookupSymbol()
5164 roots_[kSymbolTableRootIndex] = new_table; in LookupSymbol()
5172 Object* new_table; in LookupAsciiSymbol() local
5175 if (!maybe_new_table->ToObject(&new_table)) return maybe_new_table; in LookupAsciiSymbol()
5179 roots_[kSymbolTableRootIndex] = new_table; in LookupAsciiSymbol()
5189 Object* new_table; in LookupAsciiSymbol() local
5195 if (!maybe_new_table->ToObject(&new_table)) return maybe_new_table; in LookupAsciiSymbol()
5199 roots_[kSymbolTableRootIndex] = new_table; in LookupAsciiSymbol()
5207 Object* new_table; in LookupTwoByteSymbol() local
[all …]
|
| D | objects.cc | 10960 MaybeObject* HashTable<Shape, Key>::Rehash(HashTable* new_table, Key key) { in Rehash() argument
10961 ASSERT(NumberOfElements() < new_table->Capacity()); in Rehash()
10964 WriteBarrierMode mode = new_table->GetWriteBarrierMode(no_gc); in Rehash()
10970 new_table->set(i, get(i), mode); in Rehash()
10981 EntryToIndex(new_table->FindInsertionEntry(hash)); in Rehash()
10983 new_table->set(insertion_index + j, get(from_index + j), mode); in Rehash()
10987 new_table->SetNumberOfElements(NumberOfElements()); in Rehash()
10988 new_table->SetNumberOfDeletedElements(0); in Rehash()
10989 return new_table; in Rehash()
|
| D | runtime.cc | 800 Handle<ObjectHashTable> new_table = PutIntoObjectHashTable(table, key, value); in RUNTIME_FUNCTION() local
801 holder->set_table(*new_table); in RUNTIME_FUNCTION()
834 Handle<ObjectHashTable> new_table = PutIntoObjectHashTable(table, key, value); in RUNTIME_FUNCTION() local
835 weakmap->set_table(*new_table); in RUNTIME_FUNCTION()
|
| D | objects.h | 2854 MUST_USE_RESULT MaybeObject* Rehash(HashTable* new_table, Key key);
|
| /external/chromium_org/v8/src/ |
| D | heap.cc | 6071 Object* new_table; in InternalizeUtf8String() local
6074 if (!maybe_new_table->ToObject(&new_table)) return maybe_new_table; in InternalizeUtf8String()
6078 roots_[kStringTableRootIndex] = new_table; in InternalizeUtf8String()
6086 Object* new_table; in InternalizeOneByteString() local
6089 if (!maybe_new_table->ToObject(&new_table)) return maybe_new_table; in InternalizeOneByteString()
6093 roots_[kStringTableRootIndex] = new_table; in InternalizeOneByteString()
6103 Object* new_table; in InternalizeOneByteString() local
6109 if (!maybe_new_table->ToObject(&new_table)) return maybe_new_table; in InternalizeOneByteString()
6113 roots_[kStringTableRootIndex] = new_table; in InternalizeOneByteString()
6121 Object* new_table; in InternalizeTwoByteString() local
[all …]
|
| D | objects.cc | 4923 Handle<ObjectHashTable> new_table = ObjectHashTable::Put(hashtable, key, in SetHiddenProperty() local
4925 if (*new_table != *hashtable) { in SetHiddenProperty()
4928 SetHiddenPropertiesHashTable(object, new_table); in SetHiddenProperty()
14159 MaybeObject* HashTable<Shape, Key>::Rehash(HashTable* new_table, Key key) { in Rehash() argument
14160 ASSERT(NumberOfElements() < new_table->Capacity()); in Rehash()
14163 WriteBarrierMode mode = new_table->GetWriteBarrierMode(no_gc); in Rehash()
14169 new_table->set(i, get(i), mode); in Rehash()
14180 EntryToIndex(new_table->FindInsertionEntry(hash)); in Rehash()
14182 new_table->set(insertion_index + j, get(from_index + j), mode); in Rehash()
14186 new_table->SetNumberOfElements(NumberOfElements()); in Rehash()
[all …]
|
| D | runtime.cc | 1524 Handle<ObjectHashTable> new_table = in RUNTIME_FUNCTION() local
1526 holder->set_table(*new_table); in RUNTIME_FUNCTION()
1538 Handle<ObjectHashTable> new_table = ObjectHashTable::Put(table, key, value); in RUNTIME_FUNCTION() local
1539 holder->set_table(*new_table); in RUNTIME_FUNCTION()
1603 Handle<ObjectHashTable> new_table = in RUNTIME_FUNCTION() local
1605 weak_collection->set_table(*new_table); in RUNTIME_FUNCTION()
1618 Handle<ObjectHashTable> new_table = ObjectHashTable::Put(table, key, value); in RUNTIME_FUNCTION() local
1619 weak_collection->set_table(*new_table); in RUNTIME_FUNCTION()
|
| D | objects.h | 3660 MUST_USE_RESULT MaybeObject* Rehash(HashTable* new_table, Key key);
|