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

  /external/llvm/include/llvm/MC/
MCModule.h 39 /// \brief Atoms in this module, sorted by begin address.
40 /// FIXME: This doesn't handle overlapping atoms (which happen when a basic
43 AtomListTy Atoms;
49 /// enables the owning MCModule to keep track of its atoms.
67 MCModule() : Atoms() { }
85 const_atom_iterator atom_begin() const { return Atoms.begin(); }
86 atom_iterator atom_begin() { return Atoms.begin(); }
87 const_atom_iterator atom_end() const { return Atoms.end(); }
88 atom_iterator atom_end() { return Atoms.end(); }
  /external/llvm/lib/MC/
MCModule.cpp 26 // Check for atoms already covering this range.
33 Atoms.insert(I, NewAtom);
55 Atoms.erase(I);
60 Atoms.insert(NewI, Atom);
  /external/llvm/lib/CodeGen/AsmPrinter/
DwarfAccelTable.h 117 // is as a list of atoms (atom_count) where each atom contains a type
120 // used to describe the offset for all forms in the list of atoms.
126 // atom_count Atoms
169 SmallVector<Atom, 1> Atoms;
172 : die_offset_base(offset), Atoms(AtomList.begin(), AtomList.end()) { }
177 for (size_t i = 0; i < Atoms.size(); i++)
178 Atoms[i].print(O);
DwarfAccelTable.cpp 126 Asm->EmitInt32(HeaderData.Atoms.size());
127 for (size_t i = 0; i < HeaderData.Atoms.size(); i++) {
128 Atom A = HeaderData.Atoms[i];
201 // If we have multiple Atoms emit that info too.
203 if (HeaderData.Atoms.size() > 1) {
DwarfDebug.cpp     [all...]

Completed in 243 milliseconds