Lines Matching refs:nodes
40 * successive list has only 1/F as many nodes on it as the previous, where F is the
41 * "fanout." With a max of n lists, up to F**n nodes can be handled optimally.
56 * 64-byte nodes with 4 list links, and 128-byte nodes with 12. Only one in every
180 ; r2 = count of nodes visited
188 ; r2 = count of nodes visited
200 add r8,r8,r2 ; count nodes visited
268 ; r2 = count of nodes visited
275 ; r2 = count of nodes visited
288 addc r9,r9,r2 ; count nodes visited
427 ; r2 = count of nodes visited
447 ; r2 = count of nodes visited
510 ; r2 = count of nodes visited
764 * This seems to give us a near perfect distribution, in the sense that about F times more nodes
1055 bltl-- mapVerifyDie ; we have visited > (pmapCurLists*pmapResidentCnt) nodes
1171 bltl- mapVerifyDie ; we have visited > (pmapCurLists*pmapResidentCnt) nodes