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 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390
|
/*-
* Copyright (c) 1993-1994 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 University of
* California, Berkeley and the Network Research Group at
* Lawrence Berkeley 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.
*/
static const char rcsid[] =
"@(#) $Header: /cs/research/mice/starship/src/local/CVS_repository/vic/decoder-jpeg.cc,v 1.1.1.1 1998/02/18 18:03:25 ucacsva Exp $ (LBL)";
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "inet.h"
#include "rtp.h"
#include "decoder.h"
#include "bsd-endian.h"
#include "Tcl.h"
#include "jpeg/jpeg.h"
#include "renderer.h"
class JpegReassembler {
public:
JpegReassembler();
~JpegReassembler();
u_char* reassemble(const rtphdr* rh, const u_char* bp, int& len);
inline int badoff() const { return (badoff_); }
inline int hugefrm() const { return (hugefrm_); }
protected:
int decimate_;
int ndec_;
/*
* Reassembly buffer. This should be a dma buffer in the
* jvdriver case but it's not clear if jvdriver allows buffers
* to be shared across sockets. XXX ask Lance
* If it does, then we can pass dma buffers betwee
* the decoder and renderers.
*/
#define JPEG_SLOTS 64
#define JPEG_SLOTMASK (JPEG_SLOTS - 1)
struct slot {
int seqno;
int eof; /* nbytes in last pkt of frame, o.w. 0 */
u_int32_t off;
u_int32_t ts;
} slots_[JPEG_SLOTS];
/*
* Reassembly buffers. We do double-buffering, which allows
* packets to arrive out of order across frame boundaries,
* but not across an entire frame (i.e., we don't want to see
* any packets from frame k+2 until we're done with frame k).
* We use RTP timestamps to keep track of which frame is
* allocated to which buffer. (RTP guarantees that the
* timestamps are constant across a frame, and increase
* between succesive frames. XXX is latter really true?)
*/
struct rbuf {
int drop;
u_int32_t ts;
u_char* bp;
};
rbuf rb0_;
rbuf rb1_;
int rbsize_;
int hugefrm_;
int badoff_;
};
/*
* Initial size of each reassembly buffer.
*/
#define JPEG_BUFSIZE (16*1024)
#define STAT_BADOFF 0
#define STAT_HUGEFRM 1
JpegReassembler::JpegReassembler()
: decimate_(0), ndec_(0), hugefrm_(0), badoff_(0)
{
rbsize_ = JPEG_BUFSIZE;
rb0_.bp = new u_char[2 * JPEG_BUFSIZE];
rb0_.ts = ~0;
rb0_.drop = 0;
rb1_.bp = &rb0_.bp[JPEG_BUFSIZE];
rb1_.ts = ~0;
rb1_.drop = 0;
memset(slots_, 0, sizeof(slots_));
}
JpegReassembler::~JpegReassembler()
{
delete rb0_.bp;
}
/*
* Reassemble an RTP/JPEG stream. Return a pointer to a buffer
* each time we encounter an entire frame. Otherwise, return 0.
* Set len to the length of the jpeg data in the buffer.
*/
u_char* JpegReassembler::reassemble(const rtphdr* rh, const u_char* bp, int& len)
{
jpeghdr* p = (jpeghdr*)(rh + 1);
int off = (int)ntohl(p->off);
int cc = len;
if (off < 0) {
++badoff_;
return (0);
}
if (off + cc > rbsize_) {
/*
* Check for outrageous frame size.
*/
if (off + cc > 250*1024) {
++hugefrm_;
return (0);
}
/*
* Grow reassembly buffers.
*/
int nsize = rbsize_;
do {
nsize <<= 1;
} while (off + cc > nsize);
u_char* p = new u_char[2 * nsize];
memcpy(p, rb0_.bp, rbsize_);
memcpy(p + nsize, rb1_.bp, rbsize_);
delete rb0_.bp;
rb0_.bp = p;
rb1_.bp = p + nsize;
rbsize_ = nsize;
}
/*
* Initialize the slot data structure.
*/
int seqno = ntohs(rh->rh_seqno);
int s = seqno & JPEG_SLOTMASK;
u_int32_t ts = ntohl(rh->rh_ts);
slots_[s].seqno = seqno;
slots_[s].off = off;
slots_[s].ts = ts;
/*
* Figure out which reassembly-buffer to use. If we're not
* already reassembling this frame, take over the older buffer.
*/
rbuf* rb;
if (ts == rb0_.ts)
rb = &rb0_;
else if (ts == rb1_.ts)
rb = &rb1_;
else {
rb = ((int)(rb0_.ts - rb1_.ts) < 0) ? &rb0_ : &rb1_;
rb->ts = ts;
rb->drop = 0;
/*
* If we're decimating frames (to save cycles),
* remember that we might want to drop the rest
* of the packets from this frame.
*/
if (decimate_) {
if (--ndec_ <= 0)
ndec_ = decimate_;
else
rb->drop = 1;
}
}
if (rb->drop)
return (0);
memcpy((char*)&rb->bp[off], (char*)bp, cc);
/*
* Check if we're at end-of-frame. If not, see if we're
* filling a hole. If not, return. Otherwise, drop out
* below and check for an entire frame. We set cc to be
* the entire frame size in the if-else below.
*/
if ((ntohs(rh->rh_flags) & RTP_M) != 0) {
slots_[s].eof = cc;
cc += off;
} else {
slots_[s].eof = 0;
int ns = s;
do {
ns = (ns + 1) & JPEG_SLOTMASK;
if (slots_[ns].ts != ts || ns == s)
return (0);
} while (slots_[ns].eof != 0);
cc = int(slots_[ns].eof + slots_[ns].off);
}
/*
* At this point, we know we have an end-of-frame, and
* all packets from slot 's' up until the end-of-frame.
* Scan backward from slot 's' making sure we have all
* packets from the start-of-frame (off == 0) to 's'.
*/
int ps = s;
do {
ps = (ps - 1) & JPEG_SLOTMASK;
if (slots_[ps].ts != ts || ps == s)
return (0);
} while (slots_[ps].off != 0);
len = cc;
return (rb->bp);
}
class MotionJpegDecoder : public Decoder {
public:
MotionJpegDecoder();
virtual ~MotionJpegDecoder();
int colorhist(u_int* hist) const;
virtual void stats(char* wrk);
protected:
virtual void recv(const struct rtphdr*, const u_char* data, int len);
virtual void redraw();
int inq_; /* input quantization */
int type_; /* JPEG/RTP parameters type code */
void configure();
JpegPixelDecoder* codec_;
JpegDecoder::config config_;
JpegReassembler reasm_;
};
static class JpegDecoderMatcher : public Matcher {
public:
JpegDecoderMatcher() : Matcher("decoder") {}
TclObject* match(const char* id) {
if (strcasecmp(id, "jpeg") == 0 ||
strcasecmp(id, "jpg") == 0)
return (new MotionJpegDecoder());
else
return (0);
}
} swd_jpeg_;
MotionJpegDecoder::MotionJpegDecoder()
: Decoder(sizeof(jpeghdr)), codec_(0)
{
JpegDecoder::defaults(config_);
inw_ = 0;
inh_ = 0;
inq_ = 0;
/* guess type 0 */
type_ = 0;
decimation_ = 422;
stat_[STAT_BADOFF].name = "Bad-Offset";
stat_[STAT_HUGEFRM].name = "Huge-Frame";
nstat_ = 2;
}
MotionJpegDecoder::~MotionJpegDecoder()
{
delete codec_;
}
void MotionJpegDecoder::stats(char* wrk)
{
/* pull stats out of reassembler */
setstat(STAT_BADOFF, reasm_.badoff());
setstat(STAT_HUGEFRM, reasm_.hugefrm());
Decoder::stats(wrk);
}
void MotionJpegDecoder::configure()
{
config_.comp[0].hsf = 2;
int old_decimation = decimation_;
if (type_ == 1) {
decimation_ = 411;
config_.comp[0].vsf = 2;
} else {
decimation_ = 422;
config_.comp[0].vsf = 1;
}
config_.comp[1].hsf = 1;
config_.comp[1].vsf = 1;
config_.comp[2].hsf = 1;
config_.comp[2].vsf = 1;
config_.width = inw_;
config_.height = inh_;
JpegDecoder::quantizer(config_, inq_);
delete codec_;
codec_ = JpegPixelDecoder::create(config_, inw_, inh_);
Tcl& tcl = Tcl::instance();
int q = atoi(tcl.attr("softJPEGthresh"));
if (q < 0)
q = JpegDecoder::q_to_thresh(inq_);
codec_->thresh(q);
codec_->cthresh(atoi(tcl.attr("softJPEGcthresh")));
if (old_decimation != decimation_)
tcl.evalf("decoder_changed %s", name());
}
int MotionJpegDecoder::colorhist(u_int* hist) const
{
const u_char* frm = codec_->frame();
int off = inw_ * inh_;
if (decimation_ == 411)
colorhist_411_556(hist, frm, frm + off, frm + off + (off >> 2),
inw_, inh_);
else
colorhist_422_556(hist, frm, frm + off, frm + off + (off >> 1),
inw_, inh_);
return (1);
}
void MotionJpegDecoder::recv(const rtphdr* rh, const u_char* bp, int cc)
{
const jpeghdr* p = (const jpeghdr*)(rh + 1);
int needConfig = 0;
if (p->q != inq_ || p->type != type_) {
type_ = p->type;
inq_ = p->q;
needConfig = 1;
}
int inw = p->width << 3;
int inh = p->height << 3;
if (inw_ != inw || inh_ != inh) {
resize(inw, inh);
needConfig = 1;
}
if (needConfig)
configure();
bp = reasm_.reassemble(rh, bp, cc);
if (bp != 0) {
/*
* Spin through all the software renderers and only
* decode the frame if at least one renderer wants it.
* (e.g., in the case of a single thumbnail window,
* we don't want to decode the stream at full rate).
*/
int doSoftwareDecode = 0;
JpegFrame jf(0, (u_int8_t*)bp, cc, inq_, type_, inw_, inh_);
for (Renderer* r = engines_; r != 0; r = r->next_) {
if (r->update_interval() == 0 || r->need_update()) {
if (r->ft() == FT_JPEG)
r->consume(&jf);
else
doSoftwareDecode = 1;
}
}
if (doSoftwareDecode) {
codec_->decode(bp, cc, rvts_, now_);
ndblk_ = codec_->ndblk();
render_frame(codec_->frame());
codec_->resetndblk();
}
}
}
void MotionJpegDecoder::redraw()
{
if (codec_ != 0)
Decoder::redraw(codec_->frame());
}
|