shithub: scc

Info  •  Files  •  Log  •  Branches

Fixed bug inserting in keyword hash

Code tested only that pointer of array hashing was null in order to insert
directly in the queue, but it was falling of testing if first element if bigger than new element, because in this case we were creating a corrupted circular
list

--- a/lex.c

+++ b/lex.c

@@ -78,14 +78,14 @@

 	for (bp = keywords; bp->str; bp++) {

 		register struct keyword *aux, *ant;

 		h = hashfun(bp->str);

-		if (!(aux = khash[h])) {

+		if (!(aux = khash[h]) || strcmp(bp->str, aux->str) < 0) {

 			khash[h] = bp;

+			bp->next = aux;

 			continue;

 		}

-		ant = aux;

-		while (aux && strcmp(bp->str, aux->str) < 0) {

-			ant = aux;

-			aux = aux->next;

+		for (ant = aux; aux; ant = aux, aux = aux->next) {

+			if (strcmp(bp->str, aux->str) < 0)

+				break;

 		}

 		ant->next = bp;

 		bp->next = aux;