2019-08-09 02:16:20 +11:00
|
|
|
/*
|
|
|
|
* OPERATORS
|
|
|
|
*
|
2020-01-23 22:36:33 +11:00
|
|
|
* operations entre des images.
|
2019-08-09 02:16:20 +11:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <unistd.h>
|
|
|
|
#include <string.h>
|
2019-08-24 12:40:53 +11:00
|
|
|
#include <math.h>
|
2019-08-09 02:16:20 +11:00
|
|
|
|
|
|
|
#include "../floatimg.h"
|
|
|
|
|
|
|
|
extern int verbosity; /* must be declared around main() */
|
|
|
|
|
|
|
|
/* ---------------------------------------------------------------- */
|
2019-12-21 22:37:26 +11:00
|
|
|
/*
|
2020-01-15 21:38:40 +11:00
|
|
|
* A + B -> D
|
2019-12-21 22:37:26 +11:00
|
|
|
* why is this func so slow ?
|
|
|
|
*/
|
2020-01-15 21:38:40 +11:00
|
|
|
int fimg_add_3(FloatImg *a, FloatImg *b, FloatImg *d)
|
2019-08-09 02:16:20 +11:00
|
|
|
{
|
2020-01-07 23:45:18 +11:00
|
|
|
int idx, nbpixels;
|
2019-08-09 02:16:20 +11:00
|
|
|
|
|
|
|
#if DEBUG_LEVEL
|
|
|
|
fprintf(stderr, ">>> %s ( %p %p %p )\n", __func__, a, b, d);
|
|
|
|
#endif
|
|
|
|
|
2020-01-22 19:33:35 +11:00
|
|
|
if (FIMG_TYPE_RGB != a->type ||
|
|
|
|
FIMG_TYPE_RGB != b->type ||
|
|
|
|
FIMG_TYPE_RGB != d->type) {
|
2019-08-09 02:16:20 +11:00
|
|
|
fprintf(stderr, "%s : got a bad type fimg\n", __func__);
|
|
|
|
return -8;
|
|
|
|
}
|
|
|
|
|
2020-01-07 23:45:18 +11:00
|
|
|
nbpixels = a->width * a->height;
|
2019-08-09 02:16:20 +11:00
|
|
|
|
2020-01-07 23:45:18 +11:00
|
|
|
for (idx=0; idx<nbpixels; idx++) {
|
2019-08-09 02:16:20 +11:00
|
|
|
d->R[idx] = a->R[idx] + b->R[idx];
|
|
|
|
d->G[idx] = a->G[idx] + b->G[idx];
|
|
|
|
d->B[idx] = a->B[idx] + b->B[idx];
|
|
|
|
}
|
|
|
|
|
2020-01-15 21:38:40 +11:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
/* ---------------------------------------------------------------- */
|
|
|
|
/*
|
|
|
|
* B += A may be faster than fimg_add_3 ?
|
|
|
|
*/
|
|
|
|
int fimg_add_2(FloatImg *a, FloatImg *b)
|
|
|
|
{
|
|
|
|
int idx, nbpixels;
|
|
|
|
|
|
|
|
#if DEBUG_LEVEL
|
|
|
|
fprintf(stderr, ">>> %s ( %p %p )\n", __func__, a, b);
|
|
|
|
#endif
|
|
|
|
|
2020-01-22 19:33:35 +11:00
|
|
|
if (FIMG_TYPE_RGB != a->type || FIMG_TYPE_RGB != b->type) {
|
2020-01-15 21:38:40 +11:00
|
|
|
fprintf(stderr, "%s : got a bad type fimg\n", __func__);
|
|
|
|
return -8;
|
|
|
|
}
|
|
|
|
|
|
|
|
nbpixels = a->width * a->height;
|
|
|
|
|
2020-06-23 19:08:59 +11:00
|
|
|
/* are we cache-friendly here ?
|
|
|
|
* we need an accurate benchmarking... */
|
|
|
|
|
2020-01-15 21:38:40 +11:00
|
|
|
for (idx=0; idx<nbpixels; idx++) {
|
|
|
|
b->R[idx] += a->R[idx];
|
|
|
|
b->G[idx] += a->G[idx];
|
|
|
|
b->B[idx] += a->B[idx];
|
|
|
|
}
|
|
|
|
|
2019-09-11 22:31:10 +11:00
|
|
|
return 0;
|
2019-08-09 02:16:20 +11:00
|
|
|
}
|
|
|
|
/* ---------------------------------------------------------------- */
|
|
|
|
/*
|
|
|
|
* A - B -> D
|
|
|
|
*/
|
2020-01-15 21:38:40 +11:00
|
|
|
int fimg_sub_3(FloatImg *a, FloatImg *b, FloatImg *d)
|
2019-08-09 02:16:20 +11:00
|
|
|
{
|
2020-01-07 23:45:18 +11:00
|
|
|
int idx, nbpixels;
|
2019-08-09 02:16:20 +11:00
|
|
|
|
|
|
|
#if DEBUG_LEVEL
|
|
|
|
fprintf(stderr, ">>> %s ( %p %p %p )\n", __func__, a, b, d);
|
|
|
|
#endif
|
|
|
|
|
2020-06-23 19:08:59 +11:00
|
|
|
if ( FIMG_TYPE_RGB != a->type ||
|
|
|
|
FIMG_TYPE_RGB != b->type ||
|
2020-01-22 19:33:35 +11:00
|
|
|
FIMG_TYPE_RGB != d->type) {
|
2019-08-09 02:16:20 +11:00
|
|
|
fprintf(stderr, "%s : got a bad type fimg\n", __func__);
|
|
|
|
return -8;
|
2020-01-15 21:38:40 +11:00
|
|
|
}
|
2019-08-09 02:16:20 +11:00
|
|
|
|
2020-01-07 23:45:18 +11:00
|
|
|
nbpixels = a->width * a->height;
|
2019-08-09 02:16:20 +11:00
|
|
|
|
2019-12-21 22:37:26 +11:00
|
|
|
/* maybe we can speedup this loop for
|
|
|
|
* avoiding the cache strashing ?
|
|
|
|
*/
|
2020-01-07 23:45:18 +11:00
|
|
|
for (idx=0; idx<nbpixels; idx++) {
|
2019-08-09 02:16:20 +11:00
|
|
|
d->R[idx] = fabs(a->R[idx] - b->R[idx]);
|
|
|
|
d->G[idx] = fabs(a->G[idx] - b->G[idx]);
|
|
|
|
d->B[idx] = fabs(a->B[idx] - b->B[idx]);
|
|
|
|
}
|
|
|
|
|
2019-09-11 22:31:10 +11:00
|
|
|
return 0;
|
2020-01-17 20:53:45 +11:00
|
|
|
}
|
|
|
|
/* ---------------------------------------------------------------- */
|
|
|
|
/*
|
|
|
|
* B *= A may be faster than fimg_mul_3 ?
|
|
|
|
*/
|
|
|
|
int fimg_mul_2(FloatImg *a, FloatImg *b)
|
|
|
|
{
|
|
|
|
int idx, nbpixels;
|
|
|
|
|
|
|
|
#if DEBUG_LEVEL
|
|
|
|
fprintf(stderr, ">>> %s ( %p %p )\n", __func__, a, b);
|
|
|
|
#endif
|
|
|
|
|
2020-01-22 19:33:35 +11:00
|
|
|
if (FIMG_TYPE_RGB != a->type || FIMG_TYPE_RGB != b->type) {
|
2020-01-17 20:53:45 +11:00
|
|
|
fprintf(stderr, "%s : got a bad type fimg\n", __func__);
|
|
|
|
return -8;
|
|
|
|
}
|
|
|
|
|
|
|
|
nbpixels = a->width * a->height;
|
|
|
|
|
|
|
|
for (idx=0; idx<nbpixels; idx++) {
|
|
|
|
b->R[idx] *= a->R[idx];
|
|
|
|
b->G[idx] *= a->G[idx];
|
|
|
|
b->B[idx] *= a->B[idx];
|
|
|
|
}
|
|
|
|
|
2020-01-22 19:33:35 +11:00
|
|
|
return 0;
|
2019-08-09 02:16:20 +11:00
|
|
|
}
|
|
|
|
/* ---------------------------------------------------------------- */
|
|
|
|
/*
|
|
|
|
* A * B -> D
|
|
|
|
*/
|
2020-01-15 21:38:40 +11:00
|
|
|
int fimg_mul_3(FloatImg *a, FloatImg *b, FloatImg *d)
|
2019-08-09 02:16:20 +11:00
|
|
|
{
|
2020-01-07 23:45:18 +11:00
|
|
|
int idx, nbpixels;
|
2019-08-09 02:16:20 +11:00
|
|
|
|
|
|
|
#if DEBUG_LEVEL
|
|
|
|
fprintf(stderr, ">>> %s ( %p %p %p )\n", __func__, a, b, d);
|
|
|
|
#endif
|
|
|
|
|
2020-01-22 19:33:35 +11:00
|
|
|
if (FIMG_TYPE_RGB != a->type || FIMG_TYPE_RGB != b->type ||
|
|
|
|
FIMG_TYPE_RGB != d->type) {
|
2019-08-09 02:16:20 +11:00
|
|
|
fprintf(stderr, "%s : got a bad type fimg\n", __func__);
|
|
|
|
return -8;
|
|
|
|
}
|
|
|
|
|
2020-01-07 23:45:18 +11:00
|
|
|
nbpixels = a->width * a->height;
|
2019-08-09 02:16:20 +11:00
|
|
|
|
2020-01-07 23:45:18 +11:00
|
|
|
for (idx=0; idx<nbpixels; idx++) {
|
2019-08-09 02:16:20 +11:00
|
|
|
d->R[idx] = a->R[idx] * b->R[idx];
|
|
|
|
d->G[idx] = a->G[idx] * b->G[idx];
|
|
|
|
d->B[idx] = a->B[idx] * b->B[idx];
|
|
|
|
}
|
|
|
|
|
2019-09-11 22:31:10 +11:00
|
|
|
return 0;
|
2019-08-09 02:16:20 +11:00
|
|
|
}
|
|
|
|
/* ---------------------------------------------------------------- */
|
2019-11-20 21:12:16 +11:00
|
|
|
int fimg_minimum(FloatImg *a, FloatImg *b, FloatImg *d)
|
|
|
|
{
|
|
|
|
int idx, nbiter;
|
|
|
|
|
|
|
|
#if DEBUG_LEVEL
|
|
|
|
fprintf(stderr, ">>> %s ( %p %p %p )\n", __func__, a, b, d);
|
|
|
|
#endif
|
|
|
|
|
2020-01-22 19:33:35 +11:00
|
|
|
if (FIMG_TYPE_RGB != a->type || FIMG_TYPE_RGB != b->type ||
|
|
|
|
FIMG_TYPE_RGB != d->type) {
|
2019-11-20 21:12:16 +11:00
|
|
|
fprintf(stderr, "%s : got a bad type fimg\n", __func__);
|
|
|
|
return -8;
|
|
|
|
}
|
|
|
|
|
2020-06-23 19:08:59 +11:00
|
|
|
nbiter = a->width * a->height;
|
2019-11-20 21:12:16 +11:00
|
|
|
|
|
|
|
for (idx=0; idx<nbiter; idx++) {
|
2020-06-23 19:08:59 +11:00
|
|
|
if (a->R[idx] > b->R[idx]) d->R[idx] = a->R[idx];
|
|
|
|
else d->R[idx] = b->R[idx];
|
|
|
|
if (a->G[idx] > b->G[idx]) d->G[idx] = a->G[idx];
|
|
|
|
else d->G[idx] = b->G[idx];
|
|
|
|
if (a->B[idx] > b->B[idx]) d->B[idx] = a->B[idx];
|
|
|
|
else d->B[idx] = b->B[idx];
|
2019-11-20 21:12:16 +11:00
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
/* ---------------------------------------------------------------- */
|
|
|
|
int fimg_maximum(FloatImg *a, FloatImg *b, FloatImg *d)
|
|
|
|
{
|
|
|
|
int idx, nbiter;
|
|
|
|
|
|
|
|
#if DEBUG_LEVEL
|
|
|
|
fprintf(stderr, ">>> %s ( %p %p %p )\n", __func__, a, b, d);
|
|
|
|
#endif
|
|
|
|
|
2020-01-22 19:33:35 +11:00
|
|
|
if (FIMG_TYPE_RGB != a->type || FIMG_TYPE_RGB != b->type ||
|
|
|
|
FIMG_TYPE_RGB != d->type) {
|
2019-11-20 21:12:16 +11:00
|
|
|
fprintf(stderr, "%s : got a bad type fimg\n", __func__);
|
|
|
|
return -8;
|
|
|
|
}
|
|
|
|
|
2020-06-23 19:08:59 +11:00
|
|
|
nbiter = a->width * a->height ;
|
2019-11-20 21:12:16 +11:00
|
|
|
|
|
|
|
for (idx=0; idx<nbiter; idx++) {
|
2020-06-23 19:08:59 +11:00
|
|
|
if (a->R[idx] < b->R[idx]) d->R[idx] = a->R[idx];
|
|
|
|
else d->R[idx] = b->R[idx];
|
|
|
|
if (a->G[idx] < b->G[idx]) d->G[idx] = a->G[idx];
|
|
|
|
else d->G[idx] = b->G[idx];
|
|
|
|
if (a->B[idx] < b->B[idx]) d->B[idx] = a->B[idx];
|
|
|
|
else d->B[idx] = b->B[idx];
|
2019-11-20 21:12:16 +11:00
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
/* ---------------------------------------------------------------- */
|