| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| H A D | MachineCopyPropagation.cpp | 121 RegsToInvalidate.insert(MI->getOperand(0).getReg()); in invalidateRegister()
122 RegsToInvalidate.insert(MI->getOperand(1).getReg()); in invalidateRegister()
124 RegsToInvalidate.insert(I->second.DefRegs.begin(), in invalidateRegister()
165 auto I = Copies.insert({*RUI, {nullptr, {}, false}}); in trackCopy()
610 MaybeDeadCopies.insert(MI); in ForwardCopyPropagateBlock()
795 MaybeDeadCopies.insert(Copy); in propagateDefs()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Linker/ |
| H A D | LinkModules.cpp | 392 ValuesToLink.insert(&GV); in linkIfNeeded()
403 Internalize.insert(GV.getName()); in addLazyFor()
417 Internalize.insert(GV2->getName()); in addLazyFor()
481 ReplacedDstComdats.insert(DstC); in run()
541 ValuesToLink.insert(GV2); in run()
547 Internalize.insert(GV->getName()); in run()
|
| /third_party/skia/third_party/externals/spirv-tools/source/fuzz/ |
| H A D | fuzzer_pass.cpp | 127 // In order for transformations to insert new instructions, they need to in ForEachInstructionWithInstructionDescriptor()
128 // be able to identify the instruction to insert before. We describe an in ForEachInstructionWithInstructionDescriptor()
489 basic_types.insert(inst.result_id()); in GetAvailableBasicTypesAndPointers()
490 basic_type_to_pointers.insert({inst.result_id(), {}}); in GetAvailableBasicTypesAndPointers()
495 basic_types.insert(inst.result_id()); in GetAvailableBasicTypesAndPointers()
496 basic_type_to_pointers.insert({inst.result_id(), {}}); in GetAvailableBasicTypesAndPointers()
512 basic_types.insert(inst.result_id()); in GetAvailableBasicTypesAndPointers()
513 basic_type_to_pointers.insert({inst.result_id(), {}}); in GetAvailableBasicTypesAndPointers()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/fuzz/ |
| H A D | fuzzer_pass.cpp | 127 // In order for transformations to insert new instructions, they need to in ForEachInstructionWithInstructionDescriptor()
128 // be able to identify the instruction to insert before. We describe an in ForEachInstructionWithInstructionDescriptor()
489 basic_types.insert(inst.result_id()); in GetAvailableBasicTypesAndPointers()
490 basic_type_to_pointers.insert({inst.result_id(), {}}); in GetAvailableBasicTypesAndPointers()
495 basic_types.insert(inst.result_id()); in GetAvailableBasicTypesAndPointers()
496 basic_type_to_pointers.insert({inst.result_id(), {}}); in GetAvailableBasicTypesAndPointers()
512 basic_types.insert(inst.result_id()); in GetAvailableBasicTypesAndPointers()
513 basic_type_to_pointers.insert({inst.result_id(), {}}); in GetAvailableBasicTypesAndPointers()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
| H A D | MustExecute.cpp | 168 Predecessors.insert(Pred); in collectTransitivePredecessors()
184 if (Predecessors.insert(PredPred).second) in collectTransitivePredecessors()
221 if (CheckedSuccessors.insert(Succ).second && in allLoopPathsLeadToBlock()
602 if (!Visited.insert(ToBB).second) { in findForwardJoinPoint()
702 Visited.insert(I); in reset()
709 if (Next && !Visited.insert(Next).second) in advance()
|
| /third_party/skia/tools/skqp/src/ |
| H A D | skqp.cpp | 70 auto insert = [&testset](const char* s, size_t l) { in get_unit_tests() local
76 testset.insert(std::string(s, l)); in get_unit_tests()
80 readlines(dat->data(), dat->size(), insert); in get_unit_tests()
98 auto insert = [gmThresholds](const char* s, size_t l) { in get_render_tests() local
122 gmThresholds->insert({std::move(key), value}); // (*gmThresholds)[s] = value; in get_render_tests()
125 readlines(dat->data(), dat->size(), insert); in get_render_tests()
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/container/internal/ |
| H A D | raw_hash_set_probe_benchmark.cc | 145 while (t.size() < kMinSize) t.insert(t.size()); in GetMinMaxLoadSizes()
149 while (lf <= t.load_factor()) t.insert(t.size()); in GetMinMaxLoadSizes()
152 // Then, insert until we reach min load factor. in GetMinMaxLoadSizes()
157 t.insert(t.size()); in GetMinMaxLoadSizes()
182 while (t.size() < min_max_sizes.min_load) t.insert(elem()); in CollectMeanProbeLengths()
187 t.insert(elem()); in CollectMeanProbeLengths()
191 while (t.size() < min_max_sizes.max_load) t.insert(elem()); in CollectMeanProbeLengths()
|
| /third_party/rust/crates/nix/test/ |
| H A D | test_stat.rs | 156 mode1.insert(Mode::S_IRUSR); in test_fchmod()
157 mode1.insert(Mode::S_IWUSR); in test_fchmod()
164 mode2.insert(Mode::S_IROTH); in test_fchmod()
185 mode1.insert(Mode::S_IRUSR); in test_fchmodat()
186 mode1.insert(Mode::S_IWUSR); in test_fchmodat()
196 mode2.insert(Mode::S_IROTH); in test_fchmodat()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/LTO/ |
| H A D | LTO.cpp | 186 UsedCfiDefs.insert(ValueGUID); in computeLTOCacheKey()
188 UsedCfiDecls.insert(ValueGUID); in computeLTOCacheKey()
205 UsedTypeIds.insert(TT); in computeLTOCacheKey()
207 UsedTypeIds.insert(TT.GUID); in computeLTOCacheKey()
209 UsedTypeIds.insert(TT.GUID); in computeLTOCacheKey()
211 UsedTypeIds.insert(TT.VFunc.GUID); in computeLTOCacheKey()
213 UsedTypeIds.insert(TT.VFunc.GUID); in computeLTOCacheKey()
372 GlobalInvolvedWithAlias.insert(&AS->getAliasee()); in thinLTOResolvePrevailingInIndex()
690 AliasedGlobals.insert(GO); in addRegularLTO()
747 NonPrevailingComdats.insert(G in addRegularLTO()
[all...] |
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/ |
| H A D | BitTracker.cpp | 214 BT::RegisterCell &BT::RegisterCell::insert(const BT::RegisterCell &RC, in insert() function in BT::RegisterCell
353 // value. Don't actually insert anything in the map, just return the cell.
371 // If not found, create a "top" entry, but do not insert it in the map.
700 // Copy bits from A1, insert A2 at position AtN.
703 Res.insert(RegisterCell::ref(A2), BT::BitMask(AtN, AtN+W2-1));
736 Res.insert(RegisterCell::ref(getCell(RS, Inputs)), mask(RD.Reg, SS));
737 Res.insert(RegisterCell::ref(getCell(RT, Inputs)), mask(RD.Reg, ST));
753 Res.insert(Src, BitMask(0, WS-1));
789 Dist.insert(std::make_pair(MI, D));
932 InstrExec.insert(
[all...] |
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/IPO/ |
| H A D | SampleProfile.cpp | 243 CurrentGUIDToFuncNameMap.insert( in GUIDToFuncNameMapper()
255 CurrentGUIDToFuncNameMap.insert( in GUIDToFuncNameMapper()
782 VisitedBlocks.insert(&BB); in computeBlockWeights()
1001 CIS.insert(CIS.begin(), AllCandidates.begin(), AllCandidates.end()); in inlineHotFunctions()
1005 CIS.insert(CIS.begin(), ColdCandidates.begin(), ColdCandidates.end()); in inlineHotFunctions()
1046 PromotedInsns.insert(I); in inlineHotFunctions()
1154 VisitedBlocks.insert(EC); in findEquivalencesFor()
1370 VisitedEdges.insert(UnknownEdge); in propagateThroughEdges()
1381 VisitedEdges.insert(E); in propagateThroughEdges()
1387 VisitedEdges.insert( in propagateThroughEdges()
[all...] |
| /third_party/glslang/glslang/MachineIndependent/ |
| H A D | LiveTraverser.h | 141 liveFunctions.insert(call->getName()); in addFunctionCall()
150 liveGlobals.insert(name); in addGlobalReference()
|
| /third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/number/ |
| H A D | ConstantMultiFieldModifier.java | 54 int length = output.insert(leftIndex, prefixChars, prefixFields); in apply()
58 length += output.insert(rightIndex + length, suffixChars, suffixFields); in apply()
|
| /third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/number/ |
| H A D | ConstantMultiFieldModifier.java | 56 int length = output.insert(leftIndex, prefixChars, prefixFields); in apply()
60 length += output.insert(rightIndex + length, suffixChars, suffixFields); in apply()
|
| /third_party/node/deps/v8/tools/dev/ |
| H A D | update-compile-commands.py | 29 sys.path.insert(0, PYLIB_PATH)
32 sys.path.insert(0, GM_PATH)
|
| /third_party/node/deps/v8/tools/clusterfuzz/js_fuzzer/mutators/ |
| H A D | function_call_mutator.js | 115 const insert = _liftExpressionsToStatements(path, [
125 thisMutator.insertAfterSkip(path, insert);
|
| /third_party/ninja/src/ |
| H A D | dyndep.cc | 91 edge->outputs_.insert(edge->outputs_.end(), in UpdateEdge()
109 edge->inputs_.insert(edge->inputs_.end() - edge->order_only_deps_, in UpdateEdge()
|
| /third_party/node/deps/v8/src/ic/ |
| H A D | ic-stats.cc | 68 script_name_map_.insert( in GetOrCacheScriptName()
72 script_name_map_.insert( in GetOrCacheScriptName()
|
| /third_party/node/deps/v8/src/torque/ |
| H A D | torque-code-generator.h | 47 it = location_map_.insert(std::make_pair(location, FreshNodeName())) in DefinitionToVariable()
57 location_map_.insert(std::make_pair(definition, str)); in SetDefinitionVariable()
|
| /third_party/mesa3d/src/nouveau/codegen/ |
| H A D | nv50_ir_from_common.cpp | 39 it = sub.map.insert(std::make_pair( in getSubroutine()
52 it = sub.map.insert(std::make_pair(ip, Subroutine(f))).first; in getSubroutine()
|
| /third_party/rust/crates/cxx/gen/build/src/syntax/ |
| H A D | map.rs | 42 pub fn insert(&mut self, key: K, value: V) -> Option<V> { in insert() functions
49 entry.insert(self.vec.len()); in insert()
103 pub fn insert(&mut self, key: K, value: V) -> Option<V> { in insert() functions
104 self.0.insert(key, value) in insert()
142 set.insert(*key); in keys()
|
| /third_party/rust/crates/cxx/gen/lib/src/syntax/ |
| H A D | map.rs | 42 pub fn insert(&mut self, key: K, value: V) -> Option<V> { in insert() functions
49 entry.insert(self.vec.len()); in insert()
103 pub fn insert(&mut self, key: K, value: V) -> Option<V> { in insert() functions
104 self.0.insert(key, value) in insert()
142 set.insert(*key); in keys()
|
| /third_party/rust/crates/cxx/macro/src/syntax/ |
| H A D | map.rs | 42 pub fn insert(&mut self, key: K, value: V) -> Option<V> { in insert() functions
49 entry.insert(self.vec.len()); in insert()
103 pub fn insert(&mut self, key: K, value: V) -> Option<V> { in insert() functions
104 self.0.insert(key, value) in insert()
142 set.insert(*key); in keys()
|
| /third_party/rust/crates/cxx/syntax/ |
| H A D | map.rs | 42 pub fn insert(&mut self, key: K, value: V) -> Option<V> { in insert() functions
49 entry.insert(self.vec.len()); in insert()
103 pub fn insert(&mut self, key: K, value: V) -> Option<V> { in insert() functions
104 self.0.insert(key, value) in insert()
142 set.insert(*key); in keys()
|
| /third_party/rust/crates/cxx/gen/cmd/src/syntax/ |
| H A D | map.rs | 42 pub fn insert(&mut self, key: K, value: V) -> Option<V> { in insert() functions
49 entry.insert(self.vec.len()); in insert()
103 pub fn insert(&mut self, key: K, value: V) -> Option<V> { in insert() functions
104 self.0.insert(key, value) in insert()
142 set.insert(*key); in keys()
|