Lines Matching defs:Prologue
20 DWARFDebugLine::Prologue::Prologue() { clear(); }
22 void DWARFDebugLine::Prologue::clear() {
32 void DWARFDebugLine::Prologue::dump(raw_ostream &OS) const {
33 OS << "Line table prologue:\n"
67 bool DWARFDebugLine::Prologue::parse(DataExtractor debug_line_data,
123 fprintf(stderr, "warning: parsing line table prologue at 0x%8.8" PRIx64
176 Prologue.dump(OS);
190 Prologue.clear();
201 Row.reset(LineTable->Prologue.DefaultIsStmt);
253 if (!Prologue.parse(debug_line_data, offset_ptr)) {
260 debug_line_offset + Prologue.TotalLength + Prologue.sizeofTotalLength();
319 // section of the statement program prologue. The index is LEB128(0)
326 // appear; the names in the prologue come before names defined by
335 Prologue.FileNames.push_back(fileEntry);
349 } else if (opcode < Prologue.OpcodeBase) {
361 // min_inst_length field of the prologue, and adds the
364 debug_line_data.getULEB128(offset_ptr) * Prologue.MinInstLength;
410 uint8_t adjust_opcode = 255 - Prologue.OpcodeBase;
412 (adjust_opcode / Prologue.LineRange) * Prologue.MinInstLength;
450 // of such opcodes because they are specified in the prologue
453 assert(opcode - 1U < Prologue.StandardOpcodeLengths.size());
454 uint8_t opcode_length = Prologue.StandardOpcodeLengths[opcode - 1];
494 uint8_t adjust_opcode = opcode - Prologue.OpcodeBase;
496 (adjust_opcode / Prologue.LineRange) * Prologue.MinInstLength;
498 Prologue.LineBase + (adjust_opcode % Prologue.LineRange);
631 if (FileIndex == 0 || FileIndex > Prologue.FileNames.size() ||
634 const FileNameEntry &Entry = Prologue.FileNames[FileIndex - 1];
647 IncludeDirIndex <= Prologue.IncludeDirectories.size())
648 IncludeDir = Prologue.IncludeDirectories[IncludeDirIndex - 1];
