Searched defs:entry (Results 276 - 300 of 1397) sorted by relevance

<<11121314151617181920>>

/external/swiftshader/third_party/LLVM/unittests/ADT/
H A DStringMapTest.cpp103 // A map with a single entry.
189 StringMap<uint32_t>::value_type* entry = local
192 EXPECT_STREQ(testKey, entry->first().data());
193 EXPECT_EQ(1u, entry->second);
194 free(entry);
/external/syslinux/gpxe/src/arch/i386/include/
H A Dundi.h28 SEGOFF16_t entry; member in struct:undi_device
/external/tensorflow/tensorflow/c/
H A Dcheckpoint_reader.cc118 BundleEntryProto entry; local
121 CHECK(entry.ParseFromArray(v2_reader_->value().data(),
123 << entry.InitializationErrorString();
124 for (int i = 0; i < entry.slices_size(); ++i) {
125 const auto& slice_proto = entry.slices(i);
142 CHECK(entry.ParseFromArray(v2_reader_->value().data(),
144 << entry.InitializationErrorString();
146 (*var_to_shape_map)[key] = TensorShape(entry.shape());
147 (*var_to_data_type_map)[key] = DataType(entry.dtype());
/external/tensorflow/tensorflow/examples/android/jni/object_tracking/
H A Dtime_log.h46 // Storage for keeping track of average values (each entry may not be printed
79 AverageEntry* const entry = avg_entries + entry_num; local
80 if (str == entry->id) {
81 entry->average_duration = Blend(entry->average_duration, new_val);
82 return entry->average_duration;
/external/toybox/lib/
H A Ddirtree.c134 struct dirent *entry; local
153 while ((entry = readdir(dir))) {
154 if ((flags&DIRTREE_PROC) && !isdigit(*entry->d_name)) continue;
155 if (!(new = dirtree_add_node(node, entry->d_name, flags))) continue;
/external/toybox/toys/posix/
H A Dkill.c91 struct dirent *entry; local
109 while ((entry = readdir(dp))) {
112 if (!(procpid = atoi(entry->d_name))) continue;
/external/v8/src/base/
H A Dcpu.cc120 struct { uint32_t tag; uint32_t value; } entry;
122 size_t n = fread(&entry, sizeof(entry), 1, fp);
123 if (n == 0 || (entry.tag == 0 && entry.value == 0)) {
126 if (entry.tag == AT_HWCAP) {
127 result = entry.value;
650 Elf64_auxv_t entry; local
652 Elf32_auxv_t entry;
655 size_t n = fread(&entry, sizeo
[all...]
/external/v8/src/
H A Dcancelable-task.cc54 auto entry = cancelable_tasks_.find(id); local
55 if (entry != cancelable_tasks_.end()) {
56 Cancelable* value = entry->second;
59 cancelable_tasks_.erase(entry);
H A Dunicode-inl.h15 CacheEntry entry = entries_[code_point & kMask]; local
16 if (entry.code_point() == code_point) return entry.value();
29 CacheEntry entry = entries_[c & kMask]; local
30 if (entry.code_point_ == c) {
31 if (entry.offset_ == 0) {
34 result[0] = c + entry.offset_;
/external/v8/src/compiler/
H A Dgraph-reducer.cc112 NodeState& entry = stack_.top(); local
113 Node* node = entry.node;
121 int start = entry.input_index < node_inputs.count() ? entry.input_index : 0;
125 entry.input_index = i + 1;
132 entry.input_index = i + 1;
154 entry.input_index = i + 1;
H A Dnode-cache.cc51 Entry* entry = &entries_[j]; local
52 if (!entry->value_) {
53 entry->key_ = old->key_;
54 entry->value_ = old->value_;
68 // Allocate the initial entries and insert the first entry.
73 Entry* entry = &entries_[hash & (kInitialSize - 1)]; local
74 entry->key_ = key;
75 return &entry->value_;
83 Entry* entry = &entries_[i]; local
84 if (pred_(entry
95 Entry* entry = &entries_[hash & (size_ - 1)]; local
[all...]
/external/v8/src/interpreter/
H A Dhandler-table-builder.cc24 Entry& entry = entries_[i]; local
25 HandlerTable::CatchPrediction pred = entry.catch_prediction_;
26 table->SetRangeStart(i, static_cast<int>(entry.offset_start));
27 table->SetRangeEnd(i, static_cast<int>(entry.offset_end));
28 table->SetRangeHandler(i, static_cast<int>(entry.offset_target), pred);
29 table->SetRangeData(i, entry.context.index());
37 Entry entry = {0, 0, 0, Register(), HandlerTable::UNCAUGHT}; local
38 entries_.push_back(entry);
/external/v8/src/parsing/
H A Dduplicate-finder.cc21 base::HashMap::Entry* entry = map_.LookupOrInsert(encoding, hash); local
22 int old_value = static_cast<int>(reinterpret_cast<intptr_t>(entry->value));
23 entry->value = reinterpret_cast<void*>(1);
/external/v8/src/runtime/
H A Druntime-wasm.cc26 const Address entry = Isolate::c_entry_fp(isolate->thread_local_top()); local
28 Memory::Address_at(entry + StandardFrameConstants::kCallerPCOffset);
/external/valgrind/coregrind/
H A Dpub_core_initimg.h107 Addr entry; /* &_start */ member in struct:_IICreateImageInfo
108 Addr init_ip; /* &__dyld_start, or copy of entry */
H A Dpub_core_ume.h78 Addr entry; // OUT: entrypoint in main executable member in struct:__anon29258
/external/vboot_reference/cgpt/
H A Dcgpt_add.c71 GptEntry *entry; local
73 entry = GetEntry(&drive->gpt, PRIMARY, index);
75 entry->starting_lba = params->begin;
77 entry->ending_lba = entry->starting_lba + params->size - 1;
79 memcpy(&entry->unique, &params->unique_guid, sizeof(Guid));
80 } else if (GuidIsZero(&entry->type)) {
81 if (CGPT_OK != GenerateGuid(&entry->unique)) {
87 memcpy(&entry->type, &params->type_guid, sizeof(Guid));
89 if (CGPT_OK != UTF8ToUTF16((uint8_t *)params->label, entry
236 GptEntry *entry = GetEntry(&drive.gpt, PRIMARY, index); local
250 GptEntry *entry = GetEntry(&drive.gpt, PRIMARY, index); local
268 GptEntry *entry, backup; local
[all...]
/external/volley/src/main/java/com/android/volley/
H A DCache.java28 * Retrieves an entry from the cache.
35 * Adds or replaces an entry to the cache.
37 * @param entry Data to store and metadata for cache coherency, TTL, etc.
39 void put(String key, Entry entry); argument
48 * Invalidates an entry in the cache.
50 * @param fullExpire True to fully expire the entry, false to soft expire
55 * Removes an entry from the cache.
66 * Data and metadata for an entry returned by the cache.
103 /** True if the entry is expired. */
/external/volley/src/test/java/com/android/volley/mock/
H A DMockCache.java32 public void setEntryToReturn(Entry entry) { argument
33 mFakeEntry = entry;
47 public void put(String key, Entry entry) { argument
50 entryPut = entry;
/external/ImageMagick/MagickCore/
H A Dlinked-list.c226 *entry;
238 entry=next;
240 entry=(ElementInfo *) RelinquishMagickMemory(entry);
222 *entry; local
/external/ImageMagick/coders/
H A Dcals.c321 *entry;
323 entry=AcquireMagickInfo("CALS","CAL",CALSDescription);
324 entry->decoder=(DecodeImageHandler *) ReadCALSImage;
326 entry->encoder=(EncodeImageHandler *) WriteCALSImage;
328 entry->flags^=CoderAdjoinFlag;
329 entry->magick=(IsImageFormatHandler *) IsCALS;
330 entry->note=ConstantString(CALSNote);
331 (void) RegisterMagickInfo(entry);
332 entry=AcquireMagickInfo("CALS","CALS",CALSDescription);
333 entry
316 *entry; local
[all...]
H A Dept.c286 *entry;
288 entry=AcquireMagickInfo("EPT","EPT",
290 entry->decoder=(DecodeImageHandler *) ReadEPTImage;
291 entry->encoder=(EncodeImageHandler *) WriteEPTImage;
292 entry->magick=(IsImageFormatHandler *) IsEPT;
293 entry->flags|=CoderSeekableStreamFlag;
294 entry->flags^=CoderAdjoinFlag;
295 entry->flags^=CoderBlobSupportFlag;
296 (void) RegisterMagickInfo(entry);
297 entry
280 *entry; local
[all...]
H A Dexr.c294 *entry;
296 entry=AcquireMagickInfo("EXR","EXR","High Dynamic-range (HDR)");
298 entry->decoder=(DecodeImageHandler *) ReadEXRImage;
299 entry->encoder=(EncodeImageHandler *) WriteEXRImage;
301 entry->magick=(IsImageFormatHandler *) IsEXR;
302 entry->flags^=CoderAdjoinFlag;
303 entry->flags^=CoderBlobSupportFlag;
304 (void) RegisterMagickInfo(entry);
289 *entry; local
H A Dflif.c311 *entry;
314 entry=AcquireMagickInfo("FLIF","FLIF","Free Lossless Image Format");
316 entry->decoder=(DecodeImageHandler *) ReadFLIFImage;
317 entry->encoder=(EncodeImageHandler *) WriteFLIFImage;
323 entry->mime_type=ConstantString("image/flif");
324 entry->magick=(IsImageFormatHandler *) IsFLIF;
326 entry->version=ConstantString(version);
327 (void) RegisterMagickInfo(entry);
307 *entry; local
H A Dipl.c440 *entry; local
442 entry=AcquireMagickInfo("IPL","IPL","IPL Image Sequence");
443 entry->decoder=(DecodeImageHandler *) ReadIPLImage;
444 entry->encoder=(EncodeImageHandler *) WriteIPLImage;
445 entry->magick=(IsImageFormatHandler *) IsIPL;
446 entry->flags|=CoderEndianSupportFlag;
447 (void) RegisterMagickInfo(entry);

Completed in 471 milliseconds

<<11121314151617181920>>