1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
|
#include "tagTracker.h"
#include "list.h"
#include "log.h"
#include <assert.h>
static List * tagLists[TAG_NUM_OF_ITEM_TYPES] =
{
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL
};
char * getTagItemString(int type, char * string) {
ListNode * node;
if(type == TAG_ITEM_TITLE) return strdup(string);
if(tagLists[type] == NULL) {
tagLists[type] = makeList(free);
}
if((node = findNodeInList(tagLists[type], string))) {
(*((int *)node->data))++;
}
else {
int * intPtr = malloc(sizeof(int));
*intPtr = 1;
node = insertInList(tagLists[type], string, intPtr);
}
return node->key;
}
void removeTagItemString(int type, char * string) {
ListNode * node;
assert(string);
if(type == TAG_ITEM_TITLE) {
free(string);
return;
}
assert(tagLists[type]);
if(tagLists[type] == NULL) return;
node = findNodeInList(tagLists[type], string);
assert(node);
if(node) {
int * countPtr = node->data;
(*countPtr)--;
if(*countPtr <= 0) deleteNodeFromList(tagLists[type], node);
}
if(tagLists[type]->numberOfNodes == 0) {
freeList(tagLists[type]);
tagLists[type] = NULL;
}
}
int getNumberOfTagItems(int type) {
if(tagLists[type] == NULL) return 0;
return tagLists[type]->numberOfNodes;
}
void printMemorySavedByTagTracker() {
int i;
ListNode * node;
size_t sum = 0;
for(i = 0; i < TAG_NUM_OF_ITEM_TYPES; i++) {
if(!tagLists[i]) continue;
sum -= sizeof(List);
node = tagLists[i]->firstNode;
while(node != NULL) {
sum -= sizeof(ListNode);
sum -= sizeof(int);
sum -= sizeof(node->key);
sum += (strlen(node->key)+1)*(*((int *)node->data));
node = node->nextNode;
}
}
DEBUG("saved memory: %li\n", (long)sum);
}
void sortTagTrackerInfo() {
int i;
for(i = 0; i < TAG_NUM_OF_ITEM_TYPES; i++) {
if(!tagLists[i]) continue;
sortList(tagLists[i]);
}
}
|
