/external/chromium/net/disk_cache/ |
mem_rankings.cc | 16 void MemRankings::Insert(MemEntryImpl* node) { 50 Insert(node);
|
rankings.cc | 22 INSERT = 1, 231 void Rankings::Insert(CacheRankingsBlock* node, bool modified, List list) { 232 Trace("Insert 0x%x l %d", node->address().value(), list); 236 Transaction lock(control_data_, node->address(), INSERT, list); 378 // A crash in between Remove and Insert will lead to a dirty entry not on the 392 Insert(node, modified, list); 629 if (INSERT == control_data_->operation) { 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/ |
ts_simple_cache.h | 47 void Insert(uintptr_t ptr, bool val) { 81 void Insert(uint32_t a, uint32_t b, bool val) {
|
thread_sanitizer.cc | 324 void Insert(A a, B b, Ret v) { 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); 994 locks_reported->insert(lid); 1001 locks_reported->insert(lid); 1009 locks->insert(lsid.GetSingleton()); 1013 locks->insert(*it); [all...] |
/external/chromium/chrome/common/extensions/ |
extension_set.cc | 24 void ExtensionSet::Insert(const scoped_refptr<const Extension>& extension) {
|
/external/srec/seti/sltsEngine/src/ |
linklist_impl.c | 123 LListResult Insert(LList *list, void *data) 143 /* curr not specified, insert from the end */ 148 /* in cases with single node, default to insert at end */ 150 /* insert at the end */ 161 /* insert at head */ 173 /* insert somewhere in middle */
|
/external/webrtc/src/system_wrappers/source/ |
map.cc | 68 int MapWrapper::Insert(int id, void* ptr)
|
list_no_stl.cc | 149 int ListWrapper::Insert(ListItem* existing_previous_item, ListItem* new_item)
|
list_stl.cc | 180 int ListWrapper::Insert(ListItem* existing_previous_item, 206 list_.insert(insert_location,new_item); 231 list_.insert(insert_location,new_item);
|
map_no_stl.cc | 74 int MapNoStl::Insert(int id, void* ptr)
|
list_unittest.cc | 66 int Insert(ListItem* existing_previous_item, 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/ |
bloom_filter.cc | 71 void BloomFilter::Insert(SBPrefix hash) {
|
/external/v8/test/cctest/ |
test-hashmap.cc | 48 void Insert(int x) { 51 CHECK(p != NULL); // insert is set! 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/common_audio/resampler/main/source/ |
resampler.cc | 893 int Resampler::Insert(WebRtc_Word16 * samplesIn, int lengthIn)
|
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
heap.h | 39 // to the calling functions on heap insert. This key can be used 58 // insert a value into the heap 59 int Insert(const T& val) { 70 return Insert(val, size_ - 1); 80 Insert(val, i); 169 // insert(update) element at subtree rooted at index i 170 int Insert(const T& val, int i) {
|
/external/v8/src/ |
splay-tree-inl.h | 45 bool SplayTree<Config, Allocator>::Insert(const Key& key, Locator* locator) { 47 // If the tree is empty, insert the new node. 59 // Insert the new node. 218 // Insert the original right child as the right child of the new
|
data-flow.h | 318 void Insert(T* item) {
|
isolate.cc | 293 thread_data_table_->Insert(per_thread); 375 void Isolate::ThreadDataTable::Insert(Isolate::PerIsolateThreadData* data) {
|
log.cc | 91 void Insert(TickSample* sample) { 202 if (profiler_) profiler_->Insert(sample); 319 Insert(&sample); [all...] |
/external/chromium/net/base/ |
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) { 92 "Only insert certs with real fingerprints."; 177 cache->Insert(cert); [all...] |
/external/chromium/base/ |
values.cc | 852 bool ListValue::Insert(size_t index, Value* in_value) { 857 list_.insert(list_.begin() + index, in_value);
|
/external/llvm/include/llvm/Support/ |
IRBuilder.h | 37 if (BB) BB->getInstList().insert(InsertPt, I); 140 /// isSet - Returns true if this insert point is set. 147 /// saveIP - Returns the current insert point. 152 /// saveAndClearIP - Returns the current insert point, clearing it 160 /// restoreIP - Sets the current insert point to a previously-saved 272 /// CreateMemSet - Create and insert a memset to the specified pointer and the 283 /// CreateMemCpy - Create and insert a memcpy between the specified pointers. 294 /// CreateMemMove - Create and insert a memmove between the specified 381 /// Insert - Insert and return the specified instruction [all...] |
/external/llvm/lib/Transforms/Scalar/ |
ScalarReplAggregates.cpp | 305 // insert/extract elements, and if there was at least one use that had 308 // we just get a lot of insert/extracts. If at least one vector is 323 // Create and insert the integer alloca. 337 /// Here we turn element accesses into insert/extract element operations. 339 /// into a <4 x float> that uses insert element. 341 /// large) integer type with extract and insert operations where the loads 519 /// vector with insert/extractelement instructions. 672 /// insert/extractelement instructions. 782 /// ConvertScalar_InsertValue - Insert the value "SV" into the existing integer 787 /// vector with insert/extractelement instructions [all...] |
/external/protobuf/gtest/src/ |
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) { [all...] |
/frameworks/base/core/java/android/provider/ |
Contacts.java | 543 return resolver.insert(GroupMembership.CONTENT_URI, values); 562 Uri contactUri = resolver.insert(People.CONTENT_URI, values); [all...] |