struct nlist *install ( char *name, char *defn )
{
struct nlist *np ;
unsigned hashval ;
if ( ( np = lookup ( name ) ) == NULL ) {
np = ( struct nlist * ) malloc ( sizeof ( *np ) ) ;
if ( np == NULL || ( np->name = strdupp ( name ) ) == NULL )
return NULL ;
hashval = hash ( name ) ;
np->next = hashtab[ hashval ] ;
hashtab[ hashval ] = np ;
} else
free ( ( void * ) np->defn ) ;
if ( ( np->defn = strdupp ( defn ) ) == NULL )
return NULL ;
return np ;
}
int main(int argc, char *argv[])
{
char word[MAXWORD];
if (argc != 2) {
printf("please enter the file name!\n");
return -1;
}
char *filename;
filename = argv[1];
FILE * fp;
if ((fp = fopen(filename, "r")) == NULL) {
printf("file is not exist!\n");
return -1;
}
char buffer[4096]; //how dirty it is..
int i = 0;
while (!feof(fp)) {
buffer[i++] = fgetc(fp);
}
/**
* that is the problem in func void ungets(char s[]) : int len = strlen(s);
* pay attention !!!!! the EOF will store in the buffer[i - 1], replace it with '\0'
*/
buffer[i - 1] = '\0';
fclose(fp);
ungetch(EOF); //it is necessary!
ungets(buffer);
int linenow = 1;
struct nlist *node;
struct nlist *node_parent;
while (getword(word, MAXWORD) != EOF) {
if ((word[0] == '\n')) {
linenow++;
}
if (word[1] == '\0' && !isalpha(word[0])) { //caocaocao == is not =
continue;
}
int hash_key = simple_hash(word, HASHSIZE);
node = hashtab[hash_key];
int is_node_exist = 0;
while (node != NULL) {
if (strcmp(node->name, word) == 0) {
is_node_exist = 1;
node->lines[node->linecount++] = linenow;
break;
}
node_parent = node;
node = node->next;
}
if (!is_node_exist) {
node = talloc();
node->next = NULL;
node->name = strdupp(word);
node->linecount = 0;
node->lines[node->linecount++] = linenow;
//the implement is dirty, how can I keep the consistency?
if (hashtab[hash_key] == NULL) {
hashtab[hash_key] = node;
} else {
node_parent->next = node;
}
}
}
for (i = 0; i < HASHSIZE; i++) {
node = hashtab[i];
while (node != NULL) {
printf("%s:", node->name);
int count = node->linecount;
while (count--) {
printf(" %d", node->lines[count]);
}
printf("\n");
node = node->next;
}
}
return 0;
}
