Home
last modified time | relevance | path

Searched refs:insert (Results 526 - 550 of 5258) sorted by relevance

1...<<21222324252627282930>>...211

/third_party/skia/third_party/externals/angle2/src/libANGLE/
H A DDisplay.cpp571 mContexts.insert(context); in addSharedContext()
661 displays->insert( in GetDisplayFromNativeDisplay()
742 devicePlatformDisplays->insert(std::make_pair(device, display)); in GetDisplayFromDevice()
766 displays.insert(anglePlatformDisplayMapEntry.second); in GetEglDisplaySet()
771 displays.insert(devicePlatformDisplayMapEntry.second); in GetEglDisplaySet()
893 mAttributeMap.insert(EGL_PLATFORM_ANGLE_TYPE_ANGLE, displayType); in updateAttribsFromEnvironment()
899 mAttributeMap.insert(EGL_PLATFORM_ANGLE_DEVICE_TYPE_ANGLE, deviceType); in updateAttribsFromEnvironment()
905 mAttributeMap.insert(EGL_PLATFORM_ANGLE_NATIVE_PLATFORM_TYPE_ANGLE, platformType); in updateAttribsFromEnvironment()
1119 attribsWithDefaults.insert(EGL_COLOR_BUFFER_TYPE, EGL_RGB_BUFFER); in chooseConfig()
1120 attribsWithDefaults.insert(EGL_LEVE in chooseConfig()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/
H A DHexagonCommonGEP.cpp83 void insert(const GepNode *N) { Map.insert(std::make_pair(N, ++LastNum)); } in insert() function
375 Us.insert(&UI.getUse()); in processGepInst()
378 NodeOrder.insert(N); in processGepInst()
393 NodeOrder.insert(Nx); in processGepInst()
402 Uses[PN].insert(Us.begin(), Us.end()); in processGepInst()
407 NM.insert(std::make_pair(GepI, PN)); in processGepInst()
452 Nodes.insert(Root); in nodes_for_root()
460 Work.insert(Work.end(), CF->second.begin(), CF->second.end()); in nodes_for_root()
461 Nodes.insert(C in nodes_for_root()
[all...]
H A DHexagonRDFOpt.cpp114 EM.insert(std::make_pair(DstR, SrcR)); in interpretAsCopy()
167 R2I.insert(std::make_pair(RA.Id, SA.Id)); in run()
170 PartlyDead.insert(SA.Id); in run()
202 OpMap.insert(std::make_pair(RA.Id, getOpNum(RA.Addr->getOp()))); in removeOperand()
269 Remove.insert(D.Id); in rewrite()
H A DRDFDeadCode.cpp44 Set.insert(V); in push_back()
102 LiveNodes.insert(TA.Id); in processDef()
134 LiveNodes.insert(N); in collect()
161 DeadNodes.insert(RA.Id); in collect()
166 DeadInstrs.insert(IA.Id); in collect()
/third_party/zlib/
H A Ddeflate.c286 if (s->insert > s->strstart) in fill_window()
287 s->insert = s->strstart; in fill_window()
310 if (s->lookahead + s->insert >= MIN_MATCH) { in fill_window()
311 uInt str = s->strstart - s->insert; in fill_window()
317 while (s->insert) { in fill_window()
324 s->insert--; in fill_window()
325 if (s->lookahead + s->insert < MIN_MATCH) in fill_window()
580 s->insert = 0; in deflateSetDictionary()
586 /* insert dictionary into window and hash */ in deflateSetDictionary()
609 s->insert in deflateSetDictionary()
[all...]
/foundation/multimedia/drm_framework/interfaces/kits/c/drm_capi/common/
H A Dnative_drm_object.h63 eventMap_.insert({ MediaKeySystemEvent::EVENT_STR_PROVISION_REQUIRED, in InitEventMap()
153 eventMap_.insert({ static_cast<std::string>(MediaKeySessionEvent::EVENT_STR_EXPIRATION_UPDATED), in InitEventMap()
155 eventMap_.insert( in InitEventMap()
157 eventMap_.insert( in InitEventMap()
159 eventMap_.insert( in InitEventMap()
/foundation/communication/netmanager_base/test/netconnmanager/unittest/net_supplier_test/
H A Dnet_supplier_test.cpp48 netCaps.insert(NET_CAPABILITY_INTERNET); in SetUpTestCase()
161 netCaps.insert(NetCap::NET_CAPABILITY_NOT_METERED); in HWTEST_F()
184 supplier->requestList_.insert(1); in HWTEST_F()
230 netCaps.insert(NET_CAPABILITY_INTERNET); in HWTEST_F()
242 supplier->bestReqList_.insert(reqId); in HWTEST_F()
/foundation/distributeddatamgr/relational_store/test/js/relationalstore/unittest/src/
H A DRdbStoreQueryByStep.test.js73 console.error(TAG + `insert data into table test failed, err code:${err.code}, message:${err.message}`)
104 await rdbStore.insert("test", valuesBucket1);
111 await rdbStore.insert("test", valuesBucket2);
117 await rdbStore.insert("test", valuesBucket3);
373 await rdbStore.insert("test", valuesBucket4);
/foundation/window/window_manager/window_scene/test/unittest/
H A Dscene_session_manager_test11.cpp163 ssm_->sceneSessionMap_.insert({ persistentId, sceneSession }); in HWTEST_F()
243 ssm_->sceneSessionMap_.insert({1, sceneSession}); in HWTEST_F()
282 ssm_->sceneSessionMap_.insert({0, nullptr}); in HWTEST_F()
283 ssm_->sceneSessionMap_.insert({1, sceneSession1}); in HWTEST_F()
284 ssm_->sceneSessionMap_.insert({2, sceneSession2}); in HWTEST_F()
/third_party/benchmark/test/
H A Duser_counters_tabular_test.cc68 state.counters.insert({ in BM_Counters_Tabular()
379 state.counters.insert({ in BM_CounterRates_Tabular()
435 state.counters.insert({ in BM_CounterSet0_Tabular()
475 state.counters.insert({ in BM_CounterSet1_Tabular()
519 state.counters.insert({ in BM_CounterSet2_Tabular()
/third_party/gn/src/gn/
H A Dpointer_set_unittest.cc116 set.insert(kFullList.begin(), kFullList.end()); in TEST()
122 set.insert(kFullList.begin(), kFullList.end()); in TEST()
130 set1.insert(set2); in TEST()
138 set1.insert(set2); in TEST()
163 set1.insert(kFullList.begin(), kFullList.end()); in TEST()
/third_party/node/src/tracing/
H A Dagent.cc42 result.insert(id_value.second.begin(), id_value.second.end()); in flatten()
114 categories_with_default.insert(categories.begin(), categories.end()); in AddClient()
115 categories_with_default.insert(categories_[kDefaultHandleId].begin(), in AddClient()
128 to_be_initialized_.insert(raw); in AddClient()
171 categories_[id].insert(categories.begin(), categories.end()); in Enable()
/third_party/node/deps/v8/src/compiler/backend/
H A Dregister-allocator-verifier.h99 void AddAlias(int vreg) { aliases_.insert(vreg); } in AddAlias()
160 map_.insert( in AddDefinition()
170 map_.insert(other->map_.begin(), other->map_.end()); in CopyFrom()
171 stale_ref_stack_slots_.insert(other->stale_ref_stack_slots_.begin(), in CopyFrom()
254 map_.insert(std::make_pair(op, vreg)); in AddDelayedAssessment()
/third_party/node/deps/v8/src/torque/
H A Dkythe-data.cc41 that->constants_.insert(it, std::make_pair(constant, constant_id)); in AddConstantDefinition()
66 that->callables_.insert(it, std::make_pair(callable, callable_id)); in AddFunctionDefinition()
97 that->class_fields_.insert(it, std::make_pair(field, field_id)); in AddClassFieldDefinition()
136 that->local_bindings_.insert(it, std::make_pair(binding_index, binding_id)); in AddBindingDefinitionImpl()
171 that->types_.insert(it, std::make_pair(type_decl, type_id)); in AddTypeDefinition()
/third_party/skia/third_party/externals/angle2/src/compiler/translator/TranslatorMetalDirect/
H A DToposortStructs.cpp45 es.insert(z); in BuildGraphImpl()
48 es.insert(ez.begin(), ez.end()); in BuildGraphImpl()
75 invPerms.insert(entry.first); in Toposort()
97 temps.insert(n); in Toposort()
283 if (mUsedStructs.insert(&structure).second) in useStruct()
/third_party/skia/third_party/externals/spirv-tools/source/
H A Dcfa.h151 processed.insert(entry->id()); in DepthFirstTraversal()
168 processed.insert(child->id()); in DepthFirstTraversal()
266 auto mark_visited = [&visited](const BB* b) { visited.insert(b); }; in TraversalRoots()
331 augmented_preds.insert(augmented_preds.end(), preds->begin(), preds->end()); in ComputeAugmentedCFG()
341 augmented_succ.insert(augmented_succ.end(), succ->begin(), succ->end()); in ComputeAugmentedCFG()
/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Ddead_insert_elim_pass.cpp93 // If no extract indices, mark insert and inserted object (which might in MarkInsertChain()
94 // also be an insert chain) and continue up the chain though the input in MarkInsertChain()
101 liveInserts_.insert(insInst->result_id()); in MarkInsertChain()
106 // If extract indices match insert, we are done. Mark insert and in MarkInsertChain()
109 liveInserts_.insert(insInst->result_id()); in MarkInsertChain()
115 // If non-matching intersection, mark insert in MarkInsertChain()
117 liveInserts_.insert(insInst->result_id()); in MarkInsertChain()
118 // If more extract indices than insert, we are done. Use remaining in MarkInsertChain()
127 // If fewer extract indices than insert, als in MarkInsertChain()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/
H A Dcfa.h151 processed.insert(entry->id()); in DepthFirstTraversal()
168 processed.insert(child->id()); in DepthFirstTraversal()
266 auto mark_visited = [&visited](const BB* b) { visited.insert(b); }; in TraversalRoots()
331 augmented_preds.insert(augmented_preds.end(), preds->begin(), preds->end()); in ComputeAugmentedCFG()
341 augmented_succ.insert(augmented_succ.end(), succ->begin(), succ->end()); in ComputeAugmentedCFG()
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Ddead_insert_elim_pass.cpp93 // If no extract indices, mark insert and inserted object (which might in MarkInsertChain()
94 // also be an insert chain) and continue up the chain though the input in MarkInsertChain()
101 liveInserts_.insert(insInst->result_id()); in MarkInsertChain()
106 // If extract indices match insert, we are done. Mark insert and in MarkInsertChain()
109 liveInserts_.insert(insInst->result_id()); in MarkInsertChain()
115 // If non-matching intersection, mark insert in MarkInsertChain()
117 liveInserts_.insert(insInst->result_id()); in MarkInsertChain()
118 // If more extract indices than insert, we are done. Use remaining in MarkInsertChain()
127 // If fewer extract indices than insert, als in MarkInsertChain()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
H A DDependenceGraphBuilder.cpp45 InstOrdinalMap.insert(std::make_pair(&I, NextOrdinal++)); in computeInstructionOrdinals()
55 IMap.insert(std::make_pair(&I, &NewNode)); in createFineGrainedNodes()
56 NodeOrdinalMap.insert(std::make_pair(&NewNode, getOrdinal(I))); in createFineGrainedNodes()
267 if (VisitedTargets.insert(DstNode).second) { in createDefUseEdges()
391 NodesInPO.insert(NodesInPO.end(), PiBlockMembers.begin(), in sortNodesTopologically()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/
H A DLoopSink.cpp93 /// Return a set of basic blocks to insert sinked instructions.
128 BBsToSinkInto.insert(UseBBs.begin(), UseBBs.end()); in findBBsToSinkInto()
143 BBsDominatedByColdestBB.insert(SinkedBB); in findBBsToSinkInto()
151 BBsToSinkInto.insert(ColdestBB); in findBBsToSinkInto()
190 BBs.insert(UI->getParent()); in sinkInstruction()
199 // Find the set of BBs that we should insert a copy of I. in sinkInstruction()
216 SortedBBsToSinkInto.insert(SortedBBsToSinkInto.begin(), BBsToSinkInto.begin(), in sinkInstruction()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-subzero/include/llvm/ADT/
H A Dsimple_ilist.h31 /// insert(). These all take values by reference (not by pointer), except for
32 /// the range version of \a insert().
140 void push_front(reference Node) { insert(begin(), Node); } in push_front()
143 void push_back(reference Node) { insert(end(), Node); } in push_back()
155 iterator insert(iterator I, reference Node) { in insert() function in llvm::simple_ilist
162 void insert(iterator I, Iterator First, Iterator Last) { in insert() function in llvm::simple_ilist
164 insert(I, *First); in insert()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/WebAssembly/
H A DWebAssemblyLateEHPrepare.cpp70 Visited.insert(MBB); in getMatchingEHPad()
265 TerminatePads.insert(getMatchingEHPad(&MI)); in addExceptionExtraction()
279 EHPad->insert(Catch->getNextNode(), Extract->removeFromParent()); in addExceptionExtraction()
300 MF.insert(std::next(MachineFunction::iterator(EHPad)), ElseMBB); in addExceptionExtraction()
301 MF.insert(std::next(MachineFunction::iterator(ElseMBB)), ThenMBB); in addExceptionExtraction()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
H A DDenseSet.h71 insert(Elems.begin(), Elems.end()); in DenseSetImpl()
187 std::pair<iterator, bool> insert(const ValueT &V) { in insert() function in llvm::detail::DenseSetImpl
192 std::pair<iterator, bool> insert(ValueT &&V) { in insert() function in llvm::detail::DenseSetImpl
197 /// Alternative version of insert that uses a different (and possibly less
211 void insert(InputIt I, InputIt E) { in insert() function in llvm::detail::DenseSetImpl
213 insert(*I); in insert()
H A DMapVector.h100 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair); in operator []()
117 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) { in insert() function in llvm::MapVector
119 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair); in insert()
129 std::pair<iterator, bool> insert(std::pair<KeyT, ValueT> &&KV) { in insert() function in llvm::MapVector
132 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair); in insert()

Completed in 21 milliseconds

1...<<21222324252627282930>>...211