| ... | @@ -653,12 +653,17 @@ pub fn abiAndDynamicLinkerFromFile( | ... | @@ -653,12 +653,17 @@ pub fn abiAndDynamicLinkerFromFile( |
| 653 | } else null; | 653 | } else null; |
| 654 | | 654 | |
| 655 | if (dynstr) |ds| { | 655 | if (dynstr) |ds| { |
| 656 | const strtab_len = std.math.min(ds.size, strtab_buf.len); | | |
| 657 | const strtab_read_len = try preadMin(file, &strtab_buf, ds.offset, strtab_len); | | |
| 658 | const strtab = strtab_buf[0..strtab_read_len]; | | |
| 659 | // TODO this pointer cast should not be necessary | 656 | // TODO this pointer cast should not be necessary |
| 660 | const rpoff_usize = std.math.cast(usize, rpoff) orelse return error.InvalidElfFile; | 657 | const rpoff_usize = std.math.cast(usize, rpoff) orelse return error.InvalidElfFile; |
| 661 | const rpath_list = mem.sliceTo(std.meta.assumeSentinel(strtab[rpoff_usize..].ptr, 0), 0); | 658 | if (rpoff_usize > ds.size) return error.InvalidElfFile; |
| | 659 | const rpoff_file = ds.offset + rpoff_usize; |
| | 660 | const rp_max_size = ds.size - rpoff_usize; |
| | 661 | |
| | 662 | const strtab_len = std.math.min(rp_max_size, strtab_buf.len); |
| | 663 | const strtab_read_len = try preadMin(file, &strtab_buf, rpoff_file, strtab_len); |
| | 664 | const strtab = strtab_buf[0..strtab_read_len]; |
| | 665 | |
| | 666 | const rpath_list = mem.sliceTo(std.meta.assumeSentinel(strtab.ptr, 0), 0); |
| 662 | var it = mem.tokenize(u8, rpath_list, ":"); | 667 | var it = mem.tokenize(u8, rpath_list, ":"); |
| 663 | while (it.next()) |rpath| { | 668 | while (it.next()) |rpath| { |
| 664 | var dir = fs.cwd().openDir(rpath, .{}) catch |err| switch (err) { | 669 | var dir = fs.cwd().openDir(rpath, .{}) catch |err| switch (err) { |