Rechreche d'un mot a base de hachage

#include <stdio.h>
#include <stdlib.h>

typedef struct{
    unsigned short int usit[0xFFFF][1];
}PSHT;

unsigned short int getCode(const char *s){
    unsigned short int h,x;
    union{
        unsigned short int usi;
        char c[2];
    }cv;
    x=0x1021; cv.usi=h=0;
    while(*s){
        if(!cv.c[0]) cv.c[0]=*s;
        else cv.c[1]=*s;
        if(cv.c[1]||!s[1]){
            h^=cv.usi^x;
            cv.usi=0;
        }
        s++;
    }
    return h;
}

PSHT *getFilePSHT(const char *path){
    FILE *f;
    char buff[256],mot[32];
    char *cban="\r\n\t ,.?!:;()[]{}<>\\\"";
    PSHT *psht;
    int i,iban,r,z=0;
    psht=malloc(sizeof(PSHT));
    if(!psht)exit(1);
    for(i=0;i<0xFFFF;i++)*psht->usit[i]=0;
    f=fopen(path,"rb");
    if(f){
        while((r=fread(buff,sizeof(char),256,f))){
            for(i=0;i<r;i++){
                for(iban=0;cban[iban];iban++)
                    if(buff[i]==cban[iban]){
                        iban=-1; break;
                    }
                if(iban>-1&&z<32){
                    mot[z]=buff[i];
                    z++;
                } else if(mot[z-1]){
                    mot[z]='\0';
                    printf("mot : %s | code : %d\n",mot,getCode(mot));
                    *psht->usit[getCode(mot)]=1;
                    z=0;
                }
            }
        }
        fclose(f);
    }else fprintf(stderr,"erreur fopen\n");
    return psht;
}

int psht_lfw(const char *word,PSHT *psht){
        return *psht->usit[getCode(word)];
}

int main(void){
    PSHT *psht;
    psht=getFilePSHT("fichier.txt");
    if(psht_lfw("voiture",psht))
        printf("le mot existe\n");
    else printf("le mot n'existe pas\n");
    free(psht);
    return 0;
}