blob: 498f67fb70a42e76dcef84ad49f7be2a07e6cc9f (
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
|
/*
* $Id: pat.cpp,v 1.1 2003-10-17 15:36:37 tmbinc Exp $
*
* (C) 2002-2003 Andreas Oberritter <obi@saftware.de>
*
* This program 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 of the License, or
* (at your option) any later version.
*
* This program 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 this program; if not, write to the Free Software
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*
*/
#include <lib/dvb_si/pat.h>
NetworkAssociation::NetworkAssociation(const uint8_t * const buffer)
{
programNumber = (buffer[0] << 8) | buffer[1];
reserved = (buffer[2] >> 5) & 0x07;
networkPid = ((buffer[2] & 0x1F) << 8) | buffer[3];
}
uint16_t NetworkAssociation::getNetworkPid(void) const
{
return networkPid;
}
ProgramAssociation::ProgramAssociation(const uint8_t * const buffer)
{
programNumber = (buffer[0] << 8) | buffer[1];
reserved = (buffer[2] >> 5) & 0x07;
programMapPid = ((buffer[2] & 0x1F) << 8) | buffer[3];
}
uint16_t ProgramAssociation::getProgramNumber(void) const
{
return programNumber;
}
uint16_t ProgramAssociation::getProgramMapPid(void) const
{
return programMapPid;
}
ProgramAssociationTable::ProgramAssociationTable(const uint8_t * const buffer) : LongCrcTable(buffer)
{
for (uint16_t i = 8; i < sectionLength - 1; i += 4) {
if (((buffer[i] << 8) | buffer[i + 1]) == 0)
networks.push_back(new NetworkAssociation(&buffer[i]));
else
programs.push_back(new ProgramAssociation(&buffer[i]));
}
}
ProgramAssociationTable::~ProgramAssociationTable(void)
{
for (NetworkAssociationIterator i = networks.begin(); i != networks.end(); ++i)
delete *i;
for (ProgramAssociationIterator i = programs.begin(); i != programs.end(); ++i)
delete *i;
}
const NetworkAssociationVector *ProgramAssociationTable::getNetworks(void) const
{
return &networks;
}
const ProgramAssociationVector *ProgramAssociationTable::getPrograms(void) const
{
return &programs;
}
|
