Changeset b72efe8 in mainline for uspace/lib/c/generic/adt/hash_table.c

Timestamp:

2011-06-19T14:38:59Z (13 years ago)

Author:

Jiri Svoboda <jiri@…>

Branches:

lfn, master, serial, ticket/834-toolchain-update, topic/msim-upgrade, topic/simplify-dev-export

Children:

74464e8

Parents:

1d1bb0f

Message:

Separate list_t typedef from link_t (user-space part).

• list_t represents lists
• Use list_first(), list_last(), list_empty() where appropriate
• Use list_foreach() where possible
• assert_link_not_used()
• usb_hid_report_path_free() shall not unlink the path, caller must do it

File:

• uspace/lib/c/generic/adt/hash_table.c (modified) (5 diffs)

uspace/lib/c/generic/adt/hash_table.c

@@ -61 +61 @@
         assert(max_keys > 0);
         
-        h->entry = malloc(m * sizeof(link_t));
+        h->entry = malloc(m * sizeof(list_t));
         if (!h->entry)
                 return false;
         
-        memset((void *) h->entry, 0,  m * sizeof(link_t));
+        memset((void *) h->entry, 0,  m * sizeof(list_t));
         
         hash_count_t i;
@@ -123 +123 @@
         assert(chain < h->entries);
         
-        link_t *cur;
-        for (cur = h->entry[chain].next; cur != &h->entry[chain];
-            cur = cur->next) {
+        list_foreach(h->entry[chain], cur) {
                 if (h->op->compare(key, h->max_keys, cur)) {
                         /*
@@ -153 +151 @@
         assert(keys <= h->max_keys);
         
-        link_t *cur;
-        
         if (keys == h->max_keys) {
+                link_t *cur;
+                
                 /*
                  * All keys are known, hash_table_find() can be used to find the
@@ -176 +174 @@
         hash_index_t chain;
         for (chain = 0; chain < h->entries; chain++) {
-                for (cur = h->entry[chain].next; cur != &h->entry[chain];
+                link_t *cur;
+                
+                for (cur = h->entry[chain].head.next; cur != &h->entry[chain].head;
                     cur = cur->next) {
                         if (h->op->compare(key, keys, cur)) {
@@ -203 +203 @@
 {
         hash_index_t bucket;
-        link_t *cur;
         
         for (bucket = 0; bucket < h->entries; bucket++) {
-                for (cur = h->entry[bucket].next; cur != &h->entry[bucket];
-                    cur = cur->next) {
+                list_foreach(h->entry[bucket], cur) {
                         f(cur, arg);
                 }