Home
last modified time | relevance | path

Searched refs:GT (Results 1 – 25 of 139) sorted by relevance

123456

/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DSCCIterator.h46 template <class GraphT, class GT = GraphTraits<GraphT>>
48 scc_iterator<GraphT, GT>, std::forward_iterator_tag,
49 const std::vector<typename GT::NodeRef>, ptrdiff_t> {
50 using NodeRef = typename GT::NodeRef;
51 using ChildItTy = typename GT::ChildIteratorType;
107 return scc_iterator(GT::getEntryNode(G)); in begin()
150 template <class GraphT, class GT>
151 void scc_iterator<GraphT, GT>::DFSVisitOne(NodeRef N) { in DFSVisitOne()
155 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum)); in DFSVisitOne()
162 template <class GraphT, class GT>
[all …]
H A DPostOrderIterator.h95 bool ExtStorage = false, class GT = GraphTraits<GraphT>>
99 using value_type = typename GT::NodeRef;
105 using NodeRef = typename GT::NodeRef;
106 using ChildItTy = typename GT::ChildIteratorType;
115 VisitStack.emplace_back(BB, GT::child_begin(BB), GT::child_end(BB)); in po_iterator()
124 VisitStack.emplace_back(BB, GT::child_begin(BB), GT::child_end(BB)); in po_iterator()
141 VisitStack.emplace_back(BB, GT::child_begin(BB), GT in traverseChild()
[all...]
H A DBreadthFirstIterator.h46 class GT = GraphTraits<GraphT>>
50 using value_type = typename GT::NodeRef;
56 using NodeRef = typename GT::NodeRef;
57 using ChildItTy = typename GT::ChildIteratorType;
87 ChildIt.emplace(GT::child_begin(Node)); in toNext()
88 while (*ChildIt != GT::child_end(Node)) { in toNext()
115 return bf_iterator(GT::getEntryNode(G)); in begin()
H A DDepthFirstIterator.h84 bool ExtStorage = false, class GT = GraphTraits<GraphT>>
88 using value_type = typename GT::NodeRef;
94 using NodeRef = typename GT::NodeRef;
95 using ChildItTy = typename GT::ChildIteratorType;
129 Opt.emplace(GT::child_begin(Node)); in toNext()
134 while (*Opt != GT::child_end(Node)) { in toNext()
153 return df_iterator(GT::getEntryNode(G)); in begin()
159 return df_iterator(GT::getEntryNode(G), S); in begin()
/freebsd/contrib/llvm-project/llvm/lib/Target/ARM/Utils/
H A DARMBaseInfo.h43 GT, // Greater than Greater than enumerator
63 case GT: return LE; in getOppositeCondition()
64 case LE: return GT; in getOppositeCondition()
81 case ARMCC::LT: return ARMCC::GT; in getSwappedCondition()
82 case ARMCC::GT: return ARMCC::LT; in getSwappedCondition()
160 case ARMCC::GT: return "gt"; in ARMCondCodeToString()
183 .Case("gt", ARMCC::GT) in ARMCondCodeFromString()
/freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64ConditionOptimizer.cpp232 case AArch64CC::GT: return AArch64CC::GE; in getAdjustedCmp()
233 case AArch64CC::GE: return AArch64CC::GT; in getAdjustedCmp()
251 int Correction = (Cmp == AArch64CC::GT) ? 1 : -1; in adjustCmp()
398 if (((HeadCmp == AArch64CC::GT && TrueCmp == AArch64CC::LT) || in runOnMachineFunction()
399 (HeadCmp == AArch64CC::LT && TrueCmp == AArch64CC::GT)) && in runOnMachineFunction()
419 } else if (((HeadCmp == AArch64CC::GT && TrueCmp == AArch64CC::GT) || in runOnMachineFunction()
/freebsd/contrib/bearssl/src/rsa/
H A Drsa_i15_privexp.c255 agtb = GT(a, b); /* 1 if a > b */ in br_rsa_i15_compute_privexp()
256 bgta = GT(b, a); /* 1 if b > a */ in br_rsa_i15_compute_privexp()
262 ctl = GT(v1, v0); in br_rsa_i15_compute_privexp()
268 ctl = GT(v0, v1); in br_rsa_i15_compute_privexp()
H A Drsa_i31_privexp.c255 agtb = GT(a, b); /* 1 if a > b */ in br_rsa_i31_compute_privexp()
256 bgta = GT(b, a); /* 1 if b > a */ in br_rsa_i31_compute_privexp()
262 ctl = GT(v1, v0); in br_rsa_i31_compute_privexp()
268 ctl = GT(v0, v1); in br_rsa_i31_compute_privexp()
H A Drsa_i15_keygen.c291 m5 -= 10 & -GT(m5, 9); in mkprime()
292 m5 -= 5 & -GT(m5, 4); in mkprime()
302 m11 -= 88 & -GT(m11, 87); in mkprime()
303 m11 -= 44 & -GT(m11, 43); in mkprime()
304 m11 -= 22 & -GT(m11, 21); in mkprime()
305 m11 -= 11 & -GT(m11, 10); in mkprime()
H A Drsa_i31_keygen_inner.c311 m5 -= 20 & -GT(m5, 19); in mkprime()
312 m5 -= 10 & -GT(m5, 9); in mkprime()
313 m5 -= 5 & -GT(m5, 4); in mkprime()
325 m11 -= 44 & -GT(m11, 43); in mkprime()
326 m11 -= 22 & -GT(m11, 21); in mkprime()
327 m11 -= 11 & -GT(m11, 10); in mkprime()
/freebsd/contrib/bearssl/src/int/
H A Di32_muladd.c118 cc += (uint64_t)GT(nxw, xw); in br_i32_muladd_small()
120 tb = MUX(EQ(nxw, mw), tb, GT(nxw, mw)); in br_i32_muladd_small()
134 over = chf | GT(clow, hi); in br_i32_muladd_small()
H A Di31_muladd.c141 tb = MUX(EQ(nxw, mw), tb, GT(nxw, mw)); in br_i31_muladd_small()
153 over = GT(cc, hi); in br_i31_muladd_small()
H A Di15_muladd.c159 tb = MUX(EQ(nxw, mw), tb, GT(nxw, mw)); in br_i15_muladd_small()
169 over = GT(cc, hi); in br_i15_muladd_small()
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DCFG.h147 class GT = GraphTraits<NodeT>>
163 for (NodeT Succ : make_range(GT::child_begin(Node), GT::child_end(Node))) { in containsIrreducibleCFG()
/freebsd/contrib/ncurses/progs/
H A Dtset.c212 #define GT 0x01 macro
216 #define GE (GT | EQ)
417 if (mapp->conditional & GT) in add_mapping()
424 mapp->conditional |= GT; in add_mapping()
459 mapp->conditional = ~mapp->conditional & (EQ | GT | LT); in add_mapping()
476 if (mapp->conditional & GT) { in add_mapping()
513 case GT: in mapped()
/freebsd/sys/contrib/device-tree/src/arm/samsung/
H A Dexynos4412-i9300.dts3 * Samsung's Exynos4412 based M0 (GT-I9300) board device tree source
13 model = "Samsung Galaxy S3 (GT-I9300) based on Exynos4412";
H A Dexynos4412-n710x.dts7 model = "Samsung Galaxy Note 2 (GT-N7100, GT-N7105) based on Exynos4412";
/freebsd/contrib/bearssl/src/
H A Dinner.h803 GT(uint32_t x, uint32_t y) in GT() function
826 #define GE(x, y) NOT(GT(y, x))
827 #define LT(x, y) GT(y, x)
828 #define LE(x, y) NOT(GT(x, y))
837 return (int32_t)GT(x, y) | -(int32_t)GT(y, x); in CMP()
920 c = GT(x, 0xFFFF); x = MUX(c, x >> 16, x); k += c << 4; in BIT_LENGTH()
921 c = GT(x, 0x00FF); x = MUX(c, x >> 8, x); k += c << 3; in BIT_LENGTH()
922 c = GT(x, 0x000F); x = MUX(c, x >> 4, x); k += c << 2; in BIT_LENGTH()
923 c = GT(x, 0x0003); x = MUX(c, x >> 2, x); k += c << 1; in BIT_LENGTH()
924 k += GT(x, 0x0001); in BIT_LENGTH()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/NVPTX/
H A DNVPTX.h33 GT, enumerator
159 GT, enumerator
/freebsd/sys/contrib/libsodium/src/libsodium/sodium/
H A Dcodecs.c111 #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/contrib/llvm-project/llvm/lib/Target/SPIRV/
H A DSPIRVDuplicatesTracker.h198 SPIRVDuplicatesTracker<GlobalVariable> GT; variable
235 GT.add(GV, MF, R); in add()
270 return GT.find(const_cast<GlobalVariable *>(GV), MF); in find()
/freebsd/contrib/llvm-project/llvm/include/llvm/MC/
H A DMCSymbolWasm.h138 void setGlobalType(wasm::WasmGlobalType GT) { GlobalType = GT; } in setGlobalType() argument
/freebsd/contrib/one-true-awk/
H A Dawkgram.y54 %token <i> AND BOR APPEND EQ GE GT LE LT NE IN
82 %nonassoc APPEND EQ GE GT LE LT NE MATCHOP IN '|'
231 | pattern GT pattern { $$ = op2($2, $1, $3); }
304 | print prarg GT term {
498 case LE: case LT: case EQ: case NE: case GT: case GE:
/freebsd/contrib/llvm-project/llvm/lib/Target/ARC/MCTargetDesc/
H A DARCInfo.h34 GT = 0x9, enumerator
/freebsd/sys/contrib/device-tree/src/arm64/broadcom/bcmbca/
H A Dbcm4912-asus-gt-ax6000.dts9 model = "Asus GT-AX6000";

123456