aboutsummaryrefslogtreecommitdiffstats
path: root/mps/code/table.c
diff options
context:
space:
mode:
authorNick Barnes2001-12-17 15:18:17 +0000
committerNick Barnes2001-12-17 15:18:17 +0000
commitdb4b3a6fa51ea452f62ed64612da5466d7bc292e (patch)
tree4401c0c97d4df2e1c48ad06f263c27199e92d5dc /mps/code/table.c
parentc864931fe4271b6592ca4a76ce856938d263c74a (diff)
downloademacs-db4b3a6fa51ea452f62ed64612da5466d7bc292e.tar.gz
emacs-db4b3a6fa51ea452f62ed64612da5466d7bc292e.zip
Remove trailing whitespace.
Copied from Perforce Change: 25309 ServerID: perforce.ravenbrook.com
Diffstat (limited to 'mps/code/table.c')
-rw-r--r--mps/code/table.c8
1 files changed, 4 insertions, 4 deletions
diff --git a/mps/code/table.c b/mps/code/table.c
index f793c4d7d90..4e56f64725e 100644
--- a/mps/code/table.c
+++ b/mps/code/table.c
@@ -80,7 +80,7 @@ static TableEntry TableFind(Table table, Word key, int skip_deleted)
80{ 80{
81 ulong hash; 81 ulong hash;
82 size_t i, mask = table->length - 1; 82 size_t i, mask = table->length - 1;
83 83
84 hash = TableHash(key) & mask; 84 hash = TableHash(key) & mask;
85 i = hash; 85 i = hash;
86 do { 86 do {
@@ -122,7 +122,7 @@ static Res TableGrow(Table table)
122 newArray[i].value = NULL; 122 newArray[i].value = NULL;
123 newArray[i].status = tableUNUSED; 123 newArray[i].status = tableUNUSED;
124 } 124 }
125 125
126 table->length = newLength; 126 table->length = newLength;
127 table->array = newArray; 127 table->array = newArray;
128 table->limit *= 2; 128 table->limit *= 2;
@@ -167,7 +167,7 @@ extern Res TableCreate(Table *tableReturn, size_t length)
167 table->array[i].value = NULL; 167 table->array[i].value = NULL;
168 table->array[i].status = tableUNUSED; 168 table->array[i].status = tableUNUSED;
169 } 169 }
170 170
171 *tableReturn = table; 171 *tableReturn = table;
172 return ResOK; 172 return ResOK;
173 173
@@ -237,7 +237,7 @@ extern Res TableDefine(Table table, Word key, void *value)
237extern Res TableRedefine(Table table, Word key, void *value) 237extern Res TableRedefine(Table table, Word key, void *value)
238{ 238{
239 TableEntry entry = TableFind(table, key, 1 /* skip deletions */); 239 TableEntry entry = TableFind(table, key, 1 /* skip deletions */);
240 240
241 if (entry == NULL || entry->status != tableACTIVE) 241 if (entry == NULL || entry->status != tableACTIVE)
242 return ResFAIL; 242 return ResFAIL;
243 assert(entry->key == key); 243 assert(entry->key == key);