1 | #include "module-stat.h"
|
---|
2 | #include "module-cccam.h"
|
---|
3 |
|
---|
4 | #define UNDEF_AVG_TIME 80000
|
---|
5 | #define MAX_ECM_SEND_CACHE 16
|
---|
6 |
|
---|
7 | static int stat_load_save;
|
---|
8 | static struct timeb nulltime;
|
---|
9 | static time_t last_housekeeping = 0;
|
---|
10 |
|
---|
11 | void init_stat()
|
---|
12 | {
|
---|
13 | cs_ftime(&nulltime);
|
---|
14 | stat_load_save = -100;
|
---|
15 |
|
---|
16 | //checking config
|
---|
17 | if (cfg->lb_nbest_readers < 2)
|
---|
18 | cfg->lb_nbest_readers = DEFAULT_NBEST;
|
---|
19 | if (cfg->lb_nfb_readers < 2)
|
---|
20 | cfg->lb_nfb_readers = DEFAULT_NFB;
|
---|
21 | if (cfg->lb_min_ecmcount < 1)
|
---|
22 | cfg->lb_min_ecmcount = DEFAULT_MIN_ECM_COUNT;
|
---|
23 | if (cfg->lb_max_ecmcount < 2)
|
---|
24 | cfg->lb_max_ecmcount = DEFAULT_MAX_ECM_COUNT;
|
---|
25 | if (cfg->lb_reopen_seconds < 10)
|
---|
26 | cfg->lb_reopen_seconds = DEFAULT_REOPEN_SECONDS;
|
---|
27 | if (cfg->lb_retrylimit <= 0)
|
---|
28 | cfg->lb_retrylimit = DEFAULT_RETRYLIMIT;
|
---|
29 | if (cfg->lb_stat_cleanup <= 0)
|
---|
30 | cfg->lb_stat_cleanup = DEFAULT_LB_STAT_CLEANUP;
|
---|
31 | }
|
---|
32 |
|
---|
33 | void load_stat_from_file()
|
---|
34 | {
|
---|
35 | stat_load_save = 0;
|
---|
36 | char buf[256];
|
---|
37 | char *fname;
|
---|
38 | FILE *file;
|
---|
39 | if (!cfg->lb_savepath || !cfg->lb_savepath[0]) {
|
---|
40 | sprintf(buf, "%s/stat", get_tmp_dir());
|
---|
41 | fname = buf;
|
---|
42 | }
|
---|
43 | else
|
---|
44 | fname = cfg->lb_savepath;
|
---|
45 |
|
---|
46 | file = fopen(fname, "r");
|
---|
47 |
|
---|
48 | if (!file) {
|
---|
49 | cs_log("loadbalancer: can't read from file %s", fname);
|
---|
50 | return;
|
---|
51 | }
|
---|
52 | cs_debug_mask(D_TRACE, "loadbalancer: load statistics from %s", fname);
|
---|
53 |
|
---|
54 | struct s_reader *rdr = NULL;
|
---|
55 | READER_STAT *stat, *dup;
|
---|
56 |
|
---|
57 | int i=1;
|
---|
58 | int count=0;
|
---|
59 | do
|
---|
60 | {
|
---|
61 | stat = malloc(sizeof(READER_STAT));
|
---|
62 | memset(stat, 0, sizeof(READER_STAT));
|
---|
63 | i = fscanf(file, "%s rc %d caid %04hX prid %06lX srvid %04hX time avg %dms ecms %d last %ld\n",
|
---|
64 | buf, &stat->rc, &stat->caid, &stat->prid, &stat->srvid,
|
---|
65 | &stat->time_avg, &stat->ecm_count, &stat->last_received);
|
---|
66 |
|
---|
67 |
|
---|
68 | if (i > 5) {
|
---|
69 | if (rdr == NULL || strcmp(buf, rdr->label) != 0) {
|
---|
70 | for (rdr=first_reader; rdr ; rdr=rdr->next) {
|
---|
71 | if (strcmp(rdr->label, buf) == 0) {
|
---|
72 | break;
|
---|
73 | }
|
---|
74 | }
|
---|
75 | }
|
---|
76 |
|
---|
77 | if (rdr != NULL && strcmp(buf, rdr->label) == 0) {
|
---|
78 | if (!rdr->lb_stat)
|
---|
79 | rdr->lb_stat = ll_create();
|
---|
80 |
|
---|
81 | //Duplicate check:
|
---|
82 | dup = get_stat(rdr, stat->caid, stat->prid, stat->srvid);
|
---|
83 | if (dup)
|
---|
84 | free(stat); //already loaded
|
---|
85 | else {
|
---|
86 |
|
---|
87 | ll_append(rdr->lb_stat, stat);
|
---|
88 | count++;
|
---|
89 | }
|
---|
90 | }
|
---|
91 | else
|
---|
92 | {
|
---|
93 | cs_log("loadbalancer: statistics could not be loaded for %s", buf);
|
---|
94 | free(stat);
|
---|
95 | }
|
---|
96 | }
|
---|
97 | else if (i!=EOF && i>0)
|
---|
98 | {
|
---|
99 | cs_debug_mask(D_TRACE, "loadbalancer: statistics ERROR %s rc=%d i=%d", buf, stat->rc, i);
|
---|
100 | free(stat);
|
---|
101 | }
|
---|
102 | else
|
---|
103 | free(stat);
|
---|
104 | } while(i!=EOF && i>0);
|
---|
105 | fclose(file);
|
---|
106 | cs_debug_mask(D_TRACE, "loadbalancer: statistic loaded %d records", count);
|
---|
107 | }
|
---|
108 | /**
|
---|
109 | * get statistic values for reader ridx and caid/prid/srvid
|
---|
110 | */
|
---|
111 | READER_STAT *get_stat(struct s_reader *rdr, ushort caid, ulong prid, ushort srvid)
|
---|
112 | {
|
---|
113 | if (!rdr->lb_stat)
|
---|
114 | rdr->lb_stat = ll_create();
|
---|
115 |
|
---|
116 | LL_ITER *it = ll_iter_create(rdr->lb_stat);
|
---|
117 | READER_STAT *stat = NULL;
|
---|
118 | int i = 0;
|
---|
119 | while ((stat = ll_iter_next(it))) {
|
---|
120 | if (stat->caid==caid && stat->prid==prid && stat->srvid==srvid) {
|
---|
121 | if (i > 5) { //Move to first if not under top 5:
|
---|
122 | ll_iter_remove(it);
|
---|
123 | ll_insert_at_nolock(rdr->lb_stat, stat, 0); //move to first!
|
---|
124 | }
|
---|
125 | break;
|
---|
126 | }
|
---|
127 | i++;
|
---|
128 | }
|
---|
129 | ll_iter_release(it);
|
---|
130 | return stat;
|
---|
131 | }
|
---|
132 |
|
---|
133 | /**
|
---|
134 | * removes caid/prid/srvid from stat-list of reader ridx
|
---|
135 | */
|
---|
136 | int remove_stat(struct s_reader *rdr, ushort caid, ulong prid, ushort srvid)
|
---|
137 | {
|
---|
138 | if (!rdr->lb_stat)
|
---|
139 | return 0;
|
---|
140 |
|
---|
141 | int c = 0;
|
---|
142 | LL_ITER *it = ll_iter_create(rdr->lb_stat);
|
---|
143 | READER_STAT *stat;
|
---|
144 | while ((stat = ll_iter_next(it))) {
|
---|
145 | if (stat->caid==caid && stat->prid==prid && stat->srvid==srvid) {
|
---|
146 | ll_iter_remove_data(it);
|
---|
147 | c++;
|
---|
148 | }
|
---|
149 | }
|
---|
150 | ll_iter_release(it);
|
---|
151 | return c;
|
---|
152 | }
|
---|
153 |
|
---|
154 | /**
|
---|
155 | * Calculates average time
|
---|
156 | */
|
---|
157 | void calc_stat(READER_STAT *stat)
|
---|
158 | {
|
---|
159 | int i;
|
---|
160 | int c=0;
|
---|
161 | long t = 0;
|
---|
162 | for (i = 0; i < LB_MAX_STAT_TIME; i++) {
|
---|
163 | if (stat->time_stat[i] > 0) {
|
---|
164 | t += (long)stat->time_stat[i];
|
---|
165 | c++;
|
---|
166 | }
|
---|
167 | }
|
---|
168 | if (!c)
|
---|
169 | stat->time_avg = UNDEF_AVG_TIME;
|
---|
170 | else
|
---|
171 | stat->time_avg = t / c;
|
---|
172 | }
|
---|
173 |
|
---|
174 | /**
|
---|
175 | * Saves statistik to /tmp/.oscam/stat.n where n is reader-index
|
---|
176 | */
|
---|
177 | void save_stat_to_file()
|
---|
178 | {
|
---|
179 | stat_load_save = 0;
|
---|
180 | char buf[256];
|
---|
181 | char *fname;
|
---|
182 | if (!cfg->lb_savepath || !cfg->lb_savepath[0]) {
|
---|
183 | sprintf(buf, "%s/stat", get_tmp_dir());
|
---|
184 | fname = buf;
|
---|
185 | }
|
---|
186 | else
|
---|
187 | fname = cfg->lb_savepath;
|
---|
188 |
|
---|
189 | FILE *file = fopen(fname, "w");
|
---|
190 |
|
---|
191 | if (!file) {
|
---|
192 | cs_log("can't write to file %s", fname);
|
---|
193 | return;
|
---|
194 | }
|
---|
195 |
|
---|
196 | int count=0;
|
---|
197 | struct s_reader *rdr;
|
---|
198 | for (rdr=first_reader; rdr ; rdr=rdr->next) {
|
---|
199 |
|
---|
200 | if (rdr->lb_stat) {
|
---|
201 | LL_ITER *it = ll_iter_create(rdr->lb_stat);
|
---|
202 | READER_STAT *stat;
|
---|
203 | while ((stat = ll_iter_next(it))) {
|
---|
204 |
|
---|
205 | fprintf(file, "%s rc %d caid %04hX prid %06lX srvid %04hX time avg %dms ecms %d last %ld\n",
|
---|
206 | rdr->label, stat->rc, stat->caid, stat->prid,
|
---|
207 | stat->srvid, stat->time_avg, stat->ecm_count, stat->last_received);
|
---|
208 | count++;
|
---|
209 | }
|
---|
210 | ll_iter_release(it);
|
---|
211 | }
|
---|
212 | }
|
---|
213 |
|
---|
214 | fclose(file);
|
---|
215 | cs_log("loadbalancer: statistic saved %d records to %s", count, fname);
|
---|
216 | }
|
---|
217 |
|
---|
218 | /**
|
---|
219 | * Adds caid/prid/srvid to stat-list for reader ridx with time/rc
|
---|
220 | */
|
---|
221 | void add_stat(struct s_reader *rdr, ECM_REQUEST *er, int ecm_time, int rc)
|
---|
222 | {
|
---|
223 | if (!rdr || !er)
|
---|
224 | return;
|
---|
225 | READER_STAT *stat = get_stat(rdr, er->caid, er->prid, er->srvid);
|
---|
226 | if (!stat) {
|
---|
227 | stat = malloc(sizeof(READER_STAT));
|
---|
228 | memset(stat, 0, sizeof(READER_STAT));
|
---|
229 | stat->caid = er->caid;
|
---|
230 | stat->prid = er->prid;
|
---|
231 | stat->srvid = er->srvid;
|
---|
232 | stat->time_avg = UNDEF_AVG_TIME; //dummy placeholder
|
---|
233 | ll_append(rdr->lb_stat, stat);
|
---|
234 | }
|
---|
235 |
|
---|
236 | //inc ecm_count if found, drop to 0 if not found:
|
---|
237 | // rc codes:
|
---|
238 | // 0 = found +
|
---|
239 | // 1 = cache1 #
|
---|
240 | // 2 = cache2 #
|
---|
241 | // 3 = emu +
|
---|
242 | // 4 = not found -
|
---|
243 | // 5 = timeout -2
|
---|
244 | // 6 = sleeping #
|
---|
245 | // 7 = fake #
|
---|
246 | // 8 = invalid #
|
---|
247 | // 9 = corrupt #
|
---|
248 | // 10= no card #
|
---|
249 | // 11= expdate #
|
---|
250 | // 12= disabled #
|
---|
251 | // 13= stopped #
|
---|
252 | // 100= unhandled #
|
---|
253 | // + = adds statistic values
|
---|
254 | // # = ignored because of duplicate values, temporary failures or softblocks
|
---|
255 | // - = causes loadbalancer to block this reader for this caid/prov/sid
|
---|
256 | // -2 = causes loadbalancer to block if happens too often
|
---|
257 |
|
---|
258 | if (stat->ecm_count < 0)
|
---|
259 | stat->ecm_count=0;
|
---|
260 |
|
---|
261 | if (rc == 0) { //found
|
---|
262 | stat->rc = 0;
|
---|
263 | stat->ecm_count++;
|
---|
264 | stat->last_received = time(NULL);
|
---|
265 | stat->request_count = 0;
|
---|
266 |
|
---|
267 | //FASTEST READER:
|
---|
268 | stat->time_idx++;
|
---|
269 | if (stat->time_idx >= LB_MAX_STAT_TIME)
|
---|
270 | stat->time_idx = 0;
|
---|
271 | stat->time_stat[stat->time_idx] = ecm_time;
|
---|
272 | calc_stat(stat);
|
---|
273 |
|
---|
274 | //OLDEST READER now set by get best reader!
|
---|
275 |
|
---|
276 |
|
---|
277 | //USAGELEVEL:
|
---|
278 | int ule = rdr->lb_usagelevel_ecmcount;
|
---|
279 | if (ule > 0 && ((ule / cfg->lb_min_ecmcount) > 0)) //update every MIN_ECM_COUNT usagelevel:
|
---|
280 | {
|
---|
281 | time_t t = (time(NULL)-rdr->lb_usagelevel_time);
|
---|
282 | rdr->lb_usagelevel = 1000/(t<1?1:t);
|
---|
283 | ule = 0;
|
---|
284 | }
|
---|
285 | if (ule == 0)
|
---|
286 | rdr->lb_usagelevel_time = time(NULL);
|
---|
287 | rdr->lb_usagelevel_ecmcount = ule+1;
|
---|
288 |
|
---|
289 | }
|
---|
290 | else if (rc == 1 || rc == 2) { //cache
|
---|
291 | //no increase of statistics here, cachetime is not real time
|
---|
292 | stat->last_received = time(NULL);
|
---|
293 | stat->request_count = 0;
|
---|
294 | }
|
---|
295 | else if (rc == 4) { //not found
|
---|
296 | stat->rc = rc;
|
---|
297 | //stat->last_received = time(NULL); do not change time, this would prevent reopen
|
---|
298 | //stat->ecm_count = 0; Keep ecm_count!
|
---|
299 | }
|
---|
300 | else if (rc == 5) { //timeout
|
---|
301 | stat->request_count++;
|
---|
302 | stat->last_received = time(NULL);
|
---|
303 |
|
---|
304 | //add timeout to stat:
|
---|
305 | if (ecm_time<=0)
|
---|
306 | ecm_time = cfg->ctimeout;
|
---|
307 | stat->time_idx++;
|
---|
308 | if (stat->time_idx >= LB_MAX_STAT_TIME)
|
---|
309 | stat->time_idx = 0;
|
---|
310 | stat->time_stat[stat->time_idx] = ecm_time;
|
---|
311 | calc_stat(stat);
|
---|
312 | }
|
---|
313 | else
|
---|
314 | {
|
---|
315 | if (rc >= 0)
|
---|
316 | cs_debug_mask(D_TRACE, "loadbalancer: not handled stat for reader %s: rc %d caid %04hX prid %06lX srvid %04hX time %dms usagelevel %d",
|
---|
317 | rdr->label, rc, er->caid, er->prid, er->srvid, ecm_time, rdr->lb_usagelevel);
|
---|
318 |
|
---|
319 | return;
|
---|
320 | }
|
---|
321 |
|
---|
322 | housekeeping_stat(0);
|
---|
323 |
|
---|
324 | cs_debug_mask(D_TRACE, "loadbalancer: adding stat for reader %s: rc %d caid %04hX prid %06lX srvid %04hX time %dms usagelevel %d",
|
---|
325 | rdr->label, rc, er->caid, er->prid, er->srvid, ecm_time, rdr->lb_usagelevel);
|
---|
326 |
|
---|
327 | if (cfg->lb_save) {
|
---|
328 | stat_load_save++;
|
---|
329 | if (stat_load_save > cfg->lb_save) {
|
---|
330 | save_stat_to_file();
|
---|
331 | }
|
---|
332 | }
|
---|
333 | }
|
---|
334 |
|
---|
335 | void reset_stat(ushort caid, ulong prid, ushort srvid)
|
---|
336 | {
|
---|
337 | //cs_debug_mask(D_TRACE, "loadbalance: resetting ecm count");
|
---|
338 | struct s_reader *rdr;
|
---|
339 | for (rdr=first_reader; rdr ; rdr=rdr->next) {
|
---|
340 | if (rdr->lb_stat && rdr->client) {
|
---|
341 | READER_STAT *stat = get_stat(rdr, caid, prid, srvid);
|
---|
342 | if (stat) {
|
---|
343 | if (stat->ecm_count > 0)
|
---|
344 | stat->ecm_count = 1; //not zero, so we know it's decodeable
|
---|
345 | stat->rc = 0;
|
---|
346 | stat->request_count = 0;
|
---|
347 | }
|
---|
348 | }
|
---|
349 | }
|
---|
350 | }
|
---|
351 |
|
---|
352 | int has_ident(FTAB *ftab, ECM_REQUEST *er) {
|
---|
353 |
|
---|
354 | if (!ftab || !ftab->filts)
|
---|
355 | return 0;
|
---|
356 |
|
---|
357 | int j, k;
|
---|
358 |
|
---|
359 | for (j = 0; j < ftab->nfilts; j++) {
|
---|
360 | if (ftab->filts[j].caid) {
|
---|
361 | if (ftab->filts[j].caid==er->caid) { //caid matches!
|
---|
362 |
|
---|
363 | int nprids = ftab->filts[j].nprids;
|
---|
364 | if (!nprids) // No Provider ->Ok
|
---|
365 | return 1;
|
---|
366 |
|
---|
367 | for (k = 0; k < nprids; k++) {
|
---|
368 | ulong prid = ftab->filts[j].prids[k];
|
---|
369 | if (prid == er->prid) { //Provider matches
|
---|
370 | return 1;
|
---|
371 | }
|
---|
372 | }
|
---|
373 | }
|
---|
374 | }
|
---|
375 | }
|
---|
376 | return 0; //No match!
|
---|
377 | }
|
---|
378 |
|
---|
379 | struct stat_value {
|
---|
380 | struct s_reader *rdr;
|
---|
381 | int value;
|
---|
382 | int time;
|
---|
383 | };
|
---|
384 |
|
---|
385 | static struct stat_value *crt_cur(struct s_reader *rdr, int value, int time) {
|
---|
386 | struct stat_value *v = malloc(sizeof(struct stat_value));
|
---|
387 | v->rdr = rdr;
|
---|
388 | v->value = value;
|
---|
389 | v->time = time;
|
---|
390 | return v;
|
---|
391 | }
|
---|
392 |
|
---|
393 | static char *strend(char *c) {
|
---|
394 | while (c && *c) c++;
|
---|
395 | return c;
|
---|
396 | }
|
---|
397 |
|
---|
398 | /**
|
---|
399 | * Gets best reader for caid/prid/srvid.
|
---|
400 | * Best reader is evaluated by lowest avg time but only if ecm_count > cfg->lb_min_ecmcount (5)
|
---|
401 | * Also the reader is asked if he is "available"
|
---|
402 | * returns ridx when found or -1 when not found
|
---|
403 | */
|
---|
404 | int get_best_reader(ECM_REQUEST *er)
|
---|
405 | {
|
---|
406 | LLIST * result = ll_create_nolock();
|
---|
407 | LLIST * selected = ll_create_nolock();
|
---|
408 |
|
---|
409 | struct timeb new_nulltime;
|
---|
410 | memset(&new_nulltime, 0, sizeof(new_nulltime));
|
---|
411 | time_t current_time = time(NULL);
|
---|
412 | LL_ITER *it;
|
---|
413 | struct s_reader *rdr;
|
---|
414 | int current = -1;
|
---|
415 | READER_STAT *stat = NULL;
|
---|
416 | int nlocal_readers = 0;
|
---|
417 |
|
---|
418 | #ifdef WITH_DEBUG
|
---|
419 | if (cs_dblevel & 0x01) {
|
---|
420 | //loadbalancer debug output:
|
---|
421 | int size = 1;
|
---|
422 | int nr = 0;
|
---|
423 | it = ll_iter_create(er->matching_rdr);
|
---|
424 | while ((rdr=ll_iter_next(it))) {
|
---|
425 | if (nr > 5) {
|
---|
426 | size+=20;
|
---|
427 | break;
|
---|
428 | }
|
---|
429 | size += strlen(rdr->label)+1;
|
---|
430 | nr++;
|
---|
431 | }
|
---|
432 | ll_iter_reset(it);
|
---|
433 | char *rdrs = cs_malloc(&rdrs, size, 1);
|
---|
434 | char *rptr = rdrs;
|
---|
435 | *rptr = 0;
|
---|
436 | nr = 0;
|
---|
437 | while ((rdr=ll_iter_next(it))) {
|
---|
438 | if (nr > 5) {
|
---|
439 | sprintf(rptr, "...(%d more)", ll_count(er->matching_rdr)-nr);
|
---|
440 | break;
|
---|
441 | }
|
---|
442 | sprintf(rptr, "%s ", rdr->label);
|
---|
443 | rptr = strend(rptr);
|
---|
444 | nr++;
|
---|
445 | }
|
---|
446 | ll_iter_release(it);
|
---|
447 |
|
---|
448 | cs_debug_mask(D_TRACE, "loadbalancer: client %s for %04X/%06X/%04X: n=%d valid readers: %s",
|
---|
449 | username(er->client), er->caid, er->prid, er->srvid, ll_count(er->matching_rdr), rdrs);
|
---|
450 |
|
---|
451 | free(rdrs);
|
---|
452 | }
|
---|
453 | #endif
|
---|
454 |
|
---|
455 | it = ll_iter_create(er->matching_rdr);
|
---|
456 | while ((rdr=ll_iter_next(it))) {
|
---|
457 | int weight = rdr->lb_weight <= 0?100:rdr->lb_weight;
|
---|
458 |
|
---|
459 | stat = get_stat(rdr, er->caid, er->prid, er->srvid);
|
---|
460 | if (!stat) {
|
---|
461 | cs_debug_mask(D_TRACE, "loadbalancer: starting statistics for reader %s", rdr->label);
|
---|
462 | add_stat(rdr, er, 1, -1);
|
---|
463 | ll_append(result, rdr); //no statistics, this reader is active (now) but we need statistics first!
|
---|
464 | continue;
|
---|
465 | }
|
---|
466 |
|
---|
467 | if (stat->ecm_count < 0||(stat->ecm_count > cfg->lb_max_ecmcount && stat->time_avg > (int)cfg->ftimeout)) {
|
---|
468 | cs_debug_mask(D_TRACE, "loadbalancer: max ecms (%d) reached by reader %s, resetting statistics", cfg->lb_max_ecmcount, rdr->label);
|
---|
469 | reset_stat(er->caid, er->prid, er->srvid);
|
---|
470 | ll_append(result, rdr); //max ecm reached, get new statistics
|
---|
471 | continue;
|
---|
472 | }
|
---|
473 |
|
---|
474 | int hassrvid = has_srvid(rdr->client, er) || has_ident(&rdr->ftab, er);
|
---|
475 |
|
---|
476 | if (!hassrvid && stat->rc == 0 && stat->request_count > cfg->lb_min_ecmcount) { // 5 unanswered requests or timeouts?
|
---|
477 | cs_debug_mask(D_TRACE, "loadbalancer: reader %s does not answer, blocking", rdr->label);
|
---|
478 | add_stat(rdr, er, 1, 4); //reader marked as unuseable
|
---|
479 | continue;
|
---|
480 | }
|
---|
481 |
|
---|
482 | if (stat->rc == 0 && stat->ecm_count < cfg->lb_min_ecmcount) {
|
---|
483 | cs_debug_mask(D_TRACE, "loadbalancer: reader %s needs more statistics", rdr->label);
|
---|
484 | ll_append(result, rdr); //need more statistics!
|
---|
485 | continue;
|
---|
486 | }
|
---|
487 |
|
---|
488 | //Reader can decode this service (rc==0) and has lb_min_ecmcount ecms:
|
---|
489 | if (stat->rc == 0 || hassrvid) {
|
---|
490 | if (cfg->preferlocalcards && !(rdr->typ & R_IS_NETWORK))
|
---|
491 | nlocal_readers++; //Prefer local readers!
|
---|
492 |
|
---|
493 | switch (cfg->lb_mode) {
|
---|
494 | default:
|
---|
495 | case LB_NONE:
|
---|
496 | //cs_debug_mask(D_TRACE, "loadbalance disabled");
|
---|
497 | ll_append(result, rdr);
|
---|
498 | continue;
|
---|
499 |
|
---|
500 | case LB_FASTEST_READER_FIRST:
|
---|
501 | current = stat->time_avg * 100 / weight;
|
---|
502 | break;
|
---|
503 |
|
---|
504 | case LB_OLDEST_READER_FIRST:
|
---|
505 | if (!rdr->lb_last.time)
|
---|
506 | rdr->lb_last = nulltime;
|
---|
507 | current = (1000*(rdr->lb_last.time-nulltime.time)+
|
---|
508 | rdr->lb_last.millitm-nulltime.millitm);
|
---|
509 | if (!new_nulltime.time || (1000*(rdr->lb_last.time-new_nulltime.time)+
|
---|
510 | rdr->lb_last.millitm-new_nulltime.millitm) < 0)
|
---|
511 | new_nulltime = rdr->lb_last;
|
---|
512 | break;
|
---|
513 |
|
---|
514 | case LB_LOWEST_USAGELEVEL:
|
---|
515 | current = rdr->lb_usagelevel * 100 / weight;
|
---|
516 | break;
|
---|
517 | }
|
---|
518 | #ifdef WEBIF
|
---|
519 | rdr->lbvalue = current;
|
---|
520 | #endif
|
---|
521 | if (rdr->ph.c_available
|
---|
522 | && !rdr->ph.c_available(rdr,
|
---|
523 | AVAIL_CHECK_LOADBALANCE)) {
|
---|
524 | current=current*2;
|
---|
525 | }
|
---|
526 | if (current < 1)
|
---|
527 | current=1;
|
---|
528 | ll_append(selected, crt_cur(rdr, current, stat->time_avg));
|
---|
529 | }
|
---|
530 | }
|
---|
531 | ll_iter_release(it);
|
---|
532 |
|
---|
533 | int nbest_readers = cfg->lb_nbest_readers;
|
---|
534 | int nfb_readers = cfg->lb_nfb_readers;
|
---|
535 | if (nlocal_readers > nbest_readers) { //if we have local readers, we prefer them!
|
---|
536 | nlocal_readers = nbest_readers;
|
---|
537 | nbest_readers = 0;
|
---|
538 | }
|
---|
539 | else
|
---|
540 | nbest_readers = nbest_readers-nlocal_readers;
|
---|
541 |
|
---|
542 | struct stat_value *stv;
|
---|
543 | it = ll_iter_create(selected);
|
---|
544 |
|
---|
545 | struct s_reader *best_rdr = NULL;
|
---|
546 | struct s_reader *best_rdri = NULL;
|
---|
547 | int best_time = 0;
|
---|
548 | LL_NODE *fallback = NULL;
|
---|
549 |
|
---|
550 | int n=0;
|
---|
551 | while (1) {
|
---|
552 | struct stat_value *best = NULL;
|
---|
553 |
|
---|
554 | ll_iter_reset(it);
|
---|
555 | while ((stv=ll_iter_next(it))) {
|
---|
556 | if (nlocal_readers && (stv->rdr->typ & R_IS_NETWORK))
|
---|
557 | continue;
|
---|
558 |
|
---|
559 | if (stv->value && (!best || stv->value < best->value))
|
---|
560 | best=stv;
|
---|
561 | }
|
---|
562 | if (!best)
|
---|
563 | break;
|
---|
564 |
|
---|
565 | n++;
|
---|
566 | best_rdri = best->rdr;
|
---|
567 | if (!best_rdr) {
|
---|
568 | best_rdr = best_rdri;
|
---|
569 | best_time = best->time;
|
---|
570 | }
|
---|
571 | best->value = 0;
|
---|
572 |
|
---|
573 | if (nlocal_readers) {//primary readers, local
|
---|
574 | nlocal_readers--;
|
---|
575 | ll_append_nolock(result, best_rdri);
|
---|
576 | //OLDEST_READER:
|
---|
577 | cs_ftime(&best_rdri->lb_last);
|
---|
578 | }
|
---|
579 | else if (nbest_readers) {//primary readers, other
|
---|
580 | nbest_readers--;
|
---|
581 | ll_append_nolock(result, best_rdri);
|
---|
582 | //OLDEST_READER:
|
---|
583 | cs_ftime(&best_rdri->lb_last);
|
---|
584 | }
|
---|
585 | else if (nfb_readers) { //fallbacks:
|
---|
586 | nfb_readers--;
|
---|
587 | LL_NODE *node = ll_append_nolock(result, best_rdri);
|
---|
588 | if (!fallback)
|
---|
589 | fallback = node;
|
---|
590 | }
|
---|
591 | else
|
---|
592 | break;
|
---|
593 | }
|
---|
594 | ll_iter_release(it);
|
---|
595 | ll_destroy_data(selected);
|
---|
596 |
|
---|
597 | if (!n) //no best reader found? reopen if we have ecm_count>0
|
---|
598 | {
|
---|
599 | cs_debug_mask(D_TRACE, "loadbalancer: NO MATCHING READER FOUND, reopen last valid:");
|
---|
600 | it = ll_iter_create(er->matching_rdr);
|
---|
601 | while ((rdr=ll_iter_next(it))) {
|
---|
602 | stat = get_stat(rdr, er->caid, er->prid, er->srvid);
|
---|
603 | if (stat && stat->ecm_count>0) {
|
---|
604 | if (!ll_contains(result, rdr))
|
---|
605 | ll_append(result, rdr);
|
---|
606 | n++;
|
---|
607 | cs_debug_mask(D_TRACE, "loadbalancer: reopened reader %s", rdr->label);
|
---|
608 | }
|
---|
609 | }
|
---|
610 | ll_iter_release(it);
|
---|
611 | cs_debug_mask(D_TRACE, "loadbalancer: reopened %d readers", n);
|
---|
612 | }
|
---|
613 |
|
---|
614 | //algo for finding unanswered requests (newcamd reader for example:)
|
---|
615 | it = ll_iter_create(result);
|
---|
616 | while ((rdr=ll_iter_next(it))) {
|
---|
617 | //primary readers
|
---|
618 | stat = get_stat(rdr, er->caid, er->prid, er->srvid);
|
---|
619 |
|
---|
620 | if (stat && current_time > stat->last_received+(time_t)(cfg->ctimeout/1000)) {
|
---|
621 | stat->request_count++;
|
---|
622 | stat->last_received = current_time;
|
---|
623 | cs_debug_mask(D_TRACE, "loadbalancer: reader %s increment request count to %d", rdr->label, stat->request_count);
|
---|
624 | }
|
---|
625 |
|
---|
626 | if (it->cur == fallback) break;
|
---|
627 | }
|
---|
628 | ll_iter_release(it);
|
---|
629 |
|
---|
630 | //algo for reopen other reader only if responsetime>retrylimit:
|
---|
631 | int reopen = (best_rdr && best_time && (best_time > cfg->lb_retrylimit));
|
---|
632 | if (reopen) {
|
---|
633 | cs_debug_mask(D_TRACE, "loadbalancer: reader %s reached retrylimit (%dms), reopening other readers", best_rdr->label, best_time);
|
---|
634 |
|
---|
635 | it = ll_iter_create(er->matching_rdr);
|
---|
636 | while ((rdr=ll_iter_next(it))) {
|
---|
637 | stat = get_stat(rdr, er->caid, er->prid, er->srvid);
|
---|
638 |
|
---|
639 | if (stat && stat->rc != 0) { //retrylimit reached:
|
---|
640 | int seconds = cfg->lb_reopen_seconds;
|
---|
641 | if (!rdr->audisabled && (er->client->autoau || er->client->aureader == rdr))
|
---|
642 | seconds = seconds/10; //reopen faster if reader is a au reader
|
---|
643 |
|
---|
644 | if (stat->last_received+seconds < current_time) { //Retrying reader every (900/conf) seconds
|
---|
645 | stat->last_received = current_time;
|
---|
646 | ll_remove(result, rdr);
|
---|
647 | ll_insert_at(result, rdr, 0);
|
---|
648 | cs_log("loadbalancer: retrying reader %s", rdr->label);
|
---|
649 | }
|
---|
650 | }
|
---|
651 | }
|
---|
652 | ll_iter_release(it);
|
---|
653 | }
|
---|
654 |
|
---|
655 | //Setting return values:
|
---|
656 | ll_destroy(er->matching_rdr);
|
---|
657 | er->matching_rdr = result;
|
---|
658 | er->fallback = fallback;
|
---|
659 |
|
---|
660 | if (new_nulltime.time)
|
---|
661 | nulltime = new_nulltime;
|
---|
662 |
|
---|
663 | #ifdef WITH_DEBUG
|
---|
664 | if (cs_dblevel & 0x01) {
|
---|
665 | //loadbalancer debug output:
|
---|
666 | int size = 3;
|
---|
667 | int nr = 0;
|
---|
668 | it = ll_iter_create(result);
|
---|
669 | while ((rdr=ll_iter_next(it))) {
|
---|
670 | if (nr > 5) {
|
---|
671 | size+=20;
|
---|
672 | break;
|
---|
673 | }
|
---|
674 | size += strlen(rdr->label)+1;
|
---|
675 | nr++;
|
---|
676 | }
|
---|
677 | ll_iter_reset(it);
|
---|
678 | char *rdrs = cs_malloc(&rdrs, size, 1);
|
---|
679 | char *rptr = rdrs;
|
---|
680 | *rptr = 0;
|
---|
681 | nr = 0;
|
---|
682 | while ((rdr=ll_iter_next(it))) {
|
---|
683 | if (nr > 5) {
|
---|
684 | sprintf(rptr, "...(%d more)", ll_count(result)-nr);
|
---|
685 | rptr = strend(rptr);
|
---|
686 | break;
|
---|
687 | }
|
---|
688 | sprintf(rptr, "%s ", rdr->label);
|
---|
689 | rptr = strend(rptr);
|
---|
690 |
|
---|
691 | if (fallback && it->cur == fallback) {
|
---|
692 | sprintf(rptr, "[");
|
---|
693 | rptr = strend(rptr);
|
---|
694 | }
|
---|
695 | nr++;
|
---|
696 | }
|
---|
697 | if (fallback) {
|
---|
698 | rptr--;
|
---|
699 | *rptr=']';
|
---|
700 | }
|
---|
701 | ll_iter_release(it);
|
---|
702 |
|
---|
703 | cs_debug_mask(D_TRACE, "loadbalancer: client %s for %04X/%06X/%04X: n=%d selected readers: %s",
|
---|
704 | username(er->client), er->caid, er->prid, er->srvid, ll_count(result), rdrs);
|
---|
705 |
|
---|
706 | free(rdrs);
|
---|
707 | }
|
---|
708 | #endif
|
---|
709 |
|
---|
710 |
|
---|
711 | return 1;
|
---|
712 | }
|
---|
713 |
|
---|
714 | /**
|
---|
715 | * clears statistic of reader ridx.
|
---|
716 | **/
|
---|
717 | void clear_reader_stat(struct s_reader *rdr)
|
---|
718 | {
|
---|
719 | if (!rdr->lb_stat)
|
---|
720 | return;
|
---|
721 |
|
---|
722 | ll_clear_data(rdr->lb_stat);
|
---|
723 | }
|
---|
724 |
|
---|
725 | void clear_all_stat()
|
---|
726 | {
|
---|
727 | struct s_reader *rdr;
|
---|
728 | for (rdr=first_reader; rdr ; rdr=rdr->next) {
|
---|
729 | clear_reader_stat(rdr);
|
---|
730 | }
|
---|
731 | }
|
---|
732 |
|
---|
733 | void housekeeping_stat(int force)
|
---|
734 | {
|
---|
735 | time_t now = time(NULL);
|
---|
736 | if (!force && now/60/60 == last_housekeeping/60/60) //only clean once in an hour
|
---|
737 | return;
|
---|
738 |
|
---|
739 | last_housekeeping = now;
|
---|
740 |
|
---|
741 | time_t cleanup_time = now - (cfg->lb_stat_cleanup*60*60);
|
---|
742 |
|
---|
743 | struct s_reader *rdr;
|
---|
744 | for (rdr=first_reader; rdr ; rdr=rdr->next) {
|
---|
745 | if (rdr->lb_stat) {
|
---|
746 | LL_ITER *itr = ll_iter_create(rdr->lb_stat);
|
---|
747 | READER_STAT *stat;
|
---|
748 | while ((stat=ll_iter_next(itr))) {
|
---|
749 |
|
---|
750 | if (stat->last_received < cleanup_time)
|
---|
751 | ll_iter_remove_data(itr);
|
---|
752 | }
|
---|
753 |
|
---|
754 | ll_iter_release(itr);
|
---|
755 | }
|
---|
756 | }
|
---|
757 | }
|
---|