/freebsd-11.0-release/contrib/llvm/include/llvm/ADT/ |
H A D | SCCIterator.h | 39 template <class GraphT, class GT = GraphTraits<GraphT>> 42 scc_iterator<GraphT, GT>, std::forward_iterator_tag, 43 const std::vector<typename GT::NodeType *>, ptrdiff_t> { 44 typedef typename GT::NodeType NodeType; 45 typedef typename GT::ChildIteratorType ChildItTy; 101 return scc_iterator(GT::getEntryNode(G)); 141 template <class GraphT, class GT> 142 void scc_iterator<GraphT, GT>::DFSVisitOne(NodeType *N) { 146 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum)); 153 template <class GraphT, class GT> [all...] |
H A D | PostOrderIterator.h | 92 class GT = GraphTraits<GraphT> > 94 typename GT::NodeType, ptrdiff_t>, 97 typename GT::NodeType, ptrdiff_t> super; 98 typedef typename GT::NodeType NodeType; 99 typedef typename GT::ChildIteratorType ChildItTy; 106 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) { 110 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); 117 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); 125 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); 138 return po_iterator(GT [all...] |
H A D | DepthFirstIterator.h | 64 bool ExtStorage = false, class GT = GraphTraits<GraphT> > 66 typename GT::NodeType, ptrdiff_t>, 69 typename GT::NodeType, ptrdiff_t> super; 71 typedef typename GT::NodeType NodeType; 72 typedef typename GT::ChildIteratorType ChildItTy; 84 std::make_pair(PointerIntTy(Node, 0), GT::child_begin(Node))); 93 std::make_pair(PointerIntTy(Node, 0), GT::child_begin(Node))); 109 It = GT::child_begin(Node); 113 while (It != GT::child_end(Node)) { 119 std::make_pair(PointerIntTy(Next, 0), GT [all...] |
/freebsd-11.0-release/usr.bin/tset/ |
H A D | map.c | 50 #define GT 0x01 macro 54 #define GE (GT | EQ) 109 if (mapp->conditional & GT) 116 mapp->conditional |= GT; 152 mapp->conditional = ~mapp->conditional & (EQ | GT | LT); 166 if (mapp->conditional & GT) { 167 (void)printf("GT"); 204 case GT:
|
/freebsd-11.0-release/contrib/llvm/include/llvm/Analysis/ |
H A D | IntervalIterator.h | 88 template<class NodeTy, class OrigContainer_t, class GT = GraphTraits<NodeTy*>, 183 for (typename GT::ChildIteratorType I = GT::child_begin(Node), 184 E = GT::child_end(Node); I != E; ++I) 237 for (typename GT::ChildIteratorType It = GT::child_begin(Node), 238 End = GT::child_end(Node); It != End; ++It)
|
H A D | DependenceAnalysis.h | 98 GT = 4, enumerator in enum:llvm::Dependence::DVEntry::__anon2168
|
/freebsd-11.0-release/contrib/llvm/lib/Target/NVPTX/ |
H A D | NVPTX.h | 39 GT, enumerator in enum:llvm::NVPTXCC::CondCodes 147 GT, enumerator in enum:llvm::NVPTX::PTXCmpMode::CmpMode
|
/freebsd-11.0-release/contrib/llvm/lib/Target/AArch64/ |
H A D | AArch64ConditionOptimizer.cpp | 13 // * GE -> GT 14 // * GT -> GE 213 case AArch64CC::GT: return AArch64CC::GE; 214 case AArch64CC::GE: return AArch64CC::GT; 222 // Transforms GT -> GE, GE -> GT, LT -> LE, LE -> LT by updating comparison 232 int Correction = (Cmp == AArch64CC::GT) ? 1 : -1; 378 if (((HeadCmp == AArch64CC::GT && TrueCmp == AArch64CC::LT) || 379 (HeadCmp == AArch64CC::LT && TrueCmp == AArch64CC::GT)) && 399 } else if (((HeadCmp == AArch64CC::GT [all...] |
/freebsd-11.0-release/contrib/llvm/lib/Target/ARM/MCTargetDesc/ |
H A D | ARMBaseInfo.h | 42 GT, // Greater than Greater than enumerator in enum:llvm::ARMCC::CondCodes 62 case GT: return LE; 63 case LE: return GT; 82 case ARMCC::GT: return "gt";
|
/freebsd-11.0-release/usr.bin/xlint/lint1/ |
H A D | op.h | 83 GT, enumerator in enum:__anon13870
|
/freebsd-11.0-release/contrib/one-true-awk/ |
H A D | maketab.c | 51 { GT, "relop", " > " },
|
H A D | awkgram.y | 54 %token <i> AND BOR APPEND EQ GE GT LE LT NE IN 81 %nonassoc APPEND EQ GE GT LE LT NE MATCHOP IN '|' 229 | pattern GT pattern { $$ = op2($2, $1, $3); } 301 | print prarg GT term { 469 case LE: case LT: case EQ: case NE: case GT: case GE:
|
H A D | lex.c | 261 yylval.i = GT; RET(GT);
|
H A D | run.c | 675 case GT: if (i>0) return(True); 1632 int mode; /* '|', 'a', 'w' => LE/LT, GT */ 1648 files[1].mode = GT; 1651 files[2].mode = GT; 1664 if (a == files[i].mode || (a==APPEND && files[i].mode==GT)) 1687 if (a == GT) { 1691 m = GT; /* so can mix > and >> */
|
/freebsd-11.0-release/contrib/gcc/ |
H A D | jump.c | 528 case GT: 535 return GT; 575 case GT: 592 return GT; 621 case GT: 626 return GT; 668 case GT: 691 case GT: 698 return GT; 755 case GT [all...] |
H A D | dojump.c | 412 && ! can_compare_p (GT, mode, ccp_jump)) 415 do_compare_and_jump (exp, GT, GTU, if_false_label, if_true_label); 651 do_compare_rtx_and_jump (op0_word, op1_word, GT, 668 The code of EXP is ignored; we always test GT if SWAP is 0, 944 case GT:
|
H A D | stmt.c | 3010 GT, NULL_RTX, mode, unsignedp, 3072 GT, NULL_RTX, mode, unsignedp, 3138 GT, NULL_RTX, mode, unsignedp, 3179 GT, NULL_RTX, mode, unsignedp, 3192 GT, NULL_RTX, mode, unsignedp, 3261 GT, NULL_RTX, mode, unsignedp, 3293 GT, NULL_RTX, mode, unsignedp, 3325 emit_cmp_and_jump_insns (new_index, new_bound, GT, NULL_RTX,
|
H A D | loop-iv.c | 1461 if ((GET_CODE (a) == GT || GET_CODE (a) == LT) 1469 if (GET_CODE (a) == GT) 1556 code = GT, op1 = gen_int_mode (const_val - 1, mode); 1823 cond_over = simplify_gen_relational (GT, SImode, iv->extend_mode, 1841 case GT: 2054 case GT:
|
/freebsd-11.0-release/contrib/ncurses/progs/ |
H A D | tset.c | 293 #define GT 0x01 macro 297 #define GE (GT | EQ) 443 if (mapp->conditional & GT) 450 mapp->conditional |= GT; 485 mapp->conditional = ~mapp->conditional & (EQ | GT | LT); 502 if (mapp->conditional & GT) { 503 (void) printf("GT"); 539 case GT:
|
/freebsd-11.0-release/contrib/llvm/lib/Analysis/ |
H A D | DependenceAnalysis.cpp | 611 if (Direction & DVEntry::GT) 1137 Result.DV[Level].Direction &= Dependence::DVEntry::GT; 1179 NewDirection |= Dependence::DVEntry::GT; 1237 Result.DV[Level].Direction &= unsigned(~Dependence::DVEntry::GT); 1297 Result.DV[Level].Direction &= unsigned(~Dependence::DVEntry::GT); 1584 DEBUG(dbgs() << "\t exploring GT direction\n"); 1594 NewDirection |= Dependence::DVEntry::GT; 2602 case Dependence::DVEntry::GT: 2645 if (Bound[Level].Lower[Dependence::DVEntry::GT]) 2646 DEBUG(dbgs() << *Bound[Level].Lower[Dependence::DVEntry::GT] << '\ [all...] |
/freebsd-11.0-release/contrib/llvm/include/llvm/MC/ |
H A D | MCExpr.h | 417 GT, ///< Signed greater than comparison (result is either 0 or some enumerator in enum:llvm::MCBinaryExpr::Opcode 469 return create(GT, LHS, RHS, Ctx);
|
/freebsd-11.0-release/contrib/llvm/lib/Target/NVPTX/InstPrinter/ |
H A D | NVPTXInstPrinter.cpp | 167 case NVPTX::PTXCmpMode::GT:
|
/freebsd-11.0-release/contrib/llvm/tools/clang/include/clang/AST/ |
H A D | StmtVisitor.h | 128 BINOP_FALLBACK(LT) BINOP_FALLBACK(GT) BINOP_FALLBACK(LE)
|
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/ |
H A D | MemRegion.cpp | 787 const Type *GT = GQT.getTypePtrOrNull(); local 790 if (GT && GQT.isConstQualified() && GT->isArithmeticType())
|
/freebsd-11.0-release/contrib/llvm/lib/Target/AArch64/Utils/ |
H A D | AArch64BaseInfo.h | 206 GT = 0xc, // Greater than Greater than enumerator in enum:llvm::AArch64CC::CondCode 229 case GT: return "gt"; 263 case GT: return 0; // Z == 0 && N == V
|