HomeSort by: relevance | last modified time | path
    Searched defs:Front (Results 1 - 11 of 11) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/tools/llvm-pdbutil/
FormatUtil.cpp 37 StringRef Front = S.take_front(FinalLen / 2);
38 StringRef Back = S.take_back(Front.size());
39 return std::string(Front) + std::string("...") + std::string(Back);
  /src/external/gpl3/gcc/dist/libsanitizer/tsan/
tsan_ilist.h 52 Elem* Front();
55 // Prev links point towards front of the queue.
120 Elem* e = Front();
135 Elem* IList<Base, Node, Elem>::Front() {
  /src/external/gpl3/gcc.old/dist/libsanitizer/tsan/
tsan_ilist.h 52 Elem* Front();
55 // Prev links point towards front of the queue.
120 Elem* e = Front();
135 Elem* IList<Base, Node, Elem>::Front() {
  /src/external/apache2/llvm/dist/clang/lib/DirectoryWatcher/linux/
DirectoryWatcher-linux.cpp 106 DirectoryWatcher::Event Front = Events.front();
108 return Front;
  /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/Symbolize/
Symbolize.cpp 628 char Front = SymbolName.empty() ? '\0' : SymbolName[0];
629 if (Front == '_' || Front == '@')
633 if (Front != '?') {
664 if (!Name.empty() && Name.front() == '?') {
  /src/external/apache2/llvm/dist/llvm/lib/Target/ARM/
A15SDOptimizer.cpp 178 SmallVector<MachineInstr *, 8> Front;
182 Front.push_back(MI);
184 while (Front.size() != 0) {
185 MI = Front.back();
186 Front.pop_back();
359 SmallVector<MachineInstr *, 8> Front;
360 Front.push_back(MI);
361 while (Front.size() != 0) {
362 MI = Front.pop_back_val();
377 Front.push_back(NewMI)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/AsmPrinter/
DwarfCompileUnit.cpp 598 DD->getSectionLabel(&Ranges.front().Begin->getSection()) ==
599 Ranges.front().Begin))) {
600 const RangeSpan &Front = Ranges.front();
602 attachLowHighPC(Die, Front.Begin, Back.End);
1546 // Maintain order by iterating backwards and inserting to the front of CU
  /src/external/apache2/llvm/dist/llvm/lib/DWARFLinker/
DWARFLinker.cpp 1563 const DWARFDebugRangeList::RangeListEntry &First = Entries.front();
1602 if (!Rows.empty() && Rows.back().Address < Seq.front().Address) {
1608 object::SectionedAddress Front = Seq.front().Address;
1610 Rows, [=](const DWARFDebugLine::Row &O) { return O.Address < Front; });
1616 if (InsertPoint != Rows.end() && InsertPoint->Address == Front &&
1618 *InsertPoint = Seq.front();
  /src/external/apache2/llvm/dist/llvm/lib/Demangle/
MicrosoftDemangle.cpp 33 return !S.empty() && std::isdigit(S.front());
88 switch (MangledName.front()) {
182 switch (S.front()) {
198 switch (S.front()) {
282 char Front = MangledName.popFront();
283 if (Front != '6' && Front != '7') {
708 switch (MangledName.front()) {
1275 // This function uses goto, so declare all variables up front.
1722 assert(MangledName.front() >= '0' && MangledName.front() <= '4')
    [all...]
  /src/external/apache2/llvm/dist/llvm/utils/TableGen/
GlobalISelEmitter.cpp 734 std::unique_ptr<PredicateMatcher> P = std::move(Conditions.front());
741 return *Conditions.front();
987 InstructionMatcher &insnmatchers_front() const { return *Matchers.front(); }
1033 std::unique_ptr<PredicateTy> Front = std::move(Predicates.front());
1036 return Front;
2413 return Matchers.front()->getOpcode();
2417 return Matchers.front()->getNumOperands();
2421 InstructionMatcher &InsnMatcher = *Matchers.front();
3350 Matchers.front()->emitPredicateOpcodes(Table, *this)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/IR/
AsmWriter.cpp 2836 StringRef Front;
2837 std::tie(Front, Asm) = Asm.split('\n');
2842 printEscapedString(Front, Out);
4010 // Special case conditional branches to swizzle the condition out to the front

Completed in 83 milliseconds