(addr, max_slots = 100)
| 448 | } |
| 449 | |
| 450 | function print_object_next(addr, max_slots = 100) { |
| 451 | let obj_addr = find_object_next(addr, max_slots); |
| 452 | if (!obj_addr) { |
| 453 | print( |
| 454 | `No object found within ${max_slots} slots following ${hex(addr)}`); |
| 455 | } |
| 456 | else { |
| 457 | print( |
| 458 | `found object: ${hex(obj_addr + 1)} : ${hex(poim(obj_addr))}`); |
| 459 | } |
| 460 | } |
| 461 | |
| 462 | // This function assumes that pointers to objects are stored at ptr-size aligned |
| 463 | // boundaries. |
nothing calls this directly
no test coverage detected
searching dependent graphs…