Lines Matching refs:one
36 * The basic idea is that each mapping is on one or more singly-linked lists, sorted
56 * 64-byte nodes with 4 list links, and 128-byte nodes with 12. Only one in every
395 bne-- cr0,mapSrchFull64e ; handle mapping larger than one page
478 bne- cr0,mapSrchFull32e ; handle mapping larger than one page
715 bgt mapRem64b ; loop to see if more than one list was emptied
749 bgt mapRem32b ; loop to see if more than one list was emptied
763 * in the pseudo-random sequence, shifted by the (log2-1) of the fanout F, plus one.
767 * At one point we used a simple counter to assign lists. While this gave perfect
771 * but one that works consistently across all known access patterns.
806 addi r3,r11,1 ; every mapping is on at least one list
1115 mr. r26,r26 ; is there one?
1238 mr. r26,r26 ; is there one?