/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation. Oracle designates this
* particular file as subject to the "Classpath" exception as provided
* by Oracle in the LICENSE file that accompanied this code.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
#include <stdlib.h>
#include "mlib_image.h"
#include "mlib_ImageCheck.h"
typedef union {
double d64;
struct {
float f0;
float f1;
} f32s;
} d64_2_f32;
/***************************************************************/
{
int i, j;
for (j = 0; j < height; j++) {
sp += 2;
}
#pragma pipeloop(0)
}
}
} else {
#pragma pipeloop(0)
}
}
}
}
}
/***************************************************************/
{
for (j = 0; j < height; j++) {
if (count1 == 1) {
sp += 2;
}
#pragma pipeloop(0)
sp += 3;
}
}
continue;
}
switch (off) {
case 0:
#pragma pipeloop(0)
sp2 += 3;
}
break;
case 1:
#pragma pipeloop(0)
sp2 += 3;
}
break;
case 2:
#pragma pipeloop(0)
sp2 += 3;
}
break;
case 3:
#pragma pipeloop(0)
sp2 += 3;
}
}
sp += 3;
}
}
}
/***************************************************************/
{
for (j = 0; j < height; j++) {
if (count1 == 1) {
sp += 3;
}
#pragma pipeloop(0)
sp += 4;
}
}
continue;
}
switch (off) {
case 0:
#pragma pipeloop(0)
sp2++;
}
break;
case 1:
#pragma pipeloop(0)
sp2++;
}
break;
case 2:
#pragma pipeloop(0)
sp2++;
}
break;
}
}
}
}
/***************************************************************/
{
int i, j, off;
for (j = 0; j < height; j++) {
#pragma pipeloop(0)
for (i = 0; i < width; i++) {
d64_2_f32 d;
}
} else {
#pragma pipeloop(0)
for (i = 0; i < width; i++) {
d64_2_f32 d;
}
}
}
}
/***************************************************************/
{
int i, j, off;
for (j = 0; j < height; j++) {
sp += 3;
dp ++;
}
#pragma pipeloop(0)
sp2 += 3;
}
}
}
}
/***************************************************************/
{
int i, j, off;
for (j = 0; j < height; j++) {
if (count1 == 1) {
sp += 2;
}
sp += 3;
}
#pragma pipeloop(0)
sp2 += 3;
}
}
}
}
/***************************************************************/
{
int i, j, off;
for (j = 0; j < height; j++) {
#pragma pipeloop(0)
for (i = 0; i < width; i++) {
d64_2_f32 d;
}
} else {
#pragma pipeloop(0)
for (i = 0; i < width; i++) {
d64_2_f32 d;
}
}
}
}
/***************************************************************/
{
int i, j, off;
for (j = 0; j < height; j++) {
if (count1 == 1) {
sp += 3;
dp ++;
}
#pragma pipeloop(0)
d64_2_f32 d;
sp2 += 2;
}
}
} else {
#pragma pipeloop(0)
sp2 += 2;
}
}
}
}
}
/***************************************************************/
{
int i, j, k;
for (j = 0; j < height; j++) {
for (k = 0; k < count1; k++) {
}
sp++;
#pragma pipeloop(0)
sp2 += 2;
}
}
} else {
#pragma pipeloop(0)
sp2 += 2;
}
}
}
}
}
/***************************************************************/
/* general channel extraction: slower due to the inner loop */
{
int i, j, k; /* indices for x, y, channel */
for (i = (channels - 1), k = 0; i >= 0; i--) {
if ((cmask & (1 << i)) == 0)
deltac[k]++;
else
k++;
}
for (i = 1; i < channeld; i++) {
}
/* Only THREE CHANNEL CASE could be executed here!!! */
for (j = 0; j < height; j++) {
for (i = 0; i < width; i++) {
#pragma pipeloop(0)
dp += 3;
}
}
}
/***************************************************************/
/* general channel extraction: slower due to the inner loop */
{
int i, j, k; /* indices for x, y, channel */
slb >>= 1;
dlb >>= 1;
for (i = (channels - 1), k = 0; i >= 0; i--) {
if ((cmask & (1 << i)) == 0)
deltac[k]++;
else
k++;
}
for (i = 1; i < channeld; i++) {
}
if (channeld == 2) {
for (j = 0; j < height; j++) {
#pragma pipeloop(0)
for (i = 0; i < width; i++) {
dp += 2;
}
}
} else
if (channeld == 3) {
for (j = 0; j < height; j++) {
for (i = 0; i < width; i++) {
#pragma pipeloop(0)
dp += 3;
}
}
}}
/***************************************************************/
/* general channel extraction: slower due to the inner loop */
{
int i, j, k; /* indices for x, y, channel */
for (i = (channels - 1), k = 0; i >= 0; i--) {
if ((cmask & (1 << i)) == 0)
deltac[k]++;
else
k++;
}
for (i = 1; i < channeld; i++) {
}
if (channeld == 1) {
for (j = 0; j < height; j++) {
#pragma pipeloop(0)
for (i = 0; i < width; i++) {
}
}
} else
if (channeld == 2) {
for (j = 0; j < height; j++) {
#pragma pipeloop(0)
for (i = 0; i < width; i++) {
dp += 2;
}
}
} else
if (channeld == 3) {
for (j = 0; j < height; j++) {
for (i = 0; i < width; i++) {
#pragma pipeloop(0)
dp += 3;
}
}
}
}