#define KeyType ir_node*
#define ConstKeyType const ir_node*
#define GetKey(entry) (entry).value
-#define InitData(self,entry,key) do { (entry).value = (key); (entry).list.next = NULL; (entry).list.prev = NULL; } while(0)
+#define InitData(self,entry,key) do { (entry).value = (key); (entry).list.next = NULL; (entry).list.prev = NULL; } while (0)
#define Hash(self,key) ir_node_hash(key)
#define KeysEqual(self,key1,key2) (key1) == (key2)
#define SetRangeEmpty(ptr,size) memset(ptr, 0, (size) * sizeof((ptr)[0]))
#define EntrySetEmpty(entry) (entry).value = NULL
-#define EntrySetDeleted(entry) do { (entry).data.value = (ir_node*) -1; list_del(&(entry).data.list); } while(0)
+#define EntrySetDeleted(entry) do { (entry).data.value = (ir_node*) -1; list_del(&(entry).data.list); } while (0)
#define EntryIsEmpty(entry) ((entry).data.value == NULL)
#define EntryIsDeleted(entry) ((entry).data.value == (ir_node*)-1)
* Resize the hashset
* @internal
*/
-static
-void resize(HashSet *self, size_t new_size)
+static void resize(HashSet *self, size_t new_size)
{
HashSetEntry *old_entries = self->entries;
HashSetEntry *new_entries;
}
void ir_valueset_iterator_init(ir_valueset_iterator_t *iterator,
- const ir_valueset_t *valueset) {
+ const ir_valueset_t *valueset)
+{
iterator->iter = valueset->elem_list.next;
iterator->valueset = valueset;
}