/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | SCCIterator.h | 41 template <class GraphT, class GT = GraphTraits<GraphT>> 43 scc_iterator<GraphT, GT>, std::forward_iterator_tag, 44 const std::vector<typename GT::NodeRef>, ptrdiff_t> { 45 using NodeRef = typename GT::NodeRef; 46 using ChildItTy = typename GT::ChildIteratorType; 102 return scc_iterator(GT::getEntryNode(G)); 145 template <class GraphT, class GT> 146 void scc_iterator<GraphT, GT>::DFSVisitOne(NodeRef N) { 150 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum)); 157 template <class GraphT, class GT> [all...] |
H A D | BreadthFirstIterator.h | 46 class GT = GraphTraits<GraphT>> 48 : public std::iterator<std::forward_iterator_tag, typename GT::NodeRef>, 50 using super = std::iterator<std::forward_iterator_tag, typename GT::NodeRef>; 52 using NodeRef = typename GT::NodeRef; 53 using ChildItTy = typename GT::ChildIteratorType; 84 ChildIt.emplace(GT::child_begin(Node)); 85 while (*ChildIt != GT::child_end(Node)) { 114 return bf_iterator(GT::getEntryNode(G));
|
H A D | PostOrderIterator.h | 94 bool ExtStorage = false, class GT = GraphTraits<GraphT>> 96 : public std::iterator<std::forward_iterator_tag, typename GT::NodeRef>, 98 using super = std::iterator<std::forward_iterator_tag, typename GT::NodeRef>; 99 using NodeRef = typename GT::NodeRef; 100 using ChildItTy = typename GT::ChildIteratorType; 108 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); 117 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); 127 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) { 131 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); 141 return po_iterator(GT [all...] |
H A D | DepthFirstIterator.h | 84 bool ExtStorage = false, class GT = GraphTraits<GraphT>> 86 : public std::iterator<std::forward_iterator_tag, typename GT::NodeRef>, 88 using super = std::iterator<std::forward_iterator_tag, typename GT::NodeRef>; 89 using NodeRef = typename GT::NodeRef; 90 using ChildItTy = typename GT::ChildIteratorType; 125 Opt.emplace(GT::child_begin(Node)); 130 while (*Opt != GT::child_end(Node)) { 151 return df_iterator(GT::getEntryNode(G)); 157 return df_iterator(GT::getEntryNode(G), S);
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/ARM/Utils/ |
H A D | ARMBaseInfo.h | 43 GT, // Greater than Greater than enumerator in enum:llvm::ARMCC::CondCodes 63 case GT: return LE; 64 case LE: return GT; 81 case ARMCC::LT: return ARMCC::GT; 82 case ARMCC::GT: return ARMCC::LT; 160 case ARMCC::GT: return "gt"; 183 .Case("gt", ARMCC::GT)
|
/freebsd-12-stable/usr.bin/tset/ |
H A D | map.c | 52 #define GT 0x01 macro 56 #define GE (GT | EQ) 111 if (mapp->conditional & GT) 118 mapp->conditional |= GT; 154 mapp->conditional = ~mapp->conditional & (EQ | GT | LT); 169 if (mapp->conditional & GT) { 170 (void)printf("GT"); 207 case GT:
|
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | CFG.h | 144 class GT = GraphTraits<NodeT>> 160 for (NodeT Succ : make_range(GT::child_begin(Node), GT::child_end(Node))) {
|
H A D | IntervalIterator.h | 87 template<class NodeTy, class OrigContainer_t, class GT = GraphTraits<NodeTy *>, 184 for (typename GT::ChildIteratorType I = GT::child_begin(Node), 185 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)
|
/freebsd-12-stable/contrib/bearssl/src/int/ |
H A D | i32_muladd.c | 118 cc += (uint64_t)GT(nxw, xw); 120 tb = MUX(EQ(nxw, mw), tb, GT(nxw, mw)); 134 over = chf | GT(clow, hi);
|
H A D | i32_sub.c | 47 cc = (cc & EQ(naw, aw)) | GT(naw, aw);
|
H A D | i15_muladd.c | 159 tb = MUX(EQ(nxw, mw), tb, GT(nxw, mw)); 169 over = GT(cc, hi);
|
H A D | i31_muladd.c | 141 tb = MUX(EQ(nxw, mw), tb, GT(nxw, mw)); 153 over = GT(cc, hi);
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/ARC/MCTargetDesc/ |
H A D | ARCInfo.h | 34 GT = 0x9, enumerator in enum:llvm::ARCCC::CondCode
|
/freebsd-12-stable/contrib/bearssl/src/rsa/ |
H A D | rsa_i15_privexp.c | 255 agtb = GT(a, b); /* 1 if a > b */ 256 bgta = GT(b, a); /* 1 if b > a */ 262 ctl = GT(v1, v0); 268 ctl = GT(v0, v1);
|
H A D | rsa_i31_privexp.c | 255 agtb = GT(a, b); /* 1 if a > b */ 256 bgta = GT(b, a); /* 1 if b > a */ 262 ctl = GT(v1, v0); 268 ctl = GT(v0, v1);
|
H A D | rsa_i15_keygen.c | 291 m5 -= 10 & -GT(m5, 9); 292 m5 -= 5 & -GT(m5, 4); 302 m11 -= 88 & -GT(m11, 87); 303 m11 -= 44 & -GT(m11, 43); 304 m11 -= 22 & -GT(m11, 21); 305 m11 -= 11 & -GT(m11, 10);
|
H A D | rsa_i31_keygen_inner.c | 311 m5 -= 20 & -GT(m5, 19); 312 m5 -= 10 & -GT(m5, 9); 313 m5 -= 5 & -GT(m5, 4); 325 m11 -= 44 & -GT(m11, 43); 326 m11 -= 22 & -GT(m11, 21); 327 m11 -= 11 & -GT(m11, 10);
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/NVPTX/ |
H A D | NVPTX.h | 32 GT, enumerator in enum:llvm::NVPTXCC::CondCodes 136 GT, enumerator in enum:llvm::NVPTX::PTXCmpMode::CmpMode
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/AArch64/ |
H A D | AArch64ConditionOptimizer.cpp | 12 // * GE -> GT 13 // * GT -> GE 231 case AArch64CC::GT: return AArch64CC::GE; 232 case AArch64CC::GE: return AArch64CC::GT; 240 // Transforms GT -> GE, GE -> GT, LT -> LE, LE -> LT by updating comparison 250 int Correction = (Cmp == AArch64CC::GT) ? 1 : -1; 399 if (((HeadCmp == AArch64CC::GT && TrueCmp == AArch64CC::LT) || 400 (HeadCmp == AArch64CC::LT && TrueCmp == AArch64CC::GT)) && 420 } else if (((HeadCmp == AArch64CC::GT [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/MC/ |
H A D | MCSymbolWasm.h | 105 void setGlobalType(wasm::WasmGlobalType GT) { GlobalType = GT; } argument
|
/freebsd-12-stable/contrib/bearssl/src/ |
H A D | inner.h | 783 GT(uint32_t x, uint32_t y) function 806 #define GE(x, y) NOT(GT(y, x)) 807 #define LT(x, y) GT(y, x) 808 #define LE(x, y) NOT(GT(x, y)) 817 return (int32_t)GT(x, y) | -(int32_t)GT(y, x); 900 c = GT(x, 0xFFFF); x = MUX(c, x >> 16, x); k += c << 4; 901 c = GT(x, 0x00FF); x = MUX(c, x >> 8, x); k += c << 3; 902 c = GT(x, 0x000F); x = MUX(c, x >> 4, x); k += c << 2; 903 c = GT( [all...] |
/freebsd-12-stable/sys/contrib/libsodium/src/libsodium/sodium/ |
H A D | codecs.c | 111 #define GT(x, y) ((((unsigned int) (y) - (unsigned int) (x)) >> 8) & 0xFF) macro 112 #define GE(x, y) (GT(y, x) ^ 0xFF) 113 #define LT(x, y) GT(y, x)
|
/freebsd-12-stable/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:
|
/freebsd-12-stable/contrib/llvm-project/compiler-rt/lib/builtins/hexagon/ |
H A D | fastmath2_ldlib_asm.S | 73 ce = CMP.GT(expa, expb); 172 ce = CMP.GT(expa, expb);
|