/* * wavemon - a wireless network monitoring aplication * * Copyright (c) 2001-2002 Jan Morgenstern * * wavemon is free software; you can redistribute it and/or modify it under * the terms of the GNU General Public License as published by the Free * Software Foundation; either version 2, or (at your option) any later * version. * * wavemon is distributed in the hope that it will be useful, but WITHOUT ANY * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more * details. * * You should have received a copy of the GNU General Public License along * with wavemon; see the file COPYING. If not, write to the Free Software * Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */ #define LISTVAL_MAX 32 /* maximum string length of `s' elements */ int ll_create(void); void *ll_get(int ld, unsigned long n); void *ll_getall(int ld); void ll_reset(int ld); void ll_push(int ld, const char *format, ...); void ll_replace(int ld, unsigned long n, const char *format, ...); signed long ll_scan(int ld, const char *format, ...); unsigned long ll_size(int ld); void ll_destroy(int ld); href='/debian/dtv-scan-tables.git/refs/'>refslogtreecommitdiffstats
path: root/dvb-t/se-Skarstad
blob: 58a749999dedd36ad5c39d03e28891e47df82781 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
3a92382f2692a38a71726bd653bb979d60c (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
/*
 * section and descriptor parser
 *
 * Copyright (C) 2005 Kenneth Aafloy (kenneth@linuxtv.org)
 * Copyright (C) 2005 Andrew de Quincey (adq_dvb@lidskialf.net)
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA
 */

#include <libucsi/atsc/rrt_section.h>

struct atsc_rrt_section *atsc_rrt_section_codec(struct atsc_section_psip *psip)
{
	uint8_t * buf = (uint8_t *) psip;
	size_t pos = 0;
	size_t len = section_ext_length(&(psip->ext_head));
	int idx;
	int vidx;
	struct atsc_rrt_section *rrt = (struct atsc_rrt_section *) psip;

	if (len < sizeof(struct atsc_rrt_section))
		return NULL;
	pos += sizeof(struct atsc_rrt_section);

	if (len < (pos + rrt->rating_region_name_length))
		return NULL;
	if (atsc_text_validate(buf+pos, rrt->rating_region_name_length))
		return NULL;

	pos += rrt->rating_region_name_length;
	if (len < (pos + sizeof(struct atsc_rrt_section_part2)))
		return NULL;
	struct atsc_rrt_section_part2 *rrtpart2 = (struct atsc_rrt_section_part2 *) (buf+pos);

	pos += sizeof(struct atsc_rrt_section_part2);
	for(idx =0; idx < rrtpart2->dimensions_defined; idx++) {
		if (len < (pos + sizeof(struct atsc_rrt_dimension)))
			return NULL;
		struct atsc_rrt_dimension *dimension = (struct atsc_rrt_dimension *) (buf+pos);

		pos += sizeof(struct atsc_rrt_dimension);
		if (len < (pos + dimension->dimension_name_length))
			return NULL;
		if (atsc_text_validate(buf+pos, dimension->dimension_name_length))
			return NULL;

		pos += dimension->dimension_name_length;
		if (len < (pos + sizeof(struct atsc_rrt_dimension_part2)))
			return NULL;
		struct atsc_rrt_dimension_part2 *dpart2 = (struct atsc_rrt_dimension_part2 *) (buf+pos);

		pos += sizeof(struct atsc_rrt_dimension_part2);
		for(vidx =0; vidx < dpart2->values_defined; vidx++) {
			if (len < (pos + sizeof(struct atsc_rrt_dimension_value)))
				return NULL;
			struct atsc_rrt_dimension_value *value = (struct atsc_rrt_dimension_value *) (buf+pos);

			pos += sizeof(struct atsc_rrt_dimension_value);
			if (len < (pos + value->abbrev_rating_value_length))
				return NULL;
			if (atsc_text_validate(buf+pos, value->abbrev_rating_value_length))
				return NULL;

			pos += value->abbrev_rating_value_length;
			if (len < (pos + sizeof(struct atsc_rrt_dimension_value_part2)))
				return NULL;
			struct atsc_rrt_dimension_value_part2 *vpart2 =
				(struct atsc_rrt_dimension_value_part2 *) (buf+pos);

			pos += sizeof(struct atsc_rrt_dimension_value_part2);
			if (len < (pos + vpart2->rating_value_length))
				return NULL;
			if (atsc_text_validate(buf+pos, vpart2->rating_value_length))
				return NULL;

			pos+= vpart2->rating_value_length;
		}
	}

	if (len < (pos + sizeof(struct atsc_rrt_section_part3)))
		return NULL;
	struct atsc_rrt_section_part3 *part3 = (struct atsc_rrt_section_part3 *) (buf+pos);

	pos += sizeof(struct atsc_rrt_section_part3);
	if (len < (pos + part3->descriptors_length))
		return NULL;

	if (verify_descriptors(buf + pos, part3->descriptors_length))
		return NULL;

	pos += part3->descriptors_length;
	if (pos != len)
		return NULL;

	return (struct atsc_rrt_section *) psip;
}