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

  /external/llvm/utils/TableGen/
SequenceToOffsetTable.h 68 void add(const SeqT &Seq) {
70 typename SeqMap::iterator I = Seqs.lower_bound(Seq);
72 // If SeqMap contains a sequence that has Seq as a suffix, I will be
74 if (I != Seqs.end() && isSuffix(Seq, I->first))
77 I = Seqs.insert(I, std::make_pair(Seq, 0u));
79 // The entry before I may be a suffix of Seq that can now be erased.
80 if (I != Seqs.begin() && isSuffix((--I)->first, Seq))
98 /// get - Returns the offset of Seq in the final table.
99 unsigned get(const SeqT &Seq) const {
101 typename SeqMap::const_iterator I = Seqs.lower_bound(Seq);
    [all...]
CodeGenSchedule.h 75 CodeGenSchedRW(unsigned Idx, bool Read, const IdxVec &Seq,
78 HasVariants(false), IsVariadic(false), IsSequence(true), Sequence(Seq) {
344 unsigned findOrInsertRW(ArrayRef<unsigned> Seq, bool IsRead);
361 std::string genRWName(const IdxVec& Seq, bool IsRead);
362 unsigned findRWForSequence(const IdxVec &Seq, bool IsRead);
CodeGenSchedule.cpp 190 RecVec Seq = RWDef->getValueAsListOfDefs("Writes");
191 for (RecIter I = Seq.begin(), E = Seq.end(); I != E; ++I)
334 std::string CodeGenSchedModels::genRWName(const IdxVec& Seq, bool IsRead) {
336 for (IdxIter I = Seq.begin(), E = Seq.end(); I != E; ++I) {
337 if (I != Seq.begin())
465 unsigned CodeGenSchedModels::findRWForSequence(const IdxVec &Seq,
471 if (I->Sequence == Seq)
479 unsigned CodeGenSchedModels::findOrInsertRW(ArrayRef<unsigned> Seq,
    [all...]
  /external/llvm/lib/Target/Mips/
MipsAnalyzeImmediate.cpp 85 void MipsAnalyzeImmediate::ReplaceADDiuSLLWithLUi(InstSeq &Seq) {
88 if ((Seq.size() < 2) || (Seq[0].Opc != ADDiu) ||
89 (Seq[1].Opc != SLL) || (Seq[1].ImmOpnd < 16))
93 int64_t Imm = SignExtend64<16>(Seq[0].ImmOpnd);
94 int64_t ShiftedImm = (uint64_t)Imm << (Seq[1].ImmOpnd - 16);
100 Seq[0].Opc = LUi;
101 Seq[0].ImmOpnd = (unsigned)(ShiftedImm & 0xffff);
102 Seq.erase(Seq.begin() + 1)
    [all...]
MipsAnalyzeImmediate.h 51 void ReplaceADDiuSLLWithLUi(InstSeq &Seq);
MipsSEInstrInfo.cpp 288 const MipsAnalyzeImmediate::InstSeq &Seq =
290 MipsAnalyzeImmediate::InstSeq::const_iterator Inst = Seq.begin();
292 assert(Seq.size() && (!LastInstrIsADDiu || (Seq.size() > 1)));
305 // Build the remaining instructions in Seq.
306 for (++Inst; Inst != Seq.end() - LastInstrIsADDiu; ++Inst)
MipsSEISelDAGToDAG.cpp 398 const MipsAnalyzeImmediate::InstSeq &Seq =
401 MipsAnalyzeImmediate::InstSeq::const_iterator Inst = Seq.begin();
419 for (++Inst; Inst != Seq.end(); ++Inst) {
  /external/llvm/utils/lit/lit/
ShUtil.py 4 from ShCommands import Command, Pipeline, Seq
240 lhs = Seq(lhs, operator[0], self.parse_pipeline())
319 Seq(Pipeline([Command(['a'], [])], False),
324 Seq(Pipeline([Command(['a'], [])], False),
329 Seq(Pipeline([Command(['a'], [])], False),
334 Seq(Pipeline([Command(['a'], [])], False),
339 Seq(Seq(Pipeline([Command(['a'], [])], False),
346 Seq(Pipeline([Command(['a'], [])], False),
ShCommands.py 65 class Seq:
73 return 'Seq(%r, %r, %r)' % (self.lhs, self.op, self.rhs)
76 if not isinstance(other, Seq):
TestRunner.py 46 if isinstance(cmd, ShUtil.Seq):
254 cmd = ShUtil.Seq(cmd, '&&', c)
  /external/llvm/lib/Transforms/ObjCARC/
ObjCARCOpts.cpp 439 Sequence Seq : 8;
448 Seq(S_None) {}
463 Seq = NewSeq;
467 return Seq;
475 Seq = NewSeq;
486 Seq = MergeSeqs(Seq, Other.Seq, TopDown);
491 Seq = S_None;
494 if (Seq == S_None)
    [all...]
  /external/v8/tools/gcmole/
gcmole.cc 677 return Seq(expr, 2, exprs, env);
728 return Seq(expr, expr->getNumInits(), expr->getInits(), env);
790 ExprEffect Seq(clang::Stmt* parent,
971 void Seq(clang::Stmt* a, clang::Stmt* b, clang::Stmt* c) {
978 void Seq(clang::Stmt* a, clang::Stmt* b) {
985 Seq(a, b, c);
990 Seq(a, b);
1060 block.Seq(stmt->getCond(), stmt->getBody());
    [all...]
  /external/llvm/include/llvm/Support/
YAMLTraits.h 119 /// static size_t size(IO &io, std::vector<MyType> &seq) {
120 /// return seq.size();
122 /// static MyType& element(IO &, std::vector<MyType> &seq, size_t index) {
123 /// if ( index >= seq.size() )
124 /// seq.resize(index+1);
125 /// return seq[index];
131 // static size_t size(IO &io, T &seq);
132 // static T::value_type& element(IO &io, T &seq, size_t index);
145 // static size_t size(IO &io, T &seq);
146 // static T::value_type& element(IO &io, T &seq, size_t index)
    [all...]
  /external/opencv/cvaux/src/
cvlee.cpp 46 #define NEXT_SEQ(seq,seq_first) ((seq) == (seq_first) ? seq->v_next : seq->h_next)
    [all...]
  /external/clang/lib/Sema/
SemaInit.cpp     [all...]
SemaStmt.cpp     [all...]
SemaExprObjC.cpp 346 InitializationSequence Seq(S, Entity, Kind, &Element, 1);
347 if (!Seq.Failed())
348 return Seq.Perform(S, Entity, Kind, Element);
    [all...]
SemaDeclCXX.cpp     [all...]
  /external/llvm/lib/CodeGen/SelectionDAG/
DAGCombiner.cpp     [all...]

Completed in 489 milliseconds