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 | #define LB_REOPEN_MODE_STANDARD 0
|
---|
8 | #define LB_REOPEN_MODE_FAST 1
|
---|
9 |
|
---|
10 | static int32_t stat_load_save;
|
---|
11 | static struct timeb nulltime;
|
---|
12 | static time_t last_housekeeping = 0;
|
---|
13 |
|
---|
14 | void init_stat()
|
---|
15 | {
|
---|
16 | cs_ftime(&nulltime);
|
---|
17 | stat_load_save = -100;
|
---|
18 |
|
---|
19 | //checking config
|
---|
20 | if (cfg.lb_nbest_readers < 2)
|
---|
21 | cfg.lb_nbest_readers = DEFAULT_NBEST;
|
---|
22 | if (cfg.lb_nfb_readers < 2)
|
---|
23 | cfg.lb_nfb_readers = DEFAULT_NFB;
|
---|
24 | if (cfg.lb_min_ecmcount < 2)
|
---|
25 | cfg.lb_min_ecmcount = DEFAULT_MIN_ECM_COUNT;
|
---|
26 | if (cfg.lb_max_ecmcount < 3)
|
---|
27 | cfg.lb_max_ecmcount = DEFAULT_MAX_ECM_COUNT;
|
---|
28 | if (cfg.lb_reopen_seconds < 10)
|
---|
29 | cfg.lb_reopen_seconds = DEFAULT_REOPEN_SECONDS;
|
---|
30 | if (cfg.lb_retrylimit <= 0)
|
---|
31 | cfg.lb_retrylimit = DEFAULT_RETRYLIMIT;
|
---|
32 | if (cfg.lb_stat_cleanup <= 0)
|
---|
33 | cfg.lb_stat_cleanup = DEFAULT_LB_STAT_CLEANUP;
|
---|
34 | }
|
---|
35 |
|
---|
36 | void load_stat_from_file()
|
---|
37 | {
|
---|
38 | stat_load_save = 0;
|
---|
39 | char buf[256];
|
---|
40 | char *fname;
|
---|
41 | FILE *file;
|
---|
42 | if (!cfg.lb_savepath || !cfg.lb_savepath[0]) {
|
---|
43 | snprintf(buf, sizeof(buf), "%s/stat", get_tmp_dir());
|
---|
44 | fname = buf;
|
---|
45 | }
|
---|
46 | else
|
---|
47 | fname = cfg.lb_savepath;
|
---|
48 |
|
---|
49 | file = fopen(fname, "r");
|
---|
50 |
|
---|
51 | if (!file) {
|
---|
52 | cs_log("loadbalancer: can't read from file %s", fname);
|
---|
53 | return;
|
---|
54 | }
|
---|
55 | cs_debug_mask(D_TRACE, "loadbalancer: load statistics from %s", fname);
|
---|
56 |
|
---|
57 | struct s_reader *rdr = NULL;
|
---|
58 | READER_STAT *stat, *dup;
|
---|
59 |
|
---|
60 | int32_t i=1;
|
---|
61 | int32_t count=0;
|
---|
62 | do
|
---|
63 | {
|
---|
64 | stat = malloc(sizeof(READER_STAT));
|
---|
65 | memset(stat, 0, sizeof(READER_STAT));
|
---|
66 | i = fscanf(file, "%s rc %d caid %04hX prid %06X srvid %04hX time avg %dms ecms %d last %ld fail %d len %02hX\n",
|
---|
67 | buf, &stat->rc, &stat->caid, &stat->prid, &stat->srvid,
|
---|
68 | &stat->time_avg, &stat->ecm_count, &stat->last_received, &stat->fail_factor, &stat->ecmlen);
|
---|
69 |
|
---|
70 |
|
---|
71 | if (i > 5) {
|
---|
72 | if (rdr == NULL || strcmp(buf, rdr->label) != 0) {
|
---|
73 | LL_ITER *itr = ll_iter_create(configured_readers);
|
---|
74 | while ((rdr=ll_iter_next(itr))) {
|
---|
75 | if (strcmp(rdr->label, buf) == 0) {
|
---|
76 | break;
|
---|
77 | }
|
---|
78 | }
|
---|
79 | ll_iter_release(itr);
|
---|
80 | }
|
---|
81 |
|
---|
82 | if (rdr != NULL && strcmp(buf, rdr->label) == 0) {
|
---|
83 | if (!rdr->lb_stat)
|
---|
84 | rdr->lb_stat = ll_create();
|
---|
85 |
|
---|
86 | //Duplicate check:
|
---|
87 | dup = get_stat(rdr, stat->caid, stat->prid, stat->srvid, stat->ecmlen);
|
---|
88 | if (dup)
|
---|
89 | free(stat); //already loaded
|
---|
90 | else {
|
---|
91 |
|
---|
92 | ll_append(rdr->lb_stat, stat);
|
---|
93 | count++;
|
---|
94 | }
|
---|
95 | }
|
---|
96 | else
|
---|
97 | {
|
---|
98 | cs_log("loadbalancer: statistics could not be loaded for %s", buf);
|
---|
99 | free(stat);
|
---|
100 | }
|
---|
101 | }
|
---|
102 | else if (i!=EOF && i>0)
|
---|
103 | {
|
---|
104 | cs_debug_mask(D_TRACE, "loadbalancer: statistics ERROR %s rc=%d i=%d", buf, stat->rc, i);
|
---|
105 | free(stat);
|
---|
106 | }
|
---|
107 | else
|
---|
108 | free(stat);
|
---|
109 | } while(i!=EOF && i>0);
|
---|
110 | fclose(file);
|
---|
111 | cs_debug_mask(D_TRACE, "loadbalancer: statistic loaded %d records", count);
|
---|
112 | }
|
---|
113 |
|
---|
114 | static uint32_t get_prid(uint16_t caid, uint32_t prid)
|
---|
115 | {
|
---|
116 | int32_t i;
|
---|
117 | for (i=0;i<CS_MAXCAIDTAB;i++) {
|
---|
118 | uint16_t tcaid = cfg.lb_noproviderforcaid.caid[i];
|
---|
119 | if (!tcaid) break;
|
---|
120 | if (tcaid == caid) {
|
---|
121 | prid = 0;
|
---|
122 | break;
|
---|
123 | }
|
---|
124 | if (tcaid < 0x0100 && (caid >> 8) == tcaid) {
|
---|
125 | prid = 0;
|
---|
126 | break;
|
---|
127 | }
|
---|
128 |
|
---|
129 | }
|
---|
130 | return prid;
|
---|
131 | }
|
---|
132 |
|
---|
133 | /**
|
---|
134 | * get statistic values for reader ridx and caid/prid/srvid/ecmlen
|
---|
135 | */
|
---|
136 | READER_STAT *get_stat(struct s_reader *rdr, uint16_t caid, uint32_t prid, uint16_t srvid, int16_t ecmlen)
|
---|
137 | {
|
---|
138 | if (!rdr->lb_stat)
|
---|
139 | rdr->lb_stat = ll_create();
|
---|
140 |
|
---|
141 | prid = get_prid(caid, prid);
|
---|
142 |
|
---|
143 | LL_ITER *it = ll_iter_create(rdr->lb_stat);
|
---|
144 | READER_STAT *stat = NULL;
|
---|
145 | int32_t i = 0;
|
---|
146 | while ((stat = ll_iter_next(it))) {
|
---|
147 | i++;
|
---|
148 | if (stat->caid==caid && stat->prid==prid && stat->srvid==srvid) {
|
---|
149 | if (stat->ecmlen == ecmlen)
|
---|
150 | break;
|
---|
151 | if (!stat->ecmlen) {
|
---|
152 | stat->ecmlen = ecmlen;
|
---|
153 | break;
|
---|
154 | }
|
---|
155 | }
|
---|
156 | }
|
---|
157 |
|
---|
158 | //Move stat to list start for faster access:
|
---|
159 | if (i > 10 && stat)
|
---|
160 | ll_iter_move_first(it);
|
---|
161 | ll_iter_release(it);
|
---|
162 |
|
---|
163 | return stat;
|
---|
164 | }
|
---|
165 |
|
---|
166 | /**
|
---|
167 | * removes caid/prid/srvid/ecmlen from stat-list of reader ridx
|
---|
168 | */
|
---|
169 | int32_t remove_stat(struct s_reader *rdr, uint16_t caid, uint32_t prid, uint16_t srvid, int16_t ecmlen)
|
---|
170 | {
|
---|
171 | if (!rdr->lb_stat)
|
---|
172 | return 0;
|
---|
173 |
|
---|
174 | int32_t c = 0;
|
---|
175 | LL_ITER *it = ll_iter_create(rdr->lb_stat);
|
---|
176 | READER_STAT *stat;
|
---|
177 | while ((stat = ll_iter_next(it))) {
|
---|
178 | if (stat->caid==caid && stat->prid==prid && stat->srvid==srvid) {
|
---|
179 | if (!stat->ecmlen || stat->ecmlen == ecmlen) {
|
---|
180 | ll_iter_remove_data(it);
|
---|
181 | c++;
|
---|
182 | }
|
---|
183 | }
|
---|
184 | }
|
---|
185 | ll_iter_release(it);
|
---|
186 | return c;
|
---|
187 | }
|
---|
188 |
|
---|
189 | /**
|
---|
190 | * Calculates average time
|
---|
191 | */
|
---|
192 | void calc_stat(READER_STAT *stat)
|
---|
193 | {
|
---|
194 | int32_t i, c=0, t = 0;
|
---|
195 | for (i = 0; i < LB_MAX_STAT_TIME; i++) {
|
---|
196 | if (stat->time_stat[i] > 0) {
|
---|
197 | t += (int32_t)stat->time_stat[i];
|
---|
198 | c++;
|
---|
199 | }
|
---|
200 | }
|
---|
201 | if (!c)
|
---|
202 | stat->time_avg = UNDEF_AVG_TIME;
|
---|
203 | else
|
---|
204 | stat->time_avg = t / c;
|
---|
205 | }
|
---|
206 |
|
---|
207 | /**
|
---|
208 | * Saves statistik to /tmp/.oscam/stat.n where n is reader-index
|
---|
209 | */
|
---|
210 | void save_stat_to_file_thread()
|
---|
211 | {
|
---|
212 | stat_load_save = 0;
|
---|
213 | char buf[256];
|
---|
214 | char *fname;
|
---|
215 | if (!cfg.lb_savepath || !cfg.lb_savepath[0]) {
|
---|
216 | snprintf(buf, sizeof(buf), "%s/stat", get_tmp_dir());
|
---|
217 | fname = buf;
|
---|
218 | }
|
---|
219 | else
|
---|
220 | fname = cfg.lb_savepath;
|
---|
221 |
|
---|
222 | FILE *file = fopen(fname, "w");
|
---|
223 |
|
---|
224 | if (!file) {
|
---|
225 | cs_log("can't write to file %s", fname);
|
---|
226 | return;
|
---|
227 | }
|
---|
228 |
|
---|
229 | int32_t count=0;
|
---|
230 | struct s_reader *rdr;
|
---|
231 | LL_ITER *itr = ll_iter_create(configured_readers);
|
---|
232 | while ((rdr=ll_iter_next(itr))) {
|
---|
233 |
|
---|
234 | if (rdr->lb_stat) {
|
---|
235 | LL_ITER *it = ll_iter_create(rdr->lb_stat);
|
---|
236 | READER_STAT *stat;
|
---|
237 | while ((stat = ll_iter_next(it))) {
|
---|
238 |
|
---|
239 | fprintf(file, "%s rc %d caid %04hX prid %06X srvid %04hX time avg %dms ecms %d last %ld fail %d len %02hX\n",
|
---|
240 | rdr->label, stat->rc, stat->caid, stat->prid,
|
---|
241 | stat->srvid, stat->time_avg, stat->ecm_count, stat->last_received, stat->fail_factor, stat->ecmlen);
|
---|
242 | count++;
|
---|
243 | }
|
---|
244 | ll_iter_release(it);
|
---|
245 | }
|
---|
246 | }
|
---|
247 | ll_iter_release(itr);
|
---|
248 |
|
---|
249 | fclose(file);
|
---|
250 | cs_log("loadbalancer: statistic saved %d records to %s", count, fname);
|
---|
251 | }
|
---|
252 |
|
---|
253 | void save_stat_to_file(int32_t thread)
|
---|
254 | {
|
---|
255 | stat_load_save = 0;
|
---|
256 | if (thread)
|
---|
257 | start_thread((void*)&save_stat_to_file_thread, "save lb stats");
|
---|
258 | else
|
---|
259 | save_stat_to_file_thread();
|
---|
260 | }
|
---|
261 |
|
---|
262 | /**
|
---|
263 | * Adds caid/prid/srvid/ecmlen to stat-list for reader ridx with time/rc
|
---|
264 | */
|
---|
265 | void add_stat(struct s_reader *rdr, ECM_REQUEST *er, int32_t ecm_time, int32_t rc)
|
---|
266 | {
|
---|
267 | if (!rdr || !er || !cfg.lb_mode)
|
---|
268 | return;
|
---|
269 |
|
---|
270 | uint32_t prid = get_prid(er->caid, er->prid);
|
---|
271 |
|
---|
272 | READER_STAT *stat = get_stat(rdr, er->caid, prid, er->srvid, er->l);
|
---|
273 | if (!stat) {
|
---|
274 | stat = malloc(sizeof(READER_STAT));
|
---|
275 | memset(stat, 0, sizeof(READER_STAT));
|
---|
276 | stat->caid = er->caid;
|
---|
277 | stat->prid = prid;
|
---|
278 | stat->srvid = er->srvid;
|
---|
279 | stat->ecmlen = er->l;
|
---|
280 | stat->time_avg = UNDEF_AVG_TIME; //dummy placeholder
|
---|
281 | ll_append(rdr->lb_stat, stat);
|
---|
282 | }
|
---|
283 |
|
---|
284 | //inc ecm_count if found, drop to 0 if not found:
|
---|
285 | // rc codes:
|
---|
286 | // 0 = found +
|
---|
287 | // 1 = cache1 #
|
---|
288 | // 2 = cache2 #
|
---|
289 | // 3 = emu +
|
---|
290 | // 4 = not found -
|
---|
291 | // 5 = timeout -2
|
---|
292 | // 6 = sleeping #
|
---|
293 | // 7 = fake #
|
---|
294 | // 8 = invalid #
|
---|
295 | // 9 = corrupt #
|
---|
296 | // 10= no card #
|
---|
297 | // 11= expdate #
|
---|
298 | // 12= disabled #
|
---|
299 | // 13= stopped #
|
---|
300 | // 100= unhandled #
|
---|
301 | // + = adds statistic values
|
---|
302 | // # = ignored because of duplicate values, temporary failures or softblocks
|
---|
303 | // - = causes loadbalancer to block this reader for this caid/prov/sid
|
---|
304 | // -2 = causes loadbalancer to block if happens too often
|
---|
305 |
|
---|
306 | if (stat->ecm_count < 0)
|
---|
307 | stat->ecm_count=0;
|
---|
308 |
|
---|
309 | time_t ctime = time(NULL);
|
---|
310 |
|
---|
311 | if (rc == 0) { //found
|
---|
312 | stat->rc = 0;
|
---|
313 | stat->ecm_count++;
|
---|
314 | stat->last_received = ctime;
|
---|
315 | stat->fail_factor = 0;
|
---|
316 |
|
---|
317 | //If answering reader is a fallback reader, decrement answer time by fallback timeout:
|
---|
318 | struct s_reader *r;
|
---|
319 | LL_ITER *it = ll_iter_create(er->matching_rdr);
|
---|
320 | int is_fallback = 0;
|
---|
321 | while ((r=ll_iter_next(it))) {
|
---|
322 | if (it->cur == er->fallback) is_fallback = 1;
|
---|
323 | if (r == rdr) {
|
---|
324 | if (is_fallback && (uint32_t)ecm_time >= cfg.ftimeout)
|
---|
325 | ecm_time -= cfg.ftimeout;
|
---|
326 | break;
|
---|
327 | }
|
---|
328 | }
|
---|
329 | ll_iter_release(it);
|
---|
330 |
|
---|
331 | //FASTEST READER:
|
---|
332 | stat->time_idx++;
|
---|
333 | if (stat->time_idx >= LB_MAX_STAT_TIME)
|
---|
334 | stat->time_idx = 0;
|
---|
335 | stat->time_stat[stat->time_idx] = ecm_time;
|
---|
336 | calc_stat(stat);
|
---|
337 |
|
---|
338 | //OLDEST READER now set by get best reader!
|
---|
339 |
|
---|
340 |
|
---|
341 | //USAGELEVEL:
|
---|
342 | int32_t ule = rdr->lb_usagelevel_ecmcount;
|
---|
343 | if (ule > 0 && ((ule / cfg.lb_min_ecmcount) > 0)) //update every MIN_ECM_COUNT usagelevel:
|
---|
344 | {
|
---|
345 | time_t t = (ctime-rdr->lb_usagelevel_time);
|
---|
346 | rdr->lb_usagelevel = 1000/(t<1?1:t);
|
---|
347 | ule = 0;
|
---|
348 | }
|
---|
349 | if (ule == 0)
|
---|
350 | rdr->lb_usagelevel_time = ctime;
|
---|
351 | rdr->lb_usagelevel_ecmcount = ule+1;
|
---|
352 | }
|
---|
353 | else if (rc == 1 || rc == 2) { //cache
|
---|
354 | //no increase of statistics here, cachetime is not real time
|
---|
355 | stat->last_received = ctime;
|
---|
356 | }
|
---|
357 | else if (rc == 4) { //not found
|
---|
358 | //CCcam card can't decode, 0x28=NOK1, 0x29=NOK2
|
---|
359 | //CCcam loop detection = E2_CCCAM_LOOP
|
---|
360 | if (er->rcEx == E2_CCCAM_NOK1 || er->rcEx == E2_CCCAM_NOK2 || er->rcEx == E2_CCCAM_LOOP)
|
---|
361 | return;
|
---|
362 |
|
---|
363 | stat->rc = rc;
|
---|
364 | stat->fail_factor++;
|
---|
365 | stat->last_received = ctime;
|
---|
366 |
|
---|
367 | //reduce ecm_count step by step
|
---|
368 | if (!cfg.lb_reopen_mode)
|
---|
369 | stat->ecm_count /= 10;
|
---|
370 | }
|
---|
371 | else if (rc == 5) { //timeout
|
---|
372 | //catch suddenly occuring timeouts and block reader:
|
---|
373 | if ((int)(ctime-stat->last_received) < (int)(5*cfg.ctimeout) &&
|
---|
374 | stat->rc == 0 &&
|
---|
375 | stat->ecm_count > 0) {
|
---|
376 | stat->rc = 5;
|
---|
377 | stat->fail_factor++;
|
---|
378 | }
|
---|
379 | else if ((rdr->client->login+(int)(2*cfg.ctimeout/1000)) < ctime && rdr->client->pending < 5) { //reader is longer than 5s connected && not more then 5 pending ecms
|
---|
380 | stat->rc = 5;
|
---|
381 | stat->fail_factor++;
|
---|
382 | }
|
---|
383 |
|
---|
384 | stat->last_received = ctime;
|
---|
385 |
|
---|
386 | if (!cfg.lb_reopen_mode)
|
---|
387 | stat->ecm_count /= 10;
|
---|
388 |
|
---|
389 | //add timeout to stat:
|
---|
390 | if (ecm_time<=0)
|
---|
391 | ecm_time = cfg.ctimeout;
|
---|
392 | stat->time_idx++;
|
---|
393 | if (stat->time_idx >= LB_MAX_STAT_TIME)
|
---|
394 | stat->time_idx = 0;
|
---|
395 | stat->time_stat[stat->time_idx] = ecm_time;
|
---|
396 | calc_stat(stat);
|
---|
397 | }
|
---|
398 | else
|
---|
399 | {
|
---|
400 | if (rc >= 0)
|
---|
401 | cs_debug_mask(D_TRACE, "loadbalancer: not handled stat for reader %s: rc %d %04hX&%06lX/%04hX/%02hX time %dms usagelevel %d",
|
---|
402 | rdr->label, rc, er->caid, prid, er->srvid, er->l, ecm_time, rdr->lb_usagelevel);
|
---|
403 |
|
---|
404 | return;
|
---|
405 | }
|
---|
406 |
|
---|
407 | housekeeping_stat(0);
|
---|
408 |
|
---|
409 | cs_debug_mask(D_TRACE, "loadbalancer: adding stat for reader %s: rc %d %04hX&%06lX/%04hX/%02hX time %dms usagelevel %d",
|
---|
410 | rdr->label, rc, er->caid, prid, er->srvid, er->l, ecm_time, rdr->lb_usagelevel);
|
---|
411 |
|
---|
412 | if (cfg.lb_save) {
|
---|
413 | stat_load_save++;
|
---|
414 | if (stat_load_save > cfg.lb_save)
|
---|
415 | save_stat_to_file(1);
|
---|
416 | }
|
---|
417 | }
|
---|
418 |
|
---|
419 | void reset_stat(uint16_t caid, uint32_t prid, uint16_t srvid, int16_t ecmlen)
|
---|
420 | {
|
---|
421 | //cs_debug_mask(D_TRACE, "loadbalance: resetting ecm count");
|
---|
422 | struct s_reader *rdr;
|
---|
423 | for (rdr=first_active_reader; rdr ; rdr=rdr->next) {
|
---|
424 | if (rdr->lb_stat && rdr->client) {
|
---|
425 | READER_STAT *stat = get_stat(rdr, caid, prid, srvid, ecmlen);
|
---|
426 | if (stat) {
|
---|
427 | if (stat->ecm_count > 0)
|
---|
428 | stat->ecm_count = 1; //not zero, so we know it's decodeable
|
---|
429 | stat->rc = 0;
|
---|
430 | stat->fail_factor = 0;
|
---|
431 | }
|
---|
432 | }
|
---|
433 | }
|
---|
434 | }
|
---|
435 |
|
---|
436 | int32_t has_ident(FTAB *ftab, ECM_REQUEST *er) {
|
---|
437 |
|
---|
438 | if (!ftab || !ftab->filts)
|
---|
439 | return 0;
|
---|
440 |
|
---|
441 | int32_t j, k;
|
---|
442 |
|
---|
443 | for (j = 0; j < ftab->nfilts; j++) {
|
---|
444 | if (ftab->filts[j].caid) {
|
---|
445 | if (ftab->filts[j].caid==er->caid) { //caid matches!
|
---|
446 | int32_t nprids = ftab->filts[j].nprids;
|
---|
447 | if (!nprids) // No Provider ->Ok
|
---|
448 | return 1;
|
---|
449 |
|
---|
450 | for (k = 0; k < nprids; k++) {
|
---|
451 | uint32_t prid = ftab->filts[j].prids[k];
|
---|
452 | if (prid == er->prid) { //Provider matches
|
---|
453 | return 1;
|
---|
454 | }
|
---|
455 | }
|
---|
456 | }
|
---|
457 | }
|
---|
458 | }
|
---|
459 | return 0; //No match!
|
---|
460 | }
|
---|
461 |
|
---|
462 | struct stat_value {
|
---|
463 | struct s_reader *rdr;
|
---|
464 | int32_t value;
|
---|
465 | int32_t time;
|
---|
466 | };
|
---|
467 |
|
---|
468 | static struct stat_value *crt_cur(struct s_reader *rdr, int32_t value, int32_t time) {
|
---|
469 | struct stat_value *v = malloc(sizeof(struct stat_value));
|
---|
470 | v->rdr = rdr;
|
---|
471 | v->value = value;
|
---|
472 | v->time = time;
|
---|
473 | return v;
|
---|
474 | }
|
---|
475 |
|
---|
476 | #ifdef WITH_DEBUG
|
---|
477 | static char *strend(char *c) {
|
---|
478 | while (c && *c) c++;
|
---|
479 | return c;
|
---|
480 | }
|
---|
481 | #endif
|
---|
482 |
|
---|
483 | static int32_t get_retrylimit(ECM_REQUEST *er) {
|
---|
484 | int32_t i;
|
---|
485 | for (i = 0; i < cfg.lb_retrylimittab.n; i++) {
|
---|
486 | if (cfg.lb_retrylimittab.caid[i] == er->caid)
|
---|
487 | return cfg.lb_retrylimittab.value[i];
|
---|
488 | }
|
---|
489 | return cfg.lb_retrylimit;
|
---|
490 | }
|
---|
491 |
|
---|
492 | static int32_t get_nbest_readers(ECM_REQUEST *er) {
|
---|
493 | int32_t i;
|
---|
494 | for (i = 0; i < cfg.lb_nbest_readers_tab.n; i++) {
|
---|
495 | if (cfg.lb_nbest_readers_tab.caid[i] == er->caid)
|
---|
496 | return cfg.lb_nbest_readers_tab.value[i];
|
---|
497 | }
|
---|
498 | return cfg.lb_nbest_readers;
|
---|
499 | }
|
---|
500 |
|
---|
501 | static int32_t get_reopen_seconds(READER_STAT *stat)
|
---|
502 | {
|
---|
503 | int32_t max = (INT_MAX / cfg.lb_reopen_seconds) - 1;
|
---|
504 | if (stat->fail_factor > max)
|
---|
505 | stat->fail_factor = max;
|
---|
506 | return (stat->fail_factor+1) * cfg.lb_reopen_seconds;
|
---|
507 | }
|
---|
508 |
|
---|
509 | ushort get_betatunnel_caid_to(ushort caid)
|
---|
510 | {
|
---|
511 | if (caid == 0x1801) return 0x1722;
|
---|
512 | if (caid == 0x1831) return 0x1722;
|
---|
513 | if (caid == 0x1833) return 0x1702;
|
---|
514 | if (caid == 0x1834) return 0x1722;
|
---|
515 | if (caid == 0x1835) return 0x1722;
|
---|
516 | if (caid == 0x1838) return 0x1722;
|
---|
517 | return 0;
|
---|
518 | }
|
---|
519 | /**
|
---|
520 | * Gets best reader for caid/prid/srvid/ecmlen.
|
---|
521 | * Best reader is evaluated by lowest avg time but only if ecm_count > cfg.lb_min_ecmcount (5)
|
---|
522 | * Also the reader is asked if he is "available"
|
---|
523 | * returns ridx when found or -1 when not found
|
---|
524 | */
|
---|
525 | int32_t get_best_reader(ECM_REQUEST *er)
|
---|
526 | {
|
---|
527 | if (!cfg.lb_mode || cfg.lb_mode==LB_LOG_ONLY)
|
---|
528 | return 0;
|
---|
529 |
|
---|
530 | LL_ITER *it;
|
---|
531 | struct s_reader *rdr;
|
---|
532 |
|
---|
533 | //preferred card forwarding (CCcam client):
|
---|
534 | if (cfg.cc_forward_origin_card && er->origin_card) {
|
---|
535 |
|
---|
536 | struct cc_card *card = er->origin_card;
|
---|
537 |
|
---|
538 | it = ll_iter_create(er->matching_rdr);
|
---|
539 | while ((rdr=ll_iter_next(it))) {
|
---|
540 | if (card->origin_reader == rdr)
|
---|
541 | break;
|
---|
542 | }
|
---|
543 | if (rdr) {
|
---|
544 | cs_debug_mask(D_TRACE, "loadbalancer: forward card: forced by card %d to reader %s", card->id, rdr->label);
|
---|
545 | ll_clear(er->matching_rdr);
|
---|
546 | ll_append(er->matching_rdr, rdr);
|
---|
547 | return 1;
|
---|
548 | }
|
---|
549 | }
|
---|
550 |
|
---|
551 | uint32_t prid = get_prid(er->caid, er->prid);
|
---|
552 |
|
---|
553 | //auto-betatunnel: The trick is: "let the loadbalancer decide"!
|
---|
554 | if (cfg.lb_auto_betatunnel && er->caid >> 8 == 0x18) { //nagra
|
---|
555 | ushort caid_to = get_betatunnel_caid_to(er->caid);
|
---|
556 | if (caid_to) {
|
---|
557 | int needs_stats = 0;
|
---|
558 |
|
---|
559 | int32_t time_nagra = 0;
|
---|
560 | int32_t time_beta = 0;
|
---|
561 |
|
---|
562 | READER_STAT *stat_nagra;
|
---|
563 | READER_STAT *stat_beta;
|
---|
564 |
|
---|
565 | //What is faster? nagra or beta?
|
---|
566 | it = ll_iter_create(er->matching_rdr);
|
---|
567 | while ((rdr=ll_iter_next(it)) && !needs_stats) {
|
---|
568 | stat_nagra = get_stat(rdr, er->caid, prid, er->srvid, er->l);
|
---|
569 | stat_beta = get_stat(rdr, caid_to, prid, er->srvid, er->l+10);
|
---|
570 |
|
---|
571 | if (stat_nagra && stat_nagra->rc == 0 && (!time_nagra || stat_nagra->time_avg < time_nagra))
|
---|
572 | time_nagra = stat_nagra->time_avg;
|
---|
573 | if (stat_beta && stat_beta->rc == 0 && (!time_beta || stat_beta->time_avg < time_beta))
|
---|
574 | time_beta = stat_beta->time_avg;
|
---|
575 |
|
---|
576 | if (!stat_nagra || !stat_beta)
|
---|
577 | needs_stats = 1; //Uncomplete reader evaluation, we need more stats!
|
---|
578 | }
|
---|
579 | ll_iter_release(it);
|
---|
580 |
|
---|
581 | //if we needs stats, we send 2 ecm requests: 18xx and 17xx:
|
---|
582 | if (needs_stats) {
|
---|
583 | cs_debug_mask(D_TRACE, "loadbalancer-betatunnel %04X:%04X needs more statistics...", er->caid, caid_to);
|
---|
584 | ECM_REQUEST *er_beta = get_ecmtask();
|
---|
585 | er_beta->ocaid = caid_to;
|
---|
586 | er_beta->caid = er->caid;
|
---|
587 | er_beta->prid = prid;
|
---|
588 | er_beta->srvid = er->srvid;
|
---|
589 | memcpy(er_beta->ecm, er->ecm, sizeof(er->ecm));
|
---|
590 | er_beta->l = er->l;
|
---|
591 | er_beta->client = er->client;
|
---|
592 | er_beta->beta_ptr_to_nagra = er;
|
---|
593 | convert_to_beta(er->client, er_beta, caid_to);
|
---|
594 | er_beta->btun = 0;
|
---|
595 | get_cw(er->client, er_beta);
|
---|
596 | }
|
---|
597 | else if (time_beta && time_beta < time_nagra) {
|
---|
598 | cs_debug_mask(D_TRACE, "loadbalancer-betatunnel %04X:%04X selected beta: n%dms>b%dms", er->caid, caid_to, time_nagra, time_beta);
|
---|
599 | convert_to_beta(er->client, er, caid_to);
|
---|
600 | }
|
---|
601 | else {
|
---|
602 | cs_debug_mask(D_TRACE, "loadbalancer-betatunnel %04X:%04X selected nagra: n%dms<b%dms", er->caid, caid_to, time_nagra, time_beta);
|
---|
603 | }
|
---|
604 | // else nagra is faster or no beta, so continue unmodified
|
---|
605 | }
|
---|
606 | }
|
---|
607 |
|
---|
608 | LLIST * result = ll_create();
|
---|
609 | LLIST * selected = ll_create();
|
---|
610 |
|
---|
611 | struct timeb new_nulltime;
|
---|
612 | memset(&new_nulltime, 0, sizeof(new_nulltime));
|
---|
613 | time_t current_time = time(NULL);
|
---|
614 | int32_t current = -1;
|
---|
615 | READER_STAT *stat = NULL;
|
---|
616 | int32_t retrylimit = get_retrylimit(er);
|
---|
617 |
|
---|
618 | int32_t nlocal_readers = 0;
|
---|
619 | int32_t nbest_readers = get_nbest_readers(er);
|
---|
620 | int32_t nfb_readers = cfg.lb_nfb_readers;
|
---|
621 | int32_t nreaders = cfg.lb_max_readers;
|
---|
622 | if (!nreaders) nreaders = -1;
|
---|
623 |
|
---|
624 | #ifdef WITH_DEBUG
|
---|
625 | if (cs_dblevel & 0x01) {
|
---|
626 | //loadbalancer debug output:
|
---|
627 | int32_t size = 1;
|
---|
628 | int32_t nr = 0;
|
---|
629 | it = ll_iter_create(er->matching_rdr);
|
---|
630 | while ((rdr=ll_iter_next(it))) {
|
---|
631 | if (nr > 5) {
|
---|
632 | size+=20;
|
---|
633 | break;
|
---|
634 | }
|
---|
635 | size += strlen(rdr->label)+1;
|
---|
636 | nr++;
|
---|
637 | }
|
---|
638 | ll_iter_reset(it);
|
---|
639 | char *rdrs = cs_malloc(&rdrs, size, 1);
|
---|
640 | char *rptr = rdrs;
|
---|
641 | *rptr = 0;
|
---|
642 | nr = 0;
|
---|
643 | while ((rdr=ll_iter_next(it))) {
|
---|
644 | if (nr > 5) {
|
---|
645 | snprintf(rptr, size, "...(%d more)", ll_count(er->matching_rdr)-nr);
|
---|
646 | break;
|
---|
647 | }
|
---|
648 | snprintf(rptr, size, "%s ", rdr->label);
|
---|
649 | rptr = strend(rptr);
|
---|
650 | nr++;
|
---|
651 | }
|
---|
652 | ll_iter_release(it);
|
---|
653 |
|
---|
654 | cs_debug_mask(D_TRACE, "loadbalancer: client %s for %04X&%06X/%04X/%02hX: n=%d valid readers: %s",
|
---|
655 | username(er->client), er->caid, prid, er->srvid, er->l, ll_count(er->matching_rdr), rdrs);
|
---|
656 |
|
---|
657 | free(rdrs);
|
---|
658 | }
|
---|
659 | #endif
|
---|
660 |
|
---|
661 | it = ll_iter_create(er->matching_rdr);
|
---|
662 | while ((rdr=ll_iter_next(it)) && nreaders) {
|
---|
663 |
|
---|
664 | int32_t weight = rdr->lb_weight <= 0?100:rdr->lb_weight;
|
---|
665 |
|
---|
666 | stat = get_stat(rdr, er->caid, prid, er->srvid, er->l);
|
---|
667 | if (!stat) {
|
---|
668 | cs_debug_mask(D_TRACE, "loadbalancer: starting statistics for reader %s", rdr->label);
|
---|
669 | add_stat(rdr, er, 1, -1);
|
---|
670 | ll_append(result, rdr); //no statistics, this reader is active (now) but we need statistics first!
|
---|
671 | nreaders--;
|
---|
672 | continue;
|
---|
673 | }
|
---|
674 |
|
---|
675 | if (stat->ecm_count < 0||(stat->ecm_count > cfg.lb_max_ecmcount && stat->time_avg > retrylimit)) {
|
---|
676 | cs_debug_mask(D_TRACE, "loadbalancer: max ecms (%d) reached by reader %s, resetting statistics", cfg.lb_max_ecmcount, rdr->label);
|
---|
677 | reset_stat(er->caid, prid, er->srvid, er->l);
|
---|
678 | ll_append(result, rdr); //max ecm reached, get new statistics
|
---|
679 | nreaders--;
|
---|
680 | continue;
|
---|
681 | }
|
---|
682 |
|
---|
683 | int32_t hassrvid = has_srvid(rdr->client, er) || has_ident(&rdr->ftab, er);
|
---|
684 |
|
---|
685 | if (stat->rc == 0 && stat->ecm_count < cfg.lb_min_ecmcount) {
|
---|
686 | cs_debug_mask(D_TRACE, "loadbalancer: reader %s needs more statistics", rdr->label);
|
---|
687 | ll_append(result, rdr); //need more statistics!
|
---|
688 | nreaders--;
|
---|
689 | continue;
|
---|
690 | }
|
---|
691 |
|
---|
692 | //Reader can decode this service (rc==0) and has lb_min_ecmcount ecms:
|
---|
693 | if (stat->rc == 0 || hassrvid) {
|
---|
694 | if (cfg.preferlocalcards && !(rdr->typ & R_IS_NETWORK))
|
---|
695 | nlocal_readers++; //Prefer local readers!
|
---|
696 |
|
---|
697 | if (stat->rc >= 5)
|
---|
698 | nbest_readers++; //just add another reader if best reader is nonresponding but has services
|
---|
699 |
|
---|
700 | switch (cfg.lb_mode) {
|
---|
701 | default:
|
---|
702 | case LB_NONE:
|
---|
703 | case LB_LOG_ONLY:
|
---|
704 | //cs_debug_mask(D_TRACE, "loadbalance disabled");
|
---|
705 | ll_append(result, rdr);
|
---|
706 | nreaders--;
|
---|
707 | continue;
|
---|
708 |
|
---|
709 | case LB_FASTEST_READER_FIRST:
|
---|
710 | current = stat->time_avg * 100 / weight;
|
---|
711 | break;
|
---|
712 |
|
---|
713 | case LB_OLDEST_READER_FIRST:
|
---|
714 | if (!rdr->lb_last.time)
|
---|
715 | rdr->lb_last = nulltime;
|
---|
716 | current = (1000*(rdr->lb_last.time-nulltime.time)+
|
---|
717 | rdr->lb_last.millitm-nulltime.millitm);
|
---|
718 | if (!new_nulltime.time || (1000*(rdr->lb_last.time-new_nulltime.time)+
|
---|
719 | rdr->lb_last.millitm-new_nulltime.millitm) < 0)
|
---|
720 | new_nulltime = rdr->lb_last;
|
---|
721 | break;
|
---|
722 |
|
---|
723 | case LB_LOWEST_USAGELEVEL:
|
---|
724 | current = rdr->lb_usagelevel * 100 / weight;
|
---|
725 | break;
|
---|
726 | }
|
---|
727 | #ifdef WEBIF
|
---|
728 | rdr->lbvalue = current;
|
---|
729 | #endif
|
---|
730 | if (rdr->ph.c_available
|
---|
731 | && !rdr->ph.c_available(rdr,
|
---|
732 | AVAIL_CHECK_LOADBALANCE)) {
|
---|
733 | current=current*2;
|
---|
734 | }
|
---|
735 |
|
---|
736 | if (rdr->client->pending)
|
---|
737 | current=current*rdr->client->pending;
|
---|
738 |
|
---|
739 | if (current < 1)
|
---|
740 | current=1;
|
---|
741 | ll_append(selected, crt_cur(rdr, current, stat->time_avg));
|
---|
742 | }
|
---|
743 | }
|
---|
744 | ll_iter_release(it);
|
---|
745 |
|
---|
746 | if (nlocal_readers > nbest_readers) { //if we have local readers, we prefer them!
|
---|
747 | nlocal_readers = nbest_readers;
|
---|
748 | nbest_readers = 0;
|
---|
749 | }
|
---|
750 | else
|
---|
751 | nbest_readers = nbest_readers-nlocal_readers;
|
---|
752 |
|
---|
753 | struct stat_value *stv;
|
---|
754 | it = ll_iter_create(selected);
|
---|
755 |
|
---|
756 | struct s_reader *best_rdr = NULL;
|
---|
757 | struct s_reader *best_rdri = NULL;
|
---|
758 | int32_t best_time = 0;
|
---|
759 | LL_NODE *fallback = NULL;
|
---|
760 |
|
---|
761 | int32_t n=0;
|
---|
762 | while (nreaders) {
|
---|
763 | struct stat_value *best = NULL;
|
---|
764 |
|
---|
765 | ll_iter_reset(it);
|
---|
766 | while ((stv=ll_iter_next(it))) {
|
---|
767 | if (nlocal_readers && (stv->rdr->typ & R_IS_NETWORK))
|
---|
768 | continue;
|
---|
769 |
|
---|
770 | if (stv->value && (!best || stv->value < best->value))
|
---|
771 | best=stv;
|
---|
772 | }
|
---|
773 | if (!best)
|
---|
774 | break;
|
---|
775 |
|
---|
776 | n++;
|
---|
777 | best_rdri = best->rdr;
|
---|
778 | if (!best_rdr) {
|
---|
779 | best_rdr = best_rdri;
|
---|
780 | best_time = best->time;
|
---|
781 | }
|
---|
782 | best->value = 0;
|
---|
783 |
|
---|
784 | if (nlocal_readers) {//primary readers, local
|
---|
785 | nlocal_readers--;
|
---|
786 | ll_append(result, best_rdri);
|
---|
787 | nreaders--;
|
---|
788 | //OLDEST_READER:
|
---|
789 | cs_ftime(&best_rdri->lb_last);
|
---|
790 | }
|
---|
791 | else if (nbest_readers) {//primary readers, other
|
---|
792 | nbest_readers--;
|
---|
793 | ll_append(result, best_rdri);
|
---|
794 | nreaders--;
|
---|
795 | //OLDEST_READER:
|
---|
796 | cs_ftime(&best_rdri->lb_last);
|
---|
797 | }
|
---|
798 | else if (nfb_readers) { //fallbacks:
|
---|
799 | nfb_readers--;
|
---|
800 | LL_NODE *node = ll_append(result, best_rdri);
|
---|
801 | if (!fallback)
|
---|
802 | fallback = node;
|
---|
803 | }
|
---|
804 | else
|
---|
805 | break;
|
---|
806 | }
|
---|
807 | ll_iter_release(it);
|
---|
808 | ll_destroy_data(selected);
|
---|
809 |
|
---|
810 | if (!n) //no best reader found? reopen if we have ecm_count>0
|
---|
811 | {
|
---|
812 | cs_debug_mask(D_TRACE, "loadbalancer: NO MATCHING READER FOUND, reopen last valid:");
|
---|
813 | it = ll_iter_create(er->matching_rdr);
|
---|
814 | while ((rdr=ll_iter_next(it))) {
|
---|
815 | stat = get_stat(rdr, er->caid, prid, er->srvid, er->l);
|
---|
816 | if (stat && stat->ecm_count>0) {
|
---|
817 | if (!ll_contains(result, rdr) && nreaders) {
|
---|
818 | ll_append(result, rdr);
|
---|
819 | nreaders--;
|
---|
820 | }
|
---|
821 | n++;
|
---|
822 | cs_debug_mask(D_TRACE, "loadbalancer: reopened reader %s", rdr->label);
|
---|
823 | }
|
---|
824 | }
|
---|
825 | ll_iter_release(it);
|
---|
826 | cs_debug_mask(D_TRACE, "loadbalancer: reopened %d readers", n);
|
---|
827 | }
|
---|
828 |
|
---|
829 | //algo for reopen other reader only if responsetime>retrylimit:
|
---|
830 | int32_t reopen = !best_rdr || (best_time && (best_time > retrylimit));
|
---|
831 | if (reopen) {
|
---|
832 | #ifdef WITH_DEBUG
|
---|
833 | if (best_rdr)
|
---|
834 | cs_debug_mask(D_TRACE, "loadbalancer: reader %s reached retrylimit (%dms), reopening other readers", best_rdr->label, best_time);
|
---|
835 | else
|
---|
836 | cs_debug_mask(D_TRACE, "loadbalancer: no best reader found, reopening other readers");
|
---|
837 | #endif
|
---|
838 | it = ll_iter_create(er->matching_rdr);
|
---|
839 | while ((rdr=ll_iter_next(it)) && nreaders) {
|
---|
840 | stat = get_stat(rdr, er->caid, prid, er->srvid, er->l);
|
---|
841 |
|
---|
842 | if (stat && stat->rc != 0) { //retrylimit reached:
|
---|
843 | if (stat->last_received+get_reopen_seconds(stat) < current_time) { //Retrying reader every (900/conf) seconds
|
---|
844 | stat->last_received = current_time;
|
---|
845 | nreaders += ll_remove(result, rdr);
|
---|
846 | ll_prepend(result, rdr);
|
---|
847 | nreaders--;
|
---|
848 | cs_debug_mask(D_TRACE, "loadbalancer: retrying reader %s", rdr->label);
|
---|
849 | }
|
---|
850 | }
|
---|
851 | }
|
---|
852 | ll_iter_release(it);
|
---|
853 | }
|
---|
854 |
|
---|
855 | //Setting return values:
|
---|
856 | ll_destroy(er->matching_rdr);
|
---|
857 | er->matching_rdr = result;
|
---|
858 | er->fallback = fallback;
|
---|
859 |
|
---|
860 | if (new_nulltime.time)
|
---|
861 | nulltime = new_nulltime;
|
---|
862 |
|
---|
863 | #ifdef WITH_DEBUG
|
---|
864 | if (cs_dblevel & 0x01) {
|
---|
865 | //loadbalancer debug output:
|
---|
866 | int32_t size = 3;
|
---|
867 | int32_t nr = 0;
|
---|
868 | it = ll_iter_create(result);
|
---|
869 | while ((rdr=ll_iter_next(it))) {
|
---|
870 | if (nr > 5) {
|
---|
871 | size+=20;
|
---|
872 | break;
|
---|
873 | }
|
---|
874 | size += strlen(rdr->label)+1;
|
---|
875 | nr++;
|
---|
876 | }
|
---|
877 | ll_iter_reset(it);
|
---|
878 | char *rdrs = cs_malloc(&rdrs, size, 1);
|
---|
879 | char *rptr = rdrs;
|
---|
880 | *rptr = 0;
|
---|
881 | nr = 0;
|
---|
882 | while ((rdr=ll_iter_next(it))) {
|
---|
883 | if (fallback && it->cur == fallback) {
|
---|
884 | snprintf(rptr, size, "[");
|
---|
885 | rptr = strend(rptr);
|
---|
886 | }
|
---|
887 | if (nr > 5) {
|
---|
888 | snprintf(rptr, size, "...(%d more)", ll_count(result)-nr);
|
---|
889 | rptr = strend(rptr);
|
---|
890 | break;
|
---|
891 | }
|
---|
892 | snprintf(rptr, size, "%s ", rdr->label);
|
---|
893 | rptr = strend(rptr);
|
---|
894 |
|
---|
895 | nr++;
|
---|
896 | }
|
---|
897 | if (fallback) {
|
---|
898 | rptr--;
|
---|
899 | *rptr=']';
|
---|
900 | }
|
---|
901 | ll_iter_release(it);
|
---|
902 |
|
---|
903 | cs_debug_mask(D_TRACE, "loadbalancer: client %s for %04X&%06X/%04X:%02hX: n=%d selected readers: %s",
|
---|
904 | username(er->client), er->caid, prid, er->srvid, er->l, ll_count(result), rdrs);
|
---|
905 |
|
---|
906 | free(rdrs);
|
---|
907 | }
|
---|
908 | #endif
|
---|
909 |
|
---|
910 |
|
---|
911 | return 1;
|
---|
912 | }
|
---|
913 |
|
---|
914 | /**
|
---|
915 | * clears statistic of reader ridx.
|
---|
916 | **/
|
---|
917 | void clear_reader_stat(struct s_reader *rdr)
|
---|
918 | {
|
---|
919 | if (!rdr->lb_stat)
|
---|
920 | return;
|
---|
921 |
|
---|
922 | ll_clear_data(rdr->lb_stat);
|
---|
923 | }
|
---|
924 |
|
---|
925 | void clear_all_stat()
|
---|
926 | {
|
---|
927 | struct s_reader *rdr;
|
---|
928 | LL_ITER *itr = ll_iter_create(configured_readers);
|
---|
929 | while ((rdr = ll_iter_next(itr))) {
|
---|
930 | clear_reader_stat(rdr);
|
---|
931 | }
|
---|
932 | ll_iter_release(itr);
|
---|
933 | }
|
---|
934 |
|
---|
935 | void housekeeping_stat_thread()
|
---|
936 | {
|
---|
937 | time_t cleanup_time = time(NULL) - (cfg.lb_stat_cleanup*60*60);
|
---|
938 | int32_t cleaned = 0;
|
---|
939 | struct s_reader *rdr;
|
---|
940 | LL_ITER *itr = ll_iter_create(configured_readers);
|
---|
941 | while ((rdr = ll_iter_next(itr))) {
|
---|
942 | if (rdr->lb_stat) {
|
---|
943 | LL_ITER *it = ll_iter_create(rdr->lb_stat);
|
---|
944 | READER_STAT *stat;
|
---|
945 | while ((stat=ll_iter_next(it))) {
|
---|
946 |
|
---|
947 | if (stat->last_received < cleanup_time) {
|
---|
948 | ll_iter_remove_data(it);
|
---|
949 | cleaned++;
|
---|
950 | }
|
---|
951 | }
|
---|
952 |
|
---|
953 | ll_iter_release(it);
|
---|
954 | }
|
---|
955 | }
|
---|
956 | ll_iter_release(itr);
|
---|
957 | cs_debug_mask(D_TRACE, "loadbalancer cleanup: removed %d entries", cleaned);
|
---|
958 | }
|
---|
959 |
|
---|
960 | void housekeeping_stat(int32_t force)
|
---|
961 | {
|
---|
962 | time_t now = time(NULL);
|
---|
963 | if (!force && now/60/60 == last_housekeeping/60/60) //only clean once in an hour
|
---|
964 | return;
|
---|
965 |
|
---|
966 | last_housekeeping = now;
|
---|
967 | start_thread((void*)&housekeeping_stat_thread, "housekeeping lb stats");
|
---|
968 | }
|
---|