HomeSort by relevance Sort by last modified time
    Searched refs:Pos (Results 1 - 25 of 172) sorted by null

1 2 3 4 5 6 7

  /external/llvm/lib/CodeGen/
AllocationOrder.h 32 int Pos;
51 if (Pos < 0)
52 return Hints.end()[Pos++];
55 while (Pos < int(Limit)) {
56 unsigned Reg = Order[Pos++];
68 if (Pos < 0)
69 return Hints.end()[Pos++];
70 if (Pos < int(Limit))
71 return Order[Pos++];
76 void rewind() { Pos = -int(Hints.size());
    [all...]
AllocationOrder.cpp 34 : Pos(0) {
  /external/llvm/lib/Support/
LineIterator.cpp 54 const char *Pos = CurrentLine.end();
55 assert(Pos == Buffer->getBufferStart() || isAtLineEnd(Pos) || *Pos == '\0');
57 if (skipIfAtLineEnd(Pos))
59 if (!SkipBlanks && isAtLineEnd(Pos)) {
63 while (skipIfAtLineEnd(Pos))
68 if (isAtLineEnd(Pos) && !SkipBlanks)
70 if (*Pos == CommentMarker)
72 ++Pos;
    [all...]
FileUtilities.cpp 49 static const char *BackupNumber(const char *Pos, const char *FirstChar) {
51 if (!isNumberChar(*Pos)) return Pos;
55 while (Pos > FirstChar && isNumberChar(Pos[-1])) {
57 if (Pos[-1] == '.') {
63 --Pos;
64 if (Pos > FirstChar && isSignedChar(Pos[0]) && !isExponentChar(Pos[-1])
    [all...]
FoldingSet.cpp 93 unsigned Pos = 0;
99 Pos = (Units + 1) * 4;
107 for (Pos += 4; Pos <= Size; Pos += 4) {
108 unsigned V = ((unsigned char)String[Pos - 4] << 24) |
109 ((unsigned char)String[Pos - 3] << 16) |
110 ((unsigned char)String[Pos - 2] << 8) |
111 (unsigned char)String[Pos - 1];
115 for (Pos += 4; Pos <= Size; Pos += 4)
    [all...]
  /external/llvm/lib/TableGen/
TableGenBackend.cpp 24 size_t Pos = (size_t)OS.tell();
28 for (size_t i = (size_t)OS.tell() - Pos, e = MAX_LINE_LEN - Suffix.size();
41 size_t Pos = 0U;
43 size_t Length = std::min(Desc.size() - Pos, MAX_LINE_LEN - PSLen);
44 printLine(OS, Prefix + Desc.substr(Pos, Length), ' ', Suffix);
45 Pos += Length;
46 } while (Pos < Desc.size());
  /external/clang/lib/Frontend/
LayoutOverrideSource.cpp 61 StringRef::size_type Pos;
62 if ((Pos = LineStr.find("struct ")) != StringRef::npos)
63 LineStr = LineStr.substr(Pos + strlen("struct "));
64 else if ((Pos = LineStr.find("class ")) != StringRef::npos)
65 LineStr = LineStr.substr(Pos + strlen("class "));
66 else if ((Pos = LineStr.find("union ")) != StringRef::npos)
67 LineStr = LineStr.substr(Pos + strlen("union "));
78 StringRef::size_type Pos = LineStr.find(" Size:");
79 if (Pos != StringRef::npos) {
81 LineStr = LineStr.substr(Pos + strlen(" Size:"))
    [all...]
  /external/llvm/lib/Fuzzer/
FuzzerUtil.cpp 112 for (size_t Pos = L; Pos <= R; Pos++) {
113 uint8_t V = (uint8_t)Str[Pos];
117 if (Pos + 1 <= R && (Str[Pos + 1] == '\\' || Str[Pos + 1] == '"')) {
118 U->push_back(Str[Pos + 1]);
119 Pos++;
123 if (Pos + 3 <= R && Str[Pos + 1] == 'x
    [all...]
FuzzerTraceState.cpp 166 // For now, very simple: put Size bytes of Data at position Pos.
168 size_t Pos;
232 Printf("TBM %zd %zd %zd\n", M.Pos, M.Size, M.Data);
233 if (M.Pos + M.Size > U->size()) return;
234 memcpy(U->data() + M.Pos, &M.Data, M.Size);
250 for (size_t Pos = LR.Beg; Pos + CmpSize <= LR.End; Pos++) {
251 Mutations.push_back({Pos, CmpSize, Data});
252 Mutations.push_back({Pos, CmpSize, Data + 1})
    [all...]
  /external/clang/lib/Tooling/
ArgumentsAdjusters.cpp 55 ArgumentInsertPosition Pos) {
56 return [Extra, Pos](const CommandLineArguments &Args, StringRef /*unused*/) {
60 if (Pos == ArgumentInsertPosition::END) {
73 ArgumentInsertPosition Pos) {
74 return getInsertArgumentAdjuster(CommandLineArguments(1, Extra), Pos);
  /external/clang/unittests/Rewrite/
RewriteBufferTest.cpp 36 size_t Pos = Input.find(RemoveStr);
37 Buf.RemoveText(Pos, RemoveStr.size());
40 Pos = Input.find(TagStr);
41 tagRange(Pos, TagStr.size(), "outer", Buf);
42 tagRange(Pos, TagStr.size(), "inner", Buf);
  /external/icu/icu4c/source/common/
ruleiter.h 46 ParsePosition& pos; member in class:RuleCharacterIterator
97 * @param pos upon input, the index of the next character to return. If a
98 * variable has been dereferenced, then pos will <em>not</em> increment as
102 ParsePosition& pos);
133 struct Pos : public UMemory {
136 int32_t pos; member in struct:RuleCharacterIterator::Pos
146 * RuleCharacterIterator::Pos pos;
147 * iterator.getPos(pos);
149 * iterator.getPos(pos);
    [all...]
  /external/clang/include/clang/Tooling/
ArgumentsAdjusters.h 52 ArgumentInsertPosition Pos);
58 ArgumentInsertPosition Pos = ArgumentInsertPosition::END);
  /external/llvm/include/llvm/LineEditor/
LineEditor.h 102 /// \param Pos The zero-based cursor position in the StringRef
103 CompletionAction getCompletionAction(StringRef Buffer, size_t Pos) const;
118 virtual CompletionAction complete(StringRef Buffer, size_t Pos) const = 0;
123 CompletionAction complete(StringRef Buffer, size_t Pos) const override;
126 size_t Pos) const = 0;
132 CompletionAction complete(StringRef Buffer, size_t Pos) const override {
133 return Value(Buffer, Pos);
142 size_t Pos) const override {
143 return Value(Buffer, Pos);
  /external/llvm/lib/MC/
StringTableBuilder.cpp 23 // Returns the character at Pos from end of a string.
24 static int charTailAt(StringPair *P, size_t Pos) {
26 if (Pos >= S.size())
28 return (unsigned char)S[S.size() - Pos - 1];
33 static void multikey_qsort(StringPair **Begin, StringPair **End, int Pos) {
40 int Pivot = charTailAt(*Begin, Pos);
44 int C = charTailAt(*R, Pos);
53 multikey_qsort(Begin, P, Pos);
54 multikey_qsort(Q, End, Pos);
56 // qsort(P, Q, Pos + 1), but with tail call optimization
    [all...]
  /external/llvm/include/llvm/ADT/
MapVector.h 87 typename MapType::const_iterator Pos = Map.find(Key);
88 return Pos == Map.end()? ValueT() : Vector[Pos->second].second;
104 typename MapType::const_iterator Pos = Map.find(Key);
105 return Pos == Map.end()? 0 : 1;
109 typename MapType::const_iterator Pos = Map.find(Key);
110 return Pos == Map.end()? Vector.end() :
111 (Vector.begin() + Pos->second);
115 typename MapType::const_iterator Pos = Map.find(Key);
116 return Pos == Map.end()? Vector.end()
    [all...]
  /external/llvm/lib/DebugInfo/DWARF/
DWARFDebugAbbrev.cpp 108 const auto Pos = AbbrDeclSets.find(CUAbbrOffset);
109 if (Pos != End) {
110 PrevAbbrOffsetPos = Pos;
111 return &(Pos->second);
  /external/llvm/include/llvm/Support/
StreamingMemoryObject.h 64 // Fetch enough bytes such that Pos can be read (i.e. BytesRead >
65 // Pos). Returns true if Pos can be read. Unlike most of the
70 bool fetchToPos(size_t Pos) const {
71 while (Pos >= BytesRead) {
84 return !ObjectSize || Pos < ObjectSize;
  /external/clang/lib/AST/
CommentParser.cpp 51 Position Pos;
54 return Pos.CurToken >= Toks.size();
60 const Token &Tok = Toks[Pos.CurToken];
62 Pos.BufferStart = Tok.getText().begin();
63 Pos.BufferEnd = Tok.getText().end();
64 Pos.BufferPtr = Pos.BufferStart;
65 Pos.BufferStartLoc = Tok.getLocation();
69 const unsigned CharNo = Pos.BufferPtr - Pos.BufferStart
    [all...]
  /external/llvm/lib/Target/ARM/MCTargetDesc/
ARMUnwindOpAsm.cpp 30 size_t Pos;
33 UnwindOpcodeStreamer(SmallVectorImpl<uint8_t> &V) : Vec(V), Pos(3) {
38 Vec[Pos] = elem;
39 Pos = (((Pos ^ 0x3u) + 1) ^ 0x3u);
59 while (Pos < Vec.size())
  /external/llvm/lib/Target/Mips/
MipsLongBranch.cpp 253 MachineBasicBlock::iterator Pos;
293 Pos = LongBrMBB->begin();
295 BuildMI(*LongBrMBB, Pos, DL, TII->get(Mips::ADDiu), Mips::SP)
297 BuildMI(*LongBrMBB, Pos, DL, TII->get(Mips::SW)).addReg(Mips::RA)
316 BuildMI(*LongBrMBB, Pos, DL, TII->get(Mips::LONG_BRANCH_LUi), Mips::AT)
318 MIBundleBuilder(*LongBrMBB, Pos)
325 Pos = BalTgtMBB->begin();
327 BuildMI(*BalTgtMBB, Pos, DL, TII->get(Mips::ADDu), Mips::AT)
329 BuildMI(*BalTgtMBB, Pos, DL, TII->get(Mips::LW), Mips::RA)
333 MIBundleBuilder(*BalTgtMBB, Pos)
    [all...]
  /external/clang/lib/Tooling/Core/
Lookup.cpp 103 auto Pos = ReplacementString.rfind("::");
104 return Pos != StringRef::npos ? ReplacementString.substr(Pos + 2)
  /external/llvm/include/llvm/CodeGen/
StackMaps.h 56 unsigned getMetaIdx(unsigned Pos = 0) const {
57 assert(Pos < MetaEnd && "Meta operand index out of range.");
58 return (HasDef ? 1 : 0) + Pos;
61 const MachineOperand &getMetaOper(unsigned Pos) {
62 return MI->getOperand(getMetaIdx(Pos));
  /external/lzma/Java/SevenZip/
LzmaBench.java 59 int Pos;
69 Pos = 0;
90 while (Pos < BufferSize)
92 if (GetRndBit() == 0 || Pos < 1)
93 Buffer[Pos++] = (byte)(RG.GetRnd(8));
103 while (Rep0 >= Pos);
107 for (int i = 0; i < len && Pos < BufferSize; i++, Pos++)
108 Buffer[Pos] = Buffer[Pos - Rep0];
    [all...]
  /external/clang/include/clang/Sema/
IdentifierResolver.h 55 void InsertDecl(DeclsTy::iterator Pos, NamedDecl *D) {
56 Decls.insert(Pos, D);
171 void InsertDeclAfter(iterator Pos, NamedDecl *D);

Completed in 791 milliseconds

1 2 3 4 5 6 7