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

1 2 3 4 5 6 7 8 9

  /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.base/
structs3.c 18 struct One
25 struct One one; member in struct:Two
31 typedef struct One tOne;
34 tOne *onep = &two.one;
  /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.base/
structs3.c 18 struct One
25 struct One one; member in struct:Two
31 typedef struct One tOne;
34 tOne *onep = &two.one;
  /src/external/apache2/llvm/dist/llvm/include/llvm/Support/
KnownBits.h 25 APInt One;
29 KnownBits(APInt Zero, APInt One)
30 : Zero(std::move(Zero)), One(std::move(One)) {}
33 // Default construct Zero and One.
37 KnownBits(unsigned BitWidth) : Zero(BitWidth, 0), One(BitWidth, 0) {}
41 assert(Zero.getBitWidth() == One.getBitWidth() &&
42 "Zero and One should have the same width!");
47 bool hasConflict() const { return Zero.intersects(One); }
52 return Zero.countPopulation() + One.countPopulation() == getBitWidth()
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Support/
KnownBits.cpp 25 "Carry can't be zero and one at the same time");
32 APInt CarryKnownOne = PossibleSumOne ^ LHS.One ^ RHS.One;
35 APInt LHSKnownUnion = LHS.Zero | LHS.One;
36 APInt RHSKnownUnion = RHS.Zero | RHS.One;
46 KnownOut.One = std::move(PossibleSumOne) & Known;
54 LHS, RHS, Carry.Zero.getBoolValue(), Carry.One.getBoolValue());
66 std::swap(RHS.Zero, RHS.One);
75 // a non-negative one, can't wrap into negative.
79 // a negative one, can't wrap into non-negative
    [all...]
  /src/external/cddl/dtracetoolkit/dist/Docs/
oneliners.txt 5 DTrace One Liners,
72 DTrace Longer One Liners,
  /src/external/gpl3/gcc/dist/contrib/
paranoia.cc 81 E6 SqEr O1 One W
778 FLOAT one = 1;
786 if (f == one)
832 FLOAT one = 1;
836 if (x == one)
842 FLOAT xm1 = x - one;
957 FLOAT One;
1031 One = long(1);
1055 TstCond (Failure, (One - One == Zero), "1-1 != 0")
    [all...]
  /src/external/gpl3/gcc.old/dist/contrib/
paranoia.cc 81 E6 SqEr O1 One W
778 FLOAT one = 1;
786 if (f == one)
832 FLOAT one = 1;
836 if (x == one)
842 FLOAT xm1 = x - one;
957 FLOAT One;
1031 One = long(1);
1055 TstCond (Failure, (One - One == Zero), "1-1 != 0")
    [all...]
  /src/external/gpl3/gcc/dist/libgcc/config/or1k/
or1k-asm.h 17 #error One of __OR1K_NODELAY__, __OR1K_DELAY__, or __OR1K_DELAY_COMPAT__ must be defined
  /src/external/gpl3/gcc.old/dist/libgcc/config/or1k/
or1k-asm.h 17 #error One of __OR1K_NODELAY__, __OR1K_DELAY__, or __OR1K_DELAY_COMPAT__ must be defined
  /src/external/gpl3/gdb/dist/sim/testsuite/or1k/
or1k-asm.h 34 #error One of __OR1K_NODELAY__, __OR1K_DELAY__, or __OR1K_DELAY_COMPAT__ must be defined
  /src/external/gpl3/gdb.old/dist/sim/testsuite/or1k/
or1k-asm.h 34 #error One of __OR1K_NODELAY__, __OR1K_DELAY__, or __OR1K_DELAY_COMPAT__ must be defined
  /src/external/apache2/llvm/dist/llvm/examples/HowToUseLLJIT/
HowToUseLLJIT.cpp 61 Value *One = builder.getInt32(1);
69 Value *Add = builder.CreateAdd(One, ArgX);
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/InstCombine/
InstCombineSimplifyDemanded.cpp 89 /// with a constant or one of its operands. In such cases, this function does
91 /// analyzing the expression and setting KnownOne and known to be one in the
96 /// Known.One and Known.Zero always follow the invariant that:
97 /// Known.One & Known.Zero == 0.
98 /// That is, a bit can't be both 1 and 0. Note that the bits in Known.One and
100 /// also that the bitwidth of V, DemandedMask, Known.Zero and Known.One must all
144 // only reflects the bits demanded by *one* of the users.
167 assert(!RHSKnown.hasConflict() && "Bits known to be one AND zero?");
168 assert(!LHSKnown.hasConflict() && "Bits known to be one AND zero?");
174 if (DemandedMask.isSubsetOf(Known.Zero | Known.One))
    [all...]
  /src/external/apache2/llvm/dist/llvm/examples/Fibonacci/
fibonacci.cpp 13 // consisting of one function as follow:
63 Value *One = ConstantInt::get(Type::getInt32Ty(Context), 1);
80 ReturnInst::Create(Context, One, RetBB);
83 Value *Sub = BinaryOperator::CreateSub(ArgX, One, "arg", RecurseBB);
  /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/
BoolAssignmentChecker.cpp 78 // be a value that is either 0 or 1. One way to check this is to see if
86 llvm::APSInt One = BVF.getValue(1, valTy);
89 std::tie(StIn, StOut) = CM.assumeInclusiveRangeDual(state, *NV, Zero, One);
  /src/external/apache2/llvm/dist/llvm/examples/HowToUseJIT/
HowToUseJIT.cpp 87 Value *One = builder.getInt32(1);
95 Value *Add = builder.CreateAdd(One, ArgX);
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
DemandedBits.cpp 9 // This pass implements a demanded bits analysis. A demanded bit is one that
11 // one without affecting control or data flow. For example in this sequence:
135 // known to be one.
145 // known to be one.
273 // For bits that are known one, the corresponding bits in the
274 // other operand are dead (unless they're both one, in which
279 AB &= ~Known2.One;
281 AB &= ~(Known.One & ~Known2.One);
501 "Carry can't be zero and one at the same time")
    [all...]
  /src/external/apache2/llvm/dist/llvm/examples/ParallelJIT/
ParallelJIT.cpp 64 Value *One = ConstantInt::get(Type::getInt32Ty(Context), 1);
72 Instruction *Add = BinaryOperator::CreateAdd(One, ArgX, "addresult", BB);
94 Value *One = ConstantInt::get(Type::getInt32Ty(Context), 1);
111 ReturnInst::Create(Context, One, RetBB);
114 Value *Sub = BinaryOperator::CreateSub(ArgX, One, "arg", RecurseBB);
276 // Create one thread for add1 and two threads for fib
  /src/external/mpl/bind/dist/bin/tests/system/checkconf/
bad-kasp10.conf 8 * file, you can obtain one at https://mozilla.org/MPL/2.0/.
14 // One zone with dnssec-policy 'none', one zone with dnssec-policy 'insecure',
bad-kasp11.conf 8 * file, you can obtain one at https://mozilla.org/MPL/2.0/.
14 // One zone with a dnssec-policy, the other with allow-update,
bad-kasp12.conf 8 * file, you can obtain one at https://mozilla.org/MPL/2.0/.
14 // One zone with a dnssec-policy, the other with update-policy,
bad-kasp13.conf 8 * file, you can obtain one at https://mozilla.org/MPL/2.0/.
14 // One zone transitioning to insecure, the other with allow-update,
bad-kasp8.conf 8 * file, you can obtain one at https://mozilla.org/MPL/2.0/.
14 // One zone with dnssec-policy, the other zone has 'dnssec-policy none',
bad-kasp9.conf 8 * file, you can obtain one at https://mozilla.org/MPL/2.0/.
14 // One zone with dnssec-policy, the other zone has 'dnssec-policy insecure'
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
ScalarEvolutionDivision.h 65 const SCEV *Denominator, *Quotient, *Remainder, *Zero, *One;

Completed in 46 milliseconds

1 2 3 4 5 6 7 8 9