/freebsd-11.0-release/contrib/llvm/lib/Support/ |
H A D | APFloat.cpp | 1462 bool reverse; 1465 reverse = compareAbsoluteValue(temp_rhs) == cmpLessThan; 1470 reverse = false; 1474 reverse = true; 1477 if (reverse) {
|
/freebsd-11.0-release/contrib/gcc/ |
H A D | rtlanal.c | 4343 If REVERSE is nonzero, then reverse the condition prior to canonizing it. 4359 canonicalize_condition (rtx insn, rtx cond, int reverse, rtx *earliest, 4376 if (reverse) 4626 int reverse; 4637 /* If this branches to JUMP_LABEL when the condition is false, reverse 4639 reverse 4643 return canonicalize_condition (jump, cond, reverse, earliest, NULL_RTX, 4333 canonicalize_condition(rtx insn, rtx cond, int reverse, rtx *earliest, rtx want_reg, int allow_cc_mode, int valid_at_insn_p) argument 4600 int reverse; local
|
/freebsd-11.0-release/contrib/llvm/lib/Target/MSP430/ |
H A D | MSP430ISelLowering.cpp | 335 std::reverse(B, B + Parts); 362 std::reverse(RVLocs.begin(), RVLocs.end());
|
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/ARCMigrate/ |
H A D | TransformActions.cpp | 508 for (const CharRange &I : llvm::reverse(Removals)) {
|
/freebsd-11.0-release/contrib/llvm/lib/CodeGen/SelectionDAG/ |
H A D | ScheduleDAGFast.cpp | 637 std::reverse(Sequence.begin(), Sequence.end());
|
/freebsd-11.0-release/contrib/llvm/include/llvm/Analysis/ |
H A D | BlockFrequencyInfoImpl.h | 163 /// This is a simple wrapper around an index into the reverse-post-order 665 /// reverse-post order. This gives two advantages: it's easy to compare the 676 /// Run a single post-order traversal and save it (in reverse) in RPOT. 684 /// in reverse post-order. 695 /// Distributing mass in a loop is a reverse-post-order traversal through 806 // All blocks in reverse postorder. 829 /// Saves a reverse post-order traversal of all the nodes in \a F. 836 /// loop, we store in reverse post-order its "immediate" members, defined as 852 /// reverse post-order, distribute mass to its successors. Only visits nodes 861 /// Assign mass to the entry block, and then for each block in reverse [all...] |
/freebsd-11.0-release/contrib/llvm/lib/Target/XCore/ |
H A D | XCoreFrameLowering.cpp | 277 // We want the nearest (negative) offsets first, so reverse list. 278 std::reverse(SpillList.begin(), SpillList.end()); 471 // Insert in reverse order. loadRegFromStackSlot can insert multiple
|
/freebsd-11.0-release/contrib/llvm/lib/Transforms/IPO/ |
H A D | FunctionAttrs.cpp | 1084 // it in reverse. This is simpler than using the RPO iterator infrastructure 1102 for (auto *F : reverse(Worklist))
|
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Scalar/ |
H A D | StructurizeCFG.cpp | 294 // The reverse post-order traversal of the list gives us an ordering close 342 // the list in reverse. Now that we are using a reverse post-order traversal 344 // we just reverse the list and continue to operate on it in reverse. 345 std::reverse(Order.begin(), Order.end());
|
/freebsd-11.0-release/contrib/llvm/tools/llvm-bcanalyzer/ |
H A D | llvm-bcanalyzer.cpp | 745 std::reverse(FreqPairs.begin(), FreqPairs.end());
|
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Checkers/ |
H A D | CStringChecker.cpp | 470 SVal reverse = svalBuilder.evalBinOpLL(state, BO_GT, local 473 reverse.getAs<DefinedOrUnknownSVal>();
|
/freebsd-11.0-release/tools/sched/ |
H A D | schedgraph.py | 819 # at the beginning. As a result, we add events in reverse order 822 self.events.reverse() 1489 sources.sort(cmp=source_cmp_start, reverse=True)
|
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/AST/ |
H A D | DeclBase.cpp | 1030 std::reverse(Contexts.begin(), Contexts.end()); 1716 // TODO: Maybe we shouldn't reverse the order during insertion.
|
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/CodeGen/ |
H A D | CoverageMappingGen.cpp | 488 for (SourceMappingRegion &I : llvm::reverse(RegionStack)) {
|
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/ |
H A D | ExprEngineC.cpp | 702 for (CFGElement CE : llvm::reverse(*SrcBlock)) {
|
/freebsd-11.0-release/contrib/libxo/xohtml/external/ |
H A D | jquery.qtip.js | 2129 return y ? result : result.reverse(); 2354 if(precedance === X) { corners.reverse(); }
|
/freebsd-11.0-release/contrib/llvm/lib/MC/ |
H A D | ELFObjectWriter.cpp | 1057 std::reverse(Relocs.begin(), Relocs.end());
|
/freebsd-11.0-release/usr.bin/patch/ |
H A D | pch.c | 1140 if (reverse) /* backwards patch? */
|
/freebsd-11.0-release/cddl/contrib/opensolaris/cmd/zfs/ |
H A D | zfs_main.c | 2325 boolean_t reverse = sortcol->sc_reverse; local 2372 return (reverse ? 1 : -1); 2374 return (reverse ? -1 : 1); 6449 * reverse to make sure to get any snapshots first. 6534 * Walk the AVL tree in reverse, unmounting each filesystem and
|
/freebsd-11.0-release/crypto/openssl/crypto/x509/ |
H A D | x509.h | 319 X509 *reverse; member in struct:x509_cert_pair_st
|
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Frontend/ |
H A D | CompilerInstance.cpp | 1688 std::reverse(Path.begin(), Path.end());
|
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Lex/ |
H A D | PPDirectives.cpp | 1708 std::reverse(Path.begin(), Path.end());
|
H A D | PPMacroExpansion.cpp | 167 // Our reverse postorder walk found the macros in reverse order. 168 std::reverse(Info.ActiveModuleMacros.begin(), Info.ActiveModuleMacros.end());
|
/freebsd-11.0-release/contrib/llvm/lib/ExecutionEngine/ |
H A D | ExecutionEngine.cpp | 221 // If we are using the reverse mapping, add it too. 269 // If we are using the reverse mapping, add it too. 305 // If we haven't computed the reverse mapping yet, do so first. 1091 // Host and target are different endian - reverse the stored bytes. 1092 std::reverse((uint8_t*)Ptr, StoreBytes + (uint8_t*)Ptr);
|
/freebsd-11.0-release/contrib/llvm/lib/Linker/ |
H A D | IRMover.cpp | 1526 std::reverse(Worklist.begin(), Worklist.end());
|