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
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
|
#include "iprange.h"
#define IPSET_ENTRIES_INCREASE_STEP 1024
/* ----------------------------------------------------------------------------
* ipset_create()
*
* create an empty ipset with the given name and free entries in its array
*
*/
ipset *ipset_create(const char *filename, size_t entries) {
ipset *ips = malloc(sizeof(ipset));
if(!ips) return NULL;
if(entries < IPSET_ENTRIES_INCREASE_STEP) entries = IPSET_ENTRIES_INCREASE_STEP;
ips->netaddrs = malloc(entries * sizeof(network_addr_t));
if(!ips->netaddrs) {
free(ips);
return NULL;
}
ips->lines = 0;
ips->entries = 0;
ips->entries_max = entries;
ips->unique_ips = 0;
ips->next = NULL;
ips->prev = NULL;
ips->flags = 0;
strncpy(ips->filename, (filename && *filename)?filename:"stdin", FILENAME_MAX);
ips->filename[FILENAME_MAX] = '\0';
/* strcpy(ips->name, ips->filename); */
return ips;
}
/* ----------------------------------------------------------------------------
* ipset_free()
*
* release the memory of an ipset and re-link its siblings so that lingage will
* be consistent
*
*/
void ipset_free(ipset *ips) {
if(ips->next) ips->next->prev = ips->prev;
if(ips->prev) ips->prev->next = ips->next;
free(ips->netaddrs);
free(ips);
}
/* ----------------------------------------------------------------------------
* ipset_free_all()
*
* release all the memory occupied by all ipsets linked together (prev, next)
*
*/
void ipset_free_all(ipset *ips) {
if(ips->prev) {
ips->prev->next = NULL;
ipset_free_all(ips->prev);
}
if(ips->next) {
ips->next->prev = NULL;
ipset_free_all(ips->next);
}
ipset_free(ips);
}
void ipset_grow_internal(ipset *ips, size_t free_entries_needed) {
// make sure we allocate at least IPSET_ENTRIES_INCREASE_STEP entries
ips->entries_max += (free_entries_needed < IPSET_ENTRIES_INCREASE_STEP)?IPSET_ENTRIES_INCREASE_STEP:free_entries_needed;
ips->netaddrs = realloc(ips->netaddrs, ips->entries_max * sizeof(network_addr_t));
if(unlikely(!ips->netaddrs)) {
fprintf(stderr, "%s: Cannot re-allocate memory (%zu bytes)\n", PROG, ips->entries_max * sizeof(network_addr_t));
exit(1);
}
}
inline size_t ipset_unique_ips(ipset *ips) {
if(unlikely(!(ips->flags & IPSET_FLAG_OPTIMIZED)))
ipset_optimize(ips);
return(ips->unique_ips);
}
/* ----------------------------------------------------------------------------
* ipset_histogram()
*
* generate histogram for ipset
*
*/
/*
int ipset_histogram(ipset *ips, const char *path) {
make sure the path exists
if this is the first time:
- create a directory for this ipset, in path
- create the 'new' directory inside this ipset path
- assume the 'latest' is empty
- keep the starting date
- print an empty histogram
save in 'new' the IPs of current excluding the 'latest'
save 'current' as 'latest'
assume the histogram is complete
for each file in 'new'
- if the file is <= to histogram start date, the histogram is incomplete
- calculate the hours passed to the 'current'
- find the IPs in this file common to 'current' = 'stillthere'
- find the IPs in this file not in 'stillthere' = 'removed'
- if there are IPs in 'removed', add an entry to the retention histogram
- if there are no IPs in 'stillthere', delete the file
- else replace the file with the contents of 'stillthere'
return 0;
}
*/
|
