1 | #ifndef PROVIDER_H |
---|
2 | #define PROVIDER_H |
---|
3 | |
---|
4 | int getlastproviderid() |
---|
5 | { |
---|
6 | debug(1000, "in"); |
---|
7 | int lastid = 0; |
---|
8 | struct provider *node = provider, *prev = NULL; |
---|
9 | |
---|
10 | while(node != NULL) |
---|
11 | { |
---|
12 | if(lastid < node->providerid) |
---|
13 | lastid = node->providerid; |
---|
14 | prev = node; |
---|
15 | node = node->next; |
---|
16 | } |
---|
17 | |
---|
18 | debug(1000, "out"); |
---|
19 | return lastid; |
---|
20 | } |
---|
21 | |
---|
22 | struct provider* getlastprovider(struct provider* node) |
---|
23 | { |
---|
24 | debug(1000, "in"); |
---|
25 | struct provider *prev = NULL; |
---|
26 | |
---|
27 | while(node != NULL) |
---|
28 | { |
---|
29 | prev = node; |
---|
30 | node = node->next; |
---|
31 | } |
---|
32 | |
---|
33 | debug(1000, "out"); |
---|
34 | return prev; |
---|
35 | } |
---|
36 | |
---|
37 | int moveproviderblockdown(struct provider* node) |
---|
38 | { |
---|
39 | int i = 0, ret = 0; |
---|
40 | struct provider* prev = NULL; |
---|
41 | |
---|
42 | if(node == NULL) |
---|
43 | { |
---|
44 | debug(1000, "NULL detect"); |
---|
45 | return 1; |
---|
46 | } |
---|
47 | |
---|
48 | for(i = 0; i < status.moveblockcount; i++) |
---|
49 | { |
---|
50 | if(node == NULL) break; |
---|
51 | node = node->next; |
---|
52 | } |
---|
53 | |
---|
54 | for(i = 0; i < status.moveblockcount + 1; i++) |
---|
55 | { |
---|
56 | if(node == NULL) break; |
---|
57 | prev = node->prev; |
---|
58 | ret = moveproviderdown(node); |
---|
59 | node = prev; |
---|
60 | } |
---|
61 | |
---|
62 | return ret; |
---|
63 | } |
---|
64 | |
---|
65 | int moveproviderdown(struct provider* node) |
---|
66 | { |
---|
67 | struct provider* prev = NULL, *next = NULL; |
---|
68 | |
---|
69 | if(node == NULL || provider == NULL) |
---|
70 | { |
---|
71 | debug(1000, "NULL detect"); |
---|
72 | return 1; |
---|
73 | } |
---|
74 | |
---|
75 | //only one node |
---|
76 | if(node->prev == NULL && node->next == NULL) |
---|
77 | return 0; |
---|
78 | |
---|
79 | //last node |
---|
80 | if(node->next == NULL) |
---|
81 | { |
---|
82 | if(node->prev != NULL) |
---|
83 | node->prev->next = NULL; |
---|
84 | node->prev = NULL; |
---|
85 | node->next = provider; |
---|
86 | provider->prev = node; |
---|
87 | provider = node; |
---|
88 | return 99; |
---|
89 | } |
---|
90 | |
---|
91 | //haenge node aus |
---|
92 | if(node->prev != NULL) |
---|
93 | node->prev->next = node->next; |
---|
94 | else |
---|
95 | provider = node->next; |
---|
96 | node->next->prev = node->prev; |
---|
97 | |
---|
98 | //save nodes next and prev |
---|
99 | next = node->next; |
---|
100 | prev = node->prev; |
---|
101 | |
---|
102 | //haenge es eine pos nacher ein |
---|
103 | node->next = next->next; |
---|
104 | node->prev = next; |
---|
105 | |
---|
106 | if(next->next != NULL) |
---|
107 | next->next->prev = node; |
---|
108 | next->next = node; |
---|
109 | |
---|
110 | status.writeprovider = 1; |
---|
111 | return 0; |
---|
112 | } |
---|
113 | |
---|
114 | int moveproviderblockup(struct provider* node) |
---|
115 | { |
---|
116 | int i = 0, ret = 0; |
---|
117 | struct provider* next = NULL; |
---|
118 | |
---|
119 | if(node == NULL) |
---|
120 | { |
---|
121 | debug(1000, "NULL detect"); |
---|
122 | return 1; |
---|
123 | } |
---|
124 | |
---|
125 | for(i = 0; i < status.moveblockcount + 1; i++) |
---|
126 | { |
---|
127 | if(node == NULL) break; |
---|
128 | next = node->next; |
---|
129 | ret = moveproviderup(node); |
---|
130 | node = next; |
---|
131 | } |
---|
132 | |
---|
133 | return ret; |
---|
134 | } |
---|
135 | |
---|
136 | int moveproviderup(struct provider* node) |
---|
137 | { |
---|
138 | struct provider* prev = NULL, *next = NULL, *last = NULL; |
---|
139 | |
---|
140 | if(node == NULL || provider == NULL) |
---|
141 | { |
---|
142 | debug(1000, "NULL detect"); |
---|
143 | return 1; |
---|
144 | } |
---|
145 | |
---|
146 | //only one node |
---|
147 | if(node->prev == NULL && node->next == NULL) |
---|
148 | return 0; |
---|
149 | |
---|
150 | //first node |
---|
151 | if(node->prev == NULL) |
---|
152 | { |
---|
153 | last = getlastprovider(provider); |
---|
154 | |
---|
155 | if(node->next != NULL) |
---|
156 | node->next->prev = NULL; |
---|
157 | provider = node->next; |
---|
158 | node->next = NULL; |
---|
159 | last->next = node; |
---|
160 | node->prev = last; |
---|
161 | return 99; |
---|
162 | } |
---|
163 | |
---|
164 | //haenge node aus |
---|
165 | node->prev->next = node->next; |
---|
166 | if(node->next != NULL) |
---|
167 | node->next->prev = node->prev; |
---|
168 | |
---|
169 | //save nodes next and prev |
---|
170 | next = node->next; |
---|
171 | prev = node->prev; |
---|
172 | |
---|
173 | //haenge es eine pos voher ein |
---|
174 | node->next = prev; |
---|
175 | node->prev = prev->prev; |
---|
176 | |
---|
177 | if(prev->prev != NULL) |
---|
178 | prev->prev->next = node; |
---|
179 | else |
---|
180 | provider = node; |
---|
181 | prev->prev = node; |
---|
182 | |
---|
183 | status.writeprovider = 1; |
---|
184 | return 0; |
---|
185 | } |
---|
186 | |
---|
187 | struct provider* addprovider(char *line, int count, struct provider* last) |
---|
188 | { |
---|
189 | //debug(1000, "in"); |
---|
190 | struct provider *newnode = NULL, *prev = NULL, *node = provider; |
---|
191 | char *name = NULL; |
---|
192 | int ret = 0; |
---|
193 | |
---|
194 | newnode = (struct provider*)calloc(1, sizeof(struct provider)); |
---|
195 | if(newnode == NULL) |
---|
196 | { |
---|
197 | err("no memory"); |
---|
198 | return NULL; |
---|
199 | } |
---|
200 | |
---|
201 | name = malloc(MINMALLOC); |
---|
202 | if(name == NULL) |
---|
203 | { |
---|
204 | err("no memory"); |
---|
205 | free(newnode); |
---|
206 | return NULL; |
---|
207 | } |
---|
208 | |
---|
209 | status.writeprovider = 1; |
---|
210 | |
---|
211 | ret = sscanf(line, "%d#%[^#]#%d", &newnode->providerid, name, &newnode->flag); |
---|
212 | if(ret != 3) |
---|
213 | { |
---|
214 | if(count > 0) |
---|
215 | { |
---|
216 | err("providerlist line %d not ok", count); |
---|
217 | } |
---|
218 | else |
---|
219 | { |
---|
220 | err("add provider"); |
---|
221 | } |
---|
222 | free(name); |
---|
223 | free(newnode); |
---|
224 | return NULL; |
---|
225 | } |
---|
226 | |
---|
227 | newnode->name = ostrshrink(name); |
---|
228 | |
---|
229 | if(last == NULL) |
---|
230 | { |
---|
231 | while(node != NULL && strcoll(newnode->name, node->name) > 0) |
---|
232 | { |
---|
233 | prev = node; |
---|
234 | node = node->next; |
---|
235 | } |
---|
236 | } |
---|
237 | else |
---|
238 | { |
---|
239 | prev = last; |
---|
240 | node = last->next; |
---|
241 | } |
---|
242 | |
---|
243 | if(prev == NULL) |
---|
244 | provider = newnode; |
---|
245 | else |
---|
246 | { |
---|
247 | prev->next = newnode; |
---|
248 | newnode->prev = prev; |
---|
249 | } |
---|
250 | newnode->next = node; |
---|
251 | if(node != NULL) node->prev = newnode; |
---|
252 | |
---|
253 | //debug(1000, "out"); |
---|
254 | return newnode; |
---|
255 | } |
---|
256 | |
---|
257 | int readprovider(const char* filename) |
---|
258 | { |
---|
259 | debug(1000, "in"); |
---|
260 | FILE *fd = NULL; |
---|
261 | char *fileline = NULL, *tmpstr = NULL, *tmpstr0 = NULL, *tmpstr1 = NULL; |
---|
262 | int linecount = 0, treffer0 = 1, treffer1 = 1, len = 0; |
---|
263 | struct provider* last = NULL, *tmplast = NULL; |
---|
264 | |
---|
265 | tmpstr0 = getconfig("channellist", NULL); |
---|
266 | tmpstr1 = getconfig("rchannellist", NULL); |
---|
267 | if(ostrncmp("(PROVIDER)-", tmpstr0, 11) == 0) treffer0 = 0; |
---|
268 | if(ostrncmp("(PROVIDER)-", tmpstr1, 11) == 0) treffer1 = 0; |
---|
269 | |
---|
270 | fileline = malloc(MINMALLOC); |
---|
271 | if(fileline == NULL) |
---|
272 | { |
---|
273 | err("no memory"); |
---|
274 | return 1; |
---|
275 | } |
---|
276 | |
---|
277 | fd = fopen(filename, "r"); |
---|
278 | if(fd == NULL) |
---|
279 | { |
---|
280 | perr("can't open %s", filename); |
---|
281 | free(fileline); |
---|
282 | return 1; |
---|
283 | } |
---|
284 | |
---|
285 | while(fgets(fileline, MINMALLOC, fd) != NULL) |
---|
286 | { |
---|
287 | if(fileline[0] == '#' || fileline[0] == '\n') |
---|
288 | continue; |
---|
289 | len = strlen(fileline) - 1; |
---|
290 | if(len >= 0 && fileline[len] == '\n') |
---|
291 | fileline[len] = '\0'; |
---|
292 | len--; |
---|
293 | if(len >= 0 && fileline[len] == '\r') |
---|
294 | fileline[len] = '\0'; |
---|
295 | |
---|
296 | linecount++; |
---|
297 | |
---|
298 | if(last == NULL) last = tmplast; |
---|
299 | last = addprovider(fileline, linecount, last); |
---|
300 | if(last != NULL) |
---|
301 | { |
---|
302 | tmplast = last; |
---|
303 | tmpstr = ostrcat("(PROVIDER)-", last->name, 0, 0); |
---|
304 | |
---|
305 | if(treffer0 == 0 && ostrcmp(tmpstr, tmpstr0) == 0) |
---|
306 | treffer0 = 1; |
---|
307 | if(treffer1 == 0 && ostrcmp(tmpstr, tmpstr1) == 0) |
---|
308 | treffer1 = 1; |
---|
309 | free(tmpstr); tmpstr = NULL; |
---|
310 | } |
---|
311 | } |
---|
312 | |
---|
313 | if(treffer0 == 0) delconfig("channellist"); |
---|
314 | if(treffer1 == 0) delconfig("rchannellist"); |
---|
315 | |
---|
316 | status.writeprovider = 0; |
---|
317 | free(fileline); |
---|
318 | fclose(fd); |
---|
319 | return 0; |
---|
320 | } |
---|
321 | |
---|
322 | void delprovider(int providerid) |
---|
323 | { |
---|
324 | debug(1000, "in"); |
---|
325 | struct provider *node = provider, *prev = provider; |
---|
326 | |
---|
327 | while(node != NULL) |
---|
328 | { |
---|
329 | if(node->providerid == providerid) |
---|
330 | { |
---|
331 | status.writeprovider = 1; |
---|
332 | if(node == provider) |
---|
333 | { |
---|
334 | provider = node->next; |
---|
335 | if(provider != NULL) |
---|
336 | provider->prev = NULL; |
---|
337 | } |
---|
338 | else |
---|
339 | { |
---|
340 | prev->next = node->next; |
---|
341 | if(node->next != NULL) |
---|
342 | node->next->prev = prev; |
---|
343 | } |
---|
344 | |
---|
345 | free(node->name); |
---|
346 | node->name = NULL; |
---|
347 | |
---|
348 | free(node); |
---|
349 | node = NULL; |
---|
350 | break; |
---|
351 | } |
---|
352 | |
---|
353 | prev = node; |
---|
354 | node = node->next; |
---|
355 | } |
---|
356 | debug(1000, "out"); |
---|
357 | } |
---|
358 | |
---|
359 | void delprovidernotused(struct provider* node) |
---|
360 | { |
---|
361 | struct channel* chnode = channel; |
---|
362 | |
---|
363 | if(node == NULL) return; |
---|
364 | |
---|
365 | while(chnode != NULL) |
---|
366 | { |
---|
367 | if(chnode->providerid == node->providerid) |
---|
368 | return; |
---|
369 | chnode = chnode->next; |
---|
370 | } |
---|
371 | delprovider(node->providerid); |
---|
372 | } |
---|
373 | |
---|
374 | struct provider* getproviderbyname(char* name) |
---|
375 | { |
---|
376 | debug(1000, "in"); |
---|
377 | struct provider *node = provider; |
---|
378 | |
---|
379 | while(node != NULL) |
---|
380 | { |
---|
381 | if(ostrcmp(node->name, name) == 0) |
---|
382 | { |
---|
383 | debug(1000, "out"); |
---|
384 | return node; |
---|
385 | } |
---|
386 | |
---|
387 | node = node->next; |
---|
388 | } |
---|
389 | debug(100, "provider not found (name=%s)", name); |
---|
390 | return NULL; |
---|
391 | } |
---|
392 | |
---|
393 | struct provider* getprovider(int providerid) |
---|
394 | { |
---|
395 | //debug(1000, "in"); |
---|
396 | struct provider *node = provider; |
---|
397 | |
---|
398 | while(node != NULL) |
---|
399 | { |
---|
400 | if(node->providerid == providerid) |
---|
401 | { |
---|
402 | //debug(1000, "out"); |
---|
403 | return node; |
---|
404 | } |
---|
405 | |
---|
406 | node = node->next; |
---|
407 | } |
---|
408 | debug(100, "provider not found (providerid=%d)", providerid); |
---|
409 | return NULL; |
---|
410 | } |
---|
411 | |
---|
412 | int provider2bouquet(int providerid) |
---|
413 | { |
---|
414 | struct provider* pnode = NULL; |
---|
415 | struct mainbouquet* mnode = NULL; |
---|
416 | struct channel* chnode = channel; |
---|
417 | char* tmpstr = NULL; |
---|
418 | char* path = NULL; |
---|
419 | |
---|
420 | pnode = getprovider(providerid); |
---|
421 | if(pnode == NULL) return 1; |
---|
422 | |
---|
423 | tmpstr = ostrcat(tmpstr, pnode->name, 1, 0); |
---|
424 | tmpstr = ostrcat(tmpstr, "#", 1, 0); |
---|
425 | tmpstr = ostrcat(tmpstr, oitoa(status.servicetype), 1, 1); |
---|
426 | tmpstr = ostrcat(tmpstr, "#", 1, 0); |
---|
427 | |
---|
428 | path = realpath(getconfig("bouquetfile", NULL), NULL); |
---|
429 | if(path != NULL) path = dirname(path); |
---|
430 | path = ostrcat(path, "/bouquets.", 1, 0); |
---|
431 | |
---|
432 | path = ostrcat(path, pnode->name, 1, 0); |
---|
433 | if(status.servicetype == 0) path = ostrcat(path, "_tv", 1, 0); |
---|
434 | if(status.servicetype == 1) path = ostrcat(path, "_radio", 1, 0); |
---|
435 | |
---|
436 | if(file_exist(path)) |
---|
437 | { |
---|
438 | free(tmpstr); tmpstr = NULL; |
---|
439 | free(path); path = NULL; |
---|
440 | return 1; |
---|
441 | } |
---|
442 | |
---|
443 | tmpstr = ostrcat(tmpstr, path, 1, 0); |
---|
444 | mnode = addmainbouquet(tmpstr, 1, NULL); |
---|
445 | free(tmpstr); tmpstr = NULL; |
---|
446 | free(path); path = NULL; |
---|
447 | |
---|
448 | if(mnode != NULL) |
---|
449 | { |
---|
450 | while(chnode != NULL) |
---|
451 | { |
---|
452 | if(chnode->providerid == providerid && chnode->servicetype == status.servicetype) |
---|
453 | { |
---|
454 | tmpstr = ostrcat(tmpstr, oitoa(chnode->serviceid), 1, 1); |
---|
455 | tmpstr = ostrcat(tmpstr, "#", 1, 0); |
---|
456 | tmpstr = ostrcat(tmpstr, ollutoa(chnode->transponderid), 1, 1); |
---|
457 | addbouquet(&mnode->bouquet, tmpstr, status.servicetype, 1, NULL); |
---|
458 | free(tmpstr); tmpstr = NULL; |
---|
459 | } |
---|
460 | chnode = chnode->next; |
---|
461 | } |
---|
462 | } |
---|
463 | |
---|
464 | return 0; |
---|
465 | } |
---|
466 | |
---|
467 | void freeprovider() |
---|
468 | { |
---|
469 | debug(1000, "in"); |
---|
470 | struct provider *node = provider, *prev = provider; |
---|
471 | |
---|
472 | while(node != NULL) |
---|
473 | { |
---|
474 | prev = node; |
---|
475 | node = node->next; |
---|
476 | if(prev != NULL) |
---|
477 | delprovider(prev->providerid); |
---|
478 | } |
---|
479 | debug(1000, "out"); |
---|
480 | } |
---|
481 | |
---|
482 | int writeprovider(const char *filename) |
---|
483 | { |
---|
484 | debug(1000, "in"); |
---|
485 | FILE *fd = NULL; |
---|
486 | struct provider *node = provider; |
---|
487 | int ret; |
---|
488 | |
---|
489 | fd = fopen(filename, "w"); |
---|
490 | if(fd == NULL) |
---|
491 | { |
---|
492 | perr("can't open %s", filename); |
---|
493 | return 1; |
---|
494 | } |
---|
495 | |
---|
496 | while(node != NULL) |
---|
497 | { |
---|
498 | ret = fprintf(fd, "%d#%s#%d\n", node->providerid, node->name, node->flag); |
---|
499 | if(ret < 0) |
---|
500 | { |
---|
501 | perr("writting file %s", filename); |
---|
502 | } |
---|
503 | node = node->next; |
---|
504 | } |
---|
505 | |
---|
506 | fclose(fd); |
---|
507 | debug(1000, "out"); |
---|
508 | return 0; |
---|
509 | } |
---|
510 | |
---|
511 | #endif |
---|
512 | |
---|