Lines Matching refs:so
57 * (4**4)==256 mappings requires the larger node, so the average size is 64.25 bytes.
108 mr r6,r3 ; save pmap ptr here so we can accumulate statistics
123 ; r2 = count of mappings visited so far
145 bne++ mapSrch64a ; was another, so loop
160 ld r4,pmapSkipLists(r6) ; assume prev ptr null... so next is first
204 beqlr- ; next ptr was null, so return 0 in r4 and r5
211 ; r2 = count of mappings visited so far
233 bne+ mapSrch32a ; was another, so loop
248 lwz r4,pmapSkipLists+4(r6) ; assume prev ptr null... so next is first
294 beqlr- ; next ptr was null, so return 0 in r4 and r5
343 mr r6,r3 ; save pmap ptr here so we can accumulate statistics
363 ; r2 = count of mappings visited so far
403 bne++ mapSrchFull64a ; was another, so loop
486 bne+ mapSrchFull32a ; was another, so loop
713 bnelr cr1 ; not null, so we are done
714 stb r10,pmapCurLists(r3) ; was null, so decrement pmapCurLists
747 bnelr cr1 ; not null, so we are done
748 stb r10,pmapCurLists(r3) ; was null, so decrement pmapCurLists
985 mflr r31 ; save LR so we can bl to mapVerifyDie
987 ; If we have already found an inconsistency and died, don not do so again, to
1000 ; Not recursive call, so initialize.
1067 ; Do some additional checks (so we only do them once per mapping.)
1118 bgt++ mapVer64 ; loop if so
1183 ; Do some additional checks (so we only do them once per mapping.)
1241 bgt+ mapVer32NextList ; loop if so