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 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878
|
/*
* Copyright (c) 1994-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 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/encoder-h261.cc,v 1.3 1999/06/03 15:49:06 piers Exp $ (LBL)";
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <errno.h>
#include "inet.h"
#include "net.h"
#include "rtp.h"
#include "dct.h"
#include "p64/p64-huff.h"
#include "bsd-endian.h"
#include "Tcl.h"
#include "crdef.h"
#include "transmitter.h"
#include "module.h"
#define HDRSIZE (sizeof(rtphdr) + 4)
#define CIF_WIDTH 352
#define CIF_HEIGHT 288
#define QCIF_WIDTH 176
#define QCIF_HEIGHT 144
#define BMB 6 /* # blocks in a MB */
#define MBPERGOB 33 /* # of Macroblocks per GOB */
#ifdef INT_64
#define NBIT 64
#define BB_INT INT_64
#else
#define NBIT 32
#define BB_INT u_int
#endif
#if BYTE_ORDER == LITTLE_ENDIAN
#if NBIT == 64
#define STORE_BITS(bb, bc) \
bc[0] = bb >> 56; \
bc[1] = bb >> 48; \
bc[2] = bb >> 40; \
bc[3] = bb >> 32; \
bc[4] = bb >> 24; \
bc[5] = bb >> 16; \
bc[6] = bb >> 8; \
bc[7] = bb;
#define LOAD_BITS(bc) \
((BB_INT)bc[0] << 56 | \
(BB_INT)bc[1] << 48 | \
(BB_INT)bc[2] << 40 | \
(BB_INT)bc[3] << 32 | \
(BB_INT)bc[4] << 24 | \
(BB_INT)bc[5] << 16 | \
(BB_INT)bc[6] << 8 | \
(BB_INT)bc[7])
#else
#define STORE_BITS(bb, bc) \
bc[0] = bb >> 24; \
bc[1] = bb >> 16; \
bc[2] = bb >> 8; \
bc[3] = bb;
#define LOAD_BITS(bc) (ntohl(*(BB_INT*)(bc)))
#endif
#else
#define STORE_BITS(bb, bc) *(BB_INT*)bc = (bb);
#define LOAD_BITS(bc) (*(BB_INT*)(bc))
#endif
#define PUT_BITS(bits, n, nbb, bb, bc) \
{ \
nbb += (n); \
if (nbb > NBIT) { \
u_int extra = (nbb) - NBIT; \
bb |= (BB_INT)(bits) >> extra; \
STORE_BITS(bb, bc) \
bc += sizeof(BB_INT); \
bb = (BB_INT)(bits) << NBIT - extra; \
nbb = extra; \
} else \
bb |= (BB_INT)(bits) << NBIT - (nbb); \
}
class H261Encoder : public TransmitterModule {
public:
void setq(int q);
protected:
H261Encoder(int ft);
~H261Encoder();
int encode(const VideoFrame*, const u_int8_t *crvec);
int command(int argc, const char*const* argv);
void encode_blk(const short* blk, const char* lm);
int flush(Transmitter::pktbuf* pb, int nbit, Transmitter::pktbuf* npb);
char* make_level_map(int q, u_int fthresh);
void setquantizers(int lq, int mq, int hq);
virtual void size(int w, int h) = 0;
virtual void encode_mb(u_int mba, const u_char* frm,
u_int loff, u_int coff, int how) = 0;
/* bit buffer */
BB_INT bb_;
u_int nbb_;
u_char* bs_;
u_char* bc_;
int sbit_;
u_char lq_; /* low quality quantizer */
u_char mq_; /* medium quality quantizer */
u_char hq_; /* high quality quantizer */
u_char mquant_; /* the last quantizer we sent to other side */
int quant_required_; /* 1 if not quant'd in dct */
u_int ngob_;
u_int mba_;
u_int cif_; /* 1 for CIF, 0 for QCIF */
u_int bstride_;
u_int lstride_;
u_int cstride_;
u_int loffsize_; /* amount of 1 luma block */
u_int coffsize_; /* amount of 1 chroma block */
u_int bloffsize_; /* amount of 1 block advance */
const char* llm_[32]; /* luma dct val -> level maps */
const char* clm_[32]; /* chroma dct val -> level maps */
float lqt_[64]; /* low quality quantizer */
float mqt_[64]; /* medium quality quantizer */
float hqt_[64]; /* high quality quantizer */
u_int coff_[12]; /* where to find U given gob# */
u_int loff_[12]; /* where to find Y given gob# */
u_int blkno_[12]; /* for CR */
};
class H261DCTEncoder : public H261Encoder {
public:
H261DCTEncoder();
int consume(const VideoFrame*);
void size(int w, int h);
protected:
void encode_mb(u_int mba, const u_char* frm,
u_int loff, u_int coff, int how);
};
class H261PixelEncoder : public H261Encoder {
public:
H261PixelEncoder();
int consume(const VideoFrame*);
void size(int w, int h);
protected:
void encode_mb(u_int mba, const u_char* frm,
u_int loff, u_int coff, int how);
};
static class H261EncoderMatcher : public Matcher {
public:
H261EncoderMatcher() : Matcher("module") {}
TclObject* match(const char* fmt) {
if (strcasecmp(fmt, "h261/pixel") == 0)
return (new H261PixelEncoder);
if (strcasecmp(fmt, "h261/dct") == 0)
return (new H261DCTEncoder);
/* XXX for now, this is compatible with ui-ctrlmenu.tcl */
if (strcasecmp(fmt, "h261") == 0)
return (new H261PixelEncoder);
return (0);
}
} encoder_matcher_h261;
H261Encoder::H261Encoder(int ft) : TransmitterModule(ft),
bs_(0), bc_(0), ngob_(12)
{
for (int q = 0; q < 32; ++q) {
llm_[q] = 0;
clm_[q] = 0;
}
}
H261Encoder::~H261Encoder()
{
for (int q = 0; q < 32; ++q) {
if (llm_[q] != 0)
delete (void *)llm_[q];
if (clm_[q] != 0)
delete (void *)clm_[q];
}
}
H261PixelEncoder::H261PixelEncoder() : H261Encoder(FT_YUV_CIF)
{
quant_required_ = 0;
setq(10);
}
H261DCTEncoder::H261DCTEncoder() : H261Encoder(FT_DCT)
{
quant_required_ = 1;
setq(10);
}
/*
* Set up the forward DCT quantization table for
* INTRA mode operation.
*/
void
H261Encoder::setquantizers(int lq, int mq, int hq)
{
int qt[64];
if (lq > 31)
lq = 31;
if (lq <= 0)
lq = 1;
lq_ = lq;
if (mq > 31)
mq = 31;
if (mq <= 0)
mq = 1;
mq_ = mq;
if (hq > 31)
hq = 31;
if (hq <= 0)
hq = 1;
hq_ = hq;
/*
* quant_required_ indicates quantization is not folded
* into fdct [because fdct is not performed]
*/
if (quant_required_ == 0) {
/*
* Set the DC quantizer to 1, since we want to do this
* coefficient differently (i.e., the DC is rounded while
* the AC terms are truncated).
*/
qt[0] = 1;
int i;
for (i = 1; i < 64; ++i)
qt[i] = lq_ << 1;
fdct_fold_q(qt, lqt_);
qt[0] = 1;
for (i = 1; i < 64; ++i)
qt[i] = mq_ << 1;
fdct_fold_q(qt, mqt_);
qt[0] = 1;
for (i = 1; i < 64; ++i)
qt[i] = hq_ << 1;
fdct_fold_q(qt, hqt_);
}
}
void
H261Encoder::setq(int q)
{
setquantizers(q, q / 2, 1);
}
void
H261PixelEncoder::size(int w, int h)
{
Module::size(w, h);
if (w == CIF_WIDTH && h == CIF_HEIGHT) {
/* CIF */
cif_ = 1;
ngob_ = 12;
bstride_ = 11;
lstride_ = 16 * CIF_WIDTH - CIF_WIDTH / 2;
cstride_ = 8 * 176 - 176 / 2;
loffsize_ = 16;
coffsize_ = 8;
bloffsize_ = 1;
} else if (w == QCIF_WIDTH && h == QCIF_HEIGHT) {
/* QCIF */
cif_ = 0;
ngob_ = 6; /* not really number of GOBs, just loop limit */
bstride_ = 0;
lstride_ = 16 * QCIF_WIDTH - QCIF_WIDTH;
cstride_ = 8 * 88 - 88;
loffsize_ = 16;
coffsize_ = 8;
bloffsize_ = 1;
} else {
/*XXX*/
fprintf(stderr, "H261PixelEncoder: H.261 bad geometry: %dx%d\n",
w, h);
exit(1);
}
u_int loff = 0;
u_int coff = 0;
u_int blkno = 0;
for (u_int gob = 0; gob < ngob_; gob += 2) {
loff_[gob] = loff;
coff_[gob] = coff;
blkno_[gob] = blkno;
/* width of a GOB (these aren't ref'd in QCIF case) */
loff_[gob + 1] = loff + 11 * 16;
coff_[gob + 1] = coff + 11 * 8;
blkno_[gob + 1] = blkno + 11;
/* advance to next GOB row */
loff += (16 * 16 * MBPERGOB) << cif_;
coff += (8 * 8 * MBPERGOB) << cif_;
blkno += MBPERGOB << cif_;
}
}
void
H261DCTEncoder::size(int w, int h)
{
Module::size(w, h);
if (w == CIF_WIDTH && h == CIF_HEIGHT) {
/* CIF */
cif_ = 1;
ngob_ = 12;
bstride_ = 11;
lstride_ = - (11 * (64*BMB)) + 2 * 11 * 64 * BMB;
cstride_ = - (11 * (64*BMB)) + 2 * 11 * 64 * BMB;
loffsize_ = 64 * BMB;
coffsize_ = 64 * BMB;
bloffsize_ = 1;
} else if (w == QCIF_WIDTH && h == QCIF_HEIGHT) {
/* QCIF */
cif_ = 0;
ngob_ = 6; /* not really number of GOBs, just loop limit */
bstride_ = 0;
lstride_ = 0;
cstride_ = 0;
loffsize_ = 64 * BMB;
coffsize_ = 64 * BMB;
bloffsize_ = 1;
} else {
/*XXX*/
fprintf(stderr, "H261DCTEncoder: H.261 bad geometry: %dx%d\n",
w, h);
exit(1);
}
u_int gob;
for (gob = 0; gob < ngob_; gob += 2) {
if (gob != 0) {
loff_[gob] = loff_[gob-2] +
(MBPERGOB << cif_) * BMB * 64;
coff_[gob] = coff_[gob-2] +
(MBPERGOB << cif_) * BMB * 64;
blkno_[gob] = blkno_[gob-2] +
(MBPERGOB << cif_);
} else {
loff_[0] = 0;
coff_[0] = loff_[0] + 4 * 64; // 4 Y's
blkno_[0] = 0;
}
loff_[gob + 1] = loff_[gob] + 11 * BMB * 64;
coff_[gob + 1] = coff_[gob] + 11 * BMB * 64;
blkno_[gob + 1] = blkno_[gob] + 11;
}
}
int
H261Encoder::command(int argc, const char*const* argv)
{
if (argc == 3 && strcmp(argv[1], "q") == 0) {
setq(atoi(argv[2]));
return (TCL_OK);
}
return (TransmitterModule::command(argc, argv));
}
/*
* Make a map to go from a 12 bit dct value to an 8 bit quantized
* 'level' number. The 'map' includes both the quantizer (for the
* dct encoder) and the perceptual filter 'threshhold' (for both
* the pixel & dct encoders). The first 4k of the map is for the
* unfiltered coeff (the first 20 in zigzag order; roughly the
* upper left quadrant) and the next 4k of the map are for the
* filtered coef.
*/
char*
H261Encoder::make_level_map(int q, u_int fthresh)
{
/* make the luminance map */
char* lm = new char[0x2000];
char* flm = lm + 0x1000;
int i;
lm[0] = 0;
flm[0] = 0;
q = quant_required_? q << 1 : 0;
for (i = 1; i < 0x800; ++i) {
int l = i;
if (q)
l /= q;
lm[i] = l;
lm[-i & 0xfff] = -l;
if (l <= fthresh)
l = 0;
flm[i] = l;
flm[-i & 0xfff] = -l;
}
return (lm);
}
/*
* encode_blk:
* encode a block of DCT coef's
*/
void
H261Encoder::encode_blk(const short* blk, const char* lm)
{
BB_INT bb = bb_;
u_int nbb = nbb_;
u_char* bc = bc_;
/*
* Quantize DC. Round instead of truncate.
*/
int dc = (blk[0] + 4) >> 3;
if (dc <= 0)
/* shouldn't happen with CCIR 601 black (level 16) */
dc = 1;
else if (dc > 254)
dc = 254;
else if (dc == 128)
/* per Table 6/H.261 */
dc = 255;
/* Code DC */
PUT_BITS(dc, 8, nbb, bb, bc);
int run = 0;
const u_char* colzag = &COLZAG[0];
for (int zag; (zag = *++colzag) != 0; ) {
if (colzag == &COLZAG[20])
lm += 0x1000;
int level = lm[((const u_short*)blk)[zag] & 0xfff];
if (level != 0) {
int val, nb;
huffent* he;
if (u_int(level + 15) <= 30 &&
(nb = (he = &hte_tc[((level&0x1f) << 6)|run])->nb))
/* we can use a VLC. */
val = he->val;
else {
/* Can't use a VLC. Escape it. */
val = (1 << 14) | (run << 8) | (level & 0xff);
nb = 20;
}
PUT_BITS(val, nb, nbb, bb, bc);
run = 0;
} else
++run;
}
/* EOB */
PUT_BITS(2, 2, nbb, bb, bc);
bb_ = bb;
nbb_ = nbb;
bc_ = bc;
}
/*
* H261PixelEncoder::encode_mb
* encode a macroblock given a set of input YUV pixels
*/
void
H261PixelEncoder::encode_mb(u_int mba, const u_char* frm,
u_int loff, u_int coff, int how)
{
register int q;
float* qt;
if (how == CR_MOTION) {
q = lq_;
qt = lqt_;
} else if (how == CR_BG) {
q = hq_;
qt = hqt_;
} else {
/* must be at age threshold */
q = mq_;
qt = mqt_;
}
/*
* encode all 6 blocks of the macro block to find the largest
* coef (so we can pick a new quantizer if gquant doesn't have
* enough range).
*/
/*XXX this can be u_char instead of short but need smarts in fdct */
short blk[64 * 6];
register int stride = width_;
/* luminance */
const u_char* p = &frm[loff];
fdct(p, stride, blk + 0, qt);
fdct(p + 8, stride, blk + 64, qt);
fdct(p + 8 * stride, stride, blk + 128, qt);
fdct(p + (8 * stride + 8), stride, blk + 192, qt);
/* chominance */
int fs = framesize_;
p = &frm[fs + coff];
stride >>= 1;
fdct(p, stride, blk + 256, qt);
fdct(p + (fs >> 2), stride, blk + 320, qt);
/*
* if the default quantizer is too small to handle the coef.
* dynamic range, spin through the blocks and see if any
* coef. would significantly overflow.
*/
if (q < 8) {
register int cmin = 0, cmax = 0;
register short* bp = blk;
for (register int i = 6; --i >= 0; ) {
++bp; // ignore dc coef
for (register int j = 63; --j >= 0; ) {
register int v = *bp++;
if (v < cmin)
cmin = v;
else if (v > cmax)
cmax = v;
}
}
if (cmax < -cmin)
cmax = -cmin;
if (cmax >= 128) {
/* need to re-quantize */
register int s;
for (s = 1; cmax >= (128 << s); ++s) {
}
q <<= s;
register short* bp = blk;
for (register int i = 6; --i >= 0; ) {
++bp; // ignore dc coef
for (register int j = 63; --j >= 0; ) {
register int v = *bp;
*bp++ = v >> s;
}
}
}
}
u_int m = mba - mba_;
mba_ = mba;
huffent* he = &hte_mba[m - 1];
/* MBA */
PUT_BITS(he->val, he->nb, nbb_, bb_, bc_);
if (q != mquant_) {
/* MTYPE = INTRA + TC + MQUANT */
PUT_BITS(1, 7, nbb_, bb_, bc_);
PUT_BITS(q, 5, nbb_, bb_, bc_);
mquant_ = q;
} else {
/* MTYPE = INTRA + TC (no quantizer) */
PUT_BITS(1, 4, nbb_, bb_, bc_);
}
/* luminance */
const char* lm = llm_[q];
if (lm == 0) {
lm = make_level_map(q, 1);
llm_[q] = lm;
clm_[q] = make_level_map(q, 2);
}
encode_blk(blk + 0, lm);
encode_blk(blk + 64, lm);
encode_blk(blk + 128, lm);
encode_blk(blk + 192, lm);
/* chominance */
lm = clm_[q];
encode_blk(blk + 256, lm);
encode_blk(blk + 320, lm);
}
/*
* H261DCTEncoder::encode_mb
* encode a macroblock given a set of input DCT coefs
* each coef is stored as a short
*/
void
H261DCTEncoder::encode_mb(u_int mba, const u_char* frm,
u_int loff, u_int coff, int how)
{
short *lblk = (short *)frm + loff;
short *ublk = (short *)frm + coff;
short *vblk = (short *)frm + coff + 64;
register u_int q;
if (how == CR_MOTION)
q = lq_;
else if (how == CR_BG)
q = hq_;
else
/* must be at age threshold */
q = mq_;
/*
* if the default quantizer is too small to handle the coef.
* dynamic range, spin through the blocks and see if any
* coef. would significantly overflow.
*/
if (q < 8) {
register int cmin = 0, cmax = 0;
register short* bp = lblk;
register int i, j;
// Y U and V blocks
for (i = 6; --i >= 0; ) {
++bp; // ignore dc coef
for (j = 63; --j >= 0; ) {
register int v = *bp++;
if (v < cmin)
cmin = v;
else if (v > cmax)
cmax = v;
}
}
if (cmax < -cmin)
cmax = -cmin;
cmax /= (q << 1);
if (cmax >= 128) {
/* need to re-quantize */
register int s;
for (s = 1; cmax >= (128 << s); ++s) {
}
q <<= s;
}
}
u_int m = mba - mba_;
mba_ = mba;
huffent* he = &hte_mba[m - 1];
/* MBA */
PUT_BITS(he->val, he->nb, nbb_, bb_, bc_);
if (q != mquant_) {
/* MTYPE = INTRA + TC + MQUANT */
PUT_BITS(1, 7, nbb_, bb_, bc_);
PUT_BITS(q, 5, nbb_, bb_, bc_);
mquant_ = q;
} else {
/* MTYPE = INTRA + TC (no quantizer) */
PUT_BITS(1, 4, nbb_, bb_, bc_);
}
/* luminance */
const char* lm = llm_[q];
if (lm == 0) {
/*
* the filter thresh is 0 since we assume the jpeg percept.
* quantizer already did the filtering.
*/
lm = make_level_map(q, 0);
llm_[q] = lm;
clm_[q] = make_level_map(q, 0);
}
encode_blk(lblk + 0, lm);
encode_blk(lblk + 64, lm);
encode_blk(lblk + 128, lm);
encode_blk(lblk + 192, lm);
/* chominance */
lm = clm_[q];
encode_blk(ublk, lm);
encode_blk(vblk, lm);
}
int
H261Encoder::flush(Transmitter::pktbuf* pb, int nbit,
Transmitter::pktbuf* npb)
{
/* flush bit buffer */
STORE_BITS(bb_, bc_);
int cc = (nbit + 7) >> 3;
int ebit = (cc << 3) - nbit;
/*XXX*/
if (cc == 0 && npb != 0)
abort();
pb->iov[0].iov_len = HDRSIZE;
pb->iov[1].iov_len = cc;
rtphdr* rh = (rtphdr*)pb->iov[0].iov_base;
if (npb == 0)
rh->rh_flags |= htons(RTP_M);
int h = *(u_int*)(rh + 1) | ebit << 26 | sbit_ << 29;
*(u_int*)(rh + 1) = htonl(h);
if (npb != 0) {
u_char* nbs = (u_char*)npb->iov[1].iov_base;
u_int bc = (bc_ - bs_) << 3;
int tbit = bc + nbb_;
int extra = ((tbit + 7) >> 3) - (nbit >> 3);
if (extra > 0)
memcpy(nbs, bs_ + (nbit >> 3), extra);
bs_ = nbs;
sbit_ = nbit & 7;
tbit -= nbit &~ 7;
bc = tbit &~ (NBIT - 1);
nbb_ = tbit - bc;
bc_ = bs_ + (bc >> 3);
/*
* Prime the bit buffer. Be careful to set bits that
* are not yet in use to 0, since output bits are later
* or'd into the buffer.
*/
if (nbb_ > 0) {
u_int n = NBIT - nbb_;
bb_ = (LOAD_BITS(bc_) >> n) << n;
} else
bb_ = 0;
}
tx_->send(pb);
return (cc + HDRSIZE);
}
int H261DCTEncoder::consume(const VideoFrame *vf)
{
if (!samesize(vf))
size(vf->width_, vf->height_);
DCTFrame* df = (DCTFrame *)vf;
return(encode(df, df->crvec_));
}
int H261PixelEncoder::consume(const VideoFrame *vf)
{
if (!samesize(vf))
size(vf->width_, vf->height_);
YuvFrame* p = (YuvFrame*)vf;
return(encode(p, p->crvec_));
}
int
H261Encoder::encode(const VideoFrame* vf, const u_int8_t *crvec)
{
tx_->flush();
Transmitter::pktbuf* pb = tx_->alloc(vf->ts_, RTP_PT_H261);
bs_ = (u_char*)pb->iov[1].iov_base;
bc_ = bs_;
u_int ec = (tx_->mtu() - HDRSIZE) << 3;
bb_ = 0;
nbb_ = 0;
sbit_ = 0;
/* RTP/H.261 header */
rtphdr* rh = (rtphdr*)pb->iov[0].iov_base;
*(u_int*)(rh + 1) = 1 << 25 | lq_ << 10;
/* PSC */
PUT_BITS(0x0001, 16, nbb_, bb_, bc_);
/* GOB 0 -> picture header */
PUT_BITS(0, 4, nbb_, bb_, bc_);
/* TR (XXX should do this right) */
PUT_BITS(0, 5, nbb_, bb_, bc_);
/* PTYPE = CIF */
int pt = cif_ ? 4 : 0;
PUT_BITS(pt, 6, nbb_, bb_, bc_);
/* PEI */
PUT_BITS(0, 1, nbb_, bb_, bc_);
int step = cif_ ? 1 : 2;
int cc = 0;
u_int8_t* frm = vf->bp_;
for (u_int gob = 0; gob < ngob_; gob += step) {
u_int loff = loff_[gob];
u_int coff = coff_[gob];
u_int blkno = blkno_[gob];
u_int nbit = ((bc_ - bs_) << 3) + nbb_;
/* GSC/GN */
PUT_BITS(0x10 | (gob + 1), 20, nbb_, bb_, bc_);
/* GQUANT/GEI */
mquant_ = lq_;
PUT_BITS(mquant_ << 1, 6, nbb_, bb_, bc_);
mba_ = 0;
int line = 11;
for (u_int mba = 1; mba <= 33; ++mba) {
/*
* If the conditional replenishment algorithm
* has decided to send any of the blocks of
* this macroblock, code it.
*/
u_int s = crvec[blkno];
if ((s & CR_SEND) != 0) {
u_int mbpred = mba_;
encode_mb(mba, frm, loff, coff, CR_STATE(s));
u_int cbits = ((bc_ - bs_) << 3) + nbb_;
if (cbits > ec) {
Transmitter::pktbuf* npb;
npb = tx_->alloc(vf->ts_, RTP_PT_H261);
cc += flush(pb, nbit, npb);
cbits -= nbit;
pb = npb;
/* RTP/H.261 header */
u_int m = mbpred;
u_int g;
if (m != 0) {
g = gob + 1;
m -= 1;
} else
g = 0;
rh = (rtphdr*)pb->iov[0].iov_base;
*(u_int*)(rh + 1) =
1 << 25 |
m << 15 |
g << 20 |
mquant_ << 10;
}
nbit = cbits;
}
loff += loffsize_;
coff += coffsize_;
blkno += bloffsize_;
if (--line <= 0) {
line = 11;
blkno += bstride_;
loff += lstride_;
coff += cstride_;
}
}
}
cc += flush(pb, ((bc_ - bs_) << 3) + nbb_, 0);
return (cc);
}
|