Zig 0.17.0-dev (Split by item) This is an example of documentation generated by
ZigDoc , an alternative to Zig's built-in
Auto Doc feature. See also
examples in other modes/formats . The project being documented here (as the example) is the Zig standard library.
std › debug › Dwarf › populateRanges Public Function populateRanges Doc Source Public Function std.debug.Dwarf.populateRanges
pub fn populateRanges (d : *Dwarf , gpa : Allocator , endian : Endian ) ScanError !void Params File debug/Dwarf.zig: 666
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698 pub fn populateRanges (d : *Dwarf , gpa : Allocator , endian : Endian ) ScanError !void {
assert (d .ranges .items .len == 0 );
for (d .compile_unit_list .items , 0 ..) |*cu , cu_index | {
if (cu .pc_range ) |range | {
try d .ranges .append (gpa , .{
.start = range .start ,
.end = range .end ,
.compile_unit_index = cu_index ,
});
continue ;
}
const ranges_value = cu .die .getAttr (AT .ranges ) orelse continue ;
var iter = DebugRangeIterator .init (ranges_value , d , endian , cu ) catch continue ;
while (try iter .next ()) |range | {
// Not sure why LLVM thinks it's OK to emit these...
if (range .start == range .end ) continue ;
try d .ranges .append (gpa , .{
.start = range .start ,
.end = range .end ,
.compile_unit_index = cu_index ,
});
}
}
std .mem .sortUnstable (Range , d .ranges .items , {}, struct {
pub fn lessThan (ctx : void , a : Range , b : Range ) bool {
_ = ctx ;
return a .start < b .start ;
}
}.lessThan );
}