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 406 uint32_t Piece = Read(NumBits);
407 if ((Piece & (1U << (NumBits-1))) == 0)
408 return Piece;
413 Result |= (Piece & ((1U << (NumBits-1))-1)) << NextBit;
415 if ((Piece & (1U << (NumBits-1))) == 0)
419 Piece = Read(NumBits);
426 uint32_t Piece = Read(NumBits);
427 if ((Piece & (1U << (NumBits-1))) == 0)
428 return uint64_t(Piece);
433 Result |= uint64_t(Piece & ((1U << (NumBits-1))-1)) << NextBit
    [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/Sema/
SemaStmtAsm.cpp 78 const GCCAsmStmt::AsmStringPiece &Piece = AsmStrPieces[p];
79 if (!Piece.isOperand()) continue;
83 if (Piece.getOperandNo() == OpNo)
225 GCCAsmStmt::AsmStringPiece &Piece = Pieces[i];
226 if (!Piece.isOperand()) continue;
233 if (Idx == Piece.getOperandNo())
238 if (Idx == Piece.getOperandNo())
246 if (Idx == Piece.getOperandNo())
251 if (Idx == Piece.getOperandNo())
265 .validateConstraintModifier(Literal->getString(), Piece.getModifier()
    [all...]
  /external/clang/lib/StaticAnalyzer/Core/
PathDiagnostic.cpp 68 PathDiagnosticPiece *Piece = I->getPtr();
70 switch (Piece->getKind()) {
72 PathDiagnosticCallPiece *Call = cast<PathDiagnosticCallPiece>(Piece);
85 PathDiagnosticMacroPiece *Macro = cast<PathDiagnosticMacroPiece>(Piece);
89 Current.push_back(Piece);
92 // FIXME: This probably shouldn't mutate the original path piece.
99 Current.push_back(Piece);
158 const PathDiagnosticPiece *piece = I->getPtr(); local
159 FullSourceLoc L = piece->getLocation().asLocation().getExpansionLoc();
167 ArrayRef<SourceRange> Ranges = piece->getRanges()
909 const PathDiagnosticPiece *piece = it->getPtr(); local
    [all...]
BugReporter.cpp 164 IntrusiveRefCntPtr<PathDiagnosticPiece> piece(path.front());
167 switch (piece->getKind()) {
169 removeRedundantMsgs(cast<PathDiagnosticCallPiece>(piece)->path);
172 removeRedundantMsgs(cast<PathDiagnosticMacroPiece>(piece)->subPieces);
183 cast<PathDiagnosticEventPiece>(piece);
185 // come up with a preference, record which piece to keep, and consume
186 // another piece from the path.
189 piece = pieceToKeep;
197 path.push_back(piece);
209 // Remove the front piece from the path. If it is still something w
2031 PathDiagnosticPiece *piece = I->getPtr(); local
2429 PathDiagnosticPiece *piece = local
    [all...]
  /external/llvm/lib/Transforms/InstCombine/
InstCombineCasts.cpp     [all...]

Completed in 323 milliseconds