HomeSort by relevance Sort by last modified time
    Searched defs:Rep (Results 1 - 5 of 5) sorted by null

  /external/clang/include/clang/Serialization/
ContinuousRangeMap.h 45 Representation Rep;
64 if (!Rep.empty() && Rep.back() == Val)
67 assert((Rep.empty() || Rep.back().first < Val.first) &&
69 Rep.push_back(Val);
73 iterator I = std::lower_bound(Rep.begin(), Rep.end(), Val, Compare());
74 if (I != Rep.end() && I->first == Val.first) {
79 Rep.insert(I, Val)
    [all...]
  /external/llvm/lib/VMCore/
AutoUpgrade.cpp 175 Value *Rep;
179 Rep = Builder.CreateICmpEQ(CI->getArgOperand(0), CI->getArgOperand(1),
182 Rep = Builder.CreateSExt(Rep, CI->getType(), "");
185 Rep = Builder.CreateICmpSGT(CI->getArgOperand(0), CI->getArgOperand(1),
188 Rep = Builder.CreateSExt(Rep, CI->getType(), "");
257 Rep = Builder.CreateCall3(VPCOM, CI->getArgOperand(0),
292 Rep = Builder.CreateShuffleVector(Op0, Op0, ConstantVector::get(Idxs));
298 CI->replaceAllUsesWith(Rep);
    [all...]
  /external/clang/test/CXX/temp/temp.decls/temp.friend/
p1.cpp 11 template <typename U> struct Rep {
13 Rep(U count) : count_(count) {}
15 friend Num operator*(const Num &a, const Rep &n) {
54 Num<int>::Rep<char> n = (char) 10;
  /external/valgrind/tsan/
ts_util.cc 514 struct TSLock::Rep {
533 //Printf("rep::Read: %c\n", buf[0]);
550 struct TSLock::Rep {
570 //Printf("rep::Read: %c\n", buf[0]);
589 rep_ = new Rep;
613 struct TSLock::Rep {
619 rep_ = new Rep();
642 struct TSLock::Rep {
647 rep_ = new Rep();
  /external/llvm/include/llvm/ADT/
DenseMap.h 766 // First stash the large side's rep and move the small side across.
857 // Now make this map use the large rep, and move all the entries back
958 LargeRep Rep = {
961 return Rep;

Completed in 983 milliseconds