Lines Matching refs:Prologue
20 DWARFDebugLine::Prologue::Prologue() {
24 void DWARFDebugLine::Prologue::clear() {
33 void DWARFDebugLine::Prologue::dump(raw_ostream &OS) const {
34 OS << "Line table prologue:\n"
68 bool DWARFDebugLine::Prologue::parse(DataExtractor debug_line_data,
117 fprintf(stderr, "warning: parsing line table prologue at 0x%8.8x should"
177 Prologue.dump(OS);
191 Prologue.clear();
202 Row.reset(LineTable->Prologue.DefaultIsStmt);
254 if (!Prologue.parse(debug_line_data, offset_ptr)) {
260 const uint32_t end_offset = debug_line_offset + Prologue.TotalLength +
261 sizeof(Prologue.TotalLength);
320 // section of the statement program prologue. The index is LEB128(0)
327 // appear; the names in the prologue come before names defined by
336 Prologue.FileNames.push_back(fileEntry);
350 } else if (opcode < Prologue.OpcodeBase) {
362 // min_inst_length field of the prologue, and adds the
365 debug_line_data.getULEB128(offset_ptr) * Prologue.MinInstLength;
411 uint8_t adjust_opcode = 255 - Prologue.OpcodeBase;
413 (adjust_opcode / Prologue.LineRange) * Prologue.MinInstLength;
451 // of such opcodes because they are specified in the prologue
454 assert(opcode - 1U < Prologue.StandardOpcodeLengths.size());
455 uint8_t opcode_length = Prologue.StandardOpcodeLengths[opcode - 1];
495 uint8_t adjust_opcode = opcode - Prologue.OpcodeBase;
497 (adjust_opcode / Prologue.LineRange) * Prologue.MinInstLength;
499 Prologue.LineBase + (adjust_opcode % Prologue.LineRange);
649 if (FileIndex == 0 || FileIndex > Prologue.FileNames.size() ||
652 const FileNameEntry &Entry = Prologue.FileNames[FileIndex - 1];
663 IncludeDirIndex <= Prologue.IncludeDirectories.size()) {
664 const char *IncludeDir = Prologue.IncludeDirectories[IncludeDirIndex - 1];