HomeSort by relevance Sort by last modified time
    Searched refs:Piece (Results 1 - 7 of 7) sorted by null

  /external/llvm/include/llvm/Bitcode/
BitstreamReader.h 405 uint32_t Piece = Read(NumBits);
406 if ((Piece & (1U << (NumBits-1))) == 0)
407 return Piece;
412 Result |= (Piece & ((1U << (NumBits-1))-1)) << NextBit;
414 if ((Piece & (1U << (NumBits-1))) == 0)
418 Piece = Read(NumBits);
425 uint32_t Piece = Read(NumBits);
426 if ((Piece & (1U << (NumBits-1))) == 0)
427 return uint64_t(Piece);
432 Result |= uint64_t(Piece & ((1U << (NumBits-1))-1)) << NextBit
    [all...]
  /external/clang/lib/Sema/
SemaStmtAsm.cpp 66 const GCCAsmStmt::AsmStringPiece &Piece = AsmStrPieces[p];
67 if (!Piece.isOperand()) continue;
71 if (Piece.getOperandNo() == OpNo)
220 GCCAsmStmt::AsmStringPiece &Piece = Pieces[i];
221 if (!Piece.isOperand()) continue;
228 if (Idx == Piece.getOperandNo())
233 if (Idx == Piece.getOperandNo())
241 if (Idx == Piece.getOperandNo())
246 if (Idx == Piece.getOperandNo())
260 .validateConstraintModifier(Literal->getString(), Piece.getModifier()
    [all...]
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/
balanced_quicksort.h 69 typedef std::pair<RandomAccessIterator, RandomAccessIterator> Piece;
71 /** @brief Initial piece to work on. */
72 Piece initial;
75 RestrictedBoundedConcurrentQueue<Piece> leftover_parts;
84 Piece global;
245 typedef std::pair<RandomAccessIterator, RandomAccessIterator> Piece;
258 Piece current = tl.initial;
427 typedef std::pair<RandomAccessIterator, RandomAccessIterator> Piece;
466 Piece dummy;
multiway_mergesort.h 47 struct Piece
87 std::vector<Piece<difference_type> >* pieces;
444 sd.pieces = new std::vector<Piece<difference_type> >[num_threads];
  /external/clang/lib/StaticAnalyzer/Core/
PathDiagnostic.cpp 69 PathDiagnosticPiece *Piece = I->getPtr();
71 switch (Piece->getKind()) {
73 PathDiagnosticCallPiece *Call = cast<PathDiagnosticCallPiece>(Piece);
86 PathDiagnosticMacroPiece *Macro = cast<PathDiagnosticMacroPiece>(Piece);
90 Current.push_back(Piece);
93 // FIXME: This probably shouldn't mutate the original path piece.
100 Current.push_back(Piece);
133 "The call piece should be in the main file.");
143 // Check if the last piece in the callee path is a call to a function outside
150 // Otherwise, the last piece is in the main file
224 const PathDiagnosticPiece *piece = I->getPtr(); local
1025 const PathDiagnosticPiece *piece = it->getPtr(); local
    [all...]
BugReporter.cpp 111 IntrusiveRefCntPtr<PathDiagnosticPiece> piece(path.front());
114 switch (piece->getKind()) {
116 removeRedundantMsgs(cast<PathDiagnosticCallPiece>(piece)->path);
119 removeRedundantMsgs(cast<PathDiagnosticMacroPiece>(piece)->subPieces);
130 cast<PathDiagnosticEventPiece>(piece);
132 // come up with a preference, record which piece to keep, and consume
133 // another piece from the path.
136 piece = pieceToKeep;
144 path.push_back(piece);
162 // Remove the front piece from the path. If it is still something w
2957 PathDiagnosticPiece *piece = I->getPtr(); local
3410 PathDiagnosticPiece *piece = local
    [all...]
  /external/llvm/lib/Transforms/InstCombine/
InstCombineCasts.cpp     [all...]

Completed in 141 milliseconds