Lines Matching refs:mappings
32 * resident mappings for each pmap. We used to use a much simpler hash-based scheme,
44 * Because the first skip-list is just a sorted list of all mappings, it is also
45 * efficient to purge a sparsely populated pmap of all the mappings in a large range,
55 * 64-bit link fields in every mapping. So we currently have two sizes of mappings:
57 * (4**4)==256 mappings requires the larger node, so the average size is 64.25 bytes.
111 li r2,0 ; initialize count of mappings visited
113 blt-- mapSrchPmapEmpty ; pmapCurLists==0 (ie, no mappings)
123 ; r2 = count of mappings visited so far
135 addi r2,r2,1 ; count mappings visited
153 ; Note the advantage of keeping the check for block mappings (and nested pmaps)
211 ; r2 = count of mappings visited so far
223 addi r2,r2,1 ; count mappings visited
241 ; Note the advantage of keeping the check for block mappings (and nested pmaps)
344 li r2,0 ; initialize count of mappings visited
351 blt-- mapSrchPmapEmpty ; pmapCurLists==0 (ie, no mappings)
363 ; r2 = count of mappings visited so far
376 addi r2,r2,1 ; count mappings visited
431 ; r8 = ptr to prev mappings (ie, r9) skip-list vector
433 ; r10 = prev mappings va
459 addi r2,r2,1 ; count mappings visited
515 ; r10 = prev mappings va
534 * determine that this mapping does not overlap other mappings in the pmap. As a side effect
540 * mapSearchFull has just been called for this mappings key
551 lwz r8,mpFlags(r4) ; get this mappings flags
554 la r11,mpList0+4(r4) ; r11 <-- base of this mappings list vector
591 ; r11 = ptr to base of new mappings list vector
598 la r7,mpList0(r5) ; get base of prev mappings list vector
632 ; r11 = ptr to base of new mappings list vector
639 la r7,mpList0+4(r5) ; get base of prev mappings list vector
659 * mapSearchFull has just been called for this mappings key
670 lwz r8,mpFlags(r4) ; get this mappings flags
672 la r11,mpList0+4(r4) ; r11 <-- base of this mappings list vector
699 la r7,mpList0(r5) ; get base of prev mappings list vector
733 la r7,mpList0+4(r5) ; get base of prev mappings list vector
774 * observation: because VM does a lot of removing and restoring of mappings in the process of
776 * count of created mappings) be much larger than the number of mappings currently in the
778 * mappings in the pmap. To avoid this common situation, we clamp the list count to be no more
790 lwz r4,pmapResidentCnt(r3) ; get number of mappings in this pmap
1005 lwz r21,pmapResidentCnt(r20); get #mappings in this pmap
1010 ; Since we walk each list this is the max number of mappings we could visit.
1023 ; Loop over each list, counting mappings in each. We first check whether or not
1027 ; r21 = decrementing counter of mappings in this pmap
1045 ; r21 = decrementing counter of mappings in this pmap
1060 bltl-- cr1,mapVerifyDie ; mappings mpLists is too low
1062 bgtl-- mapVerifyDie ; mappings mpLists > max
1075 subi r21,r21,1 ; count mappings in this pmap
1082 la r28,mpList0(r26) ; get base of this mappings vector
1093 ; r28 = base of this mappings list links
1101 ld r30,mpVAddr(r29) ; get next mappings va
1112 la r28,mpList0(r26) ; get base of this mappings vector
1120 cmpwi r21,0 ; did we find all the mappings in the pmap?
1135 ; Loop over each list, counting mappings in each. We first check whether or not
1140 ; r21 = decrementing counter of mappings in this pmap
1158 ; r21 = decrementing counter of mappings in this pmap
1176 bltl- cr1,mapVerifyDie ; mappings mpLists is too low
1178 bgtl- mapVerifyDie ; mappings mpLists > max
1191 subi r21,r21,1 ; count mappings in this pmap
1203 la r28,mpList0+4(r26) ; get base of this mappings vector
1211 ; Inner loop over each list in this mappings mpList vector.
1214 ; r28 = base of this mappings list links
1224 lwz r30,mpVAddr+4(r29) ; get next mappings va
1235 la r28,mpList0+4(r26) ; get base of this mappings vector again
1243 cmpwi r21,0 ; did we find all the mappings in the pmap?