summaryrefslogtreecommitdiff
path: root/libobjc/hash.c
diff options
context:
space:
mode:
authorshebs <shebs@138bc75d-0d04-0410-961f-82ee72b054a4>2002-07-02 19:43:03 +0000
committershebs <shebs@138bc75d-0d04-0410-961f-82ee72b054a4>2002-07-02 19:43:03 +0000
commit617763557711795ccc8087e4c7af30832f1af171 (patch)
tree8f207ea088d819aa3e3ed4230231f34c706b6e54 /libobjc/hash.c
parent894a031dc687848ac0c10c9e00a201f870b3179a (diff)
downloadgcc-617763557711795ccc8087e4c7af30832f1af171.tar.gz
2002-07-02 Rodney Brown <rbrown64@csc.com.au>
* objc/encoding.h: Fix formatting. * objc/hash.h: Likewise. * objc/objc-api.h: Likewise. * objc/runtime.h: Likewise. * objc/thr.h: Likewise. * archive.c: Likewise. * class.c: Likewise. * encoding.c: Likewise. * gc.c: Likewise. * hash.c: Likewise. * init.c: Likewise. * misc.c: Likewise. * nil_method.c: Likewise. * objects.c: Likewise. * sarray.c: Likewise. * selector.c: Likewise. * sendmsg.c: Likewise. * thr-mach.c: Likewise. * thr.c: Likewise. git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@55190 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'libobjc/hash.c')
-rw-r--r--libobjc/hash.c8
1 files changed, 4 insertions, 4 deletions
diff --git a/libobjc/hash.c b/libobjc/hash.c
index 223991f97f3..2f58b2c5472 100644
--- a/libobjc/hash.c
+++ b/libobjc/hash.c
@@ -47,7 +47,7 @@ hash_new (unsigned int size, hash_func_type hash_func,
/* Pass me a value greater than 0 and a power of 2. */
assert (size);
- assert (!(size & (size - 1)));
+ assert (! (size & (size - 1)));
/* Allocate the cache structure. calloc insures
its initialization for default values. */
@@ -196,7 +196,7 @@ hash_remove (cache_ptr cache, const void *key)
objc_free(node);
} else
prev = node, node = node->next;
- } while (!removed && node);
+ } while (! removed && node);
assert (removed);
}
@@ -210,7 +210,7 @@ hash_next (cache_ptr cache, node_ptr node)
{
/* If the scan is being started then reset the last node
visitied pointer and bucket index. */
- if (!node)
+ if (! node)
cache->last_bucket = 0;
/* If there is a node visited last then check for another
@@ -258,7 +258,7 @@ hash_value_for_key (cache_ptr cache, const void *key)
break;
} else
node = node->next;
- } while (!retval && node);
+ } while (! retval && node);
return retval;
}