/third_party/icu/icu4c/source/test/intltest/ |
H A D | ssearch.cpp | 354 void reverse(void); 482 void OrderList::reverse() in reverse() function in OrderList 672 backwardList.reverse(); in offsetTest()
|
H A D | tstnorm.cpp | 240 // And finally, make sure you can do it in reverse too in TestHangulCompose() 262 // And finally, make sure you can do it in reverse too in TestHangulDecomp() 523 UnicodeString reverse; in backAndForth() local 525 insert(reverse, 0, ch); in backAndForth() 528 if (forward != reverse) { in backAndForth() 529 errln("Forward/reverse mismatch for input " + hex(input) in backAndForth() 530 + ", forward: " + hex(forward) + ", backward: " + hex(reverse)); in backAndForth()
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUAsmPrinter.cpp | 653 for (MCPhysReg Reg : reverse(AMDGPU::VGPR_32RegClass.getRegisters())) { in analyzeResourceUsage() 662 for (MCPhysReg Reg : reverse(AMDGPU::AGPR_32RegClass.getRegisters())) { in analyzeResourceUsage() 673 for (MCPhysReg Reg : reverse(AMDGPU::SGPR_32RegClass.getRegisters())) { in analyzeResourceUsage()
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/X86/ |
H A D | X86FlagsCopyLowering.cpp | 455 llvm::reverse(llvm::make_range(Begin, End)), [&](MachineInstr &MI) { in runOnMachineFunction() 514 llvm::reverse(llvm::make_range(TestMBB->instr_begin(), TestPos)), in runOnMachineFunction() 753 llvm::reverse(llvm::make_range(MBB.begin(), TestPos))) { in collectCondsInRegs()
|
/third_party/python/Modules/ |
H A D | mmapmodule.c | 326 int reverse) in mmap_gfind() 333 if (!PyArg_ParseTuple(args, reverse ? "y*|nn:rfind" : "y*|nn:find", in mmap_gfind() 354 if (reverse) { in mmap_gfind() 324 mmap_gfind(mmap_object *self, PyObject *args, int reverse) mmap_gfind() argument
|
/kernel/linux/linux-5.10/drivers/input/joystick/ |
H A D | db9.c | 84 int reverse; member 520 if (db9_modes[db9->mode].reverse) { in db9_open()
|
/kernel/linux/linux-6.6/drivers/input/joystick/ |
H A D | db9.c | 81 int reverse; member 517 if (db9_modes[db9->mode].reverse) { in db9_open()
|
/third_party/icu/icu4c/source/layoutex/ |
H A D | ParagraphLayout.cpp | 487 LXUtilities::reverse(&fGlyphWidths[glyphBase], glyphCount); in ParagraphLayout() 488 LXUtilities::reverse(&fGlyphToCharMap[glyphBase], glyphCount); in ParagraphLayout()
|
/third_party/node/deps/v8/tools/release/ |
H A D | common_includes.py | 369 wait_plan.reverse() 564 key=LooseVersion, reverse=True)[0]
|
/third_party/node/test/parallel/ |
H A D | test-assert-deep.js | 475 assertDeepAndStrictEqual(new Set(values), new Set(values.reverse())); 479 assertDeepAndStrictEqual(new Map(mapValues), new Map(mapValues.reverse()));
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/ |
H A D | StructurizeCFG.cpp | 339 // The reverse post-order traversal of the list gives us an ordering close in orderNodes() 379 // the list in reverse. Now that we are using a reverse post-order traversal in orderNodes() 381 // we just reverse the list and continue to operate on it in reverse. in orderNodes() 382 std::reverse(Order.begin(), Order.end()); in orderNodes() 520 for (RegionNode *RN : reverse(Order)) { in collectInfos()
|
H A D | SimpleLoopUnswitch.cpp | 646 for (unsigned Index : reverse(ExitCaseIndices)) { in unswitchTrivialSwitch() 699 // We walk in reverse so that we split in the same order as the cases in unswitchTrivialSwitch() 722 for (auto &ExitCase : reverse(ExitCases)) { in unswitchTrivialSwitch() 749 // Now add the unswitched cases. We do this in reverse order as we built them in unswitchTrivialSwitch() 750 // in reverse order. in unswitchTrivialSwitch() 751 for (auto &ExitCase : reverse(ExitCases)) { in unswitchTrivialSwitch() 1187 // Build up the loops to clone in reverse order as we'll clone them from the in cloneLoopNest() 1189 for (Loop *ChildL : llvm::reverse(OrigRootL)) in cloneLoopNest() 1197 for (Loop *ChildL : llvm::reverse(*L)) in cloneLoopNest() 1866 // is a predecessor of the header and so reached in the reverse wal in rebuildLoopAfterUnswitch() [all...] |
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-subzero/include/llvm/ADT/ |
H A D | STLExtras.h | 209 // Returns an iterator_range over the given container which iterates in reverse. 212 auto reverse(ContainerTy &&C, 224 // Returns an iterator_range over the given container which iterates in reverse. 228 auto reverse(
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/ |
H A D | LoopInfoImpl.h | 498 /// subloop header, add the subloop to its parent in PostOrder, then reverse the 514 std::reverse(Subloop->getSubLoopsVector().begin(), in insertIntoLoop() 531 /// 1) Discovered and mapped by a reverse CFG traversal. 570 // order as we walk it. But LoopInfo stores the top level loops in reverse in getLoopsInPreorder() 571 // program order so for here we reverse it to get forward program order. in getLoopsInPreorder() 573 // reverse here. in getLoopsInPreorder() 574 for (LoopT *RootL : reverse(*this)) { in getLoopsInPreorder() 588 // order as we walk it. LoopInfo stores the top level loops in reverse in getLoopsInReverseSiblingPreorder() 590 // FIXME: If we change the order of LoopInfo we will want to add a reverse in getLoopsInReverseSiblingPreorder()
|
/third_party/icu/icu4c/source/common/unicode/ |
H A D | unistr.h | 2637 inline UnicodeString& reverse(void); 2642 * @param start the start of the range to reverse 2643 * @param length the number of characters to to reverse 2647 inline UnicodeString& reverse(int32_t start, 4745 UnicodeString::reverse() in reverse() function in UnicodeString 4749 UnicodeString::reverse(int32_t start, in reverse() function in UnicodeString
|
/third_party/node/deps/icu-small/source/common/unicode/ |
H A D | unistr.h | 2637 inline UnicodeString& reverse(void); 2642 * @param start the start of the range to reverse 2643 * @param length the number of characters to to reverse 2647 inline UnicodeString& reverse(int32_t start, 4772 UnicodeString::reverse() in reverse() function in UnicodeString 4776 UnicodeString::reverse(int32_t start, in reverse() function in UnicodeString
|
/third_party/node/deps/openssl/openssl/ssl/ |
H A D | ssl_ciph.c | 818 int reverse = 0; in ssl_cipher_apply_rule() local 828 reverse = 1; /* needed to maintain sorting between currently in ssl_cipher_apply_rule() 834 if (reverse) { in ssl_cipher_apply_rule() 852 next = reverse ? curr->prev : curr->next; in ssl_cipher_apply_rule() 897 /* reverse == 0 */ in ssl_cipher_apply_rule() 905 /* reverse == 0 */ in ssl_cipher_apply_rule() 910 /* reverse == 1 */ in ssl_cipher_apply_rule() 915 * in reverse to maintain the order) in ssl_cipher_apply_rule() 924 /* reverse == 0 */ in ssl_cipher_apply_rule() 1573 * reverse orde in STACK_OF() [all...] |
/third_party/openssl/ssl/ |
H A D | ssl_ciph.c | 817 int reverse = 0; in ssl_cipher_apply_rule() local 827 reverse = 1; /* needed to maintain sorting between currently in ssl_cipher_apply_rule() 833 if (reverse) { in ssl_cipher_apply_rule() 851 next = reverse ? curr->prev : curr->next; in ssl_cipher_apply_rule() 896 /* reverse == 0 */ in ssl_cipher_apply_rule() 904 /* reverse == 0 */ in ssl_cipher_apply_rule() 909 /* reverse == 1 */ in ssl_cipher_apply_rule() 914 * in reverse to maintain the order) in ssl_cipher_apply_rule() 923 /* reverse == 0 */ in ssl_cipher_apply_rule() 1572 * reverse orde in STACK_OF() [all...] |
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
H A D | LazyCallGraph.cpp | 856 find_if(reverse(PendingSCCStack), [RootDFSNumber](const Node *N) { 1271 auto StackRI = find_if(reverse(PendingRefSCCStack), [&](Node *N) { 1650 find_if(reverse(PendingSCCStack), [RootDFSNumber](const Node *N) { 1711 // The roots will be popped of a stack, so use reverse to get a less 1713 std::reverse(Roots.begin(), Roots.end());
|
/third_party/skia/third_party/externals/icu/source/common/unicode/ |
H A D | unistr.h | 2637 inline UnicodeString& reverse(void); 2642 * @param start the start of the range to reverse 2643 * @param length the number of characters to to reverse 2647 inline UnicodeString& reverse(int32_t start, 4745 UnicodeString::reverse() in reverse() function in UnicodeString 4749 UnicodeString::reverse(int32_t start, in reverse() function in UnicodeString
|
/third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/test/normalizer/ |
H A D | BasicTest.java | 140 // And finally, make sure you can do it in reverse too in TestHangulCompose() 162 // And finally, make sure you can do it in reverse too in TestHangulDecomp() 763 StringBuffer reverse = new StringBuffer(); 765 reverse.insert(0, ch); 768 if (!forward.toString().equals(reverse.toString())) { 769 errln("FAIL: Forward/reverse mismatch for input " + hex(input) 770 + ", forward: " + hex(forward) + ", backward: "+hex(reverse)); 772 logln("Ok: Forward/reverse for input " + hex(input) 773 + ", forward: " + hex(forward) + ", backward: "+hex(reverse)); 791 StringBuffer reverse in backAndForth() [all...] |
/third_party/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/normalizer/ |
H A D | BasicTest.java | 137 // And finally, make sure you can do it in reverse too in TestHangulCompose() 159 // And finally, make sure you can do it in reverse too in TestHangulDecomp() 760 StringBuffer reverse = new StringBuffer(); 762 reverse.insert(0, ch); 765 if (!forward.toString().equals(reverse.toString())) { 766 errln("FAIL: Forward/reverse mismatch for input " + hex(input) 767 + ", forward: " + hex(forward) + ", backward: "+hex(reverse)); 769 logln("Ok: Forward/reverse for input " + hex(input) 770 + ", forward: " + hex(forward) + ", backward: "+hex(reverse)); 788 StringBuffer reverse in backAndForth() [all...] |
/third_party/python/Lib/test/ |
H A D | test_array.py | 917 data.reverse() 998 self.assertRaises(TypeError, a.reverse, 42) 999 a.reverse() 1593 example.reverse() 1598 example.reverse()
|
/kernel/linux/linux-5.10/include/trace/events/ |
H A D | ext4.h | 2037 int reverse, int found, ext4_lblk_t found_blk), 2039 TP_ARGS(inode, from, to, reverse, found, found_blk), 2046 __field( int, reverse ) 2056 __entry->reverse = reverse; 2061 TP_printk("dev %d,%d ino %lu from %u to %u reverse %d found %d " 2066 __entry->reverse, __entry->found,
|
/third_party/protobuf/python/google/protobuf/internal/ |
H A D | message_test.py | 707 message.repeated_nested_message.sort(key=get_bb, reverse=True) 714 message.repeated_nested_message.sort(cmp=cmp_bb, reverse=True) 727 message.repeated_int32.sort(key=abs, reverse=True) 733 message.repeated_int32.sort(cmp=abs_cmp, reverse=True) 741 message.repeated_string.sort(key=len, reverse=True) 747 message.repeated_string.sort(cmp=len_cmp, reverse=True)
|