mirror of
https://gitlab.gnome.org/GNOME/gimp
synced 2024-10-21 12:02:32 +00:00
5d01581069
2004-11-13 Manish Singh <yosh@gimp.org> Fix a bunch of warnings from Sparse: * app/actions/dockable-commands.c * app/actions/layers-actions.c * app/actions/view-commands.c * app/base/pixel-surround.c * app/config/gimpconfig-utils.c * app/config/gimpscanner.c * app/core/gimpbrushgenerated.c * app/core/gimpcontainer.c * app/core/gimpimage.c * app/dialogs/palette-import-dialog.c * app/file/gimprecentlist.c * app/plug-in/plug-in-params.c * app/text/gimptext-compat.c * app/text/gimptext-parasite.c * app/vectors/gimpbezierstroke.c * app/vectors/gimpstroke.c * app/widgets/gimpcellrendereraccel.c * app/widgets/gimpselectiondata.c * app/xcf/xcf.c * libgimp/gimp.c * libgimpthumb/gimpthumb-utils.c * libgimpthumb/gimpthumbnail.c * modules/cdisplay_proof.c * plug-ins/Lighting/lighting_ui.c * plug-ins/common/csource.c * plug-ins/common/glasstile.c * plug-ins/common/nova.c * plug-ins/common/pcx.c * plug-ins/common/pnm.c * plug-ins/common/randomize.c * plug-ins/common/screenshot.c * plug-ins/common/sel_gauss.c * plug-ins/common/spheredesigner.c * plug-ins/common/wind.c * plug-ins/gfig/gfig-dialog.c * plug-ins/gfig/gfig-dobject.c * plug-ins/gimpressionist/gimpressionist.c * plug-ins/ifscompose/ifscompose.c * plug-ins/print/gimp_main_window.c * plug-ins/print/print.c: Cleanup integer vs. pointer confusion. * app/base/temp-buf.c * app/dialogs/about-dialog.c * plug-ins/common/bumpmap.c * plug-ins/common/jigsaw.c * plug-ins/gfig/gfig-dobject.c: Cosmetic cleanups. * app/config/gimpconfig-deserialize.c * app/config/gimpconfig-path.c * app/config/gimpconfigwriter.c * app/core/gimpgradient.c * app/tools/gimpdrawtool.c * plug-ins/common/nlfilt.c * plug-ins/common/unsharp.c * plug-ins/common/zealouscrop.c: Define inline functions before they are used. * app/core/gimpdrawable-blend.c: PixelRegion definition was changed some time ago, but the initialization here didn't change. Fix it. * app/plug-in/plug-in-rc.c (plug_in_extra_deserialize): No need to assign token twice in a row. * libgimpbase/gimpdatafiles.c (gimp_datafiles_read_directories): No need to initialize file_data, since the code fills out all the fields. * plug-ins/common/CML_explorer.c * plug-ins/common/vpropagate.c: Declare function pointers fully. * plug-ins/common/grid.c (pix_composite): G_INLINE_FUNC isn't needed, we assume we can use the "inline" keyword always. * plug-ins/common/psd_save.c * plug-ins/common/vinvert.c * plug-ins/gfig/gfig-arc.c * plug-ins/gfig/gfig-bezier.c * plug-ins/gfig/gfig-circle.c * plug-ins/gfig/gfig-dialog.c * plug-ins/gfig/gfig-dobject.c * plug-ins/gfig/gfig-ellipse.c * plug-ins/gfig/gfig-line.c * plug-ins/gfig/gfig-poly.c * plug-ins/gfig/gfig-spiral.c * plug-ins/gfig/gfig-star.c * plug-ins/gfig/gfig.c * plug-ins/gimpressionist/orientmap.c * plug-ins/gimpressionist/placement.c * plug-ins/gimpressionist/sizemap.c * plug-ins/imagemap/imap_grid.c * plug-ins/imagemap/imap_main.c * plug-ins/imagemap/imap_preferences.c * plug-ins/imagemap/imap_settings.c * plug-ins/maze/maze.c * plug-ins/sel2path/curve.c * plug-ins/sel2path/fit.c * plug-ins/sel2path/pxl-outline.c * plug-ins/sel2path/spline.c * plug-ins/xjt/xjt.c: Functions with no args should be declared with (void). * plug-ins/common/retinex.c (MSRCR): Initialize max_preview to quiet the compiler.
231 lines
6 KiB
C
231 lines
6 KiB
C
/* spline.c: spline and spline list (represented as arrays) manipulation.
|
|
|
|
Copyright (C) 1992 Free Software Foundation, Inc.
|
|
|
|
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, or (at your option)
|
|
any later version.
|
|
|
|
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, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
|
|
|
|
#include <assert.h>
|
|
|
|
#include <glib.h>
|
|
|
|
#include "global.h"
|
|
#include "bounding-box.h"
|
|
#include "spline.h"
|
|
#include "vector.h"
|
|
|
|
/* Return a new spline structure, initialized with (recognizable)
|
|
garbage. */
|
|
|
|
spline_type
|
|
new_spline (void)
|
|
{
|
|
real_coordinate_type coord = { -100.0, -100.0 };
|
|
spline_type spline;
|
|
|
|
START_POINT (spline)
|
|
= CONTROL1 (spline)
|
|
= CONTROL2 (spline)
|
|
= END_POINT (spline)
|
|
= coord;
|
|
SPLINE_DEGREE (spline) = -1;
|
|
|
|
return spline;
|
|
}
|
|
|
|
|
|
/* Print a spline in human-readable form. */
|
|
|
|
void
|
|
print_spline (FILE *f, spline_type s)
|
|
{
|
|
if (SPLINE_DEGREE (s) == LINEAR)
|
|
fprintf (f, "(%.3f,%.3f)--(%.3f,%.3f).\n",
|
|
START_POINT (s).x, START_POINT (s).y,
|
|
END_POINT (s).x, END_POINT (s).y);
|
|
|
|
else if (SPLINE_DEGREE (s) == CUBIC)
|
|
fprintf (f, "(%.3f,%.3f)..ctrls(%.3f,%.3f)&(%.3f,%.3f)..(%.3f,%.3f).\n",
|
|
START_POINT (s).x, START_POINT (s).y,
|
|
CONTROL1 (s).x, CONTROL1 (s).y,
|
|
CONTROL2 (s).x, CONTROL2 (s).y,
|
|
END_POINT (s).x, END_POINT (s).y);
|
|
|
|
else
|
|
{
|
|
/* FATAL1 ("print_spline: strange degree (%d)", SPLINE_DEGREE (s)); */
|
|
}
|
|
}
|
|
|
|
/* Evaluate the spline S at a given T value. This is an implementation
|
|
of de Casteljau's algorithm. See Schneider's thesis (reference in
|
|
../limn/README), p.37. The variable names are taken from there. */
|
|
|
|
real_coordinate_type
|
|
evaluate_spline (spline_type s, real t)
|
|
{
|
|
spline_type V[4]; /* We need degree+1 splines, but assert degree <= 3. */
|
|
unsigned i, j;
|
|
real one_minus_t = 1.0 - t;
|
|
polynomial_degree degree = SPLINE_DEGREE (s);
|
|
|
|
for (i = 0; i <= degree; i++)
|
|
V[0].v[i] = s.v[i];
|
|
|
|
for (j = 1; j <= degree; j++)
|
|
for (i = 0; i <= degree - j; i++)
|
|
{
|
|
#if defined (__GNUC__)
|
|
real_coordinate_type t1 = Pmult_scalar (V[j - 1].v[i], one_minus_t);
|
|
real_coordinate_type t2 = Pmult_scalar (V[j - 1].v[i + 1], t);
|
|
V[j].v[i] = Padd (t1, t2);
|
|
#else
|
|
/* HB: the above is really nice, but is there any other compiler
|
|
* supporting this ??
|
|
*/
|
|
real_coordinate_type t1;
|
|
real_coordinate_type t2;
|
|
t1.x = V[j - 1].v[i].x * one_minus_t;
|
|
t1.y = V[j - 1].v[i].y * one_minus_t;
|
|
t2.x = V[j - 1].v[i + 1].x * t;
|
|
t2.y = V[j - 1].v[i + 1].y * t;
|
|
V[j].v[i].x = t1.x + t2.x;
|
|
V[j].v[i].y = t1.y + t2.y;
|
|
#endif
|
|
}
|
|
|
|
return V[degree].v[0];
|
|
}
|
|
|
|
|
|
|
|
/* Return a new, empty, spline list. */
|
|
|
|
spline_list_type *
|
|
new_spline_list (void)
|
|
{
|
|
spline_list_type *answer = g_new (spline_list_type, 1);
|
|
|
|
SPLINE_LIST_DATA (*answer) = NULL;
|
|
SPLINE_LIST_LENGTH (*answer) = 0;
|
|
|
|
return answer;
|
|
}
|
|
|
|
|
|
/* Return a new spline list with SPLINE as the first element. */
|
|
|
|
spline_list_type *
|
|
init_spline_list (spline_type spline)
|
|
{
|
|
spline_list_type *answer = g_new (spline_list_type, 1);
|
|
|
|
SPLINE_LIST_DATA (*answer) = g_new (spline_type, 1);
|
|
SPLINE_LIST_ELT (*answer, 0) = spline;
|
|
SPLINE_LIST_LENGTH (*answer) = 1;
|
|
|
|
return answer;
|
|
}
|
|
|
|
|
|
/* Free the storage in a spline list. We don't have to free the
|
|
elements, since they are arrays in automatic storage. And we don't
|
|
want to free the list if it was empty. */
|
|
|
|
void
|
|
free_spline_list (spline_list_type *spline_list)
|
|
{
|
|
if (SPLINE_LIST_DATA (*spline_list) != NULL)
|
|
safe_free ((address *) &(SPLINE_LIST_DATA (*spline_list)));
|
|
}
|
|
|
|
|
|
/* Append the spline S to the list SPLINE_LIST. */
|
|
|
|
void
|
|
append_spline (spline_list_type *l, spline_type s)
|
|
{
|
|
assert (l != NULL);
|
|
|
|
SPLINE_LIST_LENGTH (*l)++;
|
|
SPLINE_LIST_DATA (*l) = g_realloc (SPLINE_LIST_DATA (*l),
|
|
SPLINE_LIST_LENGTH (*l) * sizeof (spline_type));
|
|
LAST_SPLINE_LIST_ELT (*l) = s;
|
|
}
|
|
|
|
|
|
/* Tack the elements in the list S2 onto the end of S1.
|
|
S2 is not changed. */
|
|
|
|
void
|
|
concat_spline_lists (spline_list_type *s1, spline_list_type s2)
|
|
{
|
|
unsigned this_spline;
|
|
unsigned new_length;
|
|
|
|
assert (s1 != NULL);
|
|
|
|
new_length = SPLINE_LIST_LENGTH (*s1) + SPLINE_LIST_LENGTH (s2);
|
|
|
|
SPLINE_LIST_DATA (*s1) = g_realloc(SPLINE_LIST_DATA (*s1),new_length * sizeof(spline_type));
|
|
|
|
for (this_spline = 0; this_spline < SPLINE_LIST_LENGTH (s2); this_spline++)
|
|
SPLINE_LIST_ELT (*s1, SPLINE_LIST_LENGTH (*s1)++)
|
|
= SPLINE_LIST_ELT (s2, this_spline);
|
|
}
|
|
|
|
|
|
/* Return a new, empty, spline list array. */
|
|
|
|
spline_list_array_type
|
|
new_spline_list_array (void)
|
|
{
|
|
spline_list_array_type answer;
|
|
|
|
SPLINE_LIST_ARRAY_DATA (answer) = NULL;
|
|
SPLINE_LIST_ARRAY_LENGTH (answer) = 0;
|
|
|
|
return answer;
|
|
}
|
|
|
|
|
|
/* Free the storage in a spline list array. We don't
|
|
want to free the list if it is empty. */
|
|
|
|
void
|
|
free_spline_list_array (spline_list_array_type *spline_list_array)
|
|
{
|
|
unsigned this_list;
|
|
|
|
for (this_list = 0;
|
|
this_list < SPLINE_LIST_ARRAY_LENGTH (*spline_list_array);
|
|
this_list++)
|
|
free_spline_list (&SPLINE_LIST_ARRAY_ELT (*spline_list_array, this_list));
|
|
|
|
if (SPLINE_LIST_ARRAY_DATA (*spline_list_array) != NULL)
|
|
safe_free ((address *) &(SPLINE_LIST_ARRAY_DATA (*spline_list_array)));
|
|
}
|
|
|
|
|
|
/* Append the spline S to the list SPLINE_LIST_ARRAY. */
|
|
|
|
void
|
|
append_spline_list (spline_list_array_type *l, spline_list_type s)
|
|
{
|
|
SPLINE_LIST_ARRAY_LENGTH (*l)++;
|
|
|
|
SPLINE_LIST_ARRAY_DATA (*l) = g_realloc(SPLINE_LIST_ARRAY_DATA (*l),(SPLINE_LIST_ARRAY_LENGTH (*l))*sizeof(spline_list_type));
|
|
LAST_SPLINE_LIST_ARRAY_ELT (*l) = s;
|
|
}
|