mirror of
https://codeberg.org/ziglang/zig.git
synced 2025-12-06 05:44:20 +00:00
std.debug.Coverage.resolveAddressesDwarf: assert sorted
This commit is contained in:
parent
022bca9b06
commit
a726e09389
2 changed files with 6 additions and 0 deletions
|
|
@ -145,6 +145,7 @@ pub const ResolveAddressesDwarfError = Dwarf.ScanError;
|
|||
pub fn resolveAddressesDwarf(
|
||||
cov: *Coverage,
|
||||
gpa: Allocator,
|
||||
/// Asserts the addresses are in ascending order.
|
||||
sorted_pc_addrs: []const u64,
|
||||
/// Asserts its length equals length of `sorted_pc_addrs`.
|
||||
output: []SourceLocation,
|
||||
|
|
@ -156,11 +157,15 @@ pub fn resolveAddressesDwarf(
|
|||
var range_i: usize = 0;
|
||||
var range: *std.debug.Dwarf.Range = &d.ranges.items[0];
|
||||
var line_table_i: usize = undefined;
|
||||
var prev_pc: u64 = 0;
|
||||
var prev_cu: ?*std.debug.Dwarf.CompileUnit = null;
|
||||
// Protects directories and files tables from other threads.
|
||||
cov.mutex.lock();
|
||||
defer cov.mutex.unlock();
|
||||
next_pc: for (sorted_pc_addrs, output) |pc, *out| {
|
||||
assert(pc >= prev_pc);
|
||||
prev_pc = pc;
|
||||
|
||||
while (pc >= range.end) {
|
||||
range_i += 1;
|
||||
if (range_i >= d.ranges.items.len) {
|
||||
|
|
|
|||
|
|
@ -51,6 +51,7 @@ pub const ResolveAddressesError = Coverage.ResolveAddressesDwarfError;
|
|||
pub fn resolveAddresses(
|
||||
info: *Info,
|
||||
gpa: Allocator,
|
||||
/// Asserts the addresses are in ascending order.
|
||||
sorted_pc_addrs: []const u64,
|
||||
/// Asserts its length equals length of `sorted_pc_addrs`.
|
||||
output: []SourceLocation,
|
||||
|
|
|
|||
Loading…
Add table
Reference in a new issue