tsdecrypt reads and decrypts CSA encrypted incoming mpeg transport stream over UDP/RTP using code words obtained from OSCAM or similar CAM server. tsdecrypt communicates with CAM server using cs378x (camd35 over tcp) protocol or newcamd protocol. https://georgi.unixsol.org/programs/tsdecrypt/
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

filter.c 7.2KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232
  1. /*
  2. * Filtering functions
  3. * Copyright (C) 2012 Unix Solutions Ltd.
  4. *
  5. * This program is free software; you can redistribute it and/or modify
  6. * it under the terms of the GNU General Public License version 2
  7. * as published by the Free Software Foundation.
  8. *
  9. * This program is distributed in the hope that it will be useful,
  10. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. * GNU General Public License (COPYING file) for more details.
  13. *
  14. */
  15. #include <ctype.h>
  16. #include <string.h>
  17. #include "data.h"
  18. #include "filter.h"
  19. struct filter_actions_map {
  20. const char *token;
  21. bool last;
  22. enum filter_action type;
  23. };
  24. static struct filter_actions_map action_tokens[] = {
  25. { "accept_all", true, FILTER_ACCEPT_ALL },
  26. { "acceptall", true, FILTER_ACCEPT_ALL },
  27. { "reject_all", true, FILTER_REJECT_ALL },
  28. { "rejectall", true, FILTER_REJECT_ALL },
  29. { "accept", false, FILTER_ACCEPT },
  30. { "reject", false, FILTER_REJECT },
  31. { NULL, true, FILTER_NO_MATCH },
  32. };
  33. enum filter_token { T_UNKNOWN, T_NAME, T_OFFSET, T_DATA, T_MATCH, T_MASK };
  34. struct filter_data_map {
  35. const char *token;
  36. enum filter_token type;
  37. };
  38. static struct filter_data_map data_tokens[] = {
  39. { "name", T_NAME },
  40. { "ofs", T_OFFSET },
  41. { "offset", T_OFFSET },
  42. { "data", T_DATA },
  43. { "match", T_MATCH },
  44. { "mask", T_MASK },
  45. { NULL, T_UNKNOWN },
  46. };
  47. int parse_hex(char *data, uint8_t *output, uint8_t *output_len, uint8_t output_size) {
  48. int i, len = strlen(data), consumed = 0;
  49. uint8_t local_output_len = 0;
  50. if (!output_len)
  51. output_len = &local_output_len;
  52. for (i = 0; i < len; i++) { // Parse data (01 02 03 04 ...)
  53. char ch = toupper(data[i]);
  54. // Skip 0x prefixes
  55. if (i + 1 < len && ch == '0' && toupper(data[i + 1]) == 'X')
  56. continue;
  57. if (!isxdigit(ch))
  58. continue;
  59. ch -= ch > 64 ? 55 : 48; // hex2dec
  60. if (consumed % 2 == 0) {
  61. output[*output_len] = 0; // Reset
  62. output[*output_len] += ch << 4;
  63. } else {
  64. output[*output_len] += ch;
  65. (*output_len)++;
  66. if (*output_len + 1 >= output_size) {
  67. fprintf(stderr, "WARN : Too much filter data (max %d bytes), ignoring last bytes: %s\n",
  68. output_size, data + i + 2);
  69. break;
  70. }
  71. }
  72. consumed++;
  73. }
  74. return *output_len;
  75. }
  76. int filter_parse(char *filter_def, struct filter *filter) {
  77. int j, k, ret = 0;
  78. char *str1, *saveptr1;
  79. char *f = strdup(filter_def);
  80. memset(filter, 0, sizeof(struct filter));
  81. memset(filter->mask, 0xff, sizeof(filter->mask));
  82. snprintf(filter->name, sizeof(filter->name), "NONAME");
  83. for (j = 1, str1 = f; ; j++, str1 = NULL) {
  84. char *token = strtok_r(str1, "/", &saveptr1);
  85. if (token == NULL)
  86. break;
  87. if (j == 1) { // First token, the command
  88. struct filter_actions_map *m;
  89. for (m = action_tokens; m->token; m++) {
  90. if (strstr(token, m->token) == token) {
  91. filter->action = m->type;
  92. ret = 1;
  93. if (m->last)
  94. goto OUT; // Other tokens are not needed
  95. break;
  96. }
  97. }
  98. if (filter->action == FILTER_NO_MATCH) {
  99. fprintf(stderr, "ERROR: Unknown filter command: %s\n", token);
  100. ret = 0;
  101. goto OUT; // Other tokens are not needed
  102. }
  103. }
  104. if (j == 2) { // Second token, the settings
  105. char *str2, *saveptr2;
  106. for (k = 1, str2 = token; ; k++, str2 = NULL) {
  107. char *token2 = strtok_r(str2, ",", &saveptr2);
  108. if (token2 == NULL)
  109. break;
  110. char *tokdata = strrchr(token2, '=');
  111. if (tokdata) {
  112. tokdata++; // Skip =
  113. struct filter_data_map *m;
  114. enum filter_token data_type = T_UNKNOWN;
  115. for (m = data_tokens; m->token; m++) {
  116. if (strstr(token2, m->token) == token2) {
  117. data_type = m->type;
  118. break;
  119. }
  120. }
  121. switch (data_type) {
  122. case T_NAME:
  123. snprintf(filter->name, sizeof(filter->name), "%s", tokdata);
  124. break;
  125. case T_OFFSET:
  126. filter->offset = strtoul(tokdata, NULL, 0);
  127. break;
  128. case T_DATA:
  129. ret = parse_hex(tokdata, filter->data, &filter->filter_len, MAX_FILTER_LEN);
  130. break;
  131. case T_MATCH:
  132. filter->type = FILTER_TYPE_MASK;
  133. ret = parse_hex(tokdata, filter->data, &filter->filter_len, MAX_FILTER_LEN);
  134. break;
  135. case T_MASK:
  136. filter->type = FILTER_TYPE_MASK;
  137. ret = parse_hex(tokdata, filter->mask, NULL, MAX_FILTER_LEN);
  138. break;
  139. default:
  140. fprintf(stderr, "WARN : Unknown filter setting: %s\n", token2);
  141. }
  142. }
  143. }
  144. }
  145. }
  146. OUT:
  147. FREE(f);
  148. return ret;
  149. }
  150. void filter_dump(struct filter *filter, char *buffer, unsigned int buf_len) {
  151. unsigned int pos = 0;
  152. memset(buffer, 0, buf_len);
  153. pos += snprintf(buffer + pos, buf_len - pos, "Action: %s",
  154. filter->action == FILTER_ACCEPT_ALL ? "ACCEPT_ALL (default)" :
  155. filter->action == FILTER_REJECT_ALL ? "REJECT_ALL (default)" :
  156. filter->action == FILTER_ACCEPT ? "ACCEPT" :
  157. filter->action == FILTER_REJECT ? "REJECT" : "???");
  158. if (filter->action == FILTER_ACCEPT || filter->action == FILTER_REJECT)
  159. pos += snprintf(buffer + pos, buf_len - pos, " Name: %-20s", filter->name);
  160. if (filter->action == FILTER_ACCEPT || filter->action == FILTER_REJECT) {
  161. char tmp_data[MAX_FILTER_LEN * 6], tmp_mask[MAX_FILTER_LEN * 6];
  162. ts_hex_dump_buf(tmp_data, sizeof(tmp_data), filter->data, filter->filter_len, 0);
  163. switch (filter->type) {
  164. case FILTER_TYPE_DATA:
  165. pos += snprintf(buffer + pos, buf_len - pos, " Offset: %2d Data: %s", filter->offset, tmp_data);
  166. break;
  167. case FILTER_TYPE_MASK:
  168. ts_hex_dump_buf(tmp_mask, sizeof(tmp_mask), filter->mask, filter->filter_len, 0);
  169. pos += snprintf(buffer + pos, buf_len - pos, " Match: %s Mask: %s", tmp_data, tmp_mask);
  170. break;
  171. } // switch (filter->type)
  172. }
  173. }
  174. static enum filter_action filter_match(uint8_t *data, unsigned int data_len, struct filter *filter) {
  175. if (filter->action == FILTER_ACCEPT_ALL || filter->action == FILTER_REJECT_ALL)
  176. return filter->action;
  177. if (filter->action == FILTER_ACCEPT || filter->action == FILTER_REJECT) {
  178. switch (filter->type) {
  179. case FILTER_TYPE_DATA: {
  180. if (filter->filter_len + filter->offset > data_len)
  181. return FILTER_NO_MATCH;
  182. if (memcmp(data + filter->offset, filter->data, filter->filter_len) == 0)
  183. return filter->action;
  184. break;
  185. }
  186. case FILTER_TYPE_MASK: {
  187. if ((unsigned int)filter->filter_len + 3 > data_len)
  188. return FILTER_NO_MATCH;
  189. int matched = 0;
  190. // Check data[0] against filter->data[0]
  191. if ((data[0] & filter->mask[0]) == (filter->data[0] & filter->mask[0])) {
  192. matched++;
  193. int i;
  194. for (i = 1; i < filter->filter_len; i++) {
  195. // Check data[3...] against filter->data[1...]
  196. if ((data[i + 2] & filter->mask[i]) == (filter->data[i] & filter->mask[i]))
  197. matched++;
  198. }
  199. }
  200. if (matched == filter->filter_len)
  201. return filter->action;
  202. break;
  203. }
  204. } // switch (filter->type)
  205. }
  206. return FILTER_NO_MATCH;
  207. }
  208. int filter_match_emm(struct ts *ts, uint8_t *data, unsigned int data_len) {
  209. int i, ret = 1;
  210. for (i = 0; i < ts->emm_filters_num; i++) {
  211. enum filter_action result = filter_match(data, data_len, &ts->emm_filters[i]);
  212. switch (result) {
  213. case FILTER_NO_MATCH : continue;
  214. case FILTER_ACCEPT_ALL: ret = 1; continue;
  215. case FILTER_ACCEPT : ret = 1; break;
  216. case FILTER_REJECT_ALL: ret = 0; continue;
  217. case FILTER_REJECT : ret = 0; break;
  218. }
  219. }
  220. return ret;
  221. }