| /src/games/hangman/ |
| extern.c | 45 char Word[BUFSIZ], Known[BUFSIZ];
|
| /src/sys/external/bsd/compiler_rt/dist/lib/xray/tests/unit/ |
| buffer_queue_test.cc | 66 BufferQueue::Buffer Known;
67 EXPECT_THAT(Buffers.getBuffer(Known), Eq(BufferQueue::ErrorCode::Ok));
70 EXPECT_THAT(Buffers.releaseBuffer(Known), Eq(BufferQueue::ErrorCode::Ok));
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| AMDGPULateCodeGenPrepare.cpp | 73 KnownBits Known = computeKnownBits(V, *DL, 0, AC);
74 return Known.countMinTrailingZeros() >= 2;
|
| AMDGPUCodeGenPrepare.cpp | 157 /// SelectionDAG has an issue where an and asserting the bits are known
444 KnownBits Known = computeKnownBits(Op, *DL, 0, AC);
445 return ScalarSize - Known.countMinLeadingZeros();
1005 KnownBits Known = computeKnownBits(V, *DL);
1006 if (Known.isNegative())
1008 if (Known.isNonNegative())
|
| /src/external/apache2/llvm/dist/clang/lib/Basic/ |
| FileManager.cpp | 103 // the cache (or it's a known non-virtual directory).
234 // subdirectory. This will let us avoid having to waste time on known-to-fail
605 llvm::DenseMap<const void *, llvm::StringRef>::iterator Known
607 if (Known != CanonicalNames.end())
608 return Known->second;
621 llvm::DenseMap<const void *, llvm::StringRef>::iterator Known
623 if (Known != CanonicalNames.end())
624 return Known->second;
|
| /src/external/apache2/llvm/dist/clang/lib/Serialization/ |
| ModuleManager.cpp | 62 auto Known = Modules.find(File);
63 if (Known == Modules.end())
66 return Known->second;
|
| GlobalModuleIndex.cpp | 297 llvm::DenseMap<ModuleFile *, unsigned>::iterator Known
299 if (Known == ModulesByFile.end())
304 ArrayRef<unsigned> StoredDependencies = Modules[Known->second].Dependencies;
322 IdentifierIndexTable::iterator Known = Table.find(Name);
323 if (Known == Table.end()) {
327 SmallVector<unsigned, 2> ModuleIDs = *Known;
340 llvm::StringMap<unsigned>::iterator Known = UnresolvedModules.find(Name);
341 if (Known == UnresolvedModules.end()) {
346 ModuleInfo &Info = Modules[Known->second];
354 ModulesByFile[File] = Known->second
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| FunctionLoweringInfo.h | 158 KnownBits Known = 1;
237 const KnownBits &Known) {
239 if (NumSignBits == 1 && Known.isUnknown())
245 LOI.Known.One = Known.One;
246 LOI.Known.Zero = Known.Zero;
|
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| DemandedBits.cpp | 88 const APInt &AOut, APInt &AB, KnownBits &Known, KnownBits &Known2,
93 // compute known bits of both operands in order to determine the live bits of
105 Known = KnownBits(BitWidth);
106 computeKnownBits(V1, Known, DL, 0, &AC, UserI, &DT);
135 // known to be one.
138 std::min(BitWidth, Known.countMaxLeadingZeros()+1));
145 // known to be one.
148 std::min(BitWidth, Known.countMaxTrailingZeros()+1));
189 AB = determineLiveOperandBitsAdd(OperandNo, AOut, Known, Known2);
197 AB = determineLiveOperandBitsSub(OperandNo, AOut, Known, Known2)
[all...] |
| GlobalsModRef.cpp | 53 // sensitivity and no known issues. The option also makes it easy to evaluate
688 // All inputs were known to be no-alias.
694 // a non-addr-taken global is known to not be escaped from any function. It is
724 // resolve to one of these known-escaping roots.
924 // Try ::alias to see if all objects are known not to alias GV.
943 ModRefInfo Known = ModRefInfo::ModRef;
955 Known = unionModRef(FI->getModRefInfoForGlobal(*GV),
958 if (!isModOrRefSet(Known))
960 return intersectModRef(Known, AAResultBase::getModRefInfo(Call, Loc, AAQI));
|
| Lint.cpp | 297 // isn't expressive enough for what we really want to do. Known partial
298 // overlap is not distinguished from the case where nothing is known.
319 // isn't expressive enough for what we really want to do. Known partial
320 // overlap is not distinguished from the case where nothing is known.
527 KnownBits Known =
529 return Known.isZero();
548 KnownBits Known = computeKnownBits(Elem, DL);
549 if (Known.isZero())
643 // TODO: Look through sext or zext cast, when the result is known to
|
| BasicAliasAnalysis.cpp | 135 // escaping, and objects located at well-known addresses via platform-specific
411 /// in the VarIndices vector) are Value*'s that are known to be scaled by the
701 /// site is not known.
753 // Checking for known builtin intrinsics and target library functions.
1154 KnownBits Known = computeKnownBits(V, DL, 0, &AC, CxtI, DT);
1155 bool SignKnownZero = Known.isNonNegative();
1156 bool SignKnownOne = Known.isNegative();
1488 // Function arguments can't alias with things that are known to be
|
| ValueTracking.cpp | 195 KnownBits &Known, unsigned Depth, const Query &Q);
197 static void computeKnownBits(const Value *V, KnownBits &Known, unsigned Depth,
202 Known.resetAll();
209 computeKnownBits(V, DemandedElts, Known, Depth, Q);
212 void llvm::computeKnownBits(const Value *V, KnownBits &Known,
217 ::computeKnownBits(V, Known, Depth,
222 KnownBits &Known, const DataLayout &DL,
226 ::computeKnownBits(V, DemandedElts, Known, Depth,
320 KnownBits Known =
322 return Known.isNonNegative()
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/GlobalISel/ |
| GISelKnownBits.cpp | 21 #define DEBUG_TYPE "gisel-known-bits"
68 KnownBits Known;
69 computeKnownBitsImpl(R, Known, DemandedElts);
71 return Known;
87 dumpResult(const MachineInstr &MI, const KnownBits &Known, unsigned Depth) {
88 dbgs() << "[" << Depth << "] Compute known bits: " << MI << "[" << Depth
89 << "] Computed for: " << MI << "[" << Depth << "] Known: 0x"
90 << (Known.Zero | Known.One).toString(16, false) << "\n"
91 << "[" << Depth << "] Zero: 0x" << Known.Zero.toString(16, false
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Tooling/ |
| InterpolatingCompilationDatabase.cpp | 520 auto Known = Inner->getCompileCommands(Filename);
521 if (Index.empty() || !Known.empty())
522 return Known;
|
| /src/external/apache2/llvm/dist/llvm/lib/Support/ |
| KnownBits.cpp | 1 //===-- KnownBits.cpp - Stores known zeros/ones ---------------------------===//
9 // This file contains a class for representing known zeros and ones used by
30 // Compute known bits of the carry.
34 // Compute set of known bits (where all three relevant bits are known).
38 APInt Known = std::move(LHSKnownUnion) & RHSKnownUnion & CarryKnownUnion;
40 assert((PossibleSumZero & Known) == (PossibleSumOne & Known) &&
41 "known bits of sum differ");
43 // Compute known bits of the result
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| LowerSwitch.cpp | 399 KnownBits Known = computeKnownBits(Val, DL, /*Depth=*/0, AC, SI);
402 ConstantRange::fromKnownBits(Known, /*IsSigned=*/false);
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/RISCV/ |
| RISCVISelDAGToDAG.cpp | 1239 // bits that are known zero.
1240 KnownBits Known = CurDAG->computeKnownBits(N->getOperand(0));
1241 if (ShMask.isSubsetOf(AndMask | Known.Zero)) {
|
| /src/external/apache2/llvm/dist/clang/include/clang/Sema/ |
| ScopeInfo.h | 249 /// weakVar | 0 (known) | weakVar (VarDecl)
285 /// Returns true if the object base specifies a known object in memory,
728 llvm::DenseMap<VarDecl*, unsigned>::const_iterator Known
730 assert(Known != CaptureMap.end() && "Variable has not been captured");
731 return Captures[Known->second - 1];
915 /// Is this scope known to be for a generic lambda? (This will be false until
|
| /src/external/apache2/llvm/dist/clang/lib/Parse/ |
| ParseExpr.cpp | 1122 llvm::SmallDenseMap<IdentifierInfo *, tok::TokenKind>::iterator Known
1124 if (Known != RevertibleTypeTraits.end()) {
1125 Tok.setKind(Known->second);
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAGISel.cpp | 728 KnownBits Known;
753 Known = CurDAG->computeKnownBits(Src);
754 FuncInfo->AddLiveOutRegInfo(DestReg, NumSignBits, Known);
2036 // either already zero or is not demanded. Check for known zero input bits.
2065 // either already zero or is not demanded. Check for known zero input bits.
2067 KnownBits Known = CurDAG->computeKnownBits(LHS);
2069 // If all the missing bits in the or are already known to be set, match!
2070 if (NeededMask.isSubsetOf(Known.One))
2673 /// scope, evaluate the current node. If the current predicate is known to
2675 /// known to pass, set Result=false and return the MatcherIndex to continu
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/SystemZ/ |
| SystemZISelDAGToDAG.cpp | 742 // It's only an insertion if all bits are covered or are known to be zero.
746 KnownBits Known = CurDAG->computeKnownBits(Op.getOperand(0));
747 if (Used != (AndMask | InsertMask | Known.Zero.getZExtValue()))
801 // If some bits of Input are already known zeros, those bits will have
804 KnownBits Known = CurDAG->computeKnownBits(Input);
805 Mask |= Known.Zero.getZExtValue();
824 // If some bits of Input are already known ones, those bits will have
827 KnownBits Known = CurDAG->computeKnownBits(Input);
828 Mask &= ~Known.One.getZExtValue();
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/XCore/ |
| XCoreISelLowering.cpp | 406 KnownBits Known = DAG.computeKnownBits(Value);
407 return Known.countMinTrailingZeros() >= 2;
1210 // known live into the call.
1605 KnownBits Known;
1610 TLI.SimplifyDemandedBits(OutVal, DemandedMask, Known, TLO))
1621 KnownBits Known;
1626 TLI.SimplifyDemandedBits(Time, DemandedMask, Known, TLO))
1659 KnownBits Known = DAG.computeKnownBits(N2);
1660 if ((Known.Zero & Mask) == Mask) {
1681 KnownBits Known = DAG.computeKnownBits(N2)
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/AST/ |
| RecordLayoutBuilder.cpp | 87 auto Known = BaseOffsets.find(RD);
88 if (Known == BaseOffsets.end())
90 BaseOffset = Known->second;
95 auto Known = VirtualBaseOffsets.find(RD);
96 if (Known == VirtualBaseOffsets.end())
98 BaseOffset = Known->second;
117 /// MaxEmptyClassOffset - The highest offset known to contain an empty
272 // We don't have to keep looking past the maximum offset that's known to
380 // We don't have to keep looking past the maximum offset that's known to
432 // We don't have to keep looking past the maximum offset that's known t
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Lex/ |
| ModuleMap.cpp | 399 HeadersMap::iterator Known = Headers.find(File);
401 Known == Headers.end() && ModuleMap::isBuiltinHeader(File)) {
405 return Known;
492 HeadersMap::iterator Known = findKnownHeader(File);
493 if (Known != Headers.end()) {
494 for (const KnownHeader &Header : Known->second) {
580 HeadersMap::iterator Known = findKnownHeader(File);
581 if (Known != Headers.end()) {
584 for (KnownHeader &H : Known->second) {
671 HeadersMap::iterator Known = findKnownHeader(File)
[all...] |
