Home
last modified time | relevance | path

Searched refs:reverse (Results 701 - 725 of 760) sorted by relevance

1...<<2122232425262728293031

/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Support/
H A DAPInt.cpp2252 // We insert the digits backward, then reverse them to get the right order.
2278 std::reverse(Str.begin()+StartDig, Str.end());
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/ARM/
H A DARMConstantIslandPass.cpp1915 // target of Br. So now we need to reverse the condition. in optimizeThumb2Branches()
1935 for (ImmBranch &Br : reverse(ImmBranches)) { in optimizeThumb2Branches()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/
H A DHexagonISelDAGToDAGHVX.cpp96 // a reverse delta network.
1484 for (SDNode *S : reverse(Queue))
1741 // with the largest group size, vshuffvdd will do them in the reverse order.
1968 // Try reverse delta.
/third_party/python/Lib/
H A Dzipfile.py1446 reverse=True):
H A Dturtle.py293 baseList.reverse()
/third_party/ffmpeg/libavcodec/
H A DMakefile1010 SHLIBOBJS += log2_tab.o reverse.o
/third_party/json/tools/cpplint/
H A Dcpplint.py2127 This is almost the reverse of FindEndOfExpressionInLine, but note
2289 lst.reverse()
6591 # Apply all the accumulated filters in reverse order (top-level directory
/third_party/mesa3d/src/gallium/drivers/radeonsi/
H A Dsi_shader.c1224 fprintf(f, "%u.%u.%u.%u", fix.u.reverse, fix.u.log_size, fix.u.num_channels_m1, in si_dump_shader_key_vs()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/AsmPrinter/
H A DAsmPrinter.cpp1538 for (const GlobalAlias *AncestorAlias : llvm::reverse(AliasStack)) in doFinalization()
H A DCodeViewDebug.cpp324 llvm::reverse(QualifiedNameComponents)) { in getQualifiedName()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
H A DMachineScheduler.cpp508 std::reverse(Regions.begin(), Regions.end()); in getSchedRegions()
860 // Release bottom roots in reverse order so the higher priority nodes appear in initQueues()
2896 // If the candidates are decreasing pressure, reverse priority. in tryPressure()
H A DCodeGenPrepare.cpp6196 // Use reverse iterator because later select may use the value of the in optimizeSelectInst()
6296 // uses must come first, so we process the ops in reverse order so as to not in tryToSinkFreeOperands()
6301 for (Use *U : reverse(OpsToSink)) { in tryToSinkFreeOperands()
7228 for (auto &I : reverse(BB)) { in optimizeBlock()
/third_party/skia/third_party/externals/swiftshader/src/Pipeline/
H A DSpirvShaderDebugger.cpp2218 std::reverse(newStack.begin(), newStack.end());
/third_party/python/Lib/test/
H A Dtest_collections.py1982 mss.reverse()
H A Dtest_itertools.py829 r = sorted([(len(list(g)) , k) for k, g in groupby(sorted(s))], reverse=True)[:3]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/
H A DNewGVN.cpp31 /// reverse mapping from value number -> operations with that value number), so
3182 "Representative MemoryAccess does not appear to be reverse "
3186 "Memory member does not appear to be reverse mapped properly");
3873 for (auto *CC : reverse(CongruenceClasses)) {
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/X86/
H A DX86FrameLowering.cpp3150 std::reverse(ObjectsToAllocate.begin(), ObjectsToAllocate.end());
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/InstCombine/
H A DInstructionCombining.cpp3222 for (auto *DII : reverse(DbgUsers)) { in TryToSinkInstruction()
3523 // add them in reverse order. This way instcombine will visit from the top in AddReachableCodeToWorklist()
/third_party/mesa3d/src/amd/llvm/
H A Dac_llvm_build.c1517 * \param reverse whether XYZ channels are reversed
1525 unsigned num_channels, unsigned format, bool reverse, in ac_build_opencoded_load_format()
1723 if (reverse) { in ac_build_opencoded_load_format()
1524 ac_build_opencoded_load_format(struct ac_llvm_context *ctx, unsigned log_size, unsigned num_channels, unsigned format, bool reverse, bool known_aligned, LLVMValueRef rsrc, LLVMValueRef vindex, LLVMValueRef voffset, LLVMValueRef soffset, unsigned cache_policy, bool can_speculate) ac_build_opencoded_load_format() argument
/third_party/node/deps/v8/src/objects/
H A Delements.cc3536 // manually reverse using GetImpl and SetImpl, which abstract over in ReverseImpl()
3547 std::reverse(UnalignedSlot<ElementType>(data), in ReverseImpl()
3550 std::reverse(data, data + len); in ReverseImpl()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Vectorize/
H A DSLPVectorizer.cpp3849 // Iterate in reverse order to consider insert elements with the high cost.
5754 // Do a quadratic search on all of the given stores in reverse order and find
7017 std::reverse(BuildVectorOpds.begin(), BuildVectorOpds.end());
7228 for (auto *I : reverse(Instructions)) {
/third_party/skia/third_party/externals/swiftshader/third_party/subzero/src/
H A DIceTargetLoweringARM32.cpp168 #define X(tag, reverse, str) \
182 #define X(tag, reverse, str) \
5059 // Essentially like Clz, but reverse the bits first.
H A DIceTargetLoweringX8632.cpp4780 // in reverse order. Then handle any remainder with overlapping copies. in lowerMemcpy()
4931 // in reverse order. Then handle any remainder with overlapping copies. in lowerMemset()
7946 #define X(tag, reverse, str) static const int _table1_##tag = InstIcmp::tag;
7960 #define X(tag, reverse, str) \
H A DIceTargetLoweringX8664.cpp4202 // reverse order. Then handle any remainder with overlapping copies. Since in lowerMemcpy()
4352 // reverse order. Then handle any remainder with overlapping copies. Since in lowerMemset()
7254 #define X(tag, reverse, str) static const int _table1_##tag = InstIcmp::tag;
7268 #define X(tag, reverse, str) \
/third_party/python/Modules/
H A Dposixmodule.c546 run_at_forkers(PyObject *lst, int reverse) in run_at_forkers() argument
561 if (reverse) in run_at_forkers()
6776 'before' callbacks are called in reverse order.

Completed in 165 milliseconds

1...<<2122232425262728293031