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

  /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/deque/deque.special/
copy.pass.cpp 49 typedef random_access_iterator<I> RAI;
58 assert(std::copy(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end()));
60 assert(std::copy(c2.cbegin(), c2.cend(), RAI(c1.begin())) == RAI(c1.end()));
copy_backward.pass.cpp 49 typedef random_access_iterator<I> RAI;
57 assert(std::copy_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin()));
59 assert(std::copy_backward(c2.cbegin(), c2.cend(), RAI(c1.end())) == RAI(c1.begin()));
move.pass.cpp 49 typedef random_access_iterator<I> RAI;
57 assert(std::move(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end()));
59 assert(std::move(c2.cbegin(), c2.cend(), RAI(c1.begin())) == RAI(c1.end()));
move_backward.pass.cpp 49 typedef random_access_iterator<I> RAI;
57 assert(std::move_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin()));
59 assert(std::move_backward(c2.cbegin(), c2.cend(), RAI(c1.end())) == RAI(c1.begin()));
  /external/llvm/lib/CodeGen/
GCStrategy.cpp 364 MachineBasicBlock::iterator RAI = CI;
365 ++RAI;
373 MCSymbol* Label = InsertLabel(*CI->getParent(), RAI, CI->getDebugLoc());
MachineBasicBlock.cpp     [all...]
  /external/llvm/utils/TableGen/
SubtargetEmitter.cpp 760 for (RecIter RAI = ProcModel.ReadAdvanceDefs.begin(),
761 RAE = ProcModel.ReadAdvanceDefs.end(); RAI != RAE; ++RAI) {
762 if (!(*RAI)->isSubClassOf("ReadAdvance"))
764 if (AliasDef == (*RAI)->getValueAsDef("ReadType")
765 || SchedRead.TheDef == (*RAI)->getValueAsDef("ReadType")) {
767 PrintFatalError((*RAI)->getLoc(), "Resources are defined for both "
771 ResDef = *RAI;
    [all...]
CodeGenSchedule.cpp     [all...]
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/
multiway_merge.h 284 template<template<typename RAI, typename C> class iterator,
404 template<template<typename RAI, typename C> class iterator,
    [all...]

Completed in 97 milliseconds