clib/dvb_ts_lib/descriptors/parse_desc_mosaic.c

filter: Statementstmt 0.0% 0 / 86 Branchbran 0.0% 0 / 28 Conditioncond n/a MC/DCmcdc n/a Subroutinesub n/a Podpod n/a totaltotal 0.0% 0 / 114 CC 0 SCAR 0
CC
0
Cov
0%
CRAP 0
« clib/dvb_ts_lib/descriptors/parse_desc_local_time_offset.c ↑ Summary clib/dvb_ts_lib/descriptors/parse_desc_multilingual_bouquet_name.c »
1 /*
2 * parse_desc_mosaic.c
3 *
4 * Created by: si_desc.pl
5 * Created on: 20-May-2011
6 * Author: sdprice1
7 */
8
9
10 // VERSION = 1.00
11
12 /*=============================================================================================*/
13 // USES
14 /*=============================================================================================*/
15
16 #include <stdio.h>
17 #include <stdlib.h>
18 #include <unistd.h>
19 #include <string.h>
20 #include <errno.h>
21 #include <ctype.h>
22 #include <fcntl.h>
23 #include <inttypes.h>
24
25 #include "parse_desc_mosaic.h"
26 #include "descriptors/parse_desc.h"
27
28 /*=============================================================================================*/
29 // CONSTANTS
30 /*=============================================================================================*/
31
32 /*=============================================================================================*/
33 // MACROS
34 /*=============================================================================================*/
35
36 /*=============================================================================================*/
37 // FUNCTIONS
38 /*=============================================================================================*/
39
40 /* ----------------------------------------------------------------------- */
41 //
42 // mosaic_descriptor(){
43 // descriptor_tag 8 uimsbf
44 // descriptor_length 8 uimsbf
45 // mosaic_entry_point 1 bslbf
46 // number_of_horizontal_elementary_cells 3 uimsbf
47 // reserved_future_use 1 bslbf
48 // number_of_vertical_elementary_cells 3 uimsbf
49 // for (i=0;i<N; i++) {
50 // logical_cell_id 6 uimsbf
51 // reserved_future_use 7 bslbf
52 // logical_cell_presentation_info 3 uimsbf
53 // elementary_cell_field_length 8 uimsbf
54 // for (i=0;j<elementary_cell_field_length;j++) {
55 // reserved_future_use 2 bslbf
56 // elementary_cell_id 6 uimsbf
57 // }
58 // cell_linkage_info 8 uimsbf
59 // If (cell_linkage_info ==0x01){
60 // bouquet_id 16 uimsbf
61 // }
62 // If (cell_linkage_info ==0x02){
63 // original_network_id 16 uimsbf
64 // transport_stream_id 16 uimsbf
65 // service_id 16 uimsbf
66 // }
67 // If (cell_linkage_info ==0x03){
68 // original_network_id 16 uimsbf
69 // transport_stream_id 16 uimsbf
70 // service_id 16 uimsbf
71 // }
72 // If (cell_linkage_info ==0x04){
73 // original_network_id 16 uimsbf
74 // transport_stream_id 16 uimsbf
75 // service_id 16 uimsbf
76 // event_id 16 uimsbf
77 // }
78 // }
79 // }
80
81
82 /* ----------------------------------------------------------------------- */
83 0 void print_mosaic(struct Descriptor_mosaic *md, int level)
84 {
85 struct list_head *item, *safe;
86 struct list_head *item1, *safe1;
87
88 0 printf(" Descriptor: mosaic [0x%02x]\n", md->descriptor_tag) ;
89 0 printf(" Length: %d\n", md->descriptor_length) ;
90
91 0 printf(" mosaic_entry_point = %d\n", md->mosaic_entry_point) ;
92 0 printf(" number_of_horizontal_elementary_cells = %d\n", md->number_of_horizontal_elementary_cells) ;
93 0 printf(" number_of_vertical_elementary_cells = %d\n", md->number_of_vertical_elementary_cells) ;
94
95 0 ▶ list_for_each_safe(item,safe,&md->md_array) {
Branch: 1 branch
BranchTrueFalseTotal
list_for_each_safe(item,safe,&md->md_array) { 0 0 0
96 0 struct MD_entry *md_entry = list_entry(item, struct MD_entry, next);
97
98 // MD entry
99 0 printf(" -MD entry-\n") ;
100
101 0 printf(" logical_cell_id = %d\n", md_entry->logical_cell_id) ;
102 0 printf(" logical_cell_presentation_info = %d\n", md_entry->logical_cell_presentation_info) ;
103 0 printf(" elementary_cell_field_length = %d\n", md_entry->elementary_cell_field_length) ;
104
105 0 ▶ list_for_each_safe(item1,safe1,&md_entry->md1_array) {
Branch: 1 branch
BranchTrueFalseTotal
list_for_each_safe(item1,safe1,&md_entry->md1_array) { 0 0 0
106 0 struct MD1_entry *md1_entry = list_entry(item, struct MD1_entry, next);
107
108 // MD entry
109 0 printf(" -MD entry-\n") ;
110
111 0 printf(" elementary_cell_id = %d\n", md1_entry->elementary_cell_id) ;
112 }
113
114 0 printf(" cell_linkage_info = %d\n", md_entry->cell_linkage_info) ;
115 0 ▶ if (md_entry->cell_linkage_info == 0x1 )
Branch: 1 branch
BranchTrueFalseTotal
if (md_entry->cell_linkage_info == 0x1 ) 0 0 0
116 {
117 0 printf(" bouquet_id = %d\n", md_entry->bouquet_id) ;
118 }
119
120 0 ▶ if (md_entry->cell_linkage_info == 0x2 )
Branch: 1 branch
BranchTrueFalseTotal
if (md_entry->cell_linkage_info == 0x2 ) 0 0 0
121 {
122 0 printf(" original_network_id = %d\n", md_entry->original_network_id) ;
123 0 printf(" transport_stream_id = %d\n", md_entry->transport_stream_id) ;
124 0 printf(" service_id = %d\n", md_entry->service_id) ;
125 }
126
127 0 ▶ if (md_entry->cell_linkage_info == 0x3 )
Branch: 1 branch
BranchTrueFalseTotal
if (md_entry->cell_linkage_info == 0x3 ) 0 0 0
128 {
129 0 printf(" original_network_id1 = %d\n", md_entry->original_network_id1) ;
130 0 printf(" transport_stream_id1 = %d\n", md_entry->transport_stream_id1) ;
131 0 printf(" service_id1 = %d\n", md_entry->service_id1) ;
132 }
133
134 0 ▶ if (md_entry->cell_linkage_info == 0x4 )
Branch: 1 branch
BranchTrueFalseTotal
if (md_entry->cell_linkage_info == 0x4 ) 0 0 0
135 {
136 0 printf(" original_network_id2 = %d\n", md_entry->original_network_id2) ;
137 0 printf(" transport_stream_id2 = %d\n", md_entry->transport_stream_id2) ;
138 0 printf(" service_id2 = %d\n", md_entry->service_id2) ;
139 0 printf(" event_id = %d\n", md_entry->event_id) ;
140 }
141
142 }
143
144 0 }
145
146 /* ----------------------------------------------------------------------- */
147 0 struct Descriptor *parse_mosaic(struct TS_bits *bits, unsigned tag, unsigned len)
148 {
149 struct Descriptor_mosaic *md ;
150 unsigned byte ;
151 int end_buff_len ;
152
153 0 md = (struct Descriptor_mosaic *)malloc( sizeof(*md) ) ;
154 0 memset(md,0,sizeof(*md));
155
156 //== Parse data ==
157 0 INIT_LIST_HEAD(&md->next);
158 0 md->descriptor_tag = tag ; // already extracted by parse_desc()
159 0 md->descriptor_length = len ; // already extracted by parse_desc()
160 0 md->mosaic_entry_point = bits_get(bits, 1) ;
161 0 md->number_of_horizontal_elementary_cells = bits_get(bits, 3) ;
162 0 bits_skip(bits, 1) ;
163 0 md->number_of_vertical_elementary_cells = bits_get(bits, 3) ;
164
165 0 INIT_LIST_HEAD(&md->md_array) ;
166 0 end_buff_len = bits_len_calc(bits, -(md->descriptor_length - 1) ) ;
167 0 ▶ while (bits->buff_len > end_buff_len)
Branch: 1 branch
BranchTrueFalseTotal
while (bits->buff_len > end_buff_len) 0 0 0
168 {
169 0 struct MD_entry *md_entry = malloc(sizeof(*md_entry));
170 0 memset(md_entry,0,sizeof(*md_entry));
171 0 list_add_tail(&md_entry->next,&md->md_array);
172
173 0 md_entry->logical_cell_id = bits_get(bits, 6) ;
174 0 bits_skip(bits, 7) ;
175 0 md_entry->logical_cell_presentation_info = bits_get(bits, 3) ;
176 0 md_entry->elementary_cell_field_length = bits_get(bits, 8) ;
177
178 0 INIT_LIST_HEAD(&md_entry->md1_array) ;
179 0 ▶ while (bits->buff_len >= 1)
Branch: 1 branch
BranchTrueFalseTotal
while (bits->buff_len >= 1) 0 0 0
180 {
181 0 struct MD1_entry *md1_entry = malloc(sizeof(*md1_entry));
182 0 memset(md1_entry,0,sizeof(*md1_entry));
183 0 list_add_tail(&md1_entry->next,&md_entry->md1_array);
184
185 0 bits_skip(bits, 2) ;
186 0 md1_entry->elementary_cell_id = bits_get(bits, 6) ;
187 }
188
189 0 md_entry->cell_linkage_info = bits_get(bits, 8) ;
190 0 ▶ if (md_entry->cell_linkage_info == 0x1 )
Branch: 1 branch
BranchTrueFalseTotal
if (md_entry->cell_linkage_info == 0x1 ) 0 0 0
191 {
192 0 md_entry->bouquet_id = bits_get(bits, 16) ;
193 }
194
195 0 ▶ if (md_entry->cell_linkage_info == 0x2 )
Branch: 1 branch
BranchTrueFalseTotal
if (md_entry->cell_linkage_info == 0x2 ) 0 0 0
196 {
197 0 md_entry->original_network_id = bits_get(bits, 16) ;
198 0 md_entry->transport_stream_id = bits_get(bits, 16) ;
199 0 md_entry->service_id = bits_get(bits, 16) ;
200 }
201
202 0 ▶ if (md_entry->cell_linkage_info == 0x3 )
Branch: 1 branch
BranchTrueFalseTotal
if (md_entry->cell_linkage_info == 0x3 ) 0 0 0
203 {
204 0 md_entry->original_network_id1 = bits_get(bits, 16) ;
205 0 md_entry->transport_stream_id1 = bits_get(bits, 16) ;
206 0 md_entry->service_id1 = bits_get(bits, 16) ;
207 }
208
209 0 ▶ if (md_entry->cell_linkage_info == 0x4 )
Branch: 1 branch
BranchTrueFalseTotal
if (md_entry->cell_linkage_info == 0x4 ) 0 0 0
210 {
211 0 md_entry->original_network_id2 = bits_get(bits, 16) ;
212 0 md_entry->transport_stream_id2 = bits_get(bits, 16) ;
213 0 md_entry->service_id2 = bits_get(bits, 16) ;
214 0 md_entry->event_id = bits_get(bits, 16) ;
215 }
216
217 }
218
219
220 0 return (struct Descriptor *)md ;
221 }
222
223 /* ----------------------------------------------------------------------- */
224 0 void free_mosaic(struct Descriptor_mosaic *md)
225 {
226 struct list_head *item, *safe;
227 struct list_head *item1, *safe1;
228
229 0 ▶ list_for_each_safe(item,safe,&md->md_array) {
Branch: 1 branch
BranchTrueFalseTotal
list_for_each_safe(item,safe,&md->md_array) { 0 0 0
230 0 struct MD_entry *md_entry = list_entry(item, struct MD_entry, next);
231
232 0 ▶ list_for_each_safe(item1,safe1,&md_entry->md1_array) {
Branch: 1 branch
BranchTrueFalseTotal
list_for_each_safe(item1,safe1,&md_entry->md1_array) { 0 0 0
233 0 struct MD1_entry *md1_entry = list_entry(item, struct MD1_entry, next);
234 0 free(md1_entry) ;
235 }
236
237 0 free(md_entry) ;
238 }
239
240
241 0 free(md) ;
242 0 }
« clib/dvb_ts_lib/descriptors/parse_desc_local_time_offset.c ↑ Summary clib/dvb_ts_lib/descriptors/parse_desc_multilingual_bouquet_name.c »