comparison ListOfArrays.c @ 4:53df05eb8d43

clean up debugging fns
author Nina Engelhardt <nengel@mailbox.tu-berlin.de>
date Wed, 21 Dec 2011 16:55:02 +0100
parents ef1712d6d7d8
children 79982974d355
comparison
equal deleted inserted replaced
2:3c0d10426c6c 3:ab4ce76026da
3 #include "../vmalloc.h" 3 #include "../vmalloc.h"
4 4
5 ListOfArrays* makeListOfArrays(size_t entry_size, int num_entries_per_block){ 5 ListOfArrays* makeListOfArrays(size_t entry_size, int num_entries_per_block){
6 ListOfArrays* newLoA = (ListOfArrays*) VMS__malloc(sizeof(ListOfArrays)); 6 ListOfArrays* newLoA = (ListOfArrays*) VMS__malloc(sizeof(ListOfArrays));
7 newLoA->dim1info = makePrivDynArrayOfSize(&(newLoA->dim1),8); 7 newLoA->dim1info = makePrivDynArrayOfSize(&(newLoA->dim1),8);
8 8
9
10 newLoA->entry_size = entry_size; 9 newLoA->entry_size = entry_size;
11 newLoA->num_entries_per_fragment = num_entries_per_block; 10 newLoA->num_entries_per_fragment = num_entries_per_block;
12 newLoA->next_free_index = 0; 11 newLoA->next_free_index = 0;
13 12
14 return newLoA; 13 return newLoA;
27 if (n >= 0){ 26 if (n >= 0){
28 for(p = (uintptr_t)(list->dim1)[n]; p < (uintptr_t)(list->dim1)[n] + offset_in_last * list->entry_size; p += list->entry_size){ 27 for(p = (uintptr_t)(list->dim1)[n]; p < (uintptr_t)(list->dim1)[n] + offset_in_last * list->entry_size; p += list->entry_size){
29 (*fnPtr)((void*)p); 28 (*fnPtr)((void*)p);
30 } 29 }
31 } 30 }
31 }
32
33 void freeListOfArrays(ListOfArrays* list){
34 freeDynArrayDeep(list->dim1info,&VMS__free);
35 VMS__free((void*)list);
32 } 36 }
33 37
34 /* 38 /*
35 void addToListOfArraysDependency(Dependency value, ListOfArrays* list){ 39 void addToListOfArraysDependency(Dependency value, ListOfArrays* list){
36 int offset_in_fragment = list->next_free_index % list->num_entries_per_fragment; 40 int offset_in_fragment = list->next_free_index % list->num_entries_per_fragment;