| /external/webrtc/src/system_wrappers/source/ |
| list_unittest.cc | 66 int Insert(ListItem* existing_previous_item,
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));
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/bsddb/ |
| dbtables.py | 480 def Insert(self, table, rowdict) :
481 """Insert(table, datadict) - Insert a new row into the table
501 # insert the row values into the table database
712 conditionlist.insert(j, i)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/bsddb/ |
| dbtables.py | 480 def Insert(self, table, rowdict) :
481 """Insert(table, datadict) - Insert a new row into the table
501 # insert the row values into the table database
712 conditionlist.insert(j, i)
|
| /external/chromium/net/disk_cache/ |
| rankings.cc | 22 INSERT = 1,
235 void Rankings::Insert(CacheRankingsBlock* node, bool modified, List list) {
236 Trace("Insert 0x%x l %d", node->address().value(), list);
240 Transaction lock(control_data_, node->address(), INSERT, list);
382 // A crash in between Remove and Insert will lead to a dirty entry not on the
396 Insert(node, modified, list);
633 if (INSERT == control_data_->operation) {
652 // This part will be skipped by the logic of Insert.
656 Insert(node, true, static_cast<List>(control_data_->operation_list));
|
| /external/chromium_org/ipc/ |
| ipc_channel_posix.cc | 119 // Insert a mapping from @channel_id to @fd. It's a fatal error to insert a
121 void Insert(const std::string& channel_id, int fd) {
302 PipeMap::GetInstance()->Insert(pipe_name_, client_pipe_);
879 input_fds_.insert(input_fds_.end(),
|
| /external/chromium_org/net/quic/crypto/ |
| strike_register.cc | 115 bool StrikeRegister::Insert(const uint8 nonce[32],
149 // Empty tree. Just insert the new value at the root.
162 // We are going to insert a new entry into the tree, so get the nodes now.
215 // order to insert the new internal node into the tree. The internal nodes
257 free_internal_nodes.insert(i);
265 free_external_nodes.insert(i);
441 used_external_nodes->insert(ext);
458 used_internal_nodes->insert(inter);
|
| crypto_handshake.cc | 87 void CryptoHandshakeMessage::Insert(QuicTagValueMap::const_iterator begin,
89 tag_value_map_.insert(begin, end);
546 cached_states_.insert(make_pair(server_hostname, cached));
|
| /external/chromium_org/v8/src/ |
| hydrogen-bce.cc | 309 void BoundsCheckTable::Insert(BoundsCheckKey* key,
416 table_.Insert(key, bb_data_list, zone());
429 table_.Insert(data->Key(), data->FatherInDominatorTree(), zone());
|
| hydrogen-gvn.cc | 53 Insert(value, zone);
79 void Insert(HValue* value, Zone* zone);
262 Insert(lists_[current].value, zone);
269 Insert(old_array[i].value, zone);
301 void HValueMap::Insert(HValue* value, Zone* zone) {
|
| serialize.cc | 702 void Insert(Address code_address, const char* name, int name_size) {
772 address_to_name_map_.Insert(code->address(), name, length);
[all...] |
| isolate.cc | 357 thread_data_table_->Insert(per_thread);
[all...] |
| log.cc | 550 void Insert(TickSample* sample) {
618 if (profiler_) profiler_->Insert(sample);
686 Insert(&sample);
[all...] |
| /external/lzma/CPP/Common/ |
| MyString.h | 469 int Insert(int index, T c)
476 int Insert(int index, const CStringBase &s)
523 Insert(pos, newString);
|
| /external/chromium/base/ |
| values.cc | 852 bool ListValue::Insert(size_t index, Value* in_value) {
857 list_.insert(list_.begin() + index, in_value);
|
| /external/chromium_org/base/ |
| values.cc | 429 dictionary_.insert(std::make_pair(key, in_value));
1051 bool ListValue::Insert(size_t index, Value* in_value) {
1056 list_.insert(list_.begin() + index, in_value);
|
| /external/chromium_org/cc/resources/ |
| raster_worker_pool.cc | 320 void RasterWorkerPool::Task::Set::Insert(const Task& task) {
350 tasks_required_for_activation_.insert(task.internal_.get());
516 // Insert image decode tasks.
|
| /external/chromium_org/net/disk_cache/ |
| rankings.cc | 26 INSERT = 1,
244 void Rankings::Insert(CacheRankingsBlock* node, bool modified, List list) {
245 Trace("Insert 0x%x l %d", node->address().value(), list);
249 Transaction lock(control_data_, node->address(), INSERT, list);
396 // A crash in between Remove and Insert will lead to a dirty entry not on the
410 Insert(node, modified, list);
654 if (INSERT == control_data_->operation) {
673 // This part will be skipped by the logic of Insert.
677 Insert(node, true, static_cast<List>(control_data_->operation_list));
|
| /external/llvm/lib/Transforms/Scalar/ |
| StructurizeCFG.cpp | 437 Visited.insert((*OI)->getEntry());
444 /// \brief Insert the missing branch conditions
632 BasicBlock *Insert = Order.empty() ? ParentRegion->getExit() :
635 Func, Insert);
717 Visited.insert(Node->getEntry());
727 // Insert extra prefix node (or reuse last one)
730 // Insert extra postfix node (or use exit instead)
|
| ScalarReplAggregates.cpp | 347 // insert/extract elements, and if there was at least one use that had
350 // we just get a lot of insert/extracts. If at least one vector is
376 // Create and insert the integer alloca.
390 /// Here we turn element accesses into insert/extract element operations.
392 /// into a <4 x float> that uses insert element.
394 /// large) integer type with extract and insert operations where the loads
592 /// vector with insert/extractelement instructions.
657 assert(!NonConstantIdx && "Cannot replace dynamic memset with insert");
690 assert(!NonConstantIdx && "Cannot replace dynamic transfer with insert");
757 /// insert/extractelement instructions
[all...] |
| /external/chromium_org/third_party/leveldatabase/src/util/ |
| env_posix.cc | 373 bool Insert(const std::string& fname) {
375 return locked_files_.insert(fname).second;
513 } else if (!locks_.Insert(fname)) {
|
| /external/llvm/lib/Target/SystemZ/ |
| SystemZISelDAGToDAG.cpp | 518 // Insert a node into the DAG at least before Pos. This will reposition
787 SDNode *Insert = CurDAG->getMachineNode(TargetOpcode::INSERT_SUBREG,
789 return SDValue(Insert, 0);
[all...] |
| /external/llvm/include/llvm/IR/ |
| IRBuilder.h | 42 if (BB) BB->getInstList().insert(InsertPt, I);
145 /// \brief Returns true if this insert point is set.
152 /// \brief Returns the current insert point.
157 /// \brief Returns the current insert point, clearing it in the process.
164 /// \brief Sets the current insert point to a previously-saved location.
282 /// \brief Create and insert a memset to the specified pointer and the
295 /// \brief Create and insert a memcpy between the specified pointers.
310 /// \brief Create and insert a memmove between the specified
431 /// \brief Insert and return the specified instruction.
433 InstTy *Insert(InstTy *I, const Twine &Name = "") const
[all...] |
| /external/llvm/lib/Transforms/Vectorize/ |
| SLPVectorizer.cpp | 348 Last->Scalars.insert(Last->Scalars.begin(), VL.begin(), VL.end());
358 MustGather.insert(VL.begin(), VL.end());
783 MemBarrierIgnoreList.insert(VL.begin(), VL.end());
[all...] |
| /external/open-vcdiff/gtest/src/ |
| 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) {
[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...] |
