Home
last modified time | relevance | path

Searched refs:next (Results 6026 - 6037 of 6037) sorted by relevance

1...<<241242

/third_party/skia/third_party/externals/angle2/src/libANGLE/capture/
H A DFrameCapture.cpp2332 // Increment tempIDStart to get a new gShaderProgram map index for the next linked stage in GenerateLinkedProgram()
2836 gl::ImageIndex index = imageIter.next(); in CaptureShareGroupMidExecutionSetup()
5797 // Set the capture active to ensure all GLES commands issued by the next frame are in onEndFrame()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
H A DValueTracking.cpp557 for (auto I = std::next(BasicBlock::const_iterator(Inv)), in isValidAssumeForContext()
3748 // These next two are very similar to the above, but also look through PHI
H A DScalarEvolution.cpp312 if (std::next(I) != E) in print()
1153 // The next issue is how to safely do the division by 2^T. The way this in BinomialCoefficient()
2551 // If there are add operands they would be next. in getAddExpr()
2784 // next one. in getAddExpr()
3156 // next one.
4779 // As we next prove, the above predicates guarantee that:
7198 // Proceed to the next level to examine the exit condition expression.
7388 // Proceed to the next level to examine the icmp.
7977 // Compute the value of the PHIs for the next iteration.
8060 // Update all the PHI nodes for the next iteratio
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Vectorize/
H A DLoopVectorize.cpp1756 LastInduction->setName("vec.ind.next");
2040 auto NewIP = std::next(BasicBlock::iterator(LastInst));
2548 Value *Next = Builder.CreateAdd(Induction, Step, "index.next");
3550 // After execution completes the vector loop, we extract the next value of
4179 SclrGep->setName("next.gep");
6225 // predicated, we fall through to the next case.
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/ARM/
H A DARMBaseInstrInfo.cpp378 MachineBasicBlock::iterator DI = std::next(I); in analyzeBranch()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/PowerPC/
H A DPPCISelDAGToDAG.cpp841 // Shift for next step if the upper 32-bits were not zero. in selectI64ImmInstrCountDirect()
952 // Shift for next step if the upper 32-bits were not zero. in selectI64ImmDirect()
1308 // VariableKnownToBeZero if this bit is the next bit of the same in getValueBits()
1654 // the next and previous groups (which might be the same group), then in assignRepl32BitGroups()
1659 assert(std::next(I) == BitGroups.end() && in assignRepl32BitGroups()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/InstCombine/
H A DInstCombineCompares.cpp626 I = &*std::next(I->getIterator()); in setInsertionPoint()
/foundation/arkui/ace_engine/frameworks/core/interfaces/arkoala/
H A Darkoala_api.h2770 void (*setScrollPage)(ArkUINodeHandle node, ArkUI_Int32 next, ArkUI_Int32 animation);
/third_party/cups-filters/utils/
H A Dcups-browsed.c645 return (ipp->current = ipp->current->next); in ippNextAttribute()
1476 /* Pick next format from attribute */ in add_tagzero_attributes()
6283 checking with the next printer this time, to get a "round robin" in on_job_state()
6470 /* Pick next format from attribute */ in on_job_state()
6479 /* Find the next format in the string pdl, if there is none left, in on_job_state()
7746 delay to continue with the next local CUPS queues. */ in update_cups_queues()
9007 update_cups_queues will run the next time only after this in update_cups_queues()
11725 /* Skip white space until next word */ in read_configuration()
11735 /* Skip white space until next word */ in read_configuration()
11740 /* No more options, consider next wor in read_configuration()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/SelectionDAG/
H A DDAGCombiner.cpp244 /// Add to the worklist making sure its instance is at the back (next to be
13063 // The next optimizations are desirable only if SELECT_CC can be lowered. in visitSINT_TO_FP()
13124 // The next optimizations are desirable only if SELECT_CC can be lowered. in visitUINT_TO_FP()
14738 /// Check whether or not \p First and \p Second are next to each other
14763 // Sort the slices so that elements that are likely to be next to each in adjustCostForPairing()
14764 // other in memory are next to each other in the list. in adjustCostForPairing()
14780 // Get to the next slice. in adjustCostForPairing()
14793 // move to the next pair, this type is hopeless. in adjustCostForPairing()
14801 // Check that both loads are next to each other in memory. in adjustCostForPairing()
14807 // Move to the next pai in adjustCostForPairing()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AArch64/
H A DAArch64ISelLowering.cpp1446 EndBB->splice(EndBB->begin(), MBB, std::next(MachineBasicBlock::iterator(MI)), in EmitF128CSEL()
3517 // This will point to the next argument passed via stack. in LowerFormalArguments()
3793 // next instruction. The behaviour of branch instructions in this in isEligibleForTailCallOptimization()
5235 // comparison which gets picked up by the next if statement. in LowerSETCC()
5766 // Increment the pointer, VAList, to the next vaarg in LowerVAARG()
6697 // The stars all align, our next step is to produce the mask for the shuffle. in ReconstructShuffle()
/third_party/mesa3d/src/amd/compiler/
H A Daco_instruction_selection.cpp12 * The above copyright notice and this permission notice (including the next
7782 /* outputs for the next vertex are undefined and keeping them around can
9604 unpacked_coord.insert(std::next(unpacked_coord.begin()), bld.copy(bld.def(rc), coord2d));
10815 * to the loop exit/entry block. Otherwise, it branches to the next
12020 /* Outputs of the previous stage are inputs to the next stage */

Completed in 152 milliseconds

1...<<241242