/external/grpc-grpc/src/core/lib/transport/ |
D | byte_stream.cc | 102 : ByteStream(cache->length_, cache->flags_), cache_(cache) {} in CachingByteStream() 117 if (cursor_ < cache_->cache_buffer_.count) return true; in Next() 118 GPR_ASSERT(cache_->underlying_stream_ != nullptr); in Next() 119 return cache_->underlying_stream_->Next(max_size_hint, on_complete); in Next() 126 if (cursor_ < cache_->cache_buffer_.count) { in Pull() 127 *slice = grpc_slice_ref_internal(cache_->cache_buffer_.slices[cursor_]); in Pull() 132 GPR_ASSERT(cache_->underlying_stream_ != nullptr); in Pull() 133 grpc_error* error = cache_->underlying_stream_->Pull(slice); in Pull() 135 grpc_slice_buffer_add(&cache_->cache_buffer_, in Pull() 140 if (offset_ == cache_->underlying_stream_->length()) { in Pull() [all …]
|
/external/tensorflow/tensorflow/core/platform/cloud/ |
D | expiring_lru_cache.h | 102 cache_.clear(); in Clear() 123 auto it = cache_.find(key); in LookupLocked() 124 if (it == cache_.end()) { in LookupLocked() 129 cache_.erase(it); in LookupLocked() 142 auto insert = cache_.insert(std::make_pair(key, entry)); in InsertLocked() 146 } else if (max_entries_ > 0 && cache_.size() > max_entries_) { in InsertLocked() 147 cache_.erase(lru_list_.back()); in InsertLocked() 153 auto it = cache_.find(key); in DeleteLocked() 154 if (it == cache_.end()) { in DeleteLocked() 158 cache_.erase(it); in DeleteLocked() [all …]
|
/external/tensorflow/tensorflow/lite/experimental/ruy/ |
D | prepacked_cache.cc | 27 auto itr = cache_.find(key); in FindAndUpdate() 29 if (itr != cache_.end()) { in FindAndUpdate() 42 while (!cache_.empty() && in Insert() 52 auto oldest = cache_.begin(); in EjectOne() 55 for (auto itr = cache_.begin(); itr != cache_.end(); ++itr) { in EjectOne() 67 cache_.erase(oldest); in EjectOne() 79 cache_.insert({key, mts}); in DoInsert()
|
/external/v8/src/compiler/ |
D | operation-typer.cc | 21 : zone_(zone), cache_(TypeCache::Get()) { in OperationTyper() 40 Type::Union(Type::Union(singleton_false_, cache_->kZeroish, zone), in OperationTyper() 131 if (!type.Is(cache_->kInteger)) { in Rangify() 235 return cache_->kIntegerOrMinusZeroOrNaN; in MultiplyRanger() 286 type = Type::Union(type, cache_->kSingletonZero, zone()); in ToNumber() 294 type = Type::Union(type, cache_->kSingletonZero, zone()); in ToNumber() 298 type = Type::Union(type, cache_->kSingletonOne, zone()); in ToNumber() 311 return maybe_bigint ? Type::Union(type, cache_->kInteger, zone()) : type; in ToNumberConvertBigInt() 336 if (type.Is(cache_->kInteger)) { in NumberAbs() 346 type = Type::Union(type, cache_->kSingletonZero, zone()); in NumberAbs() [all …]
|
D | machine-graph.cc | 15 Node** loc = cache_.FindInt32Constant(value); in Int32Constant() 23 Node** loc = cache_.FindInt64Constant(value); in Int64Constant() 42 Node** loc = cache_.FindTaggedIndexConstant(value32); in TaggedIndexConstant() 51 Node** loc = cache_.FindRelocatableInt32Constant( in RelocatableInt32Constant() 61 Node** loc = cache_.FindRelocatableInt64Constant( in RelocatableInt64Constant() 77 Node** loc = cache_.FindFloat32Constant(value); in Float32Constant() 85 Node** loc = cache_.FindFloat64Constant(value); in Float64Constant() 93 Node** loc = cache_.FindPointerConstant(value); in PointerConstant() 101 Node** loc = cache_.FindExternalConstant(reference); in ExternalConstant()
|
D | simplified-operator.cc | 1226 : cache_(*GetSimplifiedOperatorGlobalCache()), zone_(zone) {} in SimplifiedOperatorBuilder() 1229 const Operator* SimplifiedOperatorBuilder::Name() { return &cache_.k##Name; } 1244 return &cache_.k##Name; \ in EFFECT_DEPENDENT_OP_LIST() 1260 return &cache_.k##Name##Aborting; \ 1262 return &cache_.k##Name; \ 1277 return &cache_.kCheckBoundsAbortingAndConverting; 1279 return &cache_.kCheckBoundsAborting; 1283 return &cache_.kCheckBoundsConverting; 1285 return &cache_.kCheckBounds; 1344 return &cache_.kCheckIf##Name; in CheckIf() [all …]
|
D | typer.cc | 43 cache_(TypeCache::Get()), in Typer() 433 return NumberBitwiseXor(type, t->cache_->kSingletonMinusOne, t); in BitwiseNot() 441 return NumberSubtract(type, t->cache_->kSingletonOne, t); in Decrement() 449 return NumberAdd(type, t->cache_->kSingletonOne, t); in Increment() 457 return NumberMultiply(type, t->cache_->kSingletonMinusOne, t); in Negate() 480 if (type.Is(t->cache_->kInteger)) return type; in ToInteger() 481 if (type.Is(t->cache_->kIntegerOrMinusZeroOrNaN)) { in ToInteger() 482 return Type::Union(Type::Intersect(type, t->cache_->kInteger, t->zone()), in ToInteger() 483 t->cache_->kSingletonZero, t->zone()); in ToInteger() 485 return t->cache_->kInteger; in ToInteger() [all …]
|
D | escape-analysis-reducer.h | 26 : graph_(graph), cache_(zone), temp_nodes_(zone) {} in NodeHashCache() 66 void Insert(Node* node) { cache_.insert(node); } in Insert() 77 ZoneUnorderedSet<Node*, NodeHashCode, NodeEquals> cache_; variable
|
/external/tensorflow/tensorflow/compiler/xrt/ |
D | xrt_compilation_cache.cc | 79 CHECK_EQ(cache_.size(), 0); in ~XRTCompilationCache() 96 << cache_.size() << " entries (" in Release() 99 << (cache_.size() - entries_by_last_use_.size()) << " entries (" in Release() 124 auto erased = cache_.erase(entry->key); in DiscardEntryRefLocked() 185 cache_.insert(std::pair<string, CompiledSubgraph*>(key, entry)); in InitializeEntry() 221 auto iter = cache_.find(key); in CompileIfKeyAbsent() 223 if (iter == cache_.end()) { in CompileIfKeyAbsent() 226 << cache_.size() << " entries (" in CompileIfKeyAbsent() 229 << (cache_.size() - entries_by_last_use_.size()) << " entries (" in CompileIfKeyAbsent() 234 << cache_.size() << " entries (" in CompileIfKeyAbsent() [all …]
|
/external/protobuf/src/google/protobuf/compiler/ |
D | scc.h | 68 if (cache_.count(descriptor)) return cache_[descriptor].scc; in GetSCC() 79 std::map<const Descriptor*, NodeData> cache_; variable 92 GOOGLE_DCHECK_EQ(cache_.count(descriptor), 0); in DFS() 95 NodeData& result = cache_[descriptor]; in DFS() 103 if (cache_.count(dep) == 0) { in DFS() 108 NodeData child_data = cache_[dep]; in DFS() 123 cache_[scc_desc].scc = scc; in DFS()
|
/external/tensorflow/tensorflow/core/kernels/data/ |
D | cache_dataset_ops.cc | 688 : DatasetBase(DatasetContext(ctx)), input_(input), cache_(cache) { in MemoryDataset() 694 if (cache_) { in ~MemoryDataset() 695 cache_->Unref(); in ~MemoryDataset() 706 cache_); in MakeIteratorInternal() 745 : DatasetIterator<MemoryDataset>(params), cache_(cache) {} in MemoryIterator() 748 if (dataset()->cache_ == nullptr) { in ~MemoryIterator() 749 cache_->Unref(); in ~MemoryIterator() 755 if (cache_ == nullptr) { in Initialize() 763 kTFData, name, &cache_, [](MemoryCache** cache) { in Initialize() 788 if (cache_->IsCompleted()) { in SaveInternal() [all …]
|
D | cache_ops.cc | 38 cache_ = std::move(cache); in Complete() 51 cache_.clear(); in Reset() 56 DCHECK(index < cache_.size()); in at() 57 return cache_[index]; in at() 62 return cache_.size(); in size()
|
/external/tensorflow/tensorflow/core/util/ |
D | tensor_slice_reader_cache.cc | 28 delete cache_; in ~TensorSliceReaderCacheWrapper() 29 cache_ = nullptr; in ~TensorSliceReaderCacheWrapper() 37 if (!cache_) { in GetReader() 38 cache_ = new TensorSliceReaderCache; in GetReader() 40 return cache_->GetReader(filepattern, std::move(open_function), in GetReader()
|
/external/tensorflow/tensorflow/compiler/xla/service/ |
D | compilation_cache.cc | 46 CHECK_EQ(cache_.count(key), 0); in Insert() 47 cache_.emplace(key, std::move(executable)); in Insert() 60 if (cache_.count(key) == 0) { in LookUp() 64 auto& result = cache_.at(key); in LookUp()
|
D | indexed_array_analysis.cc | 81 auto it = cache_.find(instr); in GetArrayFor() 82 if (it != cache_.end()) { in GetArrayFor() 87 return FindOrDie(cache_, instr); in GetArrayFor() 105 if (cache_.contains(instr)) { in TraverseAndPopulateCache() 113 if (!cache_.contains(operand)) { in TraverseAndPopulateCache() 127 InsertOrDie(&cache_, instr, array); in TraverseAndPopulateCache() 142 instr->opcode(), FindOrDie(cache_, instr->operand(0)))); in ComputeArrayFor() 147 instr->opcode(), FindOrDie(cache_, instr->operand(0)), in ComputeArrayFor() 148 FindOrDie(cache_, instr->operand(1)))); in ComputeArrayFor() 157 FindOrDie(cache_, instr->operand(0)), in ComputeArrayFor() [all …]
|
/external/webrtc/webrtc/base/ |
D | diskcache.h | 100 : cache_(cache), id_(id), rollback_(rollback) in cache_() function 102 locked_ = cache_->LockResource(id_); in cache_() 106 cache_->UnlockResource(id_); in ~CacheLock() 108 cache_->DeleteResource(id_); in ~CacheLock() 116 DiskCache* cache_;
|
D | httpclient.cc | 273 uri_form_(URI_DEFAULT), cache_(NULL), cache_state_(CS_READY), in HttpClient() 390 if ((NULL != cache_) && CheckCache()) { in start() 455 ASSERT(NULL != cache_); in BeginCacheFile() 459 CacheLock lock(cache_, id, true); in BeginCacheFile() 469 scoped_ptr<StreamInterface> stream(cache_->WriteResource(id, kCacheBody)); in BeginCacheFile() 488 scoped_ptr<StreamInterface> stream(cache_->WriteResource(id, kCacheHeader)); in WriteCacheHeaders() 515 cache_->DeleteResource(GetCacheID(request())); in CompleteCacheFile() 520 ASSERT(NULL != cache_); in CheckCache() 524 if (!cache_->HasResource(id)) { in CheckCache() 566 scoped_ptr<StreamInterface> stream(cache_->ReadResource(id, kCacheHeader)); in ReadCacheHeaders() [all …]
|
/external/tensorflow/tensorflow/compiler/tf2tensorrt/utils/ |
D | trt_lru_cache.cc | 62 : cache_(capacity) { in TRTEngineCacheResource() 85 oss << "LRUCache = " << hex << &cache_ << dec << endl; in DebugString() 86 oss << "Containing " << cache_.size() << " entries: " << endl; in DebugString() 87 for (const auto& item : cache_) { in DebugString()
|
/external/compiler-rt/lib/sanitizer_common/ |
D | sanitizer_quarantine.h | 48 : cache_(LINKER_INITIALIZED) { in Quarantine() 69 cache_.Transfer(c); in Drain() 71 if (cache_.Size() > GetSize() && recycle_mutex_.TryLock()) in Drain() 84 Cache cache_; variable 92 while (cache_.Size() > min_size) { in Recycle() 93 QuarantineBatch *b = cache_.DequeueBatch(); in Recycle()
|
/external/perfetto/src/traced/probes/filesystem/ |
D | inode_file_data_source_unittest.cc | 78 cfg, &task_runner_, 0, &static_file_map_, &cache_, in GetInodeFileDataSource() 82 LRUInodeCache cache_{100}; member in perfetto::__anon9f02b3c50111::InodeFileDataSourceTest 113 EXPECT_THAT(cache_.Get(std::make_pair(buf.st_dev, buf.st_ino)), in TEST_F() 137 EXPECT_THAT(cache_.Get(std::make_pair(buf.st_dev, buf.st_ino)), IsNull()); in TEST_F() 156 cache_.Insert(std::make_pair(buf.st_dev, buf.st_ino), value); in TEST_F()
|
/external/tensorflow/tensorflow/stream_executor/ |
D | executor_cache.cc | 37 entry = &cache_[config.ordinal]; in GetOrCreate() 71 auto it = cache_.find(config.ordinal); in Get() 72 if (it != cache_.end()) { in Get() 101 cache_.clear(); in DestroyAllExecutors()
|
/external/tensorflow/tensorflow/core/common_runtime/ |
D | placer_inspection_required_ops_utils.cc | 58 cache_.resize(graph_.num_node_ids()); in PlacerInspectionRequiredOpChecker() 63 if (cache_[node.id()].has_value()) { in IsPlacerInspectionRequired() 64 *is_deep = cache_[node.id()].value(); in IsPlacerInspectionRequired() 69 return Set(node, false, is_deep, &cache_); in IsPlacerInspectionRequired() 79 return Set(node, true, is_deep, &cache_); in IsPlacerInspectionRequired() 82 return Set(node, false, is_deep, &cache_); in IsPlacerInspectionRequired()
|
/external/libtextclassifier/native/utils/math/ |
D | fastexp.h | 49 | cache_.exp1[x & kMask1]; in VeryFastExp2() 58 static const Table cache_;
|
/external/libtextclassifier/native/lang_id/common/math/ |
D | fastexp.h | 51 | cache_.exp1[x & kMask1]; in VeryFastExp2() 60 static const Table cache_;
|
/external/tensorflow/tensorflow/compiler/tf2tensorrt/kernels/ |
D | trt_engine_resource_ops.cc | 107 OP_REQUIRES(ctx, resource->cache_.size() == 0, in Compute() 109 resource->cache_.size(), " entries.")); in Compute() 143 resource->cache_.emplace( in Compute() 195 for (const auto& pair : resource->cache_) { in Compute()
|