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

1 2

  /src/external/apache2/llvm/dist/llvm/lib/Support/
regex2.h 78 #define OEND (1LU<<OPSHIFT) /* endmarker - */
79 #define OCHAR (2LU<<OPSHIFT) /* character unsigned char */
80 #define OBOL (3LU<<OPSHIFT) /* left anchor - */
81 #define OEOL (4LU<<OPSHIFT) /* right anchor - */
82 #define OANY (5LU<<OPSHIFT) /* . - */
83 #define OANYOF (6LU<<OPSHIFT) /* [...] set number */
84 #define OBACK_ (7LU<<OPSHIFT) /* begin \d paren number */
85 #define O_BACK (8LU<<OPSHIFT) /* end \d paren number */
86 #define OPLUS_ (9LU<<OPSHIFT) /* + prefix fwd to suffix */
87 #define O_PLUS (10LU<<OPSHIFT) /* + suffix back to prefix *
    [all...]
  /src/tests/usr.bin/indent/
lex_number.c 12 100000000000000000000000000000000000000000LU, // suffix
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
LoopStrengthReduce.cpp 1000 /// folded in \p LU at isel time.
1002 /// This function returns true if \p LU can accommodate what \p F
1009 const LSRUse &LU, const Formula &F);
1011 // Get the cost of the scaling factor used in F for LU.
1013 const LSRUse &LU, const Formula &F,
1063 const LSRUse &LU,
1327 const LSRUse &LU,
1359 NumBaseParts - (1 + (F.Scale && isAMCompletelyFolded(*TTI, LU, F)));
1363 C.ScaleCost += *getScalingFactorCost(*TTI, LU, F, *L).getValue();
1366 for (const LSRFixup &Fixup : LU.Fixups)
    [all...]
  /src/external/cddl/osnet/dist/uts/common/sys/
bitmap.h 195 #define BITX(u, h, l) (((u) >> (l)) & ((1LU << ((h) - (l) + 1LU)) - 1LU))
  /src/tests/usr.bin/xlint/lint1/
lex_integer.c 95 print_type(3LU);
  /src/external/gpl3/gcc.old/dist/gcc/
substring-locations.cc 206 gtn = n <= ULONG_MAX ? n : n % 1000000LU + 1000000LU;
diagnostic.cc 1570 gtn = n <= ULONG_MAX ? n : n % 1000000LU + 1000000LU;
  /src/external/gpl3/gcc/dist/gcc/
substring-locations.cc 206 gtn = n <= ULONG_MAX ? n : n % 1000000LU + 1000000LU;
  /src/external/bsd/jemalloc/dist/include/jemalloc/internal/
bitmap.h 254 bitmap_t group_mask = ~((1LU << group_nmask) - 1);
256 if (group_masked == 0LU) {
257 if (group == 0LU) {
283 bitmap_t g = bitmap[i] & ~((1LU << (min_bit & BITMAP_GROUP_NBITS_MASK))
fb.h 188 group &= ~((1LU << bit_ind) - 1);
196 group &= ((2LU << bit_ind) - 1);
  /src/external/bsd/jemalloc/include/jemalloc/internal/
bitmap.h 254 bitmap_t group_mask = ~((1LU << group_nmask) - 1);
256 if (group_masked == 0LU) {
257 if (group == 0LU) {
283 bitmap_t g = bitmap[i] & ~((1LU << (min_bit & BITMAP_GROUP_NBITS_MASK))
fb.h 188 group &= ~((1LU << bit_ind) - 1);
196 group &= ((2LU << bit_ind) - 1);
  /src/external/bsd/jemalloc.old/dist/include/jemalloc/internal/
bitmap.h 255 bitmap_t group_mask = ~((1LU << group_nmask) - 1);
257 if (group_masked == 0LU) {
258 if (group == 0LU) {
284 bitmap_t g = bitmap[i] & ~((1LU << (min_bit & BITMAP_GROUP_NBITS_MASK))
  /src/external/bsd/jemalloc.old/include/jemalloc/internal/
bitmap.h 255 bitmap_t group_mask = ~((1LU << group_nmask) - 1);
257 if (group_masked == 0LU) {
258 if (group == 0LU) {
284 bitmap_t g = bitmap[i] & ~((1LU << (min_bit & BITMAP_GROUP_NBITS_MASK))
  /src/external/gpl3/binutils/dist/gprofng/common/
cpuid.c 68 #define BITX(u, h, l) (((u) >> (l)) & ((1LU << ((h) - (l) + 1LU)) - 1LU))
  /src/external/gpl3/binutils.old/dist/gprofng/common/
cpuid.c 68 #define BITX(u, h, l) (((u) >> (l)) & ((1LU << ((h) - (l) + 1LU)) - 1LU))
  /src/external/apache2/llvm/dist/llvm/tools/verify-uselistorder/
verify-uselistorder.cpp 318 auto LU = L->use_begin(), LE = L->use_end();
320 skipUnmappedUsers(LU, LE, LM);
323 while (LU != LE) {
328 if (LM.lookup(LU->getUser()) != RM.lookup(RU->getUser())) {
332 if (LU->getOperandNo() != RU->getOperandNo()) {
336 skipUnmappedUsers(++LU, LE, LM);
  /src/sys/arch/arm/at91/
at91pmc.c 50 #define SLOW_CLOCK 32768LU
  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
HexagonBlockRanges.cpp 304 auto LD = LastDef[R], LU = LastUse[R];
307 if (LU == IndexType::None)
308 LU = IndexType::Exit;
309 LiveMap[R].add(LD, LU, false, false);
  /src/external/apache2/llvm/dist/llvm/lib/IR/
LegacyPassManager.cpp 624 auto &LU = DMI->second;
625 LastUses.append(LU.begin(), LU.end());
1638 SmallVector<Pass *, 1> LU;
1639 LU.push_back(FoundPass);
1640 FPP->setLastUser(LU, P);
  /src/lib/libpthread/
pthread_int.h 193 #define _UC_USER (1LU << _UC_USER_BIT)
  /src/external/apache2/llvm/dist/llvm/lib/Bitcode/Writer/
ValueEnumerator.cpp 217 const Use *LU = L.first;
219 if (LU == RU)
222 auto LID = OM.lookup(LU->getUser()).first;
252 return LU->getOperandNo() < RU->getOperandNo();
253 return LU->getOperandNo() > RU->getOperandNo();
  /src/external/gpl3/gcc.old/dist/gcc/d/dmd/
intrange.d 822 for (uinteger_t d = 1LU << (8 * uinteger_t.sizeof - 1); d; d >>= 1)
878 for (uinteger_t d = 1LU << (8 * uinteger_t.sizeof - 1); d; d >>= 1)
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
TargetLoweringObjectFileImpl.cpp 1777 if (const auto *LU = M.getNamedGlobal("llvm.used")) {
1778 assert(LU->hasInitializer() && "expected llvm.used to have an initializer");
1779 assert(isa<ArrayType>(LU->getValueType()) &&
1781 if (const auto *A = cast<ConstantArray>(LU->getInitializer())) {
  /src/sys/arch/mips/mips/
cpu_subr.c 84 __aligned(1LU << ilog2((2*sizeof(struct cpu_info)-1)))
699 printf(" cpu%lu", cii);
714 printf("cpu%lu: shutting down\n", cii);

Completed in 63 milliseconds

1 2