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
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
|
/*
* Copyright (c) 1995 The Regents of the University of California.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the Network Research
* Group at Lawrence Berkeley National Laboratory.
* 4. Neither the name of the University nor of the Laboratory may be used
* to endorse or promote products derived from this software without
* specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#ifndef lint
static char rcsid[] =
"@(#) $Header: /cs/research/mice/starship/src/local/CVS_repository/vic/session-rtpv1.cc,v 1.1.1.1 1998/02/18 18:03:44 ucacsva Exp $ (LBL)";
#endif
#include "session-rtpv1.h"
#include "source.h"
#include "ntp-time.h"
/*
* parse rtp v1 options (actually, nv options).
*/
int RTPv1SessionManager::parseopts(const u_char* bp,
int cc, u_int32_t addr) const
{
register int t = 0;
register u_int optflags;
do {
optflags = bp[0];
register u_int optlen = bp[1] << 2;
t += optlen;
if (t > cc || optlen == 0)
/* bad optlen */
return (-1);
switch (optflags & 0x7f) {
case 33:
if (optlen > 8) {
/* extract names from nv's rtp v1 SDES opt */
char buf[256];
u_int len = optlen - 9;
if (len > 255)
len = 255;
SourceManager& sm = SourceManager::instance();
Source* s = sm.lookup(addr, addr, addr);
if (s) {
strncpy(buf, (char*)bp + 8, len);
buf[len] = 0;
if (s->sdes(RTCP_SDES_CNAME) == 0)
s->sdes(RTCP_SDES_CNAME,
intoa(addr));
s->sdes(RTCP_SDES_NAME, buf);
timeval tv = unixtime();
s->lts_ctrl(tv);
}
}
break;
case 35: /* bye option */
if (optlen == 4) {
Source* s = SourceManager::instance().consult(addr);
if (s)
s->lts_done(unixtime());
}
break;
}
bp += optlen;
} while ((optflags & 0x80) == 0);
return (t);
}
/*
* Called for sessions that implement RTPv1 (i.e., nv and ivs)
*/
void RTPv1SessionManager::recv(DataHandler* dh)
{
rtphdr hdr;
u_int32_t addr;
/* leave room in case we need to expand rtpv1 into an rtpv2 header */
u_char* bp = &pktbuf_[4];
int cc = dh->recv(bp, 2 * RTP_MTU - 4, addr);
if (cc <= 0)
return;
rtphdr* rh = (rtphdr*)bp;
int version = *(u_char*)rh >> 6;
if (version != 1) {
++badversion_;
return;
}
/* RTP v1 hdr */
rtp1hdr* rh1 = (rtp1hdr*)rh;
int flags = rh1->rh_flags;
flags = (flags & 0x40) << 1 | flags & 0x3f;
if ((flags & 0x3f) == RTP_PT_H261) {
/*
* smash RTPv1/H.261 payload type to undefined
* value so we can distinguish it from RTPv2/H.261
*/
flags = (flags &~ 0x3f) | RTP_PT_H261_COMPAT;
}
hdr.rh_flags = htons(flags & 0xf0ff);
hdr.rh_seqno = rh1->rh_seqno;
hdr.rh_ts = rh1->rh_ts;
hdr.rh_ssrc = addr;
bp += sizeof(*rh1);
cc -= sizeof(*rh1);
if (rh1->rh_flags & RTP1_OPTION_BIT) {
int t = parseopts(bp, cc, addr);
if (t <= 0) {
++badoptions_;
return;
}
bp += t;
cc -= t;
if (cc == 0)
return;
}
/* make sure rtp and profile headers are contiguus */
rh = (rtphdr*)(bp - sizeof(*rh));
*rh = hdr;
demux(rh, bp, cc, addr);
}
void RTPv1SessionManager::transmit(pktbuf* pb)
{
mh_.msg_iov = pb->iov;
Network* net = dh_.net();
/*
* Smash the packet for RTPv1 compat.
* (put the contents back because it gets looped back above)
*/
rtphdr rhs = *(rtphdr*)pb->iov[0].iov_base;
/* RTP v1 hdr */
struct rtp1hdr {
u_char rh_chan; /* version/channel */
u_char rh_flags; /* O/S/content */
u_int16_t rh_seqno; /* sequence number */
u_int32_t rh_ts;
}* rh1;
pb->iov[0].iov_base = (caddr_t)pb->iov[0].iov_base + 4;
rh1 = (rtp1hdr*)pb->iov[0].iov_base;
pb->iov[0].iov_len -= 4;
rh1->rh_chan = 0x60; // vers 1, chan 32
int flags = ((u_char*)&rhs)[1];
/*XXX lose a bit in PT -> content type */
flags = ((flags & 0x80) >> 1) | (flags & 0x3f);
rh1->rh_flags = flags;
rh1->rh_seqno = rhs.rh_seqno;
rh1->rh_ts = rhs.rh_ts;
net->send(mh_);
pb->iov[0].iov_len += 4;
pb->iov[0].iov_base = (caddr_t)pb->iov[0].iov_base - 4;
*(rtphdr*)pb->iov[0].iov_base = rhs;
}
|
