Home
last modified time | relevance | path

Searched refs:back (Results 1301 - 1325 of 2267) sorted by relevance

1...<<51525354555657585960>>...91

/third_party/node/deps/v8/src/heap/cppgc-js/
H A Dcpp-heap.cc329 incremental_mark_batched_events_.events.back().cpp_wall_clock_duration_in_us = in AddMainThreadEvent()
347 incremental_sweep_batched_events_.events.back() in AddMainThreadEvent()
/third_party/node/deps/v8/src/heap/
H A Dsweeper.cc186 auto last_page = list.back(); in GetSweptPageSafe()
513 // The Scavenger may add already swept pages back. in ParallelSweepPage()
628 page = sweeping_list_[space_index].back(); in GetSweepingPageSafe()
/third_party/libabigail/src/
H A Dabg-ini.cc907 return buf_.back(); in peek()
950 result = buf_.back(); in get()
962 /// Put a character that was read from the input stream, back into
966 /// @param c the character to put back into the stream.
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
H A DEarlyIfConversion.cpp511 PHIInfo &PI = PHIs.back(); in canConvertIf()
761 DomTree->changeImmediateDominator(Node->getChildren().back(), HeadNode); in updateDomTree()
772 // If-conversion doesn't change loop structure, and it doesn't mess with back in updateLoops()
H A DInterleavedLoadCombinePass.cpp1271 if (!VectorInfo::computeFromSVI(SVI, Candidates.back(), DL)) { in run()
1276 if (!Candidates.back().isInterleaved(Factor, DL)) { in run()
1289 // back on the list and continue searching in run()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/SelectionDAG/
H A DLegalizeTypes.cpp221 SDNode *N = Worklist.back(); in run()
646 SDNode *N = NodesToAnalyze.back(); in ReplaceValueWith()
H A DScheduleDAGFast.cpp59 SUnit *V = Queue.back(); in pop()
539 // priority. If it is not ready put it back. Schedule the node. in ListScheduleBottomUp()
598 NewDef = Copies.back(); in ListScheduleBottomUp()
614 // Add the nodes that aren't ready back onto the available list. in ListScheduleBottomUp()
/third_party/skia/src/gpu/dawn/
H A DGrDawnProgramBuilder.cpp214 auto back = stencilSettings.postOriginCWFace(origin); in create_depth_stencil_state() local
216 state.stencilBack = to_stencil_state_face(back); in create_depth_stencil_state()
/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Dir_context.cpp230 auto* i = work_list.back(); in CollectNonSemanticTree()
936 line_inst = &line_inst->dbg_line_insts().back(); in EmitErrorMessage()
H A Dloop_unroller.cpp425 // Add the new merge block to the back of the list of blocks to be added. It in PartiallyUnrollResidualFactor()
763 if (!lines.empty()) new_branch->AddDebugLine(&lines.back()); in FoldConditionBlock()
817 new_block_order.push_back(blocks_to_add_.back().get()); in DuplicateLoop()
H A Dmerge_return_pass.cpp85 auto lastMergeInst = state_.back().BreakMergeInst(); in GenerateState()
94 auto lastMergeInst = state_.back().BreakMergeInst(); in GenerateState()
445 // If |block| is a loop header, then the back edge must jump to the original in BreakFromConstruct()
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Dir_context.cpp230 auto* i = work_list.back(); in CollectNonSemanticTree()
936 line_inst = &line_inst->dbg_line_insts().back(); in EmitErrorMessage()
H A Dloop_unroller.cpp425 // Add the new merge block to the back of the list of blocks to be added. It in PartiallyUnrollResidualFactor()
763 if (!lines.empty()) new_branch->AddDebugLine(&lines.back()); in FoldConditionBlock()
817 new_block_order.push_back(blocks_to_add_.back().get()); in DuplicateLoop()
H A Dmerge_return_pass.cpp85 auto lastMergeInst = state_.back().BreakMergeInst(); in GenerateState()
94 auto lastMergeInst = state_.back().BreakMergeInst(); in GenerateState()
445 // If |block| is a loop header, then the back edge must jump to the original in BreakFromConstruct()
/third_party/skia/third_party/externals/imgui/misc/freetype/
H A Dimgui_freetype.cpp555 src_glyph.BitmapData = (unsigned int*)(buf_bitmap_buffers.back() + buf_bitmap_current_used_bytes); in ImFontAtlasBuildWithFreeTypeEx()
617 // 8. Copy rasterized font characters back into the main texture in ImFontAtlasBuildWithFreeTypeEx()
664 ImFontGlyph* dst_glyph = &dst_font->Glyphs.back(); in ImFontAtlasBuildWithFreeTypeEx()
/third_party/skia/tests/
H A DUtilsTest.cpp208 REPORTER_ASSERT(reporter, s1.back() == 100); in DEF_TEST()
373 // Check back in DEF_TEST()
374 auto t = z.back(); in DEF_TEST()
/third_party/skia/src/utils/
H A DSkJSON.cpp545 const auto& obj = fValueStack.back().as<ObjectValue>(); in popObjectScope()
566 const auto& arr = fValueStack.back().as<ArrayValue>(); in popArrayScope()
/third_party/skia/third_party/externals/dawn/src/dawn_native/vulkan/
H A DDeviceVk.cpp271 // If submitting to the queue fails, move the fence back into the unused fence in SubmitPendingCommands()
521 VkFence fence = mUnusedFences.back(); in GetUnusedFence()
574 CommandPoolAndBuffer commands = mUnusedCommands.back(); in PrepareRecordingContext()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
H A DBranchProbabilityInfo.cpp311 WeightSum += Weights.back(); in calcMetadataWeights()
506 // We detect this by looking back through the graph of PHI nodes that sets the in computeUnlikelySuccessors()
552 PHINode *P = WorkList.back(); in computeUnlikelySuccessors()
618 // Use LoopInfo if we have it, otherwise fall-back to SCC info to catch in calcLoopBranchHeuristics()
642 // Collect the sum of probabilities of back-edges/in-edges/exiting-edges, and in calcLoopBranchHeuristics()
H A DGlobalsModRef.cpp459 AllocsForIndirectGlobals[AllocRelatedValues.back()] = GV; in AnalyzeIndirectGlobalMemory()
460 Handles.emplace_front(*this, AllocRelatedValues.back()); in AnalyzeIndirectGlobalMemory()
527 // This function might call back into the module and read a global - in AnalyzeCallGraph()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/
H A DLowerMatrixIntrinsics.cpp332 Instruction *Inst = WorkList.back(); in propagateShapeForward()
403 Value *V = WorkList.back(); in propagateShapeBackward()
606 /// The intrinsic store a matrix back memory using a stride between columns.
818 // Add each column and store the result back into the opmapping in VisitBinaryOperator()
H A DSeparateConstOffsetFromGEP.cpp750 UserChainTail = Extractor.UserChain.back(); in Extract()
1053 // bitcast %gep2 to i8*, add the offset, and bitcast the result back to the in splitGEP()
1155 Instruction *Candidate = Candidates.back(); in findClosestMatchingDominator()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/ProfileData/
H A DGCOV.cpp189 GCOVEdge *Edge = Edges.back().get(); in readGCNO()
348 return Blocks.back()->getCount(); in getExitCount()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/PowerPC/
H A DPPCReduceCRLogicals.cpp717 if (AllCRLogicalOps.back().IsNullary) in collectCRLogicals()
719 else if (AllCRLogicalOps.back().IsBinary) in collectCRLogicals()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/WebAssembly/AsmParser/
H A DWebAssemblyAsmParser.cpp254 auto Top = NestingStack.back(); in pop()
266 nestingString(NestingStack.back()).first); in ensureEmptyNestingStack()

Completed in 40 milliseconds

1...<<51525354555657585960>>...91