mirror of
https://github.com/RGBCube/serenity
synced 2025-07-25 19:17:44 +00:00
AK+Kernel+LibELF: Remove the need for IteratorDecision::Continue
By constraining two implementations, the compiler will select the best fitting one. All this will require is duplicating the implementation and simplifying for the `void` case. This constraining also informs both the caller and compiler by passing the callback parameter types as part of the constraint (e.g.: `IterationFunction<int>`). Some `for_each` functions in LibELF only take functions which return `void`. This is a minimal correctness check, as it removes one way for a function to incompletely do something. There seems to be a possible idiom where inside a lambda, a `return;` is the same as `continue;` in a for-loop.
This commit is contained in:
parent
bbaa463032
commit
aa4d41fe2c
25 changed files with 311 additions and 127 deletions
|
@ -172,7 +172,7 @@ static KResultOr<RequiredLoadRange> get_required_load_range(FileDescription& pro
|
|||
RequiredLoadRange range {};
|
||||
elf_image.for_each_program_header([&range](const auto& pheader) {
|
||||
if (pheader.type() != PT_LOAD)
|
||||
return IterationDecision::Continue;
|
||||
return;
|
||||
|
||||
auto region_start = (FlatPtr)pheader.vaddr().as_ptr();
|
||||
auto region_end = region_start + pheader.size_in_memory();
|
||||
|
@ -180,7 +180,6 @@ static KResultOr<RequiredLoadRange> get_required_load_range(FileDescription& pro
|
|||
range.start = region_start;
|
||||
if (range.end == 0 || region_end > range.end)
|
||||
range.end = region_end;
|
||||
return IterationDecision::Continue;
|
||||
});
|
||||
|
||||
VERIFY(range.end > range.start);
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue