98  * with val.
100 #define declare_initialize_value_pointer_value(name, val) \
102     name.value = val
518     ListNode *current;
520     for (current = head->next; current != head; current = current->next) {
521         if (equal_func(current->value, value)) {
522             *output = current;
670     ListNode *current;
673     current = map_head->next;
674     while (current != map_head) {
675         SymbolMapValue * const value = (SymbolMapValue*)current->value;
676         ListNode * const next = current->next;
695             list_remove_free(current, free_value, NULL);
697         current = next;
708     const ListNode *current;
713     for (current = map_head->next; current != map_head;
714          current = current->next) {
716             (SymbolMapValue*)current->value;
1704 /* Crudely checkpoint the current heap state. */

Indexes created Tue Jul 24 14:28:13 CEST 2018