/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 | 235 void Rankings::Insert(CacheRankingsBlock* node, bool modified, List list) { function in class:disk_cache::Rankings 236 Trace("Insert 0x%x l %d", node->address().value(), list); 382 // A crash in between Remove and Insert will lead to a dirty entry not on the 396 Insert(node, modified, list); 652 // This part will be skipped by the logic of Insert. 656 Insert(node, true, static_cast<List>(control_data_->operation_list));
|
/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 const int retval = list_.Insert(existing_previous_item, new_item); 387 // Use Insert to interleave two lists. 423 EXPECT_EQ(0, interleave_list->Insert(item, insert_item));
|
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.JavaExtensions/ |
H A D | SubList.cs | 62 public void Insert( int index, object value ) method in class:Antlr.Runtime.JavaExtensions.SubList 281 void IList.Insert( int index, object value ) 393 void IList<T>.Insert( int index, T item ) method in class:Antlr.Runtime.JavaExtensions.SubList
|
/external/chromium/chrome/browser/safe_browsing/ |
H A D | bloom_filter.cc | 71 void BloomFilter::Insert(SBPrefix hash) { function in class:BloomFilter
|
/external/openfst/src/include/fst/ |
H A D | heap.h | 64 // Insert a value into the heap 65 int Insert(const T& val) { function in class:fst::Heap 76 return Insert(val, size_ - 1); 86 Insert(val, i); 182 // Insert (update) element at subtree rooted at index i 183 int Insert(const T& val, int i) { function in class:fst::Heap
|
H A D | util.h | 391 void Insert(Key key) { function in class:fst::CompactSet
|
/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
|
/external/webrtc/src/common_audio/resampler/ |
H A D | resampler.cc | 996 int Resampler::Insert(WebRtc_Word16 * samplesIn, int lengthIn) function in class:webrtc::Resampler
|
/external/llvm/lib/CodeGen/ |
H A D | BasicTargetTransformInfo.cpp | 31 /// Estimate the overhead of scalarizing an instruction. Insert and Extract 33 unsigned getScalarizationOverhead(Type *Ty, bool Insert, bool Extract) const; 169 unsigned BasicTTI::getScalarizationOverhead(Type *Ty, bool Insert, argument 175 if (Insert)
|
/external/llvm/lib/Target/R600/ |
H A D | SIAnnotateControlFlow.cpp | 239 TerminatorInst *Insert = From->getTerminator(); local 241 Value *Ret = CallInst::Create(Break, Arg, "", Insert); 248 TerminatorInst *Insert = Parent->getTerminator(); local 250 Value *Ret = CallInst::Create(IfBreak, Args, "", Insert);
|
H A D | AMDGPUStructurizeCFG.cpp | 452 /// \brief Insert the missing branch conditions 642 BasicBlock *Insert = Order.empty() ? ParentRegion->getExit() : local 645 Func, Insert); 741 // Insert extra prefix node (or reuse last one) 744 // Insert extra postfix node (or use exit instead)
|
/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 | 60 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::__anon2993::X509CertificateCache 183 cache->Insert(cert);
|
/external/llvm/lib/IR/ |
H A D | Metadata.cpp | 216 FunctionLocalness FL, bool Insert) { 230 if (N || !Insert) 215 getMDNode(LLVMContext &Context, ArrayRef<Value*> Vals, FunctionLocalness FL, bool Insert) argument
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | ScalarReplAggregates.cpp | 882 /// ConvertScalar_InsertValue - Insert the value "SV" into the existing integer 1923 Value *Insert = UndefValue::get(LIType); local 1927 Insert = Builder.CreateInsertValue(Insert, Load, i, "insert"); 1929 LI->replaceAllUsesWith(Insert); 1977 // utilizing just the first element of the scalarized result. Insert a
|
/external/open-vcdiff/gtest/src/ |
H A D | gtest-internal-inl.h | 284 void PushBack(const E& element) { Insert(element, size_); } 287 void PushFront(const E& element) { Insert(element, 0); } 307 void Insert(const E& element, int index) { function in class:testing::internal::Vector
|