/********************************************************************* * * Copyright (C) 2003, National ICT Australia (NICTA) * * File path: arch/powerpc64/vsid_asid.cc * Description: PowerPC64 specific reverse lookup ASID management * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. * * $Id: vsid_asid.cc,v 1.5 2004/06/04 03:40:20 cvansch Exp $ * ********************************************************************/ #include INC_ARCH(vsid_asid.h) #include vsid_asid_cache_t vsid_asid_cache; word_t vsid_asid_cache_t::alloc( space_t *space ) { word_t asid = first_free << (VSID_REVERSE_SHIFT + 12); /* SLB entry vsid is shifted by 12 */ if ( first_free < (s64_t)ASID_MAX ) { /* SLB vsid entry format of power4 */ /* | UNIMPL | VSID_ASID | ESID | other bits | */ /* 63 49 40 12 0 */ cache[first_free].asid = asid; cache[first_free].space = space; /* Find the next free ASID */ do { first_free++; } while (( cache[first_free].asid != ASID_INVALID ) && (first_free < (s64_t)ASID_MAX)); } else { /* We need to preempt ASIDs */ UNIMPLEMENTED(); } return asid; } void vsid_asid_cache_t::release( word_t asid ) { word_t entry = asid >> (VSID_REVERSE_SHIFT + 12); cache[ entry ].asid = ASID_INVALID; if ( (s64_t)entry < first_free ) first_free = entry; }