Changeset 2962 for trunk/src/opengl/mesa/hash.c

Timestamp:

Mar 1, 2000, 7:50:02 PM (25 years ago)

Author:

jeroen

Message:

* empty log message *

File:

• trunk/src/opengl/mesa/hash.c (modified) (7 diffs)

trunk/src/opengl/mesa/hash.c

@@ -1 @@
-/* $Id: hash.c,v 1.1 2000-02-29 00:50:04 sandervl Exp $ */
+/* $Id: hash.c,v 1.2 2000-03-01 18:49:29 jeroen Exp $ */
 
 /*
@@ -85 +85 @@
       struct HashEntry *entry = table->Table[i];
       while (entry) {
-         struct HashEntry *next = entry->Next;
-         FREE(entry);
-         entry = next;
+         struct HashEntry *next = entry->Next;
+         FREE(entry);
+         entry = next;
       }
    }
@@ -106 +106 @@
    const struct HashEntry *entry;
 
-   assert(table);
+/* assert(table);
    assert(key);
-
+*/
    pos = key & (TABLE_SIZE-1);
    entry = table->Table[pos];
    while (entry) {
       if (entry->Key == key) {
-         return entry->Data;
+         return entry->Data;
       }
       entry = entry->Next;
@@ -146 +146 @@
       if (entry->Key == key) {
          /* replace entry's data */
-         entry->Data = data;
-         return;
+         entry->Data = data;
+         return;
       }
       entry = entry->Next;
@@ -188 +188 @@
          }
          FREE(entry);
-         return;
+         return;
       }
       prev = entry;
@@ -225 +225 @@
       const struct HashEntry *entry = table->Table[i];
       while (entry) {
-         printf("%u %p\n", entry->Key, entry->Data);
-         entry = entry->Next;
+         printf("%u %p\n", entry->Key, entry->Data);
+         entry = entry->Next;
       }
    }
@@ -252 +252 @@
       GLuint key;
       for (key=0; key!=maxKey; key++) {
-         if (HashLookup(table, key)) {
-            /* darn, this key is already in use */
-            freeCount = 0;
-            freeStart = key+1;
-         }
-         else {
-            /* this key not in use, check if we've found enough */
-            freeCount++;
-            if (freeCount == numKeys) {
-               return freeStart;
-            }
-         }
+         if (HashLookup(table, key)) {
+            /* darn, this key is already in use */
+            freeCount = 0;
+            freeStart = key+1;
+         }
+         else {
+            /* this key not in use, check if we've found enough */
+            freeCount++;
+            if (freeCount == numKeys) {
+               return freeStart;
+            }
+         }
       }
       /* cannot allocate a block of numKeys consecutive keys */