Home
last modified time | relevance | path

Searched refs:insert (Results 476 - 500 of 3520) sorted by relevance

1...<<11121314151617181920>>...141

/third_party/spirv-tools/source/opt/
H A Dremove_unused_interface_variables_pass.cpp42 used_variables_.insert(*id); in processFunction()
64 old_variables.insert(variable); in ShouldModify()
H A Ddead_branch_elim_pass.cpp103 if (!live_blocks->insert(block).second) continue; in MarkLiveBlocks()
246 unreachable_merges->insert(merge_block); in MarkUnreachableStructuredTargets()
598 visited.insert(cont_id); in AddBlocksWithBackEdge()
599 visited.insert(header_id); in AddBlocksWithBackEdge()
600 visited.insert(merge_id); in AddBlocksWithBackEdge()
614 if (visited.insert(*succ_label_id).second) { in AddBlocksWithBackEdge()
623 blocks_with_back_edges->insert(bb); in AddBlocksWithBackEdge()
/third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_ops/apple/
H A DRewriteDoWhile.cpp120 sequence->insert(sequence->begin(), assignTrue);
121 sequence->insert(sequence->begin(), breakIf);
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/
H A DSROA.cpp266 void insert(ArrayRef<Slice> NewSlices) { in insert() function in llvm::sroa::AllocaSlices
670 if (VisitedDeadInsts.insert(&I).second)
902 MemTransferSliceMap.insert(std::make_pair(&II, AS.Slices.size()));
952 Visited.insert(Root);
985 if (Visited.insert(cast<Instruction>(U)).second)
1584 Visited.insert(Ptr);
1615 if (!Visited.insert(Ptr).second)
1655 } while (Visited.insert(Ptr).second);
2155 "Cannot insert a larger integer!");
2175 V = IRB.CreateOr(Old, V, Name + ".insert");
[all...]
H A DLoopSimplifyCFG.cpp228 LiveLoopBlocks.insert(L.getHeader()); in analyze()
252 LiveLoopBlocks.insert(Succ); in analyze()
254 LiveExitBlocks.insert(Succ); in analyze()
269 UniqueDeadExits.insert(ExitBlock).second) in analyze()
291 BlocksInLoopAfterFolding.insert(L.getLoopLatch()); in analyze()
304 BlocksInLoopAfterFolding.insert(BB); in analyze()
329 /// we insert the following fictive preheader:
492 DeadSuccessors.insert(Succ); in foldTerminators()
/third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/test/lang/
H A DUTF16Test.java510 * Testing UTF16 class method insert
522 UTF16.insert(strbuff, 5, 't'); in TestInsert()
523 UTF16.insert(strbuff, 5, 's'); in TestInsert()
524 UTF16.insert(strbuff, 5, 'e'); in TestInsert()
525 UTF16.insert(strbuff, 5, 't'); in TestInsert()
529 length = UTF16.insert(array, length, 5, 't'); in TestInsert()
530 length = UTF16.insert(array, length, 5, 's'); in TestInsert()
531 length = UTF16.insert(array, length, 5, 'e'); in TestInsert()
532 length = UTF16.insert(array, length, 5, 't'); in TestInsert()
537 UTF16.insert(strbuf in TestInsert()
[all...]
/third_party/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/lang/
H A DUTF16Test.java516 * Testing UTF16 class method insert
528 UTF16.insert(strbuff, 5, 't'); in TestInsert()
529 UTF16.insert(strbuff, 5, 's'); in TestInsert()
530 UTF16.insert(strbuff, 5, 'e'); in TestInsert()
531 UTF16.insert(strbuff, 5, 't'); in TestInsert()
535 length = UTF16.insert(array, length, 5, 't'); in TestInsert()
536 length = UTF16.insert(array, length, 5, 's'); in TestInsert()
537 length = UTF16.insert(array, length, 5, 'e'); in TestInsert()
538 length = UTF16.insert(array, length, 5, 't'); in TestInsert()
543 UTF16.insert(strbuf in TestInsert()
[all...]
/third_party/python/Lib/idlelib/
H A Dpyshell.py194 lineno = int(float(text.index("insert")))
203 lineno = int(float(text.index("insert")))
208 text.tag_remove("BREAK", "insert linestart",\
209 "insert lineend +1char")
354 "Extend base class: forbid insert/delete before the I/O mark"
355 def insert(self, index, chars, tags=None): member in ModifiedUndoDelegator
362 UndoDelegator.insert(self, index, chars, tags)
374 # Temporarily monkey-patch the delegate's .insert() method to
378 orig_insert = self.delegate.insert
379 self.delegate.insert
389 def insert(self, index, chars, tags=None): global() member in UserInputTaggingDelegator
[all...]
H A Dsidebar.py197 self.text.mark_set("insert",
269 The provided callback is called after every insert and delete.
275 def insert(self, index, chars, tags=None): member in EndLineDelegator
276 self.delegate.insert(index, chars, tags)
305 self.sidebar_text.insert('insert', '1', 'linenumber')
353 self.sidebar_text.insert(f'end -1c', new_text, 'linenumber')
367 callback - Callable, will be called when an insert, delete or replace
374 def insert(self, index, chars, tags=None): member in WrappedLineHeightChangeDelegator
379 self.delegate.insert(inde
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
H A DTwoAddressInstructionPass.cpp237 UseRegs.insert(MO.getReg()); in sink3AddrInstruction()
333 MBB->insert(KillPos, MI); in sink3AddrInstruction()
595 // insert => %reg1030 = COPY %reg1028 in isProfitableToCommute()
603 // insert => %reg1030 = COPY %reg1029 in isProfitableToCommute()
757 DistanceMap.insert(std::make_pair(NewMI, Dist)); in convertInstTo3Addr()
762 SunkInstrs.insert(NewMI); in convertInstTo3Addr()
781 if (IsCopy && !Processed.insert(UseMI).second) in scanUses()
793 bool isNew = SrcRegMap.insert(std::make_pair(NewReg, Reg)).second; in scanUses()
806 bool isNew = DstRegMap.insert(std::make_pair(FromReg, ToReg)).second; in scanUses()
811 bool isNew = DstRegMap.insert(st in scanUses()
[all...]
H A DRegAllocPBQP.cpp248 D.insert(IKey(NRegs, MRegs)); in setDisjointAllowedRegs()
250 D.insert(IKey(MRegs, NRegs)); in setDisjointAllowedRegs()
291 // the set will assume they're actually equal and refuse to insert a in lowestEndPoint()
383 EC.insert(EK);
387 Active.insert(Cur);
564 VRegsToAlloc.insert(Reg); in findVRegIntervalsToAlloc()
599 EmptyIntervalVRegs.insert(VRegLI.reg); in initializeGraph()
642 Worklist.insert(Worklist.end(), NewVRegs.begin(), NewVRegs.end()); in initializeGraph()
653 EmptyIntervalVRegs.insert(VReg); in initializeGraph()
697 VRegsToAlloc.insert(L in spillVReg()
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/container/internal/
H A Draw_hash_set.h74 // On insert, once the right group is found (as in lookup), its slots are
583 // In debug build we will randomly insert in either the front or back of
719 // An enabler for insert(T&&): T must be convertible to init_type or be the
888 insert(first, last);
918 // The same trick is used in insert().
971 // than a full `insert`.
1017 for (auto& elem : that) insert(std::move(elem));
1090 // m.insert(std::make_pair("abc", 42));
1097 std::pair<iterator, bool> insert(T&& value) {
1106 // s.insert(
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/subzero/src/
H A DIceTargetLoweringX8632.cpp453 // particular, no transformations that insert or reorder CfgNodes should be in translateO2()
627 Node->getInsts().insert(I3, BeaconDef); in findRMW()
631 Node->getInsts().insert(I3, RMW); in findRMW()
682 // which requires legalization to insert a copy to register. in doLoadOpt()
748 Context.insert(NewInst); in doLoadOpt()
1330 Context.insert<InstFakeDef>(Dest); in lowerAlloca()
1409 Context.insert<InstAssign>(Arg, RegisterArg); in lowerArguments()
1412 Context.insert<InstAssign>(Tmp, RegisterArg); in lowerArguments()
1413 Context.insert<InstAssign>(Arg, Tmp); in lowerArguments()
1725 Context.insert(Labe in lowerShift64()
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/number/
H A DNumberFormatterImpl.java421 length += string.insert(length + index, micros.symbols.getInfinity(), NumberFormat.Field.INTEGER); in writeNumber()
424 length += string.insert(length + index, micros.symbols.getNaN(), NumberFormat.Field.INTEGER); in writeNumber()
433 length += string.insert(length + index, in writeNumber()
449 length += string.insert(index, in writeNumber()
469 length += string.insert(index, in writeIntegerDigits()
482 length += string.insert(index, in writeIntegerDigits()
504 length += string.insert(length + index, micros.symbols.getDigitStringsLocal()[nextDigit], in writeFractionDigits()
/third_party/libabigail/src/
H A Dabg-ir-priv.h270 {depends_on_recursive_type_.insert(reinterpret_cast<uintptr_t>(t));} in set_depends_on_recursive_type()
790 recursive_types_.insert(reinterpret_cast<uintptr_t>(right)); in mark_dependant_types_compared_until()
853 to_remove.insert(i); in confirm_ct_propagation_for_types_dependant_on()
938 collected.insert(i); in collect_types_that_depends_on()
1035 types_with_non_confirmed_propagated_ct_.insert(v); in add_to_types_with_non_confirmed_propagated_ct()
1177 env.priv_->classes_being_compared_.insert in mark_as_being_compared()
1340 env.priv_->fn_types_being_compared_.insert in mark_as_being_compared()
/third_party/skia/third_party/externals/spirv-tools/source/fuzz/
H A Dtransformation_duplicate_region_with_selection.cpp332 original_label_to_duplicate_label.insert( in Apply()
341 original_id_to_duplicate_id.insert( in Apply()
348 original_id_to_phi_id.insert( in Apply()
391 // will insert |new_entry| before |entry_block|. in Apply()
470 // If the block is the first duplicated block, insert it after the exit in Apply()
471 // block of the original region. Otherwise, insert it after the preceding in Apply()
658 result.insert(&block); in GetRegionBlocks()
676 result.insert(pair.second()); in GetFreshIds()
679 result.insert(pair.second()); in GetFreshIds()
682 result.insert(pai in GetFreshIds()
[all...]
/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Ddead_branch_elim_pass.cpp107 if (!live_blocks->insert(block).second) continue; in MarkLiveBlocks()
250 unreachable_merges->insert(merge_block); in MarkUnreachableStructuredTargets()
610 visited.insert(cont_id); in AddBlocksWithBackEdge()
611 visited.insert(header_id); in AddBlocksWithBackEdge()
612 visited.insert(merge_id); in AddBlocksWithBackEdge()
626 if (visited.insert(*succ_label_id).second) { in AddBlocksWithBackEdge()
635 blocks_with_back_edges->insert(bb); in AddBlocksWithBackEdge()
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/fuzz/
H A Dtransformation_duplicate_region_with_selection.cpp332 original_label_to_duplicate_label.insert( in Apply()
341 original_id_to_duplicate_id.insert( in Apply()
348 original_id_to_phi_id.insert( in Apply()
391 // will insert |new_entry| before |entry_block|. in Apply()
470 // If the block is the first duplicated block, insert it after the exit in Apply()
471 // block of the original region. Otherwise, insert it after the preceding in Apply()
658 result.insert(&block); in GetRegionBlocks()
676 result.insert(pair.second()); in GetFreshIds()
679 result.insert(pair.second()); in GetFreshIds()
682 result.insert(pai in GetFreshIds()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Ddead_branch_elim_pass.cpp107 if (!live_blocks->insert(block).second) continue; in MarkLiveBlocks()
250 unreachable_merges->insert(merge_block); in MarkUnreachableStructuredTargets()
610 visited.insert(cont_id); in AddBlocksWithBackEdge()
611 visited.insert(header_id); in AddBlocksWithBackEdge()
612 visited.insert(merge_id); in AddBlocksWithBackEdge()
626 if (visited.insert(*succ_label_id).second) { in AddBlocksWithBackEdge()
635 blocks_with_back_edges->insert(bb); in AddBlocksWithBackEdge()
/third_party/skia/third_party/externals/zlib/google/
H A Dzip_unittest.cc146 zip_contents_.insert(zip_path.Append(FILE_PATH_LITERAL("foo.txt"))); in SetUp()
148 zip_contents_.insert(zip_path); in SetUp()
149 zip_contents_.insert(zip_path.Append(FILE_PATH_LITERAL("bar.txt"))); in SetUp()
151 zip_contents_.insert(zip_path); in SetUp()
152 zip_contents_.insert(zip_path.Append(FILE_PATH_LITERAL("baz.txt"))); in SetUp()
153 zip_contents_.insert(zip_path.Append(FILE_PATH_LITERAL("quux.txt"))); in SetUp()
154 zip_contents_.insert(zip_path.Append(FILE_PATH_LITERAL(".hidden"))); in SetUp()
/third_party/spirv-tools/source/fuzz/
H A Dtransformation_duplicate_region_with_selection.cpp332 original_label_to_duplicate_label.insert( in Apply()
341 original_id_to_duplicate_id.insert( in Apply()
348 original_id_to_phi_id.insert( in Apply()
391 // will insert |new_entry| before |entry_block|. in Apply()
470 // If the block is the first duplicated block, insert it after the exit in Apply()
471 // block of the original region. Otherwise, insert it after the preceding in Apply()
658 result.insert(&block); in GetRegionBlocks()
676 result.insert(pair.second()); in GetFreshIds()
679 result.insert(pair.second()); in GetFreshIds()
682 result.insert(pai in GetFreshIds()
[all...]
/third_party/mesa3d/src/gallium/frontends/clover/core/
H A Dkernel.cpp374 insert(T &v, const T &w) { in insert() function
375 v.insert(v.end(), w.begin(), w.end()); in insert()
454 insert(ctx.input, w); in bind()
497 insert(ctx.input, v); in bind()
502 insert(ctx.input, v); in bind()
539 insert(ctx.input, v); in bind()
571 insert(ctx.input, v); in bind()
610 insert(ctx.input, v); in bind()
641 insert(ctx.input, v); in bind()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/IR/
H A DPassManager.h162 PA.PreservedIDs.insert(&AllAnalysesKey); in all()
186 PreservedIDs.insert(ID); in preserve()
198 PreservedIDs.insert(ID); in preserveSet()
219 NotPreservedAnalysisIDs.insert(ID); in abandon()
237 NotPreservedAnalysisIDs.insert(ID); in intersect()
259 NotPreservedAnalysisIDs.insert(ID); in intersect()
707 // that. Note that we cannot reuse IMapI and must do a fresh insert here, in invalidateImpl()
708 // as calling invalidate could (recursively) insert things into the map, in invalidateImpl()
712 IsResultInvalidated.insert({ID, Result.invalidate(IR, PA, *this)}); in invalidateImpl()
888 // Note that we cannot reuse 'IMapI' here or pre-insert th in invalidate()
[all...]
/kernel/linux/linux-5.10/Documentation/sphinx/
H A DrstFlatTable.py33 * fill-cells: instead of autospann missing cells, insert missing cells
140 tableNode.insert(0, title)
264 self.rows[y].insert(x+c+1, None)
272 self.rows[y+r+1].insert(x+c, None)
355 cellElements.insert(0, target)
/kernel/linux/linux-5.10/drivers/net/can/dev/
H A Drx-offload.c79 struct sk_buff *pos, *insert = NULL; in __skb_queue_add_sort() local
96 insert = pos; in __skb_queue_add_sort()
99 if (!insert) in __skb_queue_add_sort()
102 __skb_queue_after(head, insert, new); in __skb_queue_add_sort()

Completed in 33 milliseconds

1...<<11121314151617181920>>...141