Lines Matching full:secondary
108 and distinguished secondary maps) to avoid the 9-bit-per-byte overhead
133 secondary (second-level) map. Since many of the 64kB chunks will
136 there are three distinguished secondary maps, which indicate 'noaccess',
140 the 'undefined' or 'defined' distinguished secondary map, so it gives a
191 /* --------------- Secondary maps --------------- */
205 // In the "partdefined" case, we use a secondary table to store the V bits.
206 // Each entry in the secondary-V-bits table maps a byte address to its 8 V
280 // 3 distinguished secondary maps, one for no-access, one for
372 value, and sm points at the relevant secondary map. As with the
373 main primary map, the secondary may be either a real secondary, or
416 non-distinguished secondary maps referred to from the auxiliary
581 /* Ok, there's no entry in the secondary map, so we'll have
662 to be able to write it. If it is a distinguished secondary, make a
823 /* --------------- Secondary V bit table ------------ */
1007 // make it to the secondary V bits table.
1019 // make it to the secondary V bits table.
1607 /* Get the distinguished secondary that we might want
1922 /* have to copy secondary map info */
2070 secondary cache (ocacheL2), which is an OSet (AVL tree) of cache
3575 * the address range falls entirely with a single secondary map
3591 single secondary map, and that that secondary 'lives' in
3647 single secondary map, and that that secondary 'lives' in
5318 // be written in the secondary map. V bits can be directly written
5327 // as the secondary vbits table must be maintained).
5575 /* Secondary V bit table */
5639 /* If we're not checking for undefined value errors, the secondary V bit
