| ... | ... | @@ -18,7 +18,6 @@ step: Step, |
| 18 | 18 | source: std.Build.FileSource, |
| 19 | 19 | max_bytes: usize = 20 * 1024 * 1024, |
| 20 | 20 | checks: std.ArrayList(Check), |
| 21 | | dump_symtab: bool = false, |
| 22 | 21 | obj_format: std.Target.ObjectFormat, |
| 23 | 22 | |
| 24 | 23 | pub fn create( |
| ... | ... | @@ -53,84 +52,104 @@ const SearchPhrase = struct { |
| 53 | 52 | } |
| 54 | 53 | }; |
| 55 | 54 | |
| 56 | | /// There two types of actions currently supported: |
| 57 | | /// * `.match` - is the main building block of standard matchers with optional eat-all token `{*}` |
| 58 | | /// and extractors by name such as `{n_value}`. Please note this action is very simplistic in nature |
| 59 | | /// i.e., it won't really handle edge cases/nontrivial examples. But given that we do want to use |
| 60 | | /// it mainly to test the output of our object format parser-dumpers when testing the linkers, etc. |
| 61 | | /// it should be plenty useful in its current form. |
| 62 | | /// * `.compute_cmp` - can be used to perform an operation on the extracted global variables |
| 55 | /// There five types of actions currently supported: |
| 56 | /// .exact - will do an exact match against the haystack |
| 57 | /// .contains - will check for existence within the haystack |
| 58 | /// .not_present - will check for non-existence within the haystack |
| 59 | /// .extract - will do an exact match and extract into a variable enclosed within `{name}` braces |
| 60 | /// .compute_cmp - will perform an operation on the extracted global variables |
| 63 | 61 | /// using the MatchAction. It currently only supports an addition. The operation is required |
| 64 | 62 | /// to be specified in Reverse Polish Notation to ease in operator-precedence parsing (well, |
| 65 | 63 | /// to avoid any parsing really). |
| 66 | 64 | /// For example, if the two extracted values were saved as `vmaddr` and `entryoff` respectively |
| 67 | 65 | /// they could then be added with this simple program `vmaddr entryoff +`. |
| 68 | 66 | const Action = struct { |
| 69 | | tag: enum { match, not_present, compute_cmp }, |
| 67 | tag: enum { exact, contains, not_present, extract, compute_cmp }, |
| 70 | 68 | phrase: SearchPhrase, |
| 71 | 69 | expected: ?ComputeCompareExpected = null, |
| 72 | 70 | |
| 73 | | /// Will return true if the `phrase` was found in the `haystack`. |
| 74 | | /// Some examples include: |
| 75 | | /// |
| 76 | | /// LC 0 => will match in its entirety |
| 77 | | /// vmaddr {vmaddr} => will match `vmaddr` and then extract the following value as u64 |
| 78 | | /// and save under `vmaddr` global name (see `global_vars` param) |
| 79 | | /// name {*}libobjc{*}.dylib => will match `name` followed by a token which contains `libobjc` and `.dylib` |
| 80 | | /// in that order with other letters in between |
| 81 | | fn match( |
| 71 | /// Returns true if the `phrase` is an exact match with the haystack and variable was successfully extracted. |
| 72 | fn extract( |
| 82 | 73 | act: Action, |
| 83 | 74 | b: *std.Build, |
| 84 | 75 | step: *Step, |
| 85 | 76 | haystack: []const u8, |
| 86 | 77 | global_vars: anytype, |
| 87 | 78 | ) !bool { |
| 88 | | assert(act.tag == .match or act.tag == .not_present); |
| 89 | | const phrase = act.phrase.resolve(b, step); |
| 90 | | var candidate_var: ?struct { name: []const u8, value: u64 } = null; |
| 91 | | var hay_it = mem.tokenizeScalar(u8, mem.trim(u8, haystack, " "), ' '); |
| 92 | | var needle_it = mem.tokenizeScalar(u8, mem.trim(u8, phrase, " "), ' '); |
| 79 | assert(act.tag == .extract); |
| 80 | const hay = mem.trim(u8, haystack, " "); |
| 81 | const phrase = mem.trim(u8, act.phrase.resolve(b, step), " "); |
| 82 | |
| 83 | var candidate_vars = std.ArrayList(struct { name: []const u8, value: u64 }).init(b.allocator); |
| 84 | var hay_it = mem.tokenizeScalar(u8, hay, ' '); |
| 85 | var needle_it = mem.tokenizeScalar(u8, phrase, ' '); |
| 93 | 86 | |
| 94 | 87 | while (needle_it.next()) |needle_tok| { |
| 95 | | const hay_tok = hay_it.next() orelse return false; |
| 96 | | |
| 97 | | if (mem.indexOf(u8, needle_tok, "{*}")) |index| { |
| 98 | | // We have fuzzy matchers within the search pattern, so we match substrings. |
| 99 | | var start = index; |
| 100 | | var n_tok = needle_tok; |
| 101 | | var h_tok = hay_tok; |
| 102 | | while (true) { |
| 103 | | n_tok = n_tok[start + 3 ..]; |
| 104 | | const inner = if (mem.indexOf(u8, n_tok, "{*}")) |sub_end| |
| 105 | | n_tok[0..sub_end] |
| 106 | | else |
| 107 | | n_tok; |
| 108 | | if (mem.indexOf(u8, h_tok, inner) == null) return false; |
| 109 | | start = mem.indexOf(u8, n_tok, "{*}") orelse break; |
| 110 | | } |
| 111 | | } else if (mem.startsWith(u8, needle_tok, "{")) { |
| 88 | const hay_tok = hay_it.next() orelse break; |
| 89 | if (mem.startsWith(u8, needle_tok, "{")) { |
| 112 | 90 | const closing_brace = mem.indexOf(u8, needle_tok, "}") orelse return error.MissingClosingBrace; |
| 113 | 91 | if (closing_brace != needle_tok.len - 1) return error.ClosingBraceNotLast; |
| 114 | 92 | |
| 115 | 93 | const name = needle_tok[1..closing_brace]; |
| 116 | 94 | if (name.len == 0) return error.MissingBraceValue; |
| 117 | | const value = try std.fmt.parseInt(u64, hay_tok, 16); |
| 118 | | candidate_var = .{ |
| 95 | const value = std.fmt.parseInt(u64, hay_tok, 16) catch return false; |
| 96 | try candidate_vars.append(.{ |
| 119 | 97 | .name = name, |
| 120 | 98 | .value = value, |
| 121 | | }; |
| 99 | }); |
| 122 | 100 | } else { |
| 123 | 101 | if (!mem.eql(u8, hay_tok, needle_tok)) return false; |
| 124 | 102 | } |
| 125 | 103 | } |
| 126 | 104 | |
| 127 | | if (candidate_var) |v| { |
| 128 | | try global_vars.putNoClobber(v.name, v.value); |
| 129 | | } |
| 105 | if (candidate_vars.items.len == 0) return false; |
| 106 | |
| 107 | for (candidate_vars.items) |cv| try global_vars.putNoClobber(cv.name, cv.value); |
| 130 | 108 | |
| 131 | 109 | return true; |
| 132 | 110 | } |
| 133 | 111 | |
| 112 | /// Returns true if the `phrase` is an exact match with the haystack. |
| 113 | fn exact( |
| 114 | act: Action, |
| 115 | b: *std.Build, |
| 116 | step: *Step, |
| 117 | haystack: []const u8, |
| 118 | ) bool { |
| 119 | assert(act.tag == .exact); |
| 120 | const hay = mem.trim(u8, haystack, " "); |
| 121 | const phrase = mem.trim(u8, act.phrase.resolve(b, step), " "); |
| 122 | return mem.eql(u8, hay, phrase); |
| 123 | } |
| 124 | |
| 125 | /// Returns true if the `phrase` exists within the haystack. |
| 126 | fn contains( |
| 127 | act: Action, |
| 128 | b: *std.Build, |
| 129 | step: *Step, |
| 130 | haystack: []const u8, |
| 131 | ) bool { |
| 132 | assert(act.tag == .contains); |
| 133 | const hay = mem.trim(u8, haystack, " "); |
| 134 | const phrase = mem.trim(u8, act.phrase.resolve(b, step), " "); |
| 135 | return mem.indexOf(u8, hay, phrase) != null; |
| 136 | } |
| 137 | |
| 138 | /// Returns true if the `phrase` does not exist within the haystack. |
| 139 | fn notPresent( |
| 140 | act: Action, |
| 141 | b: *std.Build, |
| 142 | step: *Step, |
| 143 | haystack: []const u8, |
| 144 | ) bool { |
| 145 | assert(act.tag == .not_present); |
| 146 | return !contains(.{ |
| 147 | .tag = .contains, |
| 148 | .phrase = act.phrase, |
| 149 | .expected = act.expected, |
| 150 | }, b, step, haystack); |
| 151 | } |
| 152 | |
| 134 | 153 | /// Will return true if the `phrase` is correctly parsed into an RPN program and |
| 135 | 154 | /// its reduced, computed value compares using `op` with the expected value, either |
| 136 | 155 | /// a literal or another extracted variable. |
| ... | ... | @@ -235,9 +254,23 @@ const Check = struct { |
| 235 | 254 | }; |
| 236 | 255 | } |
| 237 | 256 | |
| 238 | | fn match(self: *Check, phrase: SearchPhrase) void { |
| 257 | fn extract(self: *Check, phrase: SearchPhrase) void { |
| 258 | self.actions.append(.{ |
| 259 | .tag = .extract, |
| 260 | .phrase = phrase, |
| 261 | }) catch @panic("OOM"); |
| 262 | } |
| 263 | |
| 264 | fn exact(self: *Check, phrase: SearchPhrase) void { |
| 239 | 265 | self.actions.append(.{ |
| 240 | | .tag = .match, |
| 266 | .tag = .exact, |
| 267 | .phrase = phrase, |
| 268 | }) catch @panic("OOM"); |
| 269 | } |
| 270 | |
| 271 | fn contains(self: *Check, phrase: SearchPhrase) void { |
| 272 | self.actions.append(.{ |
| 273 | .tag = .contains, |
| 241 | 274 | .phrase = phrase, |
| 242 | 275 | }) catch @panic("OOM"); |
| 243 | 276 | } |
| ... | ... | @@ -258,52 +291,118 @@ const Check = struct { |
| 258 | 291 | } |
| 259 | 292 | }; |
| 260 | 293 | |
| 261 | | /// Creates a new sequence of actions with `phrase` as the first anchor searched phrase. |
| 262 | | pub fn checkStart(self: *CheckObject, phrase: []const u8) void { |
| 294 | /// Creates a new empty sequence of actions. |
| 295 | pub fn checkStart(self: *CheckObject) void { |
| 263 | 296 | var new_check = Check.create(self.step.owner.allocator); |
| 264 | | new_check.match(.{ .string = self.step.owner.dupe(phrase) }); |
| 265 | 297 | self.checks.append(new_check) catch @panic("OOM"); |
| 266 | 298 | } |
| 267 | 299 | |
| 268 | | /// Adds another searched phrase to the latest created Check with `CheckObject.checkStart(...)`. |
| 269 | | /// Asserts at least one check already exists. |
| 270 | | pub fn checkNext(self: *CheckObject, phrase: []const u8) void { |
| 300 | /// Adds an exact match phrase to the latest created Check with `CheckObject.checkStart()`. |
| 301 | pub fn checkExact(self: *CheckObject, phrase: []const u8) void { |
| 302 | self.checkExactInner(phrase, null); |
| 303 | } |
| 304 | |
| 305 | /// Like `checkExact()` but takes an additional argument `FileSource` which will be |
| 306 | /// resolved to a full search query in `make()`. |
| 307 | pub fn checkExactFileSource(self: *CheckObject, phrase: []const u8, file_source: std.Build.FileSource) void { |
| 308 | self.checkExactInner(phrase, file_source); |
| 309 | } |
| 310 | |
| 311 | fn checkExactInner(self: *CheckObject, phrase: []const u8, file_source: ?std.Build.FileSource) void { |
| 271 | 312 | assert(self.checks.items.len > 0); |
| 272 | 313 | const last = &self.checks.items[self.checks.items.len - 1]; |
| 273 | | last.match(.{ .string = self.step.owner.dupe(phrase) }); |
| 314 | last.exact(.{ .string = self.step.owner.dupe(phrase), .file_source = file_source }); |
| 315 | } |
| 316 | |
| 317 | /// Adds a fuzzy match phrase to the latest created Check with `CheckObject.checkStart()`. |
| 318 | pub fn checkContains(self: *CheckObject, phrase: []const u8) void { |
| 319 | self.checkContainsInner(phrase, null); |
| 274 | 320 | } |
| 275 | 321 | |
| 276 | | /// Like `checkNext()` but takes an additional argument `FileSource` which will be |
| 322 | /// Like `checkContains()` but takes an additional argument `FileSource` which will be |
| 277 | 323 | /// resolved to a full search query in `make()`. |
| 278 | | pub fn checkNextFileSource( |
| 279 | | self: *CheckObject, |
| 280 | | phrase: []const u8, |
| 281 | | file_source: std.Build.FileSource, |
| 282 | | ) void { |
| 324 | pub fn checkContainsFileSource(self: *CheckObject, phrase: []const u8, file_source: std.Build.FileSource) void { |
| 325 | self.checkContainsInner(phrase, file_source); |
| 326 | } |
| 327 | |
| 328 | fn checkContainsInner(self: *CheckObject, phrase: []const u8, file_source: ?std.Build.FileSource) void { |
| 329 | assert(self.checks.items.len > 0); |
| 330 | const last = &self.checks.items[self.checks.items.len - 1]; |
| 331 | last.contains(.{ .string = self.step.owner.dupe(phrase), .file_source = file_source }); |
| 332 | } |
| 333 | |
| 334 | /// Adds an exact match phrase with variable extractor to the latest created Check |
| 335 | /// with `CheckObject.checkStart()`. |
| 336 | pub fn checkExtract(self: *CheckObject, phrase: []const u8) void { |
| 337 | self.checkExtractInner(phrase, null); |
| 338 | } |
| 339 | |
| 340 | /// Like `checkExtract()` but takes an additional argument `FileSource` which will be |
| 341 | /// resolved to a full search query in `make()`. |
| 342 | pub fn checkExtractFileSource(self: *CheckObject, phrase: []const u8, file_source: std.Build.FileSource) void { |
| 343 | self.checkExtractInner(phrase, file_source); |
| 344 | } |
| 345 | |
| 346 | fn checkExtractInner(self: *CheckObject, phrase: []const u8, file_source: ?std.Build.FileSource) void { |
| 283 | 347 | assert(self.checks.items.len > 0); |
| 284 | 348 | const last = &self.checks.items[self.checks.items.len - 1]; |
| 285 | | last.match(.{ .string = self.step.owner.dupe(phrase), .file_source = file_source }); |
| 349 | last.extract(.{ .string = self.step.owner.dupe(phrase), .file_source = file_source }); |
| 286 | 350 | } |
| 287 | 351 | |
| 288 | 352 | /// Adds another searched phrase to the latest created Check with `CheckObject.checkStart(...)` |
| 289 | 353 | /// however ensures there is no matching phrase in the output. |
| 290 | | /// Asserts at least one check already exists. |
| 291 | 354 | pub fn checkNotPresent(self: *CheckObject, phrase: []const u8) void { |
| 355 | self.checkNotPresentInner(phrase, null); |
| 356 | } |
| 357 | |
| 358 | /// Like `checkExtract()` but takes an additional argument `FileSource` which will be |
| 359 | /// resolved to a full search query in `make()`. |
| 360 | pub fn checkNotPresentFileSource(self: *CheckObject, phrase: []const u8, file_source: std.Build.FileSource) void { |
| 361 | self.checkNotPresentInner(phrase, file_source); |
| 362 | } |
| 363 | |
| 364 | fn checkNotPresentInner(self: *CheckObject, phrase: []const u8, file_source: ?std.Build.FileSource) void { |
| 292 | 365 | assert(self.checks.items.len > 0); |
| 293 | 366 | const last = &self.checks.items[self.checks.items.len - 1]; |
| 294 | | last.notPresent(.{ .string = self.step.owner.dupe(phrase) }); |
| 367 | last.notPresent(.{ .string = self.step.owner.dupe(phrase), .file_source = file_source }); |
| 295 | 368 | } |
| 296 | 369 | |
| 297 | 370 | /// Creates a new check checking specifically symbol table parsed and dumped from the object |
| 298 | 371 | /// file. |
| 299 | | /// Issuing this check will force parsing and dumping of the symbol table. |
| 300 | 372 | pub fn checkInSymtab(self: *CheckObject) void { |
| 301 | | self.dump_symtab = true; |
| 302 | | const symtab_label = switch (self.obj_format) { |
| 373 | const label = switch (self.obj_format) { |
| 303 | 374 | .macho => MachODumper.symtab_label, |
| 304 | | else => @panic("TODO other parsers"), |
| 375 | .elf => ElfDumper.symtab_label, |
| 376 | .wasm => WasmDumper.symtab_label, |
| 377 | .coff => @panic("TODO symtab for coff"), |
| 378 | else => @panic("TODO other file formats"), |
| 305 | 379 | }; |
| 306 | | self.checkStart(symtab_label); |
| 380 | self.checkStart(); |
| 381 | self.checkExact(label); |
| 382 | } |
| 383 | |
| 384 | /// Creates a new check checking specifically dynamic symbol table parsed and dumped from the object |
| 385 | /// file. |
| 386 | /// This check is target-dependent and applicable to ELF only. |
| 387 | pub fn checkInDynamicSymtab(self: *CheckObject) void { |
| 388 | const label = switch (self.obj_format) { |
| 389 | .elf => ElfDumper.dynamic_symtab_label, |
| 390 | else => @panic("Unsupported target platform"), |
| 391 | }; |
| 392 | self.checkStart(); |
| 393 | self.checkExact(label); |
| 394 | } |
| 395 | |
| 396 | /// Creates a new check checking specifically dynamic section parsed and dumped from the object |
| 397 | /// file. |
| 398 | /// This check is target-dependent and applicable to ELF only. |
| 399 | pub fn checkInDynamicSection(self: *CheckObject) void { |
| 400 | const label = switch (self.obj_format) { |
| 401 | .elf => ElfDumper.dynamic_section_label, |
| 402 | else => @panic("Unsupported target platform"), |
| 403 | }; |
| 404 | self.checkStart(); |
| 405 | self.checkExact(label); |
| 307 | 406 | } |
| 308 | 407 | |
| 309 | 408 | /// Creates a new standalone, singular check which allows running simple binary operations |
| ... | ... | @@ -336,16 +435,10 @@ fn make(step: *Step, prog_node: *std.Progress.Node) !void { |
| 336 | 435 | ) catch |err| return step.fail("unable to read '{s}': {s}", .{ src_path, @errorName(err) }); |
| 337 | 436 | |
| 338 | 437 | const output = switch (self.obj_format) { |
| 339 | | .macho => try MachODumper.parseAndDump(step, contents, .{ |
| 340 | | .dump_symtab = self.dump_symtab, |
| 341 | | }), |
| 342 | | .elf => try ElfDumper.parseAndDump(step, contents, .{ |
| 343 | | .dump_symtab = self.dump_symtab, |
| 344 | | }), |
| 438 | .macho => try MachODumper.parseAndDump(step, contents), |
| 439 | .elf => try ElfDumper.parseAndDump(step, contents), |
| 345 | 440 | .coff => @panic("TODO coff parser"), |
| 346 | | .wasm => try WasmDumper.parseAndDump(step, contents, .{ |
| 347 | | .dump_symtab = self.dump_symtab, |
| 348 | | }), |
| 441 | .wasm => try WasmDumper.parseAndDump(step, contents), |
| 349 | 442 | else => unreachable, |
| 350 | 443 | }; |
| 351 | 444 | |
| ... | ... | @@ -355,9 +448,9 @@ fn make(step: *Step, prog_node: *std.Progress.Node) !void { |
| 355 | 448 | var it = mem.tokenizeAny(u8, output, "\r\n"); |
| 356 | 449 | for (chk.actions.items) |act| { |
| 357 | 450 | switch (act.tag) { |
| 358 | | .match => { |
| 451 | .exact => { |
| 359 | 452 | while (it.next()) |line| { |
| 360 | | if (try act.match(b, step, line, &vars)) break; |
| 453 | if (act.exact(b, step, line)) break; |
| 361 | 454 | } else { |
| 362 | 455 | return step.fail( |
| 363 | 456 | \\ |
| ... | ... | @@ -369,18 +462,46 @@ fn make(step: *Step, prog_node: *std.Progress.Node) !void { |
| 369 | 462 | , .{ act.phrase.resolve(b, step), output }); |
| 370 | 463 | } |
| 371 | 464 | }, |
| 465 | .contains => { |
| 466 | while (it.next()) |line| { |
| 467 | if (act.contains(b, step, line)) break; |
| 468 | } else { |
| 469 | return step.fail( |
| 470 | \\ |
| 471 | \\========= expected to find: ========================== |
| 472 | \\*{s}* |
| 473 | \\========= but parsed file does not contain it: ======= |
| 474 | \\{s} |
| 475 | \\====================================================== |
| 476 | , .{ act.phrase.resolve(b, step), output }); |
| 477 | } |
| 478 | }, |
| 372 | 479 | .not_present => { |
| 373 | 480 | while (it.next()) |line| { |
| 374 | | if (try act.match(b, step, line, &vars)) { |
| 375 | | return step.fail( |
| 376 | | \\ |
| 377 | | \\========= expected not to find: =================== |
| 378 | | \\{s} |
| 379 | | \\========= but parsed file does contain it: ======== |
| 380 | | \\{s} |
| 381 | | \\=================================================== |
| 382 | | , .{ act.phrase.resolve(b, step), output }); |
| 383 | | } |
| 481 | if (act.notPresent(b, step, line)) break; |
| 482 | } else { |
| 483 | return step.fail( |
| 484 | \\ |
| 485 | \\========= expected not to find: =================== |
| 486 | \\{s} |
| 487 | \\========= but parsed file does contain it: ======== |
| 488 | \\{s} |
| 489 | \\=================================================== |
| 490 | , .{ act.phrase.resolve(b, step), output }); |
| 491 | } |
| 492 | }, |
| 493 | .extract => { |
| 494 | while (it.next()) |line| { |
| 495 | if (try act.extract(b, step, line, &vars)) break; |
| 496 | } else { |
| 497 | return step.fail( |
| 498 | \\ |
| 499 | \\========= expected to find and extract: ============== |
| 500 | \\{s} |
| 501 | \\========= but parsed file does not contain it: ======= |
| 502 | \\{s} |
| 503 | \\====================================================== |
| 504 | , .{ act.phrase.resolve(b, step), output }); |
| 384 | 505 | } |
| 385 | 506 | }, |
| 386 | 507 | .compute_cmp => { |
| ... | ... | @@ -410,15 +531,16 @@ fn make(step: *Step, prog_node: *std.Progress.Node) !void { |
| 410 | 531 | } |
| 411 | 532 | } |
| 412 | 533 | |
| 413 | | const Opts = struct { |
| 414 | | dump_symtab: bool = false, |
| 415 | | }; |
| 416 | | |
| 417 | 534 | const MachODumper = struct { |
| 418 | 535 | const LoadCommandIterator = macho.LoadCommandIterator; |
| 419 | | const symtab_label = "symtab"; |
| 536 | const symtab_label = "symbol table"; |
| 537 | |
| 538 | const Symtab = struct { |
| 539 | symbols: []align(1) const macho.nlist_64, |
| 540 | strings: []const u8, |
| 541 | }; |
| 420 | 542 | |
| 421 | | fn parseAndDump(step: *Step, bytes: []align(@alignOf(u64)) const u8, opts: Opts) ![]const u8 { |
| 543 | fn parseAndDump(step: *Step, bytes: []align(@alignOf(u64)) const u8) ![]const u8 { |
| 422 | 544 | const gpa = step.owner.allocator; |
| 423 | 545 | var stream = std.io.fixedBufferStream(bytes); |
| 424 | 546 | const reader = stream.reader(); |
| ... | ... | @@ -431,8 +553,7 @@ const MachODumper = struct { |
| 431 | 553 | var output = std.ArrayList(u8).init(gpa); |
| 432 | 554 | const writer = output.writer(); |
| 433 | 555 | |
| 434 | | var symtab: []const macho.nlist_64 = undefined; |
| 435 | | var strtab: []const u8 = undefined; |
| 556 | var symtab: ?Symtab = null; |
| 436 | 557 | var sections = std.ArrayList(macho.section_64).init(gpa); |
| 437 | 558 | var imports = std.ArrayList([]const u8).init(gpa); |
| 438 | 559 | |
| ... | ... | @@ -450,13 +571,11 @@ const MachODumper = struct { |
| 450 | 571 | sections.appendAssumeCapacity(sect); |
| 451 | 572 | } |
| 452 | 573 | }, |
| 453 | | .SYMTAB => if (opts.dump_symtab) { |
| 574 | .SYMTAB => { |
| 454 | 575 | const lc = cmd.cast(macho.symtab_command).?; |
| 455 | | symtab = @as( |
| 456 | | [*]const macho.nlist_64, |
| 457 | | @ptrCast(@alignCast(&bytes[lc.symoff])), |
| 458 | | )[0..lc.nsyms]; |
| 459 | | strtab = bytes[lc.stroff..][0..lc.strsize]; |
| 576 | const symbols = @as([*]align(1) const macho.nlist_64, @ptrCast(bytes.ptr + lc.symoff))[0..lc.nsyms]; |
| 577 | const strings = bytes[lc.stroff..][0..lc.strsize]; |
| 578 | symtab = .{ .symbols = symbols, .strings = strings }; |
| 460 | 579 | }, |
| 461 | 580 | .LOAD_DYLIB, |
| 462 | 581 | .LOAD_WEAK_DYLIB, |
| ... | ... | @@ -473,53 +592,8 @@ const MachODumper = struct { |
| 473 | 592 | i += 1; |
| 474 | 593 | } |
| 475 | 594 | |
| 476 | | if (opts.dump_symtab) { |
| 477 | | try writer.print("{s}\n", .{symtab_label}); |
| 478 | | for (symtab) |sym| { |
| 479 | | if (sym.stab()) continue; |
| 480 | | const sym_name = mem.sliceTo(@as([*:0]const u8, @ptrCast(strtab.ptr + sym.n_strx)), 0); |
| 481 | | if (sym.sect()) { |
| 482 | | const sect = sections.items[sym.n_sect - 1]; |
| 483 | | try writer.print("{x} ({s},{s})", .{ |
| 484 | | sym.n_value, |
| 485 | | sect.segName(), |
| 486 | | sect.sectName(), |
| 487 | | }); |
| 488 | | if (sym.ext()) { |
| 489 | | try writer.writeAll(" external"); |
| 490 | | } |
| 491 | | try writer.print(" {s}\n", .{sym_name}); |
| 492 | | } else if (sym.undf()) { |
| 493 | | const ordinal = @divTrunc(@as(i16, @bitCast(sym.n_desc)), macho.N_SYMBOL_RESOLVER); |
| 494 | | const import_name = blk: { |
| 495 | | if (ordinal <= 0) { |
| 496 | | if (ordinal == macho.BIND_SPECIAL_DYLIB_SELF) |
| 497 | | break :blk "self import"; |
| 498 | | if (ordinal == macho.BIND_SPECIAL_DYLIB_MAIN_EXECUTABLE) |
| 499 | | break :blk "main executable"; |
| 500 | | if (ordinal == macho.BIND_SPECIAL_DYLIB_FLAT_LOOKUP) |
| 501 | | break :blk "flat lookup"; |
| 502 | | unreachable; |
| 503 | | } |
| 504 | | const full_path = imports.items[@as(u16, @bitCast(ordinal)) - 1]; |
| 505 | | const basename = fs.path.basename(full_path); |
| 506 | | assert(basename.len > 0); |
| 507 | | const ext = mem.lastIndexOfScalar(u8, basename, '.') orelse basename.len; |
| 508 | | break :blk basename[0..ext]; |
| 509 | | }; |
| 510 | | try writer.writeAll("(undefined)"); |
| 511 | | if (sym.weakRef()) { |
| 512 | | try writer.writeAll(" weak"); |
| 513 | | } |
| 514 | | if (sym.ext()) { |
| 515 | | try writer.writeAll(" external"); |
| 516 | | } |
| 517 | | try writer.print(" {s} (from {s})\n", .{ |
| 518 | | sym_name, |
| 519 | | import_name, |
| 520 | | }); |
| 521 | | } else unreachable; |
| 522 | | } |
| 595 | if (symtab) |stab| { |
| 596 | try dumpSymtab(sections.items, imports.items, stab, writer); |
| 523 | 597 | } |
| 524 | 598 | |
| 525 | 599 | return output.toOwnedSlice(); |
| ... | ... | @@ -696,10 +770,67 @@ const MachODumper = struct { |
| 696 | 770 | else => {}, |
| 697 | 771 | } |
| 698 | 772 | } |
| 773 | |
| 774 | fn dumpSymtab( |
| 775 | sections: []const macho.section_64, |
| 776 | imports: []const []const u8, |
| 777 | symtab: Symtab, |
| 778 | writer: anytype, |
| 779 | ) !void { |
| 780 | try writer.writeAll(symtab_label ++ "\n"); |
| 781 | |
| 782 | for (symtab.symbols) |sym| { |
| 783 | if (sym.stab()) continue; |
| 784 | const sym_name = mem.sliceTo(@as([*:0]const u8, @ptrCast(symtab.strings.ptr + sym.n_strx)), 0); |
| 785 | if (sym.sect()) { |
| 786 | const sect = sections[sym.n_sect - 1]; |
| 787 | try writer.print("{x} ({s},{s})", .{ |
| 788 | sym.n_value, |
| 789 | sect.segName(), |
| 790 | sect.sectName(), |
| 791 | }); |
| 792 | if (sym.ext()) { |
| 793 | try writer.writeAll(" external"); |
| 794 | } |
| 795 | try writer.print(" {s}\n", .{sym_name}); |
| 796 | } else if (sym.undf()) { |
| 797 | const ordinal = @divTrunc(@as(i16, @bitCast(sym.n_desc)), macho.N_SYMBOL_RESOLVER); |
| 798 | const import_name = blk: { |
| 799 | if (ordinal <= 0) { |
| 800 | if (ordinal == macho.BIND_SPECIAL_DYLIB_SELF) |
| 801 | break :blk "self import"; |
| 802 | if (ordinal == macho.BIND_SPECIAL_DYLIB_MAIN_EXECUTABLE) |
| 803 | break :blk "main executable"; |
| 804 | if (ordinal == macho.BIND_SPECIAL_DYLIB_FLAT_LOOKUP) |
| 805 | break :blk "flat lookup"; |
| 806 | unreachable; |
| 807 | } |
| 808 | const full_path = imports[@as(u16, @bitCast(ordinal)) - 1]; |
| 809 | const basename = fs.path.basename(full_path); |
| 810 | assert(basename.len > 0); |
| 811 | const ext = mem.lastIndexOfScalar(u8, basename, '.') orelse basename.len; |
| 812 | break :blk basename[0..ext]; |
| 813 | }; |
| 814 | try writer.writeAll("(undefined)"); |
| 815 | if (sym.weakRef()) { |
| 816 | try writer.writeAll(" weak"); |
| 817 | } |
| 818 | if (sym.ext()) { |
| 819 | try writer.writeAll(" external"); |
| 820 | } |
| 821 | try writer.print(" {s} (from {s})\n", .{ |
| 822 | sym_name, |
| 823 | import_name, |
| 824 | }); |
| 825 | } else unreachable; |
| 826 | } |
| 827 | } |
| 699 | 828 | }; |
| 700 | 829 | |
| 701 | 830 | const ElfDumper = struct { |
| 702 | | const symtab_label = "symtab"; |
| 831 | const symtab_label = "symbol table"; |
| 832 | const dynamic_symtab_label = "dynamic symbol table"; |
| 833 | const dynamic_section_label = "dynamic section"; |
| 703 | 834 | |
| 704 | 835 | const Symtab = struct { |
| 705 | 836 | symbols: []align(1) const elf.Elf64_Sym, |
| ... | ... | @@ -712,8 +843,7 @@ const ElfDumper = struct { |
| 712 | 843 | |
| 713 | 844 | fn getName(st: Symtab, index: usize) ?[]const u8 { |
| 714 | 845 | const sym = st.get(index) orelse return null; |
| 715 | | assert(sym.st_name < st.strings.len); |
| 716 | | return mem.sliceTo(@ptrCast(st.strings.ptr + sym.st_name), 0); |
| 846 | return getString(st.strings, sym.st_name); |
| 717 | 847 | } |
| 718 | 848 | }; |
| 719 | 849 | |
| ... | ... | @@ -728,7 +858,7 @@ const ElfDumper = struct { |
| 728 | 858 | dysymtab: ?Symtab = null, |
| 729 | 859 | }; |
| 730 | 860 | |
| 731 | | fn parseAndDump(step: *Step, bytes: []const u8, opts: Opts) ![]const u8 { |
| 861 | fn parseAndDump(step: *Step, bytes: []const u8) ![]const u8 { |
| 732 | 862 | const gpa = step.owner.allocator; |
| 733 | 863 | var stream = std.io.fixedBufferStream(bytes); |
| 734 | 864 | const reader = stream.reader(); |
| ... | ... | @@ -751,34 +881,32 @@ const ElfDumper = struct { |
| 751 | 881 | }; |
| 752 | 882 | ctx.shstrtab = getSectionContents(ctx, ctx.hdr.e_shstrndx); |
| 753 | 883 | |
| 754 | | if (opts.dump_symtab) { |
| 755 | | for (ctx.shdrs, 0..) |shdr, i| switch (shdr.sh_type) { |
| 756 | | elf.SHT_SYMTAB, elf.SHT_DYNSYM => { |
| 757 | | const raw = getSectionContents(ctx, i); |
| 758 | | const nsyms = @divExact(raw.len, @sizeOf(elf.Elf64_Sym)); |
| 759 | | const symbols = @as([*]align(1) const elf.Elf64_Sym, @ptrCast(raw.ptr))[0..nsyms]; |
| 760 | | const strings = getSectionContents(ctx, shdr.sh_link); |
| 761 | | |
| 762 | | switch (shdr.sh_type) { |
| 763 | | elf.SHT_SYMTAB => { |
| 764 | | ctx.symtab = .{ |
| 765 | | .symbols = symbols, |
| 766 | | .strings = strings, |
| 767 | | }; |
| 768 | | }, |
| 769 | | elf.SHT_DYNSYM => { |
| 770 | | ctx.dysymtab = .{ |
| 771 | | .symbols = symbols, |
| 772 | | .strings = strings, |
| 773 | | }; |
| 774 | | }, |
| 775 | | else => unreachable, |
| 776 | | } |
| 777 | | }, |
| 884 | for (ctx.shdrs, 0..) |shdr, i| switch (shdr.sh_type) { |
| 885 | elf.SHT_SYMTAB, elf.SHT_DYNSYM => { |
| 886 | const raw = getSectionContents(ctx, i); |
| 887 | const nsyms = @divExact(raw.len, @sizeOf(elf.Elf64_Sym)); |
| 888 | const symbols = @as([*]align(1) const elf.Elf64_Sym, @ptrCast(raw.ptr))[0..nsyms]; |
| 889 | const strings = getSectionContents(ctx, shdr.sh_link); |
| 890 | |
| 891 | switch (shdr.sh_type) { |
| 892 | elf.SHT_SYMTAB => { |
| 893 | ctx.symtab = .{ |
| 894 | .symbols = symbols, |
| 895 | .strings = strings, |
| 896 | }; |
| 897 | }, |
| 898 | elf.SHT_DYNSYM => { |
| 899 | ctx.dysymtab = .{ |
| 900 | .symbols = symbols, |
| 901 | .strings = strings, |
| 902 | }; |
| 903 | }, |
| 904 | else => unreachable, |
| 905 | } |
| 906 | }, |
| 778 | 907 | |
| 779 | | else => {}, |
| 780 | | }; |
| 781 | | } |
| 908 | else => {}, |
| 909 | }; |
| 782 | 910 | |
| 783 | 911 | var output = std.ArrayList(u8).init(gpa); |
| 784 | 912 | const writer = output.writer(); |
| ... | ... | @@ -786,14 +914,16 @@ const ElfDumper = struct { |
| 786 | 914 | try dumpHeader(ctx, writer); |
| 787 | 915 | try dumpShdrs(ctx, writer); |
| 788 | 916 | try dumpPhdrs(ctx, writer); |
| 917 | try dumpDynamicSection(ctx, writer); |
| 918 | try dumpSymtab(ctx, .symtab, writer); |
| 919 | try dumpSymtab(ctx, .dysymtab, writer); |
| 789 | 920 | |
| 790 | 921 | return output.toOwnedSlice(); |
| 791 | 922 | } |
| 792 | 923 | |
| 793 | | fn getSectionName(ctx: Context, shndx: usize) []const u8 { |
| 924 | inline fn getSectionName(ctx: Context, shndx: usize) []const u8 { |
| 794 | 925 | const shdr = ctx.shdrs[shndx]; |
| 795 | | assert(shdr.sh_name < ctx.shstrtab.len); |
| 796 | | return mem.sliceTo(@as([*:0]const u8, @ptrCast(ctx.shstrtab.ptr + shdr.sh_name)), 0); |
| 926 | return getString(ctx.shstrtab, shdr.sh_name); |
| 797 | 927 | } |
| 798 | 928 | |
| 799 | 929 | fn getSectionContents(ctx: Context, shndx: usize) []const u8 { |
| ... | ... | @@ -803,6 +933,17 @@ const ElfDumper = struct { |
| 803 | 933 | return ctx.data[shdr.sh_offset..][0..shdr.sh_size]; |
| 804 | 934 | } |
| 805 | 935 | |
| 936 | fn getSectionByName(ctx: Context, name: []const u8) ?usize { |
| 937 | for (0..ctx.shdrs.len) |shndx| { |
| 938 | if (mem.eql(u8, getSectionName(ctx, shndx), name)) return shndx; |
| 939 | } else return null; |
| 940 | } |
| 941 | |
| 942 | fn getString(strtab: []const u8, off: u32) []const u8 { |
| 943 | assert(off < strtab.len); |
| 944 | return mem.sliceTo(@as([*:0]const u8, @ptrCast(strtab.ptr + off)), 0); |
| 945 | } |
| 946 | |
| 806 | 947 | fn dumpHeader(ctx: Context, writer: anytype) !void { |
| 807 | 948 | try writer.writeAll("header\n"); |
| 808 | 949 | try writer.print("type {s}\n", .{@tagName(ctx.hdr.e_type)}); |
| ... | ... | @@ -812,6 +953,8 @@ const ElfDumper = struct { |
| 812 | 953 | fn dumpShdrs(ctx: Context, writer: anytype) !void { |
| 813 | 954 | if (ctx.shdrs.len == 0) return; |
| 814 | 955 | |
| 956 | try writer.writeAll("section headers\n"); |
| 957 | |
| 815 | 958 | for (ctx.shdrs, 0..) |shdr, shndx| { |
| 816 | 959 | try writer.print("shdr {d}\n", .{shndx}); |
| 817 | 960 | try writer.print("name {s}\n", .{getSectionName(ctx, shndx)}); |
| ... | ... | @@ -824,6 +967,145 @@ const ElfDumper = struct { |
| 824 | 967 | } |
| 825 | 968 | } |
| 826 | 969 | |
| 970 | fn dumpDynamicSection(ctx: Context, writer: anytype) !void { |
| 971 | const shndx = getSectionByName(ctx, ".dynamic") orelse return; |
| 972 | const shdr = ctx.shdrs[shndx]; |
| 973 | const strtab = getSectionContents(ctx, shdr.sh_link); |
| 974 | const data = getSectionContents(ctx, shndx); |
| 975 | const nentries = @divExact(data.len, @sizeOf(elf.Elf64_Dyn)); |
| 976 | const entries = @as([*]align(1) const elf.Elf64_Dyn, @ptrCast(data.ptr))[0..nentries]; |
| 977 | |
| 978 | try writer.writeAll(ElfDumper.dynamic_section_label ++ "\n"); |
| 979 | |
| 980 | for (entries) |entry| { |
| 981 | const key = @as(u64, @bitCast(entry.d_tag)); |
| 982 | const value = entry.d_val; |
| 983 | |
| 984 | const key_str = switch (key) { |
| 985 | elf.DT_NEEDED => "NEEDED", |
| 986 | elf.DT_SONAME => "SONAME", |
| 987 | elf.DT_INIT_ARRAY => "INIT_ARRAY", |
| 988 | elf.DT_INIT_ARRAYSZ => "INIT_ARRAYSZ", |
| 989 | elf.DT_FINI_ARRAY => "FINI_ARRAY", |
| 990 | elf.DT_FINI_ARRAYSZ => "FINI_ARRAYSZ", |
| 991 | elf.DT_HASH => "HASH", |
| 992 | elf.DT_GNU_HASH => "GNU_HASH", |
| 993 | elf.DT_STRTAB => "STRTAB", |
| 994 | elf.DT_SYMTAB => "SYMTAB", |
| 995 | elf.DT_STRSZ => "STRSZ", |
| 996 | elf.DT_SYMENT => "SYMENT", |
| 997 | elf.DT_PLTGOT => "PLTGOT", |
| 998 | elf.DT_PLTRELSZ => "PLTRELSZ", |
| 999 | elf.DT_PLTREL => "PLTREL", |
| 1000 | elf.DT_JMPREL => "JMPREL", |
| 1001 | elf.DT_RELA => "RELA", |
| 1002 | elf.DT_RELASZ => "RELASZ", |
| 1003 | elf.DT_RELAENT => "RELAENT", |
| 1004 | elf.DT_VERDEF => "VERDEF", |
| 1005 | elf.DT_VERDEFNUM => "VERDEFNUM", |
| 1006 | elf.DT_FLAGS => "FLAGS", |
| 1007 | elf.DT_FLAGS_1 => "FLAGS_1", |
| 1008 | elf.DT_VERNEED => "VERNEED", |
| 1009 | elf.DT_VERNEEDNUM => "VERNEEDNUM", |
| 1010 | elf.DT_VERSYM => "VERSYM", |
| 1011 | elf.DT_RELACOUNT => "RELACOUNT", |
| 1012 | elf.DT_RPATH => "RPATH", |
| 1013 | elf.DT_RUNPATH => "RUNPATH", |
| 1014 | elf.DT_INIT => "INIT", |
| 1015 | elf.DT_FINI => "FINI", |
| 1016 | elf.DT_NULL => "NULL", |
| 1017 | else => "UNKNOWN", |
| 1018 | }; |
| 1019 | try writer.print("{s}", .{key_str}); |
| 1020 | |
| 1021 | switch (key) { |
| 1022 | elf.DT_NEEDED, |
| 1023 | elf.DT_SONAME, |
| 1024 | elf.DT_RPATH, |
| 1025 | elf.DT_RUNPATH, |
| 1026 | => { |
| 1027 | const name = getString(strtab, @intCast(value)); |
| 1028 | try writer.print(" {s}", .{name}); |
| 1029 | }, |
| 1030 | |
| 1031 | elf.DT_INIT_ARRAY, |
| 1032 | elf.DT_FINI_ARRAY, |
| 1033 | elf.DT_HASH, |
| 1034 | elf.DT_GNU_HASH, |
| 1035 | elf.DT_STRTAB, |
| 1036 | elf.DT_SYMTAB, |
| 1037 | elf.DT_PLTGOT, |
| 1038 | elf.DT_JMPREL, |
| 1039 | elf.DT_RELA, |
| 1040 | elf.DT_VERDEF, |
| 1041 | elf.DT_VERNEED, |
| 1042 | elf.DT_VERSYM, |
| 1043 | elf.DT_INIT, |
| 1044 | elf.DT_FINI, |
| 1045 | elf.DT_NULL, |
| 1046 | => try writer.print(" {x}", .{value}), |
| 1047 | |
| 1048 | elf.DT_INIT_ARRAYSZ, |
| 1049 | elf.DT_FINI_ARRAYSZ, |
| 1050 | elf.DT_STRSZ, |
| 1051 | elf.DT_SYMENT, |
| 1052 | elf.DT_PLTRELSZ, |
| 1053 | elf.DT_RELASZ, |
| 1054 | elf.DT_RELAENT, |
| 1055 | elf.DT_RELACOUNT, |
| 1056 | => try writer.print(" {d}", .{value}), |
| 1057 | |
| 1058 | elf.DT_PLTREL => try writer.writeAll(switch (value) { |
| 1059 | elf.DT_REL => " REL", |
| 1060 | elf.DT_RELA => " RELA", |
| 1061 | else => " UNKNOWN", |
| 1062 | }), |
| 1063 | |
| 1064 | elf.DT_FLAGS => if (value > 0) { |
| 1065 | if (value & elf.DF_ORIGIN != 0) try writer.writeAll(" ORIGIN"); |
| 1066 | if (value & elf.DF_SYMBOLIC != 0) try writer.writeAll(" SYMBOLIC"); |
| 1067 | if (value & elf.DF_TEXTREL != 0) try writer.writeAll(" TEXTREL"); |
| 1068 | if (value & elf.DF_BIND_NOW != 0) try writer.writeAll(" BIND_NOW"); |
| 1069 | if (value & elf.DF_STATIC_TLS != 0) try writer.writeAll(" STATIC_TLS"); |
| 1070 | }, |
| 1071 | |
| 1072 | elf.DT_FLAGS_1 => if (value > 0) { |
| 1073 | if (value & elf.DF_1_NOW != 0) try writer.writeAll(" NOW"); |
| 1074 | if (value & elf.DF_1_GLOBAL != 0) try writer.writeAll(" GLOBAL"); |
| 1075 | if (value & elf.DF_1_GROUP != 0) try writer.writeAll(" GROUP"); |
| 1076 | if (value & elf.DF_1_NODELETE != 0) try writer.writeAll(" NODELETE"); |
| 1077 | if (value & elf.DF_1_LOADFLTR != 0) try writer.writeAll(" LOADFLTR"); |
| 1078 | if (value & elf.DF_1_INITFIRST != 0) try writer.writeAll(" INITFIRST"); |
| 1079 | if (value & elf.DF_1_NOOPEN != 0) try writer.writeAll(" NOOPEN"); |
| 1080 | if (value & elf.DF_1_ORIGIN != 0) try writer.writeAll(" ORIGIN"); |
| 1081 | if (value & elf.DF_1_DIRECT != 0) try writer.writeAll(" DIRECT"); |
| 1082 | if (value & elf.DF_1_TRANS != 0) try writer.writeAll(" TRANS"); |
| 1083 | if (value & elf.DF_1_INTERPOSE != 0) try writer.writeAll(" INTERPOSE"); |
| 1084 | if (value & elf.DF_1_NODEFLIB != 0) try writer.writeAll(" NODEFLIB"); |
| 1085 | if (value & elf.DF_1_NODUMP != 0) try writer.writeAll(" NODUMP"); |
| 1086 | if (value & elf.DF_1_CONFALT != 0) try writer.writeAll(" CONFALT"); |
| 1087 | if (value & elf.DF_1_ENDFILTEE != 0) try writer.writeAll(" ENDFILTEE"); |
| 1088 | if (value & elf.DF_1_DISPRELDNE != 0) try writer.writeAll(" DISPRELDNE"); |
| 1089 | if (value & elf.DF_1_DISPRELPND != 0) try writer.writeAll(" DISPRELPND"); |
| 1090 | if (value & elf.DF_1_NODIRECT != 0) try writer.writeAll(" NODIRECT"); |
| 1091 | if (value & elf.DF_1_IGNMULDEF != 0) try writer.writeAll(" IGNMULDEF"); |
| 1092 | if (value & elf.DF_1_NOKSYMS != 0) try writer.writeAll(" NOKSYMS"); |
| 1093 | if (value & elf.DF_1_NOHDR != 0) try writer.writeAll(" NOHDR"); |
| 1094 | if (value & elf.DF_1_EDITED != 0) try writer.writeAll(" EDITED"); |
| 1095 | if (value & elf.DF_1_NORELOC != 0) try writer.writeAll(" NORELOC"); |
| 1096 | if (value & elf.DF_1_SYMINTPOSE != 0) try writer.writeAll(" SYMINTPOSE"); |
| 1097 | if (value & elf.DF_1_GLOBAUDIT != 0) try writer.writeAll(" GLOBAUDIT"); |
| 1098 | if (value & elf.DF_1_SINGLETON != 0) try writer.writeAll(" SINGLETON"); |
| 1099 | if (value & elf.DF_1_STUB != 0) try writer.writeAll(" STUB"); |
| 1100 | if (value & elf.DF_1_PIE != 0) try writer.writeAll(" PIE"); |
| 1101 | }, |
| 1102 | |
| 1103 | else => try writer.print(" {x}", .{value}), |
| 1104 | } |
| 1105 | try writer.writeByte('\n'); |
| 1106 | } |
| 1107 | } |
| 1108 | |
| 827 | 1109 | fn fmtShType(sh_type: u32) std.fmt.Formatter(formatShType) { |
| 828 | 1110 | return .{ .data = sh_type }; |
| 829 | 1111 | } |
| ... | ... | @@ -836,46 +1118,46 @@ const ElfDumper = struct { |
| 836 | 1118 | ) !void { |
| 837 | 1119 | _ = unused_fmt_string; |
| 838 | 1120 | _ = options; |
| 839 | | if (elf.SHT_LOOS <= sh_type and sh_type < elf.SHT_HIOS) { |
| 840 | | try writer.print("LOOS+0x{x}", .{sh_type - elf.SHT_LOOS}); |
| 841 | | } else if (elf.SHT_LOPROC <= sh_type and sh_type < elf.SHT_HIPROC) { |
| 842 | | try writer.print("LOPROC+0x{x}", .{sh_type - elf.SHT_LOPROC}); |
| 843 | | } else if (elf.SHT_LOUSER <= sh_type and sh_type < elf.SHT_HIUSER) { |
| 844 | | try writer.print("LOUSER+0x{x}", .{sh_type - elf.SHT_LOUSER}); |
| 845 | | } else { |
| 846 | | const name = switch (sh_type) { |
| 847 | | elf.SHT_NULL => "NULL", |
| 848 | | elf.SHT_PROGBITS => "PROGBITS", |
| 849 | | elf.SHT_SYMTAB => "SYMTAB", |
| 850 | | elf.SHT_STRTAB => "STRTAB", |
| 851 | | elf.SHT_RELA => "RELA", |
| 852 | | elf.SHT_HASH => "HASH", |
| 853 | | elf.SHT_DYNAMIC => "DYNAMIC", |
| 854 | | elf.SHT_NOTE => "NOTE", |
| 855 | | elf.SHT_NOBITS => "NOBITS", |
| 856 | | elf.SHT_REL => "REL", |
| 857 | | elf.SHT_SHLIB => "SHLIB", |
| 858 | | elf.SHT_DYNSYM => "DYNSYM", |
| 859 | | elf.SHT_INIT_ARRAY => "INIT_ARRAY", |
| 860 | | elf.SHT_FINI_ARRAY => "FINI_ARRAY", |
| 861 | | elf.SHT_PREINIT_ARRAY => "PREINIT_ARRAY", |
| 862 | | elf.SHT_GROUP => "GROUP", |
| 863 | | elf.SHT_SYMTAB_SHNDX => "SYMTAB_SHNDX", |
| 864 | | elf.SHT_X86_64_UNWIND => "X86_64_UNWIND", |
| 865 | | elf.SHT_LLVM_ADDRSIG => "LLVM_ADDRSIG", |
| 866 | | elf.SHT_GNU_HASH => "GNU_HASH", |
| 867 | | elf.SHT_GNU_VERDEF => "VERDEF", |
| 868 | | elf.SHT_GNU_VERNEED => "VERNEED", |
| 869 | | elf.SHT_GNU_VERSYM => "VERSYM", |
| 870 | | else => "UNKNOWN", |
| 871 | | }; |
| 872 | | try writer.writeAll(name); |
| 873 | | } |
| 1121 | const name = switch (sh_type) { |
| 1122 | elf.SHT_NULL => "NULL", |
| 1123 | elf.SHT_PROGBITS => "PROGBITS", |
| 1124 | elf.SHT_SYMTAB => "SYMTAB", |
| 1125 | elf.SHT_STRTAB => "STRTAB", |
| 1126 | elf.SHT_RELA => "RELA", |
| 1127 | elf.SHT_HASH => "HASH", |
| 1128 | elf.SHT_DYNAMIC => "DYNAMIC", |
| 1129 | elf.SHT_NOTE => "NOTE", |
| 1130 | elf.SHT_NOBITS => "NOBITS", |
| 1131 | elf.SHT_REL => "REL", |
| 1132 | elf.SHT_SHLIB => "SHLIB", |
| 1133 | elf.SHT_DYNSYM => "DYNSYM", |
| 1134 | elf.SHT_INIT_ARRAY => "INIT_ARRAY", |
| 1135 | elf.SHT_FINI_ARRAY => "FINI_ARRAY", |
| 1136 | elf.SHT_PREINIT_ARRAY => "PREINIT_ARRAY", |
| 1137 | elf.SHT_GROUP => "GROUP", |
| 1138 | elf.SHT_SYMTAB_SHNDX => "SYMTAB_SHNDX", |
| 1139 | elf.SHT_X86_64_UNWIND => "X86_64_UNWIND", |
| 1140 | elf.SHT_LLVM_ADDRSIG => "LLVM_ADDRSIG", |
| 1141 | elf.SHT_GNU_HASH => "GNU_HASH", |
| 1142 | elf.SHT_GNU_VERDEF => "VERDEF", |
| 1143 | elf.SHT_GNU_VERNEED => "VERNEED", |
| 1144 | elf.SHT_GNU_VERSYM => "VERSYM", |
| 1145 | else => if (elf.SHT_LOOS <= sh_type and sh_type < elf.SHT_HIOS) { |
| 1146 | return try writer.print("LOOS+0x{x}", .{sh_type - elf.SHT_LOOS}); |
| 1147 | } else if (elf.SHT_LOPROC <= sh_type and sh_type < elf.SHT_HIPROC) { |
| 1148 | return try writer.print("LOPROC+0x{x}", .{sh_type - elf.SHT_LOPROC}); |
| 1149 | } else if (elf.SHT_LOUSER <= sh_type and sh_type < elf.SHT_HIUSER) { |
| 1150 | return try writer.print("LOUSER+0x{x}", .{sh_type - elf.SHT_LOUSER}); |
| 1151 | } else "UNKNOWN", |
| 1152 | }; |
| 1153 | try writer.writeAll(name); |
| 874 | 1154 | } |
| 875 | 1155 | |
| 876 | 1156 | fn dumpPhdrs(ctx: Context, writer: anytype) !void { |
| 877 | 1157 | if (ctx.phdrs.len == 0) return; |
| 878 | 1158 | |
| 1159 | try writer.writeAll("program headers\n"); |
| 1160 | |
| 879 | 1161 | for (ctx.phdrs, 0..) |phdr, phndx| { |
| 880 | 1162 | try writer.print("phdr {d}\n", .{phndx}); |
| 881 | 1163 | try writer.print("type {s}\n", .{fmtPhType(phdr.p_type)}); |
| ... | ... | @@ -885,7 +1167,28 @@ const ElfDumper = struct { |
| 885 | 1167 | try writer.print("memsz {x}\n", .{phdr.p_memsz}); |
| 886 | 1168 | try writer.print("filesz {x}\n", .{phdr.p_filesz}); |
| 887 | 1169 | try writer.print("align {x}\n", .{phdr.p_align}); |
| 888 | | // TODO dump formatted p_flags |
| 1170 | |
| 1171 | { |
| 1172 | const flags = phdr.p_flags; |
| 1173 | try writer.writeAll("flags"); |
| 1174 | if (flags > 0) try writer.writeByte(' '); |
| 1175 | if (flags & elf.PF_R != 0) { |
| 1176 | try writer.writeByte('R'); |
| 1177 | } |
| 1178 | if (flags & elf.PF_W != 0) { |
| 1179 | try writer.writeByte('W'); |
| 1180 | } |
| 1181 | if (flags & elf.PF_X != 0) { |
| 1182 | try writer.writeByte('E'); |
| 1183 | } |
| 1184 | if (flags & elf.PF_MASKOS != 0) { |
| 1185 | try writer.writeAll("OS"); |
| 1186 | } |
| 1187 | if (flags & elf.PF_MASKPROC != 0) { |
| 1188 | try writer.writeAll("PROC"); |
| 1189 | } |
| 1190 | try writer.writeByte('\n'); |
| 1191 | } |
| 889 | 1192 | } |
| 890 | 1193 | } |
| 891 | 1194 | |
| ... | ... | @@ -901,27 +1204,107 @@ const ElfDumper = struct { |
| 901 | 1204 | ) !void { |
| 902 | 1205 | _ = unused_fmt_string; |
| 903 | 1206 | _ = options; |
| 904 | | if (elf.PT_LOOS <= ph_type and ph_type < elf.PT_HIOS) { |
| 905 | | try writer.print("LOOS+0x{x}", .{ph_type - elf.PT_LOOS}); |
| 906 | | } else if (elf.PT_LOPROC <= ph_type and ph_type < elf.PT_HIPROC) { |
| 907 | | try writer.print("LOPROC+0x{x}", .{ph_type - elf.PT_LOPROC}); |
| 908 | | } else { |
| 909 | | const p_type = switch (ph_type) { |
| 910 | | elf.PT_NULL => "NULL", |
| 911 | | elf.PT_LOAD => "LOAD", |
| 912 | | elf.PT_DYNAMIC => "DYNAMIC", |
| 913 | | elf.PT_INTERP => "INTERP", |
| 914 | | elf.PT_NOTE => "NOTE", |
| 915 | | elf.PT_SHLIB => "SHLIB", |
| 916 | | elf.PT_PHDR => "PHDR", |
| 917 | | elf.PT_TLS => "TLS", |
| 918 | | elf.PT_NUM => "NUM", |
| 919 | | elf.PT_GNU_EH_FRAME => "GNU_EH_FRAME", |
| 920 | | elf.PT_GNU_STACK => "GNU_STACK", |
| 921 | | elf.PT_GNU_RELRO => "GNU_RELRO", |
| 922 | | else => "UNKNOWN", |
| 1207 | const p_type = switch (ph_type) { |
| 1208 | elf.PT_NULL => "NULL", |
| 1209 | elf.PT_LOAD => "LOAD", |
| 1210 | elf.PT_DYNAMIC => "DYNAMIC", |
| 1211 | elf.PT_INTERP => "INTERP", |
| 1212 | elf.PT_NOTE => "NOTE", |
| 1213 | elf.PT_SHLIB => "SHLIB", |
| 1214 | elf.PT_PHDR => "PHDR", |
| 1215 | elf.PT_TLS => "TLS", |
| 1216 | elf.PT_NUM => "NUM", |
| 1217 | elf.PT_GNU_EH_FRAME => "GNU_EH_FRAME", |
| 1218 | elf.PT_GNU_STACK => "GNU_STACK", |
| 1219 | elf.PT_GNU_RELRO => "GNU_RELRO", |
| 1220 | else => if (elf.PT_LOOS <= ph_type and ph_type < elf.PT_HIOS) { |
| 1221 | return try writer.print("LOOS+0x{x}", .{ph_type - elf.PT_LOOS}); |
| 1222 | } else if (elf.PT_LOPROC <= ph_type and ph_type < elf.PT_HIPROC) { |
| 1223 | return try writer.print("LOPROC+0x{x}", .{ph_type - elf.PT_LOPROC}); |
| 1224 | } else "UNKNOWN", |
| 1225 | }; |
| 1226 | try writer.writeAll(p_type); |
| 1227 | } |
| 1228 | |
| 1229 | fn dumpSymtab(ctx: Context, comptime @"type": enum { symtab, dysymtab }, writer: anytype) !void { |
| 1230 | const symtab = switch (@"type") { |
| 1231 | .symtab => ctx.symtab, |
| 1232 | .dysymtab => ctx.dysymtab, |
| 1233 | } orelse return; |
| 1234 | |
| 1235 | try writer.writeAll(switch (@"type") { |
| 1236 | .symtab => symtab_label, |
| 1237 | .dysymtab => dynamic_symtab_label, |
| 1238 | } ++ "\n"); |
| 1239 | |
| 1240 | for (symtab.symbols, 0..) |sym, index| { |
| 1241 | try writer.print("{x} {x}", .{ sym.st_value, sym.st_size }); |
| 1242 | |
| 1243 | { |
| 1244 | if (elf.SHN_LORESERVE <= sym.st_shndx and sym.st_shndx < elf.SHN_HIRESERVE) { |
| 1245 | if (elf.SHN_LOPROC <= sym.st_shndx and sym.st_shndx < elf.SHN_HIPROC) { |
| 1246 | try writer.print(" LO+{d}", .{sym.st_shndx - elf.SHN_LOPROC}); |
| 1247 | } else { |
| 1248 | const sym_ndx = &switch (sym.st_shndx) { |
| 1249 | elf.SHN_ABS => "ABS", |
| 1250 | elf.SHN_COMMON => "COM", |
| 1251 | elf.SHN_LIVEPATCH => "LIV", |
| 1252 | else => "UNK", |
| 1253 | }; |
| 1254 | try writer.print(" {s}", .{sym_ndx}); |
| 1255 | } |
| 1256 | } else if (sym.st_shndx == elf.SHN_UNDEF) { |
| 1257 | try writer.writeAll(" UND"); |
| 1258 | } else { |
| 1259 | try writer.print(" {x}", .{sym.st_shndx}); |
| 1260 | } |
| 1261 | } |
| 1262 | |
| 1263 | blk: { |
| 1264 | const tt = sym.st_type(); |
| 1265 | const sym_type = switch (tt) { |
| 1266 | elf.STT_NOTYPE => "NOTYPE", |
| 1267 | elf.STT_OBJECT => "OBJECT", |
| 1268 | elf.STT_FUNC => "FUNC", |
| 1269 | elf.STT_SECTION => "SECTION", |
| 1270 | elf.STT_FILE => "FILE", |
| 1271 | elf.STT_COMMON => "COMMON", |
| 1272 | elf.STT_TLS => "TLS", |
| 1273 | elf.STT_NUM => "NUM", |
| 1274 | elf.STT_GNU_IFUNC => "IFUNC", |
| 1275 | else => if (elf.STT_LOPROC <= tt and tt < elf.STT_HIPROC) { |
| 1276 | break :blk try writer.print(" LOPROC+{d}", .{tt - elf.STT_LOPROC}); |
| 1277 | } else if (elf.STT_LOOS <= tt and tt < elf.STT_HIOS) { |
| 1278 | break :blk try writer.print(" LOOS+{d}", .{tt - elf.STT_LOOS}); |
| 1279 | } else "UNK", |
| 1280 | }; |
| 1281 | try writer.print(" {s}", .{sym_type}); |
| 1282 | } |
| 1283 | |
| 1284 | blk: { |
| 1285 | const bind = sym.st_bind(); |
| 1286 | const sym_bind = switch (bind) { |
| 1287 | elf.STB_LOCAL => "LOCAL", |
| 1288 | elf.STB_GLOBAL => "GLOBAL", |
| 1289 | elf.STB_WEAK => "WEAK", |
| 1290 | elf.STB_NUM => "NUM", |
| 1291 | else => if (elf.STB_LOPROC <= bind and bind < elf.STB_HIPROC) { |
| 1292 | break :blk try writer.print(" LOPROC+{d}", .{bind - elf.STB_LOPROC}); |
| 1293 | } else if (elf.STB_LOOS <= bind and bind < elf.STB_HIOS) { |
| 1294 | break :blk try writer.print(" LOOS+{d}", .{bind - elf.STB_LOOS}); |
| 1295 | } else "UNKNOWN", |
| 1296 | }; |
| 1297 | try writer.print(" {s}", .{sym_bind}); |
| 1298 | } |
| 1299 | |
| 1300 | const sym_vis = @as(elf.STV, @enumFromInt(sym.st_other)); |
| 1301 | try writer.print(" {s}", .{@tagName(sym_vis)}); |
| 1302 | |
| 1303 | const sym_name = switch (sym.st_type()) { |
| 1304 | elf.STT_SECTION => getSectionName(ctx, sym.st_shndx), |
| 1305 | else => symtab.getName(index).?, |
| 923 | 1306 | }; |
| 924 | | try writer.writeAll(p_type); |
| 1307 | try writer.print(" {s}\n", .{sym_name}); |
| 925 | 1308 | } |
| 926 | 1309 | } |
| 927 | 1310 | }; |
| ... | ... | @@ -929,12 +1312,8 @@ const ElfDumper = struct { |
| 929 | 1312 | const WasmDumper = struct { |
| 930 | 1313 | const symtab_label = "symbols"; |
| 931 | 1314 | |
| 932 | | fn parseAndDump(step: *Step, bytes: []const u8, opts: Opts) ![]const u8 { |
| 1315 | fn parseAndDump(step: *Step, bytes: []const u8) ![]const u8 { |
| 933 | 1316 | const gpa = step.owner.allocator; |
| 934 | | if (opts.dump_symtab) { |
| 935 | | @panic("TODO: Implement symbol table parsing and dumping"); |
| 936 | | } |
| 937 | | |
| 938 | 1317 | var fbs = std.io.fixedBufferStream(bytes); |
| 939 | 1318 | const reader = fbs.reader(); |
| 940 | 1319 | |