Go to the documentation of this file.
241 int last = instrCount - 1;
242 Word key = elementIndex;
247 while (first <= last) {
248 middle = (first + last) / 2;
virtual InstructionElement * element(Word index) const
void initInstructionCache() const
virtual void addElement(SectionElement *element)
virtual void setElement(Word index, SectionElement *element)
virtual void setElement(Word index, SectionElement *element)
Word indexOfElement(const InstructionElement &elem) const
std::vector< Word > instructionStartCache_
Cache vector of element indexes of those instruction elements, which begins a new instruction.
#define assert(condition)
SectionElement * element(Word index) const
virtual void addElement(SectionElement *element)
InstructionElement & instruction(Word index) const
bool isInSection(const InstructionElement &elem) const
static void registerSection(const Section *section)
Word instructionCount() const
Word instructionToSectionIndex(Word index) const
virtual Section * clone() const
static CodeSection proto_
Prototype instance of section.
void clearInstructionCache() const
std::map< const InstructionElement *, Word > elementIndexCache_
Cache of indexes of instruction elemenets.
Word indexOfInstruction(const InstructionElement &elem) const
virtual SectionType type() const
Word elementCount() const