Lines Matching refs:more
36 * The basic idea is that each mapping is on one or more singly-linked lists, sorted
97 * We return the mapping ptr (or 0) in r3, and the next VA (or 0 if no more) in r4 and r5.
332 * We return the mapping ptr (or 0) in r3, and the next VA (or 0 if no more) in r4 and r5.
558 sub. r6,r9,r7 ; is this mapping on more lists than any other?
583 bdnzt cr0_eq,mapIns64NewList ; loop if more lists to initialize and list hdr was 0
597 cmpwi cr1,r8,0 ; more to go?
603 bne++ cr1,mapIns64a ; more lists to go
607 ; iff the new mapping has more lists. Since mapSearchFull() only sets up the first
624 bdnzt cr0_eq,mapIns32NewList ; loop if more lists to initialize and list hdr was 0
638 cmpwi cr1,r8,0 ; more to go?
644 bne+ cr1,mapIns32a ; more lists to go
698 cmpwi cr1,r8,0 ; more to go?
715 bgt mapRem64b ; loop to see if more than one list was emptied
732 cmpwi cr1,r8,0 ; more to go?
749 bgt mapRem32b ; loop to see if more than one list was emptied
764 * This seems to give us a near perfect distribution, in the sense that about F times more nodes
778 * mappings in the pmap. To avoid this common situation, we clamp the list count to be no more
825 * You will notice we make little attempt to schedule the code; clarity is deemed more
1107 bne++ mapVer64c ; loop if more to go
1109 ; Next node on current list, or next list if current done, or return if no more lists.
1230 bne+ mapVer32c ; loop if more to go
1232 ; Next node on current list, or next list if current done, or return if no more lists.
1255 cmplwi r24,mpBasicLists ; Do we have more than basic?
1265 bgt+ mapVerUpper1 ; loop if more to go