Lines Matching full:secondary
110 and distinguished secondary maps) to avoid the 9-bit-per-byte overhead
135 secondary (second-level) map. Since many of the 64kB chunks will
138 there are three distinguished secondary maps, which indicate 'noaccess',
142 the 'undefined' or 'defined' distinguished secondary map, so it gives a
193 /* --------------- Secondary maps --------------- */
207 // In the "partdefined" case, we use a secondary table to store the V bits.
208 // Each entry in the secondary-V-bits table maps a byte address to its 8 V
282 // 3 distinguished secondary maps, one for no-access, one for
374 value, and sm points at the relevant secondary map. As with the
375 main primary map, the secondary may be either a real secondary, or
418 non-distinguished secondary maps referred to from the auxiliary
583 /* Ok, there's no entry in the secondary map, so we'll have
665 to be able to write it. If it is a distinguished secondary, make a
826 /* --------------- Secondary V bit table ------------ */
981 // make it to the secondary V bits table.
993 // make it to the secondary V bits table.
1341 /* Get the distinguished secondary that we might want
1643 /* have to copy secondary map info */
1791 secondary cache (ocacheL2), which is an OSet (AVL tree) of cache
3298 * the address range falls entirely with a single secondary map
3314 single secondary map, and that that secondary 'lives' in
3370 single secondary map, and that that secondary 'lives' in
4644 /* Secondary V bit table */
4708 /* If we're not checking for undefined value errors, the secondary V bit
