| 72 | }; |
| 73 | |
| 74 | static void test_map2(void) |
| 75 | { |
| 76 | unsigned int i, n; |
| 77 | unsigned short k; |
| 78 | unsigned char h, l; |
| 79 | |
| 80 | n = sizeof(html_charset) / sizeof(html_charset[0]); |
| 81 | |
| 82 | for (i = 0; i < n; i++) { |
| 83 | k = html_charset[i].id; |
| 84 | h = (unsigned char) (k >> 8); |
| 85 | l = (unsigned char) (k & 0xFF) ; |
| 86 | if (k > 255 && (h == 0 || l == 0)) |
| 87 | printf("id: %d = 0\n", html_charset[i].id); |
| 88 | } |
| 89 | } |
| 90 | |
| 91 | static void create_map2(void) |
| 92 | { |
no outgoing calls
no test coverage detected
searching dependent graphs…