/external/chromium/net/disk_cache/ |
H A D | mem_rankings.cc | 16 void MemRankings::Insert(MemEntryImpl* node) { function in class:disk_cache::MemRankings 50 Insert(node);
|
H A D | rankings.cc | 231 void Rankings::Insert(CacheRankingsBlock* node, bool modified, List list) { function in class:disk_cache::Rankings 232 Trace("Insert 0x%x l %d", node->address().value(), list); 378 // A crash in between Remove and Insert will lead to a dirty entry not on the 392 Insert(node, modified, list); 648 // This part will be skipped by the logic of Insert. 652 Insert(node, true, static_cast<List>(control_data_->operation_list));
|
/external/valgrind/tsan/ |
H A D | ts_simple_cache.h | 47 void Insert(uintptr_t ptr, bool val) { function in class:PtrToBoolCache 81 void Insert(uint32_t a, uint32_t b, bool val) { function in class:IntPairToBoolCache
|
H A D | thread_sanitizer.cc | 324 void Insert(A a, B b, Ret v) { function in class:PairCache 871 ls_add_cache_->Insert(lsid.raw(), lid.raw(), res.raw()); 903 ls_rem_cache_->Insert(lsid.raw(), lid.raw(), res.raw()); 952 ls_intersection_cache_->Insert(lsid1.raw(), -lsid2.raw(), ret); 1257 hb_cache_->Insert(vts_a->uniq_id_, vts_b->uniq_id_, res); 2288 map_->Insert(res_ss, res_ssid); 2410 void Insert(SegmentSet *ss, SSID id) { 2482 remove_segment_cache_->Insert(old_ssid, sid_to_remove, res); 2560 add_segment_cache_->Insert(old_ssid, new_sid, res); 5032 ignore_below_cache_.Insert(target_p [all...] |
/external/chromium/chrome/common/extensions/ |
H A D | extension_set.cc | 24 void ExtensionSet::Insert(const scoped_refptr<const Extension>& extension) { function in class:ExtensionSet
|
/external/srec/seti/sltsEngine/src/ |
H A D | linklist_impl.c | 123 LListResult Insert(LList *list, void *data) function
|
/external/v8/test/cctest/ |
H A D | test-hashmap.cc | 48 void Insert(int x) { function in class:IntSet 97 set.Insert(1); 98 set.Insert(2); 99 set.Insert(3); 102 set.Insert(2); 103 set.Insert(3); 127 // Insert a long series of values. 136 set.Insert(x);
|
/external/webrtc/src/system_wrappers/source/ |
H A D | map.cc | 68 int MapWrapper::Insert(int id, void* ptr) function in class:webrtc::MapWrapper
|
H A D | map_no_stl.cc | 74 int MapNoStl::Insert(int id, void* ptr) function in class:webrtc::MapNoStl
|
H A D | list_no_stl.cc | 149 int ListWrapper::Insert(ListItem* existing_previous_item, ListItem* new_item) function in class:webrtc::ListWrapper
|
H A D | list_stl.cc | 180 int ListWrapper::Insert(ListItem* existing_previous_item, function in class:webrtc::ListWrapper
|
H A D | list_unittest.cc | 66 int Insert(ListItem* existing_previous_item, function in class:ListWrapperSimple 68 return list_.Insert(existing_previous_item, new_item); 371 // Use Insert to interleave two lists. 405 if (0 != interleave_list->Insert(item,insert_item)) {
|
/external/chromium/chrome/browser/safe_browsing/ |
H A D | bloom_filter.cc | 71 void BloomFilter::Insert(SBPrefix hash) { function in class:BloomFilter
|
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
H A D | heap.h | 59 int Insert(const T& val) { function in class:fst::Heap 70 return Insert(val, size_ - 1); 80 Insert(val, i); 170 int Insert(const T& val, int i) { function in class:fst::Heap
|
/external/v8/src/ |
H A D | splay-tree-inl.h | 45 bool SplayTree<Config, Allocator>::Insert(const Key& key, Locator* locator) { function in class:v8::internal::SplayTree 59 // Insert the new node. 218 // Insert the original right child as the right child of the new
|
H A D | data-flow.h | 318 void Insert(T* item) { function in class:v8::internal::BASE_EMBEDDED
|
H A D | isolate.cc | 293 thread_data_table_->Insert(per_thread); 375 void Isolate::ThreadDataTable::Insert(Isolate::PerIsolateThreadData* data) { function in class:v8::internal::Isolate::ThreadDataTable
|
H A D | log.cc | 91 void Insert(TickSample* sample) { function in class:v8::internal::Profiler 202 if (profiler_) profiler_->Insert(sample); 319 Insert(&sample);
|
/external/webrtc/src/common_audio/resampler/main/source/ |
H A D | resampler.cc | 893 int Resampler::Insert(WebRtc_Word16 * samplesIn, int lengthIn) function in class:webrtc::Resampler
|
/external/llvm/lib/VMCore/ |
H A D | Metadata.cpp | 188 FunctionLocalness FL, bool Insert) { 187 getMDNode(LLVMContext &Context, ArrayRef<Value*> Vals, FunctionLocalness FL, bool Insert) argument
|
/external/chromium/base/ |
H A D | values.cc | 852 bool ListValue::Insert(size_t index, Value* in_value) { function in class:ListValue
|
/external/chromium/net/base/ |
H A D | x509_certificate.cc | 59 void Insert(X509Certificate* cert); 86 // Insert |cert| into the cache. The cache does NOT AddRef |cert|. 88 void X509CertificateCache::Insert(X509Certificate* cert) { function in class:net::__anon2133::X509CertificateCache 177 cache->Insert(cert);
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | ScalarReplAggregates.cpp | 782 /// ConvertScalar_InsertValue - Insert the value "SV" into the existing integer 1802 Value *Insert = UndefValue::get(LIType); local 1806 Insert = Builder.CreateInsertValue(Insert, Load, i, "insert"); 1808 LI->replaceAllUsesWith(Insert); 1856 // utilizing just the first element of the scalarized result. Insert a
|
/external/protobuf/gtest/src/ |
H A D | gtest-internal-inl.h | 280 void PushBack(const E& element) { Insert(element, size_); } 283 void PushFront(const E& element) { Insert(element, 0); } 303 void Insert(const E& element, int index) { function in class:testing::internal::Vector
|
/external/llvm/include/llvm/Support/ |
H A D | IRBuilder.h | 381 /// Insert - Insert and return the specified instruction. 383 InstTy *Insert(InstTy *I, const Twine &Name = "") const { function in class:llvm::IRBuilder 390 /// Insert - No-op overload to handle constants. 391 Constant *Insert(Constant *C, const Twine& = "") const { function in class:llvm::IRBuilder 401 return Insert(ReturnInst::Create(Context)); 408 return Insert(ReturnInst::Create(Context, V)); 422 return Insert(ReturnInst::Create(Context, V)); 427 return Insert(BranchInst::Create(Dest)); 433 return Insert(BranchIns [all...] |