/* Calculate a hash key using a fast hash function that works well for low hash table fill.  */
static unsigned long xmlDictComputeFastKey(const xmlChar *name, int namelen, int seed)
/* Calculate a hash key using a fast hash function that works well for low hash table fill.  */
static unsigned long xmlDictComputeFastKey(const xmlChar *name, int namelen, int seed)
{
        value += name[namelen - 1];
        namelen = 10;
    }
    switch (namelen) {
        case 10: value += name[9];
        case 9: value += name[8];
        case 8: value += name[7];
        case 7: value += name[6];
        case 6: value += name[5];
        case 5: value += name[4];
        case 4: value += name[3];
        case 3: value += name[2];
        case 2: value += name[1];
        default: break;
    }
    return(value);
}