HomeSort by: relevance | last modified time | path
    Searched refs:Seq (Results 1 - 25 of 34) sorted by relevancy

1 2

  /src/external/apache2/llvm/dist/llvm/lib/Target/Mips/
MipsAnalyzeImmediate.cpp 89 void MipsAnalyzeImmediate::ReplaceADDiuSLLWithLUi(InstSeq &Seq) {
92 if ((Seq.size() < 2) || (Seq[0].Opc != ADDiu) ||
93 (Seq[1].Opc != SLL) || (Seq[1].ImmOpnd < 16))
97 int64_t Imm = SignExtend64<16>(Seq[0].ImmOpnd);
98 int64_t ShiftedImm = (uint64_t)Imm << (Seq[1].ImmOpnd - 16);
104 Seq[0].Opc = LUi;
105 Seq[0].ImmOpnd = (unsigned)(ShiftedImm & 0xffff);
106 Seq.erase(Seq.begin() + 1)
    [all...]
MipsAnalyzeImmediate.h 53 void ReplaceADDiuSLLWithLUi(InstSeq &Seq);
MipsSEInstrInfo.cpp 631 const MipsAnalyzeImmediate::InstSeq &Seq =
633 MipsAnalyzeImmediate::InstSeq::const_iterator Inst = Seq.begin();
635 assert(Seq.size() && (!LastInstrIsADDiu || (Seq.size() > 1)));
648 // Build the remaining instructions in Seq.
649 for (++Inst; Inst != Seq.end() - LastInstrIsADDiu; ++Inst)
  /src/external/apache2/llvm/dist/llvm/utils/lit/tests/unit/
ShUtil.py 5 from lit.ShUtil import Command, Pipeline, Seq, ShLexer, ShParser
79 Seq(Pipeline([Command(['a'], [])], False),
84 Seq(Pipeline([Command(['a'], [])], False),
89 Seq(Pipeline([Command(['a'], [])], False),
94 Seq(Pipeline([Command(['a'], [])], False),
99 Seq(Seq(Pipeline([Command(['a'], [])], False),
106 Seq(Pipeline([Command(['a'], [])], False),
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/ObjCARC/
PtrState.h 111 unsigned char Seq : 8;
116 PtrState() : Seq(S_None) {}
150 Sequence GetSeq() const { return static_cast<Sequence>(Seq); }
PtrState.cpp 137 Seq = NewSeq;
148 Seq = MergeSeqs(GetSeq(), Other.GetSeq(), TopDown);
152 if (Seq == S_None) {
236 LLVM_DEBUG(dbgs() << " CanAlterRefCount: Seq: " << S << "; "
293 LLVM_DEBUG(dbgs() << " CanUse: Seq: " << GetSeq() << "; "
298 LLVM_DEBUG(dbgs() << " ReleaseUse: Seq: " << GetSeq() << "; "
306 LLVM_DEBUG(dbgs() << " PreciseStopUse: Seq: " << GetSeq()
386 LLVM_DEBUG(dbgs() << " CanAlterRefCount: Seq: " << GetSeq() << "; "
424 LLVM_DEBUG(dbgs() << " CanUse: Seq: " << GetSeq() << "; "
ObjCARCOpts.cpp 454 << " Seq: "
474 << " Seq: "
1285 const Sequence Seq = I->second.GetSeq();
1288 if (Seq == S_None)
1293 assert((Seq == S_Retain || Seq == S_CanRelease || Seq == S_Use) &&
1324 // *NOTE* We do not use Seq from above here since we are allowing for
  /src/external/apache2/llvm/dist/clang/lib/Analysis/
CloneDetection.cpp 99 static bool containsAnyInGroup(StmtSequence &Seq,
102 if (Seq.contains(GroupSeq))
420 const StmtSequence &Seq, std::size_t Limit,
422 if (Seq.empty())
427 ASTContext &Context = Seq.getASTContext();
431 data_collection::getMacroStack(Seq.getBeginLoc(), Context);
447 if (Seq.holdsSequence()) {
448 for (const Stmt *S : Seq) {
450 StmtSequence(S, Seq.getContainingDecl()), Limit, MacroStack);
455 for (const Stmt *S : Seq.front()->children())
    [all...]
  /src/external/apache2/llvm/dist/llvm/tools/llvm-mca/Views/
BottleneckAnalysis.cpp 264 SmallVectorImpl<const DependencyEdge *> &Seq) const {
278 Seq.resize(Nodes[IID].Depth);
279 for (unsigned I = Seq.size(), E = 0; I > E; --I) {
281 Seq[I - 1] = &N.CriticalPredecessor;
302 SmallVector<const DependencyEdge *, 16> Seq;
303 DG.getCriticalSequence(Seq);
304 if (Seq.empty())
309 const DependencyEdge &FirstEdge = *Seq[0];
340 for (const DependencyEdge *&DE : Seq) {
BottleneckAnalysis.h 278 void getCriticalSequence(SmallVectorImpl<const DependencyEdge *> &Seq) const;
  /src/external/apache2/llvm/dist/llvm/utils/lit/lit/
ShCommands.py 88 class Seq:
96 return 'Seq(%r, %r, %r)' % (self.lhs, self.op, self.rhs)
99 if not isinstance(other, Seq):
ShUtil.py 5 from lit.ShCommands import Command, GlobItem, Pipeline, Seq
262 lhs = Seq(lhs, operator[0], self.parse_pipeline())
  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
HexagonGenInsert.cpp 394 assert(Idx < Seq.size());
395 return Seq[Idx];
399 return Seq.size();
405 iterator begin() { return Seq.begin(); }
406 iterator end() { return Seq.end(); }
407 const_iterator begin() const { return Seq.begin(); }
408 const_iterator end() const { return Seq.end(); }
414 ListType Seq;
444 iterator L = llvm::lower_bound(Seq, VR, Ord);
445 if (L == Seq.end()
    [all...]
HexagonConstExtenders.cpp 141 void order(SmallVectorImpl<Node*> &Seq) const {
142 order(Root, Seq);
159 void order(Node *N, SmallVectorImpl<Node*> &Seq) const;
161 SmallVectorImpl<Node*> &Seq) const;
601 void RangeTree::order(Node *N, SmallVectorImpl<Node*> &Seq) const {
604 order(N->Left, Seq);
605 Seq.push_back(N);
606 order(N->Right, Seq);
610 SmallVectorImpl<Node*> &Seq) const {
613 nodesWith(N->Left, P, CheckA, Seq);
    [all...]
  /src/external/apache2/llvm/dist/llvm/utils/TableGen/
CodeGenSchedule.cpp 569 RecVec Seq = RWDef->getValueAsListOfDefs("Writes");
570 for (Record *WSRec : Seq)
709 std::string CodeGenSchedModels::genRWName(ArrayRef<unsigned> Seq, bool IsRead) {
712 for (unsigned I : Seq) {
830 unsigned CodeGenSchedModels::findRWForSequence(ArrayRef<unsigned> Seq,
834 auto I = find_if(RWVec, [Seq](CodeGenSchedRW &RW) {
835 return makeArrayRef(RW.Sequence) == Seq;
842 unsigned CodeGenSchedModels::findOrInsertRW(ArrayRef<unsigned> Seq,
844 assert(!Seq.empty() && "cannot insert empty sequence");
845 if (Seq.size() == 1
    [all...]
CodeGenSchedule.h 75 CodeGenSchedRW(unsigned Idx, bool Read, ArrayRef<unsigned> Seq,
78 HasVariants(false), IsVariadic(false), IsSequence(true), Sequence(Seq) {
572 unsigned findOrInsertRW(ArrayRef<unsigned> Seq, bool IsRead);
588 std::string genRWName(ArrayRef<unsigned> Seq, bool IsRead);
589 unsigned findRWForSequence(ArrayRef<unsigned> Seq, bool IsRead);
  /src/external/apache2/llvm/dist/llvm/lib/DWARFLinker/
DWARFLinker.cpp 1595 /// Insert the new line info sequence \p Seq into the current
1597 static void insertLineSequence(std::vector<DWARFDebugLine::Row> &Seq,
1599 if (Seq.empty())
1602 if (!Rows.empty() && Rows.back().Address < Seq.front().Address) {
1603 llvm::append_range(Rows, Seq);
1604 Seq.clear();
1608 object::SectionedAddress Front = Seq.front().Address;
1618 *InsertPoint = Seq.front();
1619 Rows.insert(InsertPoint + 1, Seq.begin() + 1, Seq.end())
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/DWARF/
DWARFDebugLine.cpp 1214 const DWARFDebugLine::Sequence &Seq,
1216 if (!Seq.containsPC(Address))
1218 assert(Seq.SectionIndex == Address.SectionIndex);
1226 RowIter FirstRow = Rows.begin() + Seq.FirstRowIndex;
1227 RowIter LastRow = Rows.begin() + Seq.LastRowIndex;
1233 assert(Seq.SectionIndex == RowPos->Address.SectionIndex);
  /src/external/apache2/llvm/dist/llvm/lib/TextAPI/
TextStub.cpp 1081 static size_t size(IO &IO, std::vector<const MachO::InterfaceFile *> &Seq) {
1082 return Seq.size();
1085 element(IO &IO, std::vector<const InterfaceFile *> &Seq, size_t Index) {
1086 if (Index >= Seq.size())
1087 Seq.resize(Index + 1);
1088 return Seq[Index];
  /src/external/apache2/llvm/dist/clang/include/clang/Analysis/
CloneDetection.h 294 size_t calculateStmtComplexity(const StmtSequence &Seq, std::size_t Limit,
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/
meta.d 1326 private template isLessEq(alias cmp, Seq...)
1327 if (Seq.length == 2)
1329 private enum Result = cmp!(Seq[1], Seq[0]);
1345 * Seq = The $(LREF AliasSeq) to check
1347 * Returns: `true` if `Seq` is sorted; otherwise `false`
  /src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/DWARF/
DWARFDebugLine.h 297 uint32_t findRowInSeq(const DWARFDebugLine::Sequence &Seq,
  /src/external/apache2/llvm/dist/clang/lib/Format/
Format.cpp 775 static size_t size(IO &IO, std::vector<FormatStyle> &Seq) {
776 return Seq.size();
778 static FormatStyle &element(IO &IO, std::vector<FormatStyle> &Seq,
780 if (Index >= Seq.size()) {
781 assert(Index == Seq.size());
783 if (!Seq.empty() && Seq[0].Language == FormatStyle::LK_None) {
784 Template = Seq[0];
789 Seq.resize(Index + 1, Template);
791 return Seq[Index]
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/RISCV/
RISCVInstrInfo.cpp 442 RISCVMatInt::InstSeq Seq = RISCVMatInt::generateInstSeq(Val, IsRV64);
443 assert(Seq.size() > 0);
445 for (RISCVMatInt::Inst &Inst : Seq) {
446 // Write the final result to DstReg if it's the last instruction in the Seq.
448 if (++Num == Seq.size())
  /src/external/gpl3/gcc.old/dist/libphobos/libdruntime/core/
demangle.d 2645 template Seq(T...){ alias Seq = T; }
2648 alias staticIota = Seq!();
2650 alias staticIota = Seq!(staticIota!(x - 1), x - 1);

Completed in 115 milliseconds

1 2