25 |
* along with this program; if not, write to the Free Software |
* along with this program; if not, write to the Free Software |
26 |
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
27 |
* |
* |
28 |
* $Id: plugin_2pass2.c,v 1.4 2004-06-11 08:44:30 suxen_drol Exp $ |
* $Id: plugin_2pass2.c,v 1.5 2004-06-12 13:53:19 edgomez Exp $ |
29 |
* |
* |
30 |
*****************************************************************************/ |
*****************************************************************************/ |
31 |
|
|
35 |
/* forces second pass not to be bigger than first */ |
/* forces second pass not to be bigger than first */ |
36 |
#undef PASS_SMALLER |
#undef PASS_SMALLER |
37 |
|
|
38 |
/* automtically alters overflow controls (strength and improvement/degradation) |
/* automatically alters overflow controls (strength and improvement/degradation) |
39 |
to fight most common problems without user's knowladge */ |
to fight most common problems without user's knowladge */ |
40 |
#define SMART_OVERFLOW_SETTING |
#define SMART_OVERFLOW_SETTING |
41 |
|
|
453 |
scaled_curve_apply_advanced_parameters(rc); |
scaled_curve_apply_advanced_parameters(rc); |
454 |
|
|
455 |
/* Check curve for VBV compliancy and rescale if necessary */ |
/* Check curve for VBV compliancy and rescale if necessary */ |
|
|
|
456 |
#ifdef VBV_FORCE |
#ifdef VBV_FORCE |
457 |
if (rc->param.vbv_size==0) |
if (rc->param.vbv_size==0) { |
|
{ |
|
458 |
rc->param.vbv_size = 3145728; |
rc->param.vbv_size = 3145728; |
459 |
rc->param.vbv_initial = 2359296; |
rc->param.vbv_initial = 2359296; |
460 |
rc->param.vbv_maxrate = 4000000; |
rc->param.vbv_maxrate = 4000000; |
462 |
} |
} |
463 |
#endif |
#endif |
464 |
|
|
465 |
if (rc->param.vbv_size>0) /* vbv_size==0 switches VBV check off */ |
/* vbv_size==0 switches VBV check off */ |
466 |
{ |
if (rc->param.vbv_size > 0) { |
467 |
const double fps = (double)create->fbase/(double)create->fincr; |
const double fps = (double)create->fbase/(double)create->fincr; |
468 |
int status = check_curve_for_vbv_compliancy(rc, fps); |
int status = check_curve_for_vbv_compliancy(rc, fps); |
469 |
#ifdef VBV_DEBUG |
|
470 |
if (status) |
if (status) { |
471 |
fprintf(stderr,"underflow detected\n Scaling Curve for compliancy... "); |
DPRINTF(XVID_DEBUG_RC, "[xvid rc] Underflow detected - Scaling Curve for compliancy.\n"); |
472 |
#endif |
} |
473 |
|
|
474 |
status = scale_curve_for_vbv_compliancy(rc, fps); |
status = scale_curve_for_vbv_compliancy(rc, fps); |
475 |
|
|
476 |
#ifdef VBV_DEBUG |
if (status == 0) { |
477 |
if (status==0) |
DPRINTF(XVID_DEBUG_RC, "[xvid rc] VBV compliant curve scaling done.\n"); |
478 |
fprintf(stderr,"done.\n"); |
} else { |
479 |
else |
DPRINTF(XVID_DEBUG_RC, "[xvid rc] VBV compliant curve scaling impossible.\n"); |
480 |
fprintf(stderr,"impossible.\n"); |
} |
|
#endif |
|
481 |
} |
} |
482 |
*handle = rc; |
*handle = rc; |
483 |
return(0); |
return(0); |
1452 |
#define VBV_OVERFLOW 2 /* doesn't exist for VBR encoding */ |
#define VBV_OVERFLOW 2 /* doesn't exist for VBR encoding */ |
1453 |
#define VBV_PEAKRATE 4 /* peak bitrate (within 3s) violated */ |
#define VBV_PEAKRATE 4 /* peak bitrate (within 3s) violated */ |
1454 |
|
|
1455 |
static int check_curve_for_vbv_compliancy(rc_2pass2_t * rc, const float fps) |
static int |
1456 |
|
check_curve_for_vbv_compliancy(rc_2pass2_t * rc, const float fps) |
1457 |
{ |
{ |
1458 |
/* We do all calculations in float, for higher accuracy, |
/* We do all calculations in float, for higher accuracy, |
1459 |
and in bytes for convenience |
* and in bytes for convenience. |
1460 |
|
* |
1461 |
typical values from DivX Home Theater profile: |
* typical values from DivX Home Theater profile: |
1462 |
vbv_size= 384*1024 (384kB), vbv_initial= 288*1024 (75% fill) |
* vbv_size= 384*1024 (384kB) |
1463 |
maxrate= 4000000 (4MBps), peakrate= 10000000 (10MBps) |
* vbv_initial= 288*1024 (75% fill) |
1464 |
|
* maxrate= 4000000 (4MBps) |
1465 |
PAL: offset3s = 75 (3 seconds of 25fps) |
* peakrate= 10000000 (10MBps) |
1466 |
NTSC: offset3s = 90 (3 seconds of 29.97fps) or 72 (3 seconds of 23.976fps) |
* |
1467 |
|
* PAL: offset3s = 75 (3 seconds of 25fps) |
1468 |
|
* NTSC: offset3s = 90 (3 seconds of 29.97fps) or 72 (3 seconds of 23.976fps) |
1469 |
*/ |
*/ |
1470 |
|
|
1471 |
const float vbv_size = (float)rc->param.vbv_size/8.f; |
const float vbv_size = (float)rc->param.vbv_size/8.f; |
1472 |
float vbvfill = (float)rc->param.vbv_initial/8.f; |
float vbvfill = (float)rc->param.vbv_initial/8.f; |
1473 |
|
float vbvmin; |
1474 |
|
|
1475 |
const float maxrate = (float)rc->param.vbv_maxrate; |
const float maxrate = (float)rc->param.vbv_maxrate; |
1476 |
const float peakrate = (float)rc->param.vbv_peakrate; |
const float peakrate = (float)rc->param.vbv_peakrate; |
1478 |
|
|
1479 |
int bytes3s = 0; |
int bytes3s = 0; |
1480 |
int offset3s = (int)(3.f*fps+0.5); |
int offset3s = (int)(3.f*fps+0.5); |
|
|
|
1481 |
int i; |
int i; |
1482 |
|
|
1483 |
|
/* 1Gbit should be enough to inuitialize the vbvmin |
1484 |
|
* an arbitrary high value */ |
1485 |
|
vbvmin = 1000*1000*1000; |
1486 |
|
|
1487 |
for (i=0; i<rc->num_frames; i++) { |
for (i=0; i<rc->num_frames; i++) { |
1488 |
/* DivX 3s peak bitrate check */ |
/* DivX 3s peak bitrate check */ |
|
|
|
1489 |
bytes3s += rc->stats[i].scaled_length; |
bytes3s += rc->stats[i].scaled_length; |
1490 |
if (i>=offset3s) |
if (i>=offset3s) |
1491 |
bytes3s -= rc->stats[i-offset3s].scaled_length; |
bytes3s -= rc->stats[i-offset3s].scaled_length; |
1492 |
|
|
1493 |
if (8.f*bytes3s > 3*peakrate) |
if (8.f*bytes3s > 3*peakrate) |
1494 |
return VBV_PEAKRATE; |
return(VBV_PEAKRATE); |
1495 |
|
|
1496 |
/* update vbv fill level */ |
/* update vbv fill level */ |
|
|
|
1497 |
vbvfill += r0 - rc->stats[i].scaled_length; |
vbvfill += r0 - rc->stats[i].scaled_length; |
1498 |
|
|
1499 |
/* this check is _NOT_ an "overflow"! only reading from disk stops then */ |
/* this check is _NOT_ an "overflow"! only reading from disk stops then */ |
1502 |
|
|
1503 |
/* but THIS would be an underflow. report it! */ |
/* but THIS would be an underflow. report it! */ |
1504 |
if (vbvfill < 0) |
if (vbvfill < 0) |
1505 |
return VBV_UNDERFLOW; |
return(VBV_UNDERFLOW); |
1506 |
|
|
1507 |
|
/* Store the minimum buffer filling */ |
1508 |
|
if (vbvfill < vbvmin) |
1509 |
|
vbvmin = vbvfill; |
1510 |
} |
} |
1511 |
|
|
1512 |
return VBV_COMPLIANT; |
DPRINTF(XVID_DEBUG_RC, "[xvid rc] Minimum buffer fill: %f bytes\n", vbvmin); |
1513 |
|
|
1514 |
|
return(VBV_COMPLIANT); |
1515 |
} |
} |
|
/* TODO: store min(vbvfill) and print "minimum buffer fill" */ |
|
1516 |
|
|
1517 |
|
|
1518 |
static int scale_curve_for_vbv_compliancy(rc_2pass2_t * rc, const float fps) |
static int |
1519 |
|
scale_curve_for_vbv_compliancy(rc_2pass2_t * rc, const float fps) |
1520 |
{ |
{ |
1521 |
/* correct any VBV violations. Peak bitrate violations disappears |
/* correct any VBV violations. Peak bitrate violations disappears |
1522 |
by this automatically |
* by this automatically |
1523 |
|
* |
1524 |
This implementation follows |
* This implementation follows |
1525 |
|
* |
1526 |
Westerink, Rajagopalan, Gonzales "Two-pass MPEG-2 variable-bitrate encoding" |
* Westerink, Rajagopalan, Gonzales "Two-pass MPEG-2 variable-bitrate encoding" |
1527 |
IBM J. RES. DEVELOP. VOL 43, No. 4, July 1999, p.471--488 |
* IBM J. RES. DEVELOP. VOL 43, No. 4, July 1999, p.471--488 |
1528 |
|
* |
1529 |
Thanks, guys! This paper rocks!!! |
* Thanks, guys! This paper rocks!!! */ |
|
*/ |
|
|
|
|
|
/* |
|
|
For each scene of len N, we have to check up to N^2 possible buffer fills. |
|
|
This works well with MPEG-2 where N==12 or so, but for MPEG-4 it's a |
|
|
little slow... |
|
1530 |
|
|
1531 |
TODO: Better control on VBVfill between scenes |
/* For each scene of len N, we have to check up to N^2 possible buffer fills. |
1532 |
*/ |
* This works well with MPEG-2 where N==12 or so, but for MPEG-4 it's a |
1533 |
|
* little slow... |
1534 |
|
* |
1535 |
|
* TODO: Better control on VBVfill between scenes */ |
1536 |
|
|
1537 |
const float vbv_size = (float)rc->param.vbv_size/8.f; |
const float vbv_size = (float)rc->param.vbv_size/8.f; |
1538 |
const float vbv_initial = (float)rc->param.vbv_initial/8.f; |
const float vbv_initial = (float)rc->param.vbv_initial/8.f; |
1546 |
int *scenestart; |
int *scenestart; |
1547 |
int *scenelength; |
int *scenelength; |
1548 |
|
|
1549 |
/* first step: determine how many "scenes" there are and store their boundaries |
/* first step: determine how many "scenes" there are and store their |
1550 |
we could get all this from existing keyframe_positions, somehow, but there we |
* boundaries we could get all this from existing keyframe_positions, |
1551 |
don't have a min_scenelength, and it's no big deal to get it again. */ |
* somehow, but there we don't have a min_scenelength, and it's no big |
1552 |
|
* deal to get it again. */ |
1553 |
|
|
1554 |
const int min_scenelength = (int)(fps+0.5); |
const int min_scenelength = (int)(fps+0.5); |
1555 |
int num_scenes = 0; |
int num_scenes = 0; |
1556 |
int last_scene = -999; |
int last_scene = -999; |
1557 |
for (i=0; i<rc->num_frames; i++) { |
for (i=0; i<rc->num_frames; i++) { |
1558 |
if ( (rc->stats[i].type == XVID_TYPE_IVOP) && (i-last_scene>min_scenelength) ) |
if ((rc->stats[i].type == XVID_TYPE_IVOP) && (i-last_scene>min_scenelength)) { |
|
{ |
|
1559 |
last_scene = i; |
last_scene = i; |
1560 |
num_scenes++; |
num_scenes++; |
1561 |
} |
} |
1565 |
scenestart = (int*)malloc( num_scenes*sizeof(int) ); |
scenestart = (int*)malloc( num_scenes*sizeof(int) ); |
1566 |
scenelength = (int*)malloc( num_scenes*sizeof(int) ); |
scenelength = (int*)malloc( num_scenes*sizeof(int) ); |
1567 |
|
|
1568 |
if ((!scenefactor) || (!scenestart) || (!scenelength) ) |
if ((!scenefactor) || (!scenestart) || (!scenelength) ) { |
|
{ |
|
1569 |
free(scenefactor); |
free(scenefactor); |
1570 |
free(scenestart); |
free(scenestart); |
1571 |
free(scenelength); |
free(scenelength); |
1572 |
/* remember: free(0) is valid and does exactly nothing. */ |
/* remember: free(0) is valid and does exactly nothing. */ |
1573 |
return -1; |
return(-1); |
1574 |
} |
} |
1575 |
|
|
1576 |
/* count again and safe the length/position */ |
/* count again and safe the length/position */ |
1578 |
num_scenes = 0; |
num_scenes = 0; |
1579 |
last_scene = -999; |
last_scene = -999; |
1580 |
for (i=0; i<rc->num_frames; i++) { |
for (i=0; i<rc->num_frames; i++) { |
1581 |
if ( (rc->stats[i].type == XVID_TYPE_IVOP) && (i-last_scene>min_scenelength) ) |
if ((rc->stats[i].type == XVID_TYPE_IVOP) && (i-last_scene>min_scenelength)) { |
1582 |
{ |
if (num_scenes>0) { |
|
if (num_scenes>0) |
|
1583 |
scenelength[num_scenes-1]=i-last_scene; |
scenelength[num_scenes-1]=i-last_scene; |
1584 |
|
} |
1585 |
scenestart[num_scenes]=i; |
scenestart[num_scenes]=i; |
1586 |
num_scenes++; |
num_scenes++; |
1587 |
last_scene = i; |
last_scene = i; |
1589 |
} |
} |
1590 |
scenelength[num_scenes-1]=i-last_scene; |
scenelength[num_scenes-1]=i-last_scene; |
1591 |
|
|
1592 |
/* second step: check for each scene, how much we can scale its frames up or down |
/* second step: check for each scene, how much we can scale its frames up or |
1593 |
such that the VBV restriction is just fulfilled |
* down such that the VBV restriction is just fulfilled */ |
|
*/ |
|
|
|
|
|
|
|
1594 |
#define R(k,n) (((n)+1-(k))*r0) /* how much enters the buffer between frame k and n */ |
#define R(k,n) (((n)+1-(k))*r0) /* how much enters the buffer between frame k and n */ |
1595 |
for (l=0; l<num_scenes;l++) |
for (l=0; l<num_scenes;l++) { |
|
{ |
|
1596 |
const int start = scenestart[l]; |
const int start = scenestart[l]; |
1597 |
const int length = scenelength[l]; |
const int length = scenelength[l]; |
1598 |
twopass_stat_t * frames = &rc->stats[start]; |
twopass_stat_t * frames = &rc->stats[start]; |
1601 |
float f,minf = 99999.f; |
float f,minf = 99999.f; |
1602 |
|
|
1603 |
S0n=0.; |
S0n=0.; |
1604 |
for (n=0;n<=length-1;n++) |
for (n=0;n<=length-1;n++) { |
|
{ |
|
1605 |
S0n += frames[n].scaled_length; |
S0n += frames[n].scaled_length; |
1606 |
|
|
1607 |
k=0; |
k=0; |
1610 |
if (f < minf) |
if (f < minf) |
1611 |
minf = f; |
minf = f; |
1612 |
|
|
1613 |
for (k=1;k<=n;k++) |
for (k=1;k<=n;k++) { |
|
{ |
|
1614 |
Skn -= frames[k].scaled_length; |
Skn -= frames[k].scaled_length; |
1615 |
|
|
1616 |
f = (R(k,n-1) + (vbv_size - vbv_low)) / Skn; |
f = (R(k,n-1) + (vbv_size - vbv_low)) / Skn; |
1620 |
} |
} |
1621 |
|
|
1622 |
/* special case: at the end, fill buffer up to vbv_initial again |
/* special case: at the end, fill buffer up to vbv_initial again |
1623 |
TODO: Allow other values for buffer fill between scenes |
* |
1624 |
e.g. if n=N is smallest f-value, then check for better value */ |
* TODO: Allow other values for buffer fill between scenes |
1625 |
|
* e.g. if n=N is smallest f-value, then check for better value */ |
1626 |
|
|
1627 |
n=length; |
n=length; |
1628 |
k=0; |
k=0; |
1631 |
if (f < minf) |
if (f < minf) |
1632 |
minf = f; |
minf = f; |
1633 |
|
|
1634 |
for (k=1;k<=n-1;k++) |
for (k=1;k<=n-1;k++) { |
|
{ |
|
1635 |
Skn -= frames[k].scaled_length; |
Skn -= frames[k].scaled_length; |
1636 |
|
|
1637 |
f = (R(k,n-1) + (vbv_initial - vbv_low)) / Skn; |
f = (R(k,n-1) + (vbv_initial - vbv_low)) / Skn; |
1639 |
minf = f; |
minf = f; |
1640 |
} |
} |
1641 |
|
|
1642 |
#ifdef VBV_DEBUG |
DPRINTF(XVID_DEBUG_RC, "[xvid rc] Scene %d (Frames %d-%d): VBVfactor %f\n", |
1643 |
printf("Scene %d (Frames %d-%d): VBVfactor %f\n", l, start, start+length-1 , minf); |
l, start, start+length-1 , minf); |
|
#endif |
|
1644 |
|
|
1645 |
scenefactor[l] = minf; |
scenefactor[l] = minf; |
1646 |
} |
} |
1647 |
#undef R |
#undef R |
1648 |
|
|
1649 |
/* last step: now we know of any scene how much it can be scaled up or down without |
/* last step: now we know of any scene how much it can be scaled up or down |
1650 |
violating VBV. Next, distribute bits from the evil scenes to the good ones */ |
* without violating VBV. Next, distribute bits from the evil scenes to the |
1651 |
|
* good ones */ |
1652 |
do |
do { |
|
{ |
|
1653 |
float S_red = 0.f; /* how much to redistribute */ |
float S_red = 0.f; /* how much to redistribute */ |
1654 |
float S_elig = 0.f; /* sum of bit for those scenes you can still swallow something*/ |
float S_elig = 0.f; /* sum of bit for those scenes you can still swallow something*/ |
1655 |
float f_red; |
float f_red; |
1656 |
int l; |
int l; |
1657 |
|
|
1658 |
for (l=0;l<num_scenes;l++) /* check how much is wrong */ |
/* check how much is wrong */ |
1659 |
{ |
for (l=0;l<num_scenes;l++) { |
1660 |
const int start = scenestart[l]; |
const int start = scenestart[l]; |
1661 |
const int length = scenelength[l]; |
const int length = scenelength[l]; |
1662 |
twopass_stat_t * frames = &rc->stats[start]; |
twopass_stat_t * frames = &rc->stats[start]; |
1663 |
|
|
1664 |
if (scenefactor[l] == 1.) /* exactly 1 means "don't touch this anymore!" */ |
/* exactly 1 means "don't touch this anymore!" */ |
1665 |
|
if (scenefactor[l] == 1.) |
1666 |
continue; |
continue; |
1667 |
|
|
1668 |
if (scenefactor[l] > 1.) /* within limits */ |
/* within limits */ |
1669 |
{ |
if (scenefactor[l] > 1.) { |
1670 |
for (n= 0; n < length; n++) |
for (n= 0; n < length; n++) |
1671 |
S_elig += frames[n].scaled_length; |
S_elig += frames[n].scaled_length; |
1672 |
} |
} else { |
1673 |
else /* underflowing segment */ |
/* underflowing segment */ |
1674 |
{ |
for (n= 0; n < length; n++) { |
|
for (n= 0; n < length; n++) |
|
|
{ |
|
1675 |
float newbytes = (float)frames[n].scaled_length * scenefactor[l]; |
float newbytes = (float)frames[n].scaled_length * scenefactor[l]; |
1676 |
S_red += (float)frames[n].scaled_length - (float)newbytes; |
S_red += (float)frames[n].scaled_length - (float)newbytes; |
1677 |
frames[n].scaled_length =(int)newbytes; |
frames[n].scaled_length =(int)newbytes; |
1680 |
} |
} |
1681 |
} |
} |
1682 |
|
|
1683 |
if (S_red < 1.f) /* no more underflows */ |
/* no more underflows */ |
1684 |
|
if (S_red < 1.f) |
1685 |
break; |
break; |
1686 |
|
|
1687 |
if (S_elig < 1.f) |
if (S_elig < 1.f) { |
1688 |
{ |
DPRINTF(XVID_DEBUG_RC, "[xvid rc] Everything underflowing.\n"); |
|
#ifdef VBV_DEBUG |
|
|
fprintf(stderr,"Everything underflowing. \n"); |
|
|
#endif |
|
1689 |
free(scenefactor); |
free(scenefactor); |
1690 |
free(scenestart); |
free(scenestart); |
1691 |
free(scenelength); |
free(scenelength); |
1692 |
return -2; |
return(-2); |
1693 |
} |
} |
1694 |
|
|
1695 |
f_red = (1.f + S_red/S_elig); |
f_red = (1.f + S_red/S_elig); |
1696 |
|
|
1697 |
#ifdef VBV_DEBUG |
DPRINTF(XVID_DEBUG_RC, "[xvid rc] Moving %.0f kB to avoid buffer underflow, correction factor: %.5f\n", |
1698 |
printf("Moving %.0f kB to avoid buffer underflow, correction factor: %.5f\n",S_red/1024.f,f_red); |
S_red/1024.f, f_red); |
|
#endif |
|
1699 |
|
|
1700 |
violation=0; |
violation=0; |
1701 |
for (l=0; l<num_scenes; l++) /* scale remaining scenes up to meet total size */ |
/* scale remaining scenes up to meet total size */ |
1702 |
{ |
for (l=0; l<num_scenes; l++) { |
1703 |
const int start = scenestart[l]; |
const int start = scenestart[l]; |
1704 |
const int length = scenelength[l]; |
const int length = scenelength[l]; |
1705 |
twopass_stat_t * frames = &rc->stats[start]; |
twopass_stat_t * frames = &rc->stats[start]; |
1708 |
continue; |
continue; |
1709 |
|
|
1710 |
/* there shouldn't be any segments with factor<1 left, so all the rest is >1 */ |
/* there shouldn't be any segments with factor<1 left, so all the rest is >1 */ |
1711 |
|
for (n= 0; n < length; n++) { |
|
for (n= 0; n < length; n++) |
|
|
{ |
|
1712 |
frames[n].scaled_length = (int)(frames[n].scaled_length * f_red + 0.5); |
frames[n].scaled_length = (int)(frames[n].scaled_length * f_red + 0.5); |
1713 |
} |
} |
1714 |
|
|
1722 |
free(scenefactor); |
free(scenefactor); |
1723 |
free(scenestart); |
free(scenestart); |
1724 |
free(scenelength); |
free(scenelength); |
1725 |
return 0; |
return(0); |
1726 |
} |
} |
1727 |
|
|
1728 |
|
|