prenex/simap
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

better this way with assert

Browse Source
This commit is contained in:
Richard Thier 2025-01-27 04:41:26 +01:00
parent 544c920304
commit 219405069c
1 changed files with 2 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
vmap.h
View File

@ -100,7 +100,8 @@ static inline vmap_find_res search_all_vmap(vmap *map, uint32_t key, vmap_find_r
/* Rare edge-case when last lane element was returned and we continue from it */ /* Rare edge-case when last lane element was returned and we continue from it */
/* We should not try lane processing, just jump next level - but only if there */ /* We should not try lane processing, just jump next level - but only if there */
/* is a next level (so last checked lane was totally filled already to full cap. */ /* is a next level (so last checked lane was totally filled already to full cap. */
if((prev.lane_abcd_next > 4) && (prev.last_found_lane_val != 0)) { if(prev.lane_abcd_next > 4) {
assert(prev.last_found_lane_val != 0);
prev = vmap_search_all_begin(); prev = vmap_search_all_begin();
++level; ++level;
/* prev.level = level; // unnecessary, I hand-optimized out */ /* prev.level = level; // unnecessary, I hand-optimized out */