| 1 |
|
| #ifndef __DV_BUCKET_C__ |
| 2 |
|
| #define __DV_BUCKET_C__ |
| 3 |
|
| |
| 4 |
|
| #include "dv_bucket.h" |
| 5 |
|
| |
| 6 |
|
| #define DV_1E6 1000000 |
| 7 |
|
| |
| 8 |
|
| static |
| 9 |
|
| double |
| 10 |
0 |
| dv_bucket_timeval2double(struct timeval *tp) |
| 11 |
|
| { |
| 12 |
0 |
| return ((double) tp->tv_sec) * DV_1E6 + tp->tv_usec; |
| 13 |
|
| } |
| 14 |
|
| |
| 15 |
|
| dv_bucket_item * |
| 16 |
0 |
| dv_bucket_item_create(double time) |
| 17 |
|
| { |
| 18 |
|
| dv_bucket_item *item; |
| 19 |
|
| |
| 20 |
0 |
| item = (dv_bucket_item *) malloc( sizeof(dv_bucket_item) ); |
| 21 |
0 |
| item->next = NULL; |
| 22 |
0 |
| item->time = time; |
| 23 |
0 |
| return item; |
| 24 |
|
| } |
| 25 |
|
| |
| 26 |
|
| void |
| 27 |
0 |
| dv_bucket_item_destroy(dv_bucket_item *item) |
| 28 |
|
| { |
| 29 |
0 |
| free(item); |
| 30 |
0 |
| } |
| 31 |
|
| |
| 32 |
|
| dv_bucket* |
| 33 |
0 |
| dv_bucket_create(double interval, unsigned long max, int strict_interval) |
| 34 |
|
| { |
| 35 |
|
| dv_bucket *bucket; |
| 36 |
|
| |
| 37 |
0 |
| bucket = (dv_bucket *) malloc( sizeof(dv_bucket)); |
| 38 |
0 |
| bucket->max = max; |
| 39 |
0 |
| bucket->interval = interval * DV_1E6; |
| 40 |
0 |
| bucket->count = 0; |
| 41 |
0 |
| bucket->strict_interval = strict_interval; |
| 42 |
0 |
| bucket->head = NULL; |
| 43 |
0 |
| bucket->tail = NULL; |
| 44 |
0 |
| return bucket; |
| 45 |
|
| } |
| 46 |
|
| |
| 47 |
|
| long |
| 48 |
0 |
| dv_bucket_max_items(dv_bucket *bucket) |
| 49 |
|
| { |
| 50 |
0 |
| return bucket->max; |
| 51 |
|
| } |
| 52 |
|
| |
| 53 |
|
| double |
| 54 |
0 |
| dv_bucket_interval(dv_bucket *bucket) |
| 55 |
|
| { |
| 56 |
0 |
| double ret = bucket->interval / DV_1E6; |
| 57 |
0 |
| return ret; |
| 58 |
|
| } |
| 59 |
|
| |
| 60 |
|
| long |
| 61 |
0 |
| dv_bucket_count(dv_bucket *bucket) |
| 62 |
|
| { |
| 63 |
0 |
| return bucket->count; |
| 64 |
|
| } |
| 65 |
|
| |
| 66 |
|
| void |
| 67 |
0 |
| dv_bucket_reset(dv_bucket *bucket) |
| 68 |
|
| { |
| 69 |
0 |
| dv_bucket_item *item = bucket->head; |
| 70 |
|
| |
| 71 |
0 |
▶ | while (item) { |
Branch: 1 branch
| Branch | True | False | Total |
| while (item) { |
0 |
0 |
0 |
|
| 72 |
0 |
| dv_bucket_item *tmp = item->next; |
| 73 |
0 |
| dv_bucket_item_destroy(item); |
| 74 |
0 |
| item = tmp; |
| 75 |
|
| } |
| 76 |
|
| |
| 77 |
0 |
| bucket->head = NULL; |
| 78 |
0 |
| bucket->tail = NULL; |
| 79 |
0 |
| bucket->count = 0; |
| 80 |
0 |
| } |
| 81 |
|
| |
| 82 |
|
| void |
| 83 |
0 |
| dv_bucket_destroy(dv_bucket *bucket) |
| 84 |
|
| { |
| 85 |
0 |
| dv_bucket_item *item = bucket->head; |
| 86 |
|
| dv_bucket_item *tmp; |
| 87 |
|
| |
| 88 |
0 |
▶ | while (item != NULL) { |
Branch: 1 branch
| Branch | True | False | Total |
| while (item != NULL) { |
0 |
0 |
0 |
|
| 89 |
0 |
| tmp = item->next; |
| 90 |
0 |
| free(item); |
| 91 |
0 |
| item = tmp; |
| 92 |
|
| } |
| 93 |
|
| |
| 94 |
0 |
| free(bucket); |
| 95 |
0 |
| } |
| 96 |
|
| |
| 97 |
|
| size_t |
| 98 |
0 |
| dv_bucket_expire( dv_bucket *bucket, struct timeval *tp ) |
| 99 |
|
| { |
| 100 |
|
| /* get the difference from the head of the list and the |
| 101 |
|
| * time we're currently trying to insert. |
| 102 |
|
| * if the difference is bigger than the interval specified, |
| 103 |
|
| * we can safely drop the oldest bucket. |
| 104 |
|
| * we repeat until bucket->head is within the given interval |
| 105 |
|
| */ |
| 106 |
0 |
| size_t expired = 0; |
| 107 |
0 |
| double dtime = dv_bucket_timeval2double(tp); |
| 108 |
|
| |
| 109 |
0 |
| while ( |
| 110 |
0 |
▶ | bucket->head != NULL && |
Branch: 1 branch
| Branch | True | False | Total |
| bucket->head != NULL && |
0 |
0 |
0 |
|
| 111 |
0 |
▶ | bucket->interval < dtime - bucket->head->time |
Branch: 1 branch
| Branch | True | False | Total |
| bucket->interval < dtime - bucket->head->time |
0 |
0 |
0 |
|
| 112 |
|
| ) { |
| 113 |
0 |
| dv_bucket_item *tmp = bucket->head; |
| 114 |
0 |
| bucket->head = bucket->head->next; |
| 115 |
0 |
▶ | if (bucket->head == NULL) { |
Branch: 1 branch
| Branch | True | False | Total |
| if (bucket->head == NULL) { |
0 |
0 |
0 |
|
| 116 |
0 |
| bucket->tail = NULL; |
| 117 |
|
| } |
| 118 |
0 |
| dv_bucket_item_destroy(tmp); |
| 119 |
0 |
| bucket->count--; |
| 120 |
0 |
| expired++; |
| 121 |
|
| } |
| 122 |
|
| |
| 123 |
0 |
| return expired; |
| 124 |
|
| } |
| 125 |
|
| |
| 126 |
|
| int |
| 127 |
0 |
| dv_bucket_is_full(dv_bucket *bucket, double dtime) |
| 128 |
|
| { |
| 129 |
0 |
▶ | if (bucket->count == 0 || bucket->head == NULL) { |
Branch: 2 branches
| Branch | True | False | Total |
| if (bucket->count == 0 || bucket->head == NULL) { |
0 |
0 |
0 |
| if (bucket->count == 0 || bucket->head == NULL) { |
0 |
0 |
0 |
|
| 130 |
|
| /* safety net */ |
| 131 |
0 |
| return 0; |
| 132 |
|
| } |
| 133 |
|
| |
| 134 |
|
| /* if we're in strict_interval mode, then we check for the last entry |
| 135 |
|
| * in the list, and make sure that current time is more than |
| 136 |
|
| * last entry + interval |
| 137 |
|
| */ |
| 138 |
0 |
▶ | if (bucket->strict_interval) { |
Branch: 1 branch
| Branch | True | False | Total |
| if (bucket->strict_interval) { |
0 |
0 |
0 |
|
| 139 |
0 |
| return bucket->head->time + bucket->interval > dtime; |
| 140 |
|
| } |
| 141 |
|
| |
| 142 |
|
| /* Otherwise, we care about how many items are in the list */ |
| 143 |
0 |
| return bucket->max <= bucket->count; |
| 144 |
|
| } |
| 145 |
|
| |
| 146 |
|
| void |
| 147 |
0 |
| dv_bucket_push(dv_bucket *bucket, double time) |
| 148 |
|
| { |
| 149 |
0 |
| dv_bucket_item *item = dv_bucket_item_create(time); |
| 150 |
0 |
▶ | if (bucket->count == 0) { |
Branch: 1 branch
| Branch | True | False | Total |
| if (bucket->count == 0) { |
0 |
0 |
0 |
|
| 151 |
0 |
| bucket->head = item; |
| 152 |
0 |
| bucket->tail = item; |
| 153 |
|
| } else { |
| 154 |
0 |
| bucket->tail->next = item; |
| 155 |
0 |
| bucket->tail = item; |
| 156 |
|
| } |
| 157 |
|
| |
| 158 |
0 |
| bucket->count++; |
| 159 |
0 |
| } |
| 160 |
|
| |
| 161 |
|
| int |
| 162 |
0 |
| dv_bucket_try_push(dv_bucket *bucket) |
| 163 |
|
| { |
| 164 |
|
| struct timeval t; |
| 165 |
|
| double dtime; |
| 166 |
|
| |
| 167 |
0 |
| gettimeofday(&t, NULL); |
| 168 |
|
| |
| 169 |
0 |
| dv_bucket_expire( bucket, &t ); |
| 170 |
|
| |
| 171 |
0 |
| dtime = dv_bucket_timeval2double(&t); |
| 172 |
|
| |
| 173 |
0 |
▶ | if ( dv_bucket_count( bucket ) == 0 ) { |
Branch: 1 branch
| Branch | True | False | Total |
| if ( dv_bucket_count( bucket ) == 0 ) { |
0 |
0 |
0 |
|
| 174 |
0 |
| dv_bucket_push( bucket, dtime ); |
| 175 |
0 |
| return 1; |
| 176 |
|
| } |
| 177 |
|
| |
| 178 |
0 |
▶ | if ( dv_bucket_is_full(bucket, dtime) ) { |
Branch: 1 branch
| Branch | True | False | Total |
| if ( dv_bucket_is_full(bucket, dtime) ) { |
0 |
0 |
0 |
|
| 179 |
0 |
| return 0; |
| 180 |
|
| } |
| 181 |
|
| |
| 182 |
0 |
| dv_bucket_push( bucket, dtime ); |
| 183 |
0 |
| return 1; |
| 184 |
|
| } |
| 185 |
|
| |
| 186 |
|
| SV * |
| 187 |
0 |
| dv_bucket_serialize(dv_bucket *bucket) |
| 188 |
|
| { |
| 189 |
0 |
| SV *sv = newSVpv("[", 1); |
| 190 |
0 |
| dv_bucket_item *item = bucket->head; |
| 191 |
|
| |
| 192 |
0 |
▶ | while (item) { |
Branch: 1 branch
| Branch | True | False | Total |
| while (item) { |
0 |
0 |
0 |
|
| 193 |
0 |
▶ | sv_catpvf(sv, "%f%s", item->time, item->next ? "," : ""); |
Branch: 1 branch
| Branch | True | False | Total |
| sv_catpvf(sv, "%f%s", item->time, item->next ? "," : ""); |
0 |
0 |
0 |
|
| 194 |
0 |
| item = item->next; |
| 195 |
|
| } |
| 196 |
|
| |
| 197 |
0 |
| sv_catpv(sv, "]"); |
| 198 |
0 |
| return sv; |
| 199 |
|
| } |
| 200 |
|
| |
| 201 |
|
| dv_bucket * |
| 202 |
0 |
| dv_bucket_deserialize(char *buf, size_t len, double interval, unsigned long max, int strict_interval) |
| 203 |
|
| { |
| 204 |
0 |
| dv_bucket *bucket = dv_bucket_create(interval, max, strict_interval); |
| 205 |
0 |
| char *end = buf + len; |
| 206 |
|
| |
| 207 |
0 |
▶ | if (buf != end && *buf == '[') { |
Branch: 2 branches
| Branch | True | False | Total |
| if (buf != end && *buf == '[') { |
0 |
0 |
0 |
| if (buf != end && *buf == '[') { |
0 |
0 |
0 |
|
| 208 |
0 |
| buf++; |
| 209 |
0 |
▶ | while (buf != end && !isdigit(*buf)) { |
Branch: 2 branches
| Branch | True | False | Total |
| while (buf != end && !isdigit(*buf)) { |
0 |
0 |
0 |
| while (buf != end && !isdigit(*buf)) { |
0 |
0 |
0 |
|
| 210 |
0 |
| buf++; |
| 211 |
|
| } |
| 212 |
|
| } |
| 213 |
|
| |
| 214 |
0 |
▶ | while (buf != end) { |
Branch: 1 branch
| Branch | True | False | Total |
| while (buf != end) { |
0 |
0 |
0 |
|
| 215 |
0 |
| dv_bucket_push(bucket, strtod(buf, NULL)); |
| 216 |
|
| |
| 217 |
|
| /* pass through the number we just read */ |
| 218 |
0 |
▶ | while ( buf != end && (isdigit(*buf) || *buf == '.')) { |
Branch: 3 branches
| Branch | True | False | Total |
| while ( buf != end && (isdigit(*buf) || *buf == '.')) { |
0 |
0 |
0 |
| while ( buf != end && (isdigit(*buf) || *buf == '.')) { |
0 |
0 |
0 |
| while ( buf != end && (isdigit(*buf) || *buf == '.')) { |
0 |
0 |
0 |
|
| 219 |
0 |
| buf++; |
| 220 |
|
| } |
| 221 |
|
| |
| 222 |
|
| /* find the next number */ |
| 223 |
0 |
▶ | while ( buf != end && ! isdigit(*buf)) { |
Branch: 2 branches
| Branch | True | False | Total |
| while ( buf != end && ! isdigit(*buf)) { |
0 |
0 |
0 |
| while ( buf != end && ! isdigit(*buf)) { |
0 |
0 |
0 |
|
| 224 |
0 |
| buf++; |
| 225 |
|
| } |
| 226 |
|
| } |
| 227 |
0 |
| return bucket; |
| 228 |
|
| } |
| 229 |
|
| |
| 230 |
|
| |
| 231 |
|
| dv_bucket_item * |
| 232 |
0 |
| dv_bucket_first(dv_bucket *bucket) |
| 233 |
|
| { |
| 234 |
0 |
| return bucket->head; |
| 235 |
|
| } |
| 236 |
|
| |
| 237 |
|
| dv_bucket_item * |
| 238 |
0 |
| dv_bucket_item_next(dv_bucket_item *item) |
| 239 |
|
| { |
| 240 |
0 |
| return item->next; |
| 241 |
|
| } |
| 242 |
|
| |
| 243 |
|
| double |
| 244 |
0 |
| dv_bucket_item_time(dv_bucket_item *item) |
| 245 |
|
| { |
| 246 |
0 |
| return item->time; |
| 247 |
|
| } |
| 248 |
|
| |
| 249 |
|
| #endif /* __DV_BUCKET_C__ */ |