Searched refs:reverse (Results 26 - 50 of 253) sorted by relevance

1234567891011

/freebsd-11-stable/contrib/llvm-project/llvm/lib/Support/Windows/
H A DDynamicLibrary.inc26 for (void *Handle : llvm::reverse(Handles))
139 // symbols from ucrt.dll first, but iterating NOT in reverse here would
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Transforms/InstCombine/
H A DInstCombineWorklist.h55 /// AddInitialGroup - Add the specified batch of stuff in reverse order.
65 for (Instruction *I : reverse(List)) {
/freebsd-11-stable/usr.sbin/lpr/pac/
H A Dpac.c71 static int reverse; /* Reverse sort order */ variable
160 reverse++;
417 return(reverse ? -r : r);
/freebsd-11-stable/contrib/subversion/subversion/libsvn_diff/
H A Ddiff_tree.c511 svn_diff_tree_processor_t *reverse; local
516 reverse = svn_diff__tree_processor_create(rb, result_pool);
518 reverse->dir_opened = reverse_dir_opened;
519 reverse->dir_added = reverse_dir_added;
520 reverse->dir_deleted = reverse_dir_deleted;
521 reverse->dir_changed = reverse_dir_changed;
522 reverse->dir_closed = reverse_dir_closed;
524 reverse->file_opened = reverse_file_opened;
525 reverse->file_added = reverse_file_added;
526 reverse
[all...]
/freebsd-11-stable/contrib/bmake/mk/
H A Dldorder.mk23 # Due to the nature of make, the result will be in the reverse order
25 # So we need to reverse it before use.
54 # and finally we need to reverse the order of content
H A Dmeta2deps.py147 def sort_unique(list, cmp=None, key=None, reverse=False):
148 list.sort(cmp, key, reverse)
269 self.srctops.sort(reverse=True)
270 self.objroots.sort(reverse=True)
322 # these entries provide for reverse DIRDEPS lookup
/freebsd-11-stable/lib/libc/stdlib/
H A Dmerge.c258 #define reverse(bot, top) { \ macro
320 reverse(f1, f2-size);
325 reverse (f1, f2-size);
/freebsd-11-stable/contrib/tcpdump/
H A Dsmbutil.c439 int reverse = 0; local
491 reverse = !reverse;
508 x = reverse ? EXTRACT_16BITS(buf) :
519 x = reverse ? EXTRACT_32BITS(buf) :
530 x = reverse ? EXTRACT_64BITS(buf) :
543 x1 = reverse ? EXTRACT_32BITS(buf) :
545 x2 = reverse ? EXTRACT_32BITS(buf + 4) :
567 x = reverse ? EXTRACT_16BITS(buf) :
578 x = reverse
[all...]
/freebsd-11-stable/contrib/libstdc++/include/backward/
H A Dalgo.h91 using std::reverse;
/freebsd-11-stable/usr.bin/ul/
H A Dul.c93 static void reverse(void);
231 reverse();
249 reverse();
452 reverse(void) function
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/
H A DARMException.cpp109 for (const GlobalValue *GV : reverse(TypeInfos)) {
/freebsd-11-stable/contrib/llvm-project/llvm/lib/IR/
H A DDebugLoc.cpp107 for (const DILocation *MD : reverse(InlinedAtLocations))
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DLoopAnalysisManager.cpp91 // cache and so we walk the preorder list in reverse to form a valid
93 for (Loop *L : reverse(PreOrderLoops)) {
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/WebAssembly/
H A DWebAssemblyCFGStackify.cpp540 for (auto &MI : reverse(*Header)) {
871 for (auto &MBB : reverse(MF)) {
873 for (auto &MI : reverse(MBB)) {
912 for (auto &MBB : reverse(MF)) {
914 for (auto &MI : reverse(MBB)) {
1173 for (auto &MBB : reverse(MF)) {
1174 for (auto &MI : reverse(MBB)) {
1213 for (auto X : reverse(Stack)) {
1243 for (MachineBasicBlock &MBB : reverse(MF)) {
1244 for (MachineInstr &MI : reverse(MB
[all...]
H A DWebAssemblyExceptionInfo.h99 std::reverse(Blocks.begin() + From, Blocks.end());
H A DWebAssemblyExceptionInfo.cpp79 std::reverse(WE->getSubExceptions().begin(), WE->getSubExceptions().end());
/freebsd-11-stable/usr.bin/tail/
H A Dtail.c96 * number of characters in reverse order. Finally, the default for
157 * If displaying in reverse, don't permit follow option, and convert
221 reverse(fp, fn, style, off, &sb);
244 reverse(stdin, fn, style, off, &sb);
/freebsd-11-stable/contrib/llvm-project/clang/lib/Analysis/
H A DThreadSafetyTIL.cpp161 // Sorts the CFGs blocks using a reverse post-order depth-first traversal.
179 // Performs a reverse topological traversal, starting from the exit block and
182 // before their post-dominator (because it's a reverse topological traversal).
234 // achieved visiting the nodes in reverse topological order.
318 for (auto *Block : Blocks.reverse()) {
329 for (auto *Block : Blocks.reverse()) {
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/
H A DLoopPassManager.h108 /// structure, so we append to it in *reverse* postorder.
110 /// For trees, a preorder traversal is a viable reverse postorder, so we
119 // We walk the initial sequence of loops in reverse because we generally want
121 for (Loop *RootL : reverse(Loops)) {
327 // Add the loop nests in the reverse order of LoopInfo. For some reason,
333 internal::appendLoopsToWorklist(reverse(LI), Worklist);
/freebsd-11-stable/contrib/ncurses/ncurses/base/
H A Dlib_color.c810 int reverse,
814 CallDriver_4(SP_PARM, docolor, old_pair, pair, reverse, outc);
872 if (reverse) {
892 _nc_do_color(int old_pair, int pair, int reverse, NCURSES_OUTC outc) argument
898 reverse,
807 _nc_do_color(NCURSES_SP_DCLx int old_pair, int pair, int reverse, NCURSES_SP_OUTC outc) argument
/freebsd-11-stable/contrib/gcc/
H A Dcfgcleanup.c1180 bool reverse, match;
1203 reverse = false;
1205 reverse = true;
1213 reverse = !reverse;
1220 if (reverse)
1329 bool reverse, match;
1361 reverse = false;
1363 reverse = true;
1371 reverse
1173 bool reverse, match; local
1322 bool reverse, match; local
[all...]
/freebsd-11-stable/share/mk/
H A Dmeta2deps.py123 def sort_unique(list, cmp=None, key=None, reverse=False):
124 list.sort(cmp, key, reverse)
243 self.srctops.sort(reverse=True)
244 self.objroots.sort(reverse=True)
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Support/
H A DDynamicLibrary.cpp83 for (void *Handle : llvm::reverse(Handles)) {
/freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/Core/
H A DSourceManager.h134 size_t DisplayMoreWithLineNumbers(Stream *s, uint32_t count, bool reverse,
/freebsd-11-stable/contrib/pam_modules/pam_passwdqc/
H A Dpasswdqc_check.c165 static char *reverse(const char *src) function
320 if ((reversed = reverse(newpass))) {

Completed in 503 milliseconds

1234567891011