HomeSort by: relevance | last modified time | path
    Searched refs:CR (Results 1 - 25 of 150) sorted by relevancy

1 2 3 4 5 6

  /src/external/gpl2/groff/font/devhtml/
Makefile 6 FONTS= R I B BI CR CI CB CBI S
  /src/external/bsd/byacc/dist/test/btyacc/
ok_syntax1.tab.h 18 #define CR 270
  /src/external/bsd/byacc/dist/test/yacc/
ok_syntax1.tab.h 15 #define CR 270
  /src/external/apache2/llvm/dist/llvm/lib/IR/
ConstantRange.cpp 79 const ConstantRange &CR) {
80 if (CR.isEmptySet())
81 return CR;
83 uint32_t W = CR.getBitWidth();
88 return CR;
90 if (CR.isSingleElement())
91 return ConstantRange(CR.getUpper(), CR.getLower());
94 APInt UMax(CR.getUnsignedMax());
100 APInt SMax(CR.getSignedMax())
    [all...]
  /src/external/bsd/ntp/dist/include/
ascii.h 56 #define CR 13
  /src/external/gpl2/groff/font/devlbp/
Makefile 10 TB TBI TI TR CR CB CI ER EB EI
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
ConstraintSystem.h 57 for (auto &CR : Constraints) {
58 while (CR.size() != R.size())
59 CR.push_back(0);
  /src/external/apache2/llvm/dist/llvm/include/llvm/IR/
ConstantRange.h 216 bool contains(const ConstantRange &CR) const;
236 /// Compare set size of this range with the range CR.
237 bool isSizeStrictlySmallerThan(const ConstantRange &CR) const;
261 bool operator==(const ConstantRange &CR) const {
262 return Lower == CR.Lower && Upper == CR.Upper;
264 bool operator!=(const ConstantRange &CR) const {
265 return !operator==(CR);
281 ConstantRange difference(const ConstantRange &CR) const;
297 ConstantRange intersectWith(const ConstantRange &CR,
    [all...]
  /src/external/gpl3/gdb/dist/sim/ppc/
idecode_fields.h 85 #define CR_BI_ ((CR & BIT32_BI) != 0)
86 #define CR_BA_ ((CR & BIT32_BA) != 0)
87 #define CR_BB_ ((CR & BIT32_BB) != 0)
  /src/external/gpl3/gdb.old/dist/sim/ppc/
idecode_fields.h 85 #define CR_BI_ ((CR & BIT32_BI) != 0)
86 #define CR_BA_ ((CR & BIT32_BA) != 0)
87 #define CR_BB_ ((CR & BIT32_BB) != 0)
  /src/external/apache2/llvm/dist/llvm/lib/ProfileData/Coverage/
CoverageMapping.cpp 512 for (const auto &CR : enumerate(Regions)) {
513 auto CurStartLoc = CR.value().startLoc();
527 bool GapRegion = CR.value().Kind == CounterMappingRegion::GapRegion;
530 if (CurStartLoc == CR.value().endLoc()) {
534 (CR.index() + 1) == Regions.size() ||
535 CR.value().Kind == CounterMappingRegion::SkippedRegion;
536 startSegment(ActiveRegions.empty() ? CR.value() : *ActiveRegions.back(),
544 if (CR.index() + 1 == Regions.size() ||
545 CurStartLoc != Regions[CR.index() + 1].startLoc()) {
548 startSegment(CR.value(), CurStartLoc, !GapRegion)
    [all...]
  /src/external/gpl3/gcc/dist/libgcc/config/libbid/
bid128_quantize.c 30 UINT128 CX, CY, T, CX2, CR, Stemp, res, REM_H, C2N;
159 CR.w[1] = 0;
160 CR.w[0] = CX2.w[1] >> (amount - 64);
162 __shr_128 (CR, CX2, amount);
169 if (CR.w[0] & 1) {
185 CR.w[0]--;
246 get_BID128_very_fast (&res, sign_x, exponent_y, CR);
250 CR.w[1] = CR.w[0] = 0;
257 CR.w[0] = 1
    [all...]
bid128_rem.c 31 UINT128 CX, CY, CX2, CQ, CR, T, CXS, P128, res;
155 __div_128_by_128 (&CQ, &CR, CX, P128);
157 CX2.w[1] = (CR.w[1] << 1) | (CR.w[0] >> 63);
158 CX2.w[0] = CR.w[0] << 1;
162 __sub_128_128 (CR, P256, CR);
166 get_BID128_very_fast (&res, sign_x, exponent_x, CR);
  /src/external/gpl3/gcc.old/dist/libgcc/config/libbid/
bid128_quantize.c 30 UINT128 CX, CY, T, CX2, CR, Stemp, res, REM_H, C2N;
159 CR.w[1] = 0;
160 CR.w[0] = CX2.w[1] >> (amount - 64);
162 __shr_128 (CR, CX2, amount);
169 if (CR.w[0] & 1) {
185 CR.w[0]--;
246 get_BID128_very_fast (&res, sign_x, exponent_y, CR);
250 CR.w[1] = CR.w[0] = 0;
257 CR.w[0] = 1
    [all...]
  /src/lib/libc/net/
nslexer.l 53 CR \n
62 \\{CR} ; /* allow continuation */
64 {CR} return NL;
  /src/external/apache2/llvm/dist/llvm/lib/Support/
DJB.cpp 43 ConversionResult CR = ConvertUTF32toUTF8(&Begin32, &C + 1, &Begin8,
45 assert(CR == conversionOK && "Case folding produced invalid char?");
46 (void)CR;
ConvertUTFWrapper.cpp 70 ConversionResult CR = ConvertUTF32toUTF8(&SourceStart, SourceEnd,
73 if (CR != conversionOK)
122 ConversionResult CR =
124 assert(CR != targetExhausted);
126 if (CR != conversionOK) {
167 ConversionResult CR =
169 assert(CR != targetExhausted);
171 if (CR != conversionOK) {
  /src/sys/arch/arm/at91/
at91streg.h 72 #define WDog() do {CPUReg->ST.CR = ST_CR_WDRST;} while (0)
  /src/sys/arch/bebox/include/
kgdb.h 36 #define CR 33
  /src/sys/arch/ibmnws/include/
kgdb.h 36 #define CR 33
  /src/sys/arch/mvmeppc/include/
kgdb.h 36 #define CR 33
  /src/sys/arch/prep/include/
kgdb.h 36 #define CR 33
  /src/sys/arch/rs6000/include/
kgdb.h 36 #define CR 33
  /src/sys/arch/sandpoint/include/
kgdb.h 36 #define CR 33
  /src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/PDB/Native/
TpiHashing.h 21 explicit TagRecordHash(codeview::ClassRecord CR, uint32_t Full,
23 : FullRecordHash(Full), ForwardDeclHash(Forward), Class(std::move(CR)) {

Completed in 45 milliseconds

1 2 3 4 5 6