This repository has been archived on 2023-10-09. You can view files and clone it, but cannot push or open issues or pull requests.
Files
blender-archive/source/blender/imbuf/intern/imageprocess.c

393 lines
11 KiB
C
Raw Normal View History

/*
* ***** BEGIN GPL LICENSE BLOCK *****
2002-10-12 11:37:38 +00:00
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
2002-10-12 11:37:38 +00:00
*
* This program 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 for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software Foundation,
2010-02-12 13:34:04 +00:00
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
2002-10-12 11:37:38 +00:00
*
* The Original Code is Copyright (C) 2001-2002 by NaN Holding BV.
* All rights reserved.
*
* The Original Code is: all of this file.
*
* Contributor(s): none yet.
*
* ***** END GPL LICENSE BLOCK *****
2012-04-30 14:24:11 +00:00
*/
/** \file blender/imbuf/intern/imageprocess.c
* \ingroup imbuf
*
2002-10-12 11:37:38 +00:00
* This file was moved here from the src/ directory. It is meant to
* deal with endianness. It resided in a general blending lib. The
* other functions were only used during rendering. This single
* function remained. It should probably move to imbuf/intern/util.c,
2012-04-30 14:24:11 +00:00
* but we'll keep it here for the time being. (nzc)
*
2011-02-27 20:23:21 +00:00
*/
#include <stdlib.h>
#include "MEM_guardedalloc.h"
#include "BLI_utildefines.h"
#include "BLI_task.h"
#include "BLI_math.h"
#include "IMB_imbuf_types.h"
2002-10-12 11:37:38 +00:00
#include "IMB_imbuf.h"
#include <math.h>
2002-10-12 11:37:38 +00:00
/* Only this one is used liberally here, and in imbuf */
void IMB_convert_rgba_to_abgr(struct ImBuf *ibuf)
2002-10-12 11:37:38 +00:00
{
int size;
unsigned char rt, *cp = (unsigned char *)ibuf->rect;
float rtf, *cpf = ibuf->rect_float;
if (ibuf->rect) {
size = ibuf->x * ibuf->y;
while (size-- > 0) {
2012-05-13 22:05:51 +00:00
rt = cp[0];
cp[0] = cp[3];
cp[3] = rt;
rt = cp[1];
cp[1] = cp[2];
cp[2] = rt;
cp += 4;
}
}
if (ibuf->rect_float) {
size = ibuf->x * ibuf->y;
while (size-- > 0) {
2012-05-13 22:05:51 +00:00
rtf = cpf[0];
cpf[0] = cpf[3];
cpf[3] = rtf;
rtf = cpf[1];
cpf[1] = cpf[2];
cpf[2] = rtf;
cpf += 4;
}
2002-10-12 11:37:38 +00:00
}
}
static void pixel_from_buffer(struct ImBuf *ibuf, unsigned char **outI, float **outF, int x, int y)
{
2012-05-13 22:05:51 +00:00
int offset = ibuf->x * y * 4 + 4 * x;
if (ibuf->rect)
2012-05-13 22:05:51 +00:00
*outI = (unsigned char *)ibuf->rect + offset;
if (ibuf->rect_float)
*outF = ibuf->rect_float + offset;
}
/* BICUBIC Interpolation */
void bicubic_interpolation_color(struct ImBuf *in, unsigned char outI[4], float outF[4], float u, float v)
{
if (outF) {
BLI_bicubic_interpolation_fl(in->rect_float, outF, in->x, in->y, 4, u, v);
}
else {
2012-12-28 14:19:05 +00:00
BLI_bicubic_interpolation_char((unsigned char *) in->rect, outI, in->x, in->y, 4, u, v);
}
}
void bicubic_interpolation(ImBuf *in, ImBuf *out, float u, float v, int xout, int yout)
{
unsigned char *outI = NULL;
float *outF = NULL;
if (in == NULL || (in->rect == NULL && in->rect_float == NULL)) {
return;
}
pixel_from_buffer(out, &outI, &outF, xout, yout); /* gcc warns these could be uninitialized, but its ok */
bicubic_interpolation_color(in, outI, outF, u, v);
}
/* BILINEAR INTERPOLATION */
void bilinear_interpolation_color(struct ImBuf *in, unsigned char outI[4], float outF[4], float u, float v)
{
if (outF) {
BLI_bilinear_interpolation_fl(in->rect_float, outF, in->x, in->y, 4, u, v);
}
else {
2012-12-28 14:19:05 +00:00
BLI_bilinear_interpolation_char((unsigned char *) in->rect, outI, in->x, in->y, 4, u, v);
}
}
/* function assumes out to be zero'ed, only does RGBA */
/* BILINEAR INTERPOLATION */
/* Note about wrapping, the u/v still needs to be within the image bounds,
* just the interpolation is wrapped.
* This the same as bilinear_interpolation_color except it wraps rather than using empty and emptyI */
void bilinear_interpolation_color_wrap(struct ImBuf *in, unsigned char outI[4], float outF[4], float u, float v)
{
float *row1, *row2, *row3, *row4, a, b;
unsigned char *row1I, *row2I, *row3I, *row4I;
float a_b, ma_b, a_mb, ma_mb;
int y1, y2, x1, x2;
/* ImBuf in must have a valid rect or rect_float, assume this is already checked */
2012-05-13 22:05:51 +00:00
x1 = (int)floor(u);
x2 = (int)ceil(u);
y1 = (int)floor(v);
y2 = (int)ceil(v);
2012-07-07 22:51:57 +00:00
/* sample area entirely outside image? */
if (x2 < 0 || x1 > in->x - 1 || y2 < 0 || y1 > in->y - 1) {
return;
}
2012-07-07 22:51:57 +00:00
/* wrap interpolation pixels - main difference from bilinear_interpolation_color */
2012-05-13 22:05:51 +00:00
if (x1 < 0) x1 = in->x + x1;
if (y1 < 0) y1 = in->y + y1;
2012-07-07 22:51:57 +00:00
2012-05-13 22:05:51 +00:00
if (x2 >= in->x) x2 = x2 - in->x;
if (y2 >= in->y) y2 = y2 - in->y;
if (outF) {
2012-07-07 22:51:57 +00:00
/* sample including outside of edges of image */
row1 = in->rect_float + in->x * y1 * 4 + 4 * x1;
row2 = in->rect_float + in->x * y2 * 4 + 4 * x1;
row3 = in->rect_float + in->x * y1 * 4 + 4 * x2;
row4 = in->rect_float + in->x * y2 * 4 + 4 * x2;
2012-05-13 22:05:51 +00:00
a = u - floorf(u);
b = v - floorf(v);
a_b = a * b; ma_b = (1.0f - a) * b; a_mb = a * (1.0f - b); ma_mb = (1.0f - a) * (1.0f - b);
outF[0] = ma_mb * row1[0] + a_mb * row3[0] + ma_b * row2[0] + a_b * row4[0];
outF[1] = ma_mb * row1[1] + a_mb * row3[1] + ma_b * row2[1] + a_b * row4[1];
outF[2] = ma_mb * row1[2] + a_mb * row3[2] + ma_b * row2[2] + a_b * row4[2];
outF[3] = ma_mb * row1[3] + a_mb * row3[3] + ma_b * row2[3] + a_b * row4[3];
}
if (outI) {
2012-07-07 22:51:57 +00:00
/* sample including outside of edges of image */
2012-05-13 22:05:51 +00:00
row1I = (unsigned char *)in->rect + in->x * y1 * 4 + 4 * x1;
row2I = (unsigned char *)in->rect + in->x * y2 * 4 + 4 * x1;
row3I = (unsigned char *)in->rect + in->x * y1 * 4 + 4 * x2;
row4I = (unsigned char *)in->rect + in->x * y2 * 4 + 4 * x2;
a = u - floorf(u);
b = v - floorf(v);
a_b = a * b; ma_b = (1.0f - a) * b; a_mb = a * (1.0f - b); ma_mb = (1.0f - a) * (1.0f - b);
/* need to add 0.5 to avoid rounding down (causes darken with the smear brush)
* tested with white images and this should not wrap back to zero */
2012-05-13 22:05:51 +00:00
outI[0] = (ma_mb * row1I[0] + a_mb * row3I[0] + ma_b * row2I[0] + a_b * row4I[0]) + 0.5f;
outI[1] = (ma_mb * row1I[1] + a_mb * row3I[1] + ma_b * row2I[1] + a_b * row4I[1]) + 0.5f;
outI[2] = (ma_mb * row1I[2] + a_mb * row3I[2] + ma_b * row2I[2] + a_b * row4I[2]) + 0.5f;
outI[3] = (ma_mb * row1I[3] + a_mb * row3I[3] + ma_b * row2I[3] + a_b * row4I[3]) + 0.5f;
}
}
void bilinear_interpolation(ImBuf *in, ImBuf *out, float u, float v, int xout, int yout)
{
unsigned char *outI = NULL;
float *outF = NULL;
if (in == NULL || (in->rect == NULL && in->rect_float == NULL)) {
return;
}
pixel_from_buffer(out, &outI, &outF, xout, yout); /* gcc warns these could be uninitialized, but its ok */
bilinear_interpolation_color(in, outI, outF, u, v);
}
/* function assumes out to be zero'ed, only does RGBA */
/* NEAREST INTERPOLATION */
2012-12-11 14:19:41 +00:00
void nearest_interpolation_color(struct ImBuf *in, unsigned char outI[4], float outF[4], float u, float v)
{
const float *dataF;
unsigned char *dataI;
int y1, x1;
/* ImBuf in must have a valid rect or rect_float, assume this is already checked */
2012-05-13 22:05:51 +00:00
x1 = (int)(u);
y1 = (int)(v);
2012-07-07 22:51:57 +00:00
/* sample area entirely outside image? */
if (x1 < 0 || x1 > in->x - 1 || y1 < 0 || y1 > in->y - 1) {
if (outI)
outI[0] = outI[1] = outI[2] = outI[3] = 0;
if (outF)
outF[0] = outF[1] = outF[2] = outF[3] = 0.0f;
return;
}
2012-07-07 22:51:57 +00:00
/* sample including outside of edges of image */
2012-05-13 22:05:51 +00:00
if (x1 < 0 || y1 < 0) {
if (outI) {
2012-05-13 22:05:51 +00:00
outI[0] = 0;
outI[1] = 0;
outI[2] = 0;
outI[3] = 0;
}
if (outF) {
2012-05-13 22:05:51 +00:00
outF[0] = 0.0f;
outF[1] = 0.0f;
outF[2] = 0.0f;
outF[3] = 0.0f;
}
}
else {
2012-05-13 22:05:51 +00:00
dataI = (unsigned char *)in->rect + in->x * y1 * 4 + 4 * x1;
if (outI) {
2012-05-13 22:05:51 +00:00
outI[0] = dataI[0];
outI[1] = dataI[1];
outI[2] = dataI[2];
outI[3] = dataI[3];
}
2012-05-13 22:05:51 +00:00
dataF = in->rect_float + in->x * y1 * 4 + 4 * x1;
if (outF) {
2012-05-13 22:05:51 +00:00
outF[0] = dataF[0];
outF[1] = dataF[1];
outF[2] = dataF[2];
outF[3] = dataF[3];
}
}
}
2012-12-11 14:19:41 +00:00
void nearest_interpolation(ImBuf *in, ImBuf *out, float x, float y, int xout, int yout)
{
unsigned char *outI = NULL;
float *outF = NULL;
if (in == NULL || (in->rect == NULL && in->rect_float == NULL)) {
return;
}
pixel_from_buffer(out, &outI, &outF, xout, yout); /* gcc warns these could be uninitialized, but its ok */
2012-12-11 14:19:41 +00:00
nearest_interpolation_color(in, outI, outF, x, y);
}
/*********************** Threaded image processing *************************/
static void processor_apply_func(TaskPool *pool, void *taskdata, int UNUSED(threadid))
{
void (*do_thread) (void *) = (void (*) (void *)) BLI_task_pool_userdata(pool);
do_thread(taskdata);
}
void IMB_processor_apply_threaded(int buffer_lines, int handle_size, void *init_customdata,
void (init_handle) (void *handle, int start_line, int tot_line,
void *customdata),
void *(do_thread) (void *))
{
const int lines_per_task = 64;
TaskScheduler *task_scheduler = BLI_task_scheduler_get();
TaskPool *task_pool;
void *handles;
int total_tasks = (buffer_lines + lines_per_task - 1) / lines_per_task;
int i, start_line;
task_pool = BLI_task_pool_create(task_scheduler, do_thread);
handles = MEM_callocN(handle_size * total_tasks, "processor apply threaded handles");
start_line = 0;
for (i = 0; i < total_tasks; i++) {
int lines_per_current_task;
void *handle = ((char *) handles) + handle_size * i;
if (i < total_tasks - 1)
lines_per_current_task = lines_per_task;
else
lines_per_current_task = buffer_lines - start_line;
init_handle(handle, start_line, lines_per_current_task, init_customdata);
BLI_task_pool_push(task_pool, processor_apply_func, handle, false, TASK_PRIORITY_LOW);
start_line += lines_per_task;
}
/* work and wait until tasks are done */
BLI_task_pool_work_and_wait(task_pool);
/* Free memory. */
MEM_freeN(handles);
BLI_task_pool_free(task_pool);
}
/* Alpha-under */
void IMB_alpha_under_color_float(float *rect_float, int x, int y, float backcol[3])
{
int a = x * y;
float *fp = rect_float;
while (a--) {
if (fp[3] == 0.0f) {
copy_v3_v3(fp, backcol);
}
else {
float mul = 1.0f - fp[3];
fp[0] += mul * backcol[0];
fp[1] += mul * backcol[1];
fp[2] += mul * backcol[2];
}
fp[3] = 1.0f;
fp += 4;
}
}
void IMB_alpha_under_color_byte(unsigned char *rect, int x, int y, float backcol[3])
{
int a = x * y;
unsigned char *cp = rect;
while (a--) {
if (cp[3] == 255) {
/* pass */
}
else if (cp[3] == 0) {
cp[0] = backcol[0] * 255;
cp[1] = backcol[1] * 255;
cp[2] = backcol[2] * 255;
}
else {
float alpha = cp[3] / 255.0;
float mul = 1.0f - alpha;
cp[0] = (cp[0] * alpha) + mul * backcol[0];
cp[1] = (cp[1] * alpha) + mul * backcol[1];
cp[2] = (cp[2] * alpha) + mul * backcol[2];
}
cp[3] = 255;
cp += 4;
}
}