diff options
| author | 2012-01-29 16:34:26 +0000 | |
|---|---|---|
| committer | 2012-01-29 16:34:26 +0000 | |
| commit | 505442d0a0bdc2944f699d9102ae0829703a5407 (patch) | |
| tree | 1a4c2f72533c67984e0112d35905f480a3a9b0ea /src/lib/libjpeg/jdmaster.c | |
| parent | 5d0cb30e84215504e368130db9e4573c37e458f2 (diff) | |
Clean-ups and version bumpmame0144u7
Diffstat (limited to 'src/lib/libjpeg/jdmaster.c')
| -rw-r--r-- | src/lib/libjpeg/jdmaster.c | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/src/lib/libjpeg/jdmaster.c b/src/lib/libjpeg/jdmaster.c index 8c1146e4fe1..ba667eb65c1 100644 --- a/src/lib/libjpeg/jdmaster.c +++ b/src/lib/libjpeg/jdmaster.c @@ -191,20 +191,20 @@ jpeg_calc_output_dimensions (j_decompress_ptr cinfo) * processes are inner loops and need to be as fast as possible. On most * machines, particularly CPUs with pipelines or instruction prefetch, * a (subscript-check-less) C table lookup - * x = sample_range_limit[x]; + * x = sample_range_limit[x]; * is faster than explicit tests - * if (x < 0) x = 0; - * else if (x > MAXJSAMPLE) x = MAXJSAMPLE; + * if (x < 0) x = 0; + * else if (x > MAXJSAMPLE) x = MAXJSAMPLE; * These processes all use a common table prepared by the routine below. * * For most steps we can mathematically guarantee that the initial value * of x is within MAXJSAMPLE+1 of the legal range, so a table running from * -(MAXJSAMPLE+1) to 2*MAXJSAMPLE+1 is sufficient. But for the initial - * limiting step (just after the IDCT), a wildly out-of-range value is + * limiting step (just after the IDCT), a wildly out-of-range value is * possible if the input data is corrupt. To avoid any chance of indexing * off the end of memory and getting a bad-pointer trap, we perform the * post-IDCT limiting thus: - * x = range_limit[x & MASK]; + * x = range_limit[x & MASK]; * where MASK is 2 bits wider than legal sample data, ie 10 bits for 8-bit * samples. Under normal circumstances this is more than enough range and * a correct output will be generated; with bogus input data the mask will |
