[anchao]

Summary

Fix the pool selection logic in multiple mempool lookup for non-linear pool
size classes.

For multiple mempools without a fixed arithmetic size delta, the lookup uses a
binary search to find the first pool that can satisfy the requested allocation
size. The previous comparison only accepted pools whose block size was strictly
greater than the requested size, so an exact-size request skipped the matching
pool and selected the next larger pool instead.

This changes the binary search condition from > to >=, making it a proper
lower-bound lookup. Exact-size requests are now served by the matching pool.

Impact

This fixes allocation behavior for multiple mempools using non-linear block
sizes.

Expected impact:

• exact-size allocation requests use the correctly matching pool
• avoids unnecessary use of the next larger pool
• reduces internal waste for exact-size requests
• preserves existing behavior for requests between two pool sizes
• no API, ABI, build-system, documentation, or security impact is expected

Testing

sim/nsh

[github-actions]

MemBrowse Memory Report · Explore what changed →

No memory changes detected for:

• arduino-mega2560
• esp32-devkitc
• hifive1-revb
• mirtoo
• qemu-armv8a
• qemu-intel64
• rx65n-rsk2mb
• s698pm-dkit
• stm32-nucleo-f103rb

---

_{Catch memory regressions in CI with MemBrowse. Free for open source.}