aboutsummaryrefslogtreecommitdiff
path: root/generic/Color.c
blob: c83631d6cb8ac97d0c1e87befa3e999188a85172 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
/*
 * Color.c -- Color management module.
 *
 * Authors		: Patrick Lecoanet.
 * Creation date	: Thu Dec 16 15:41:53 1999
 *
 * $Id$
 */

/*
 *  Copyright (c) 1999 CENA, Patrick Lecoanet --
 *
 * This code is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Library General Public
 * License as published by the Free Software Foundation; either
 * version 2 of the License, or (at your option) any later version.
 *
 * 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
 * Library General Public License for more details.
 *
 * You should have received a copy of the GNU Library General Public
 * License along with this code; if not, write to the Free
 * Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 *
 */

/*
 * Most of this file is derived from Tk color code and thus
 * also copyrighted:
 *
 * Copyright (c) 1991-1994 The Regents of the University of California.
 * Copyright (c) 1994-1995 Sun Microsystems, Inc.
 *
 */


#include <string.h>
#include <stdlib.h>

#include "Types.h"
#include "Image.h"
#include "Color.h"
#include "Geo.h"


/*
 * Maximum size of a color name including the \0.
 */
#define COLOR_NAME_SIZE 32

/*
 * Maximum intensity for a color.
 */
#define MAX_INTENSITY 65535

/*
 * Hash table to map from a gradient's values (color, etc.) to a
 * gradient structure for those values.
 */
static Tcl_HashTable gradient_table;

static int initialized = 0;	/* 0 means static structures haven't been
				 * initialized yet. */


/*
 *----------------------------------------------------------------------
 *
 * ColorInit --
 *
 *	Initialize the structure used for color management.
 *
 * Results:
 *	None.
 *
 * Side effects:
 *	Read the code.
 *
 *----------------------------------------------------------------------
 */
static void
ColorInit()
{
  initialized = 1;
  Tcl_InitHashTable(&gradient_table, TCL_STRING_KEYS);
}


/*
 *----------------------------------------------------------------------
 *
 * ZnGetGradientColor --
 *
 *----------------------------------------------------------------------
 */
XColor *
ZnGetGradientColor(ZnGradient	*grad,
		   ZnReal	position,
		   unsigned short *alpha)
{
  int			index, min, max;
  XColor		*shade=NULL;
  
  if ((grad->num_colors == 1) || (position <= 0.0)) {
    if (alpha) {
      *alpha = grad->colors[0].alpha;
    }
    return grad->colors[0].rgb;
  }
  if (position >= 100.0) {
    if (alpha) {
      *alpha = grad->colors[grad->num_colors-1].alpha;
    }
    shade = grad->colors[grad->num_colors-1].rgb;
  }
  else {
    min = 0;
    max = grad->num_colors-1;
    index = (max + min) / 2;
    while (max - min != 1) {
      /*printf("color index %d, min: %d, max: %d\n", index, min, max);*/
      if (grad->colors[index].position < position) {
	min = index;
      }
      else {
	max = index;
      }
      index = (max + min) / 2;
    }
    shade = grad->colors[index].rgb;
    if (alpha) {
      *alpha = grad->colors[index].alpha;
    }
  }

  return shade;
}


/*
 *--------------------------------------------------------------
 *
 * ZnGradientFlat --
 *
 *	Returns true if the gradient is defined by a single
 *	color.
 *
 *--------------------------------------------------------------
 */
ZnBool
ZnGradientFlat(ZnGradient	*grad)
{
  return (grad->num_colors == 1);
}


/*
 *--------------------------------------------------------------
 *
 * ZnGetReliefGradient --
 *
 *	Create a data structure containing a range of colors
 *	used to display a 3D border. Name contains the base
 *	color for the border. This is a slight variation on
 *	the syntax of a gradient that make life easier in this
 *	simple case.
 *
 * Results:
 *	The return value is a token for a data structure
 *	describing a gradient.  This token may be passed
 *	to the drawing routines.
 *	If an error prevented the gradient from being created
 *	then NULL is returned and an error message will be
 *	left in interp.
 *
 * Side effects:
 *	Data structures, etc. are allocated.
 *	It is the caller's responsibility to eventually call
 *	ZnFreeGradient to release the resources.
 *
 *--------------------------------------------------------------
 */
ZnGradient *
ZnGetReliefGradient(Tcl_Interp	*interp,
		    Tk_Window	tkwin,
		    Tk_Uid	name,
		    unsigned short alpha)
{
  XColor *base, light_color, dark_color, color;
  char	 color_name[COLOR_NAME_SIZE];
  char	 buffer[COLOR_NAME_SIZE*(3+2*ZN_RELIEF_STEPS)];
  int	 j, tmp1, tmp2;
  int	 red_range, green_range, blue_range;
  
  base = Tk_GetColor(interp, tkwin, name);
  /*
   * Compute the border gradient.
   *
   * Always consider that we are dealing with a color display with
   * enough colors available. If the colormap is full (stressed)
   * then just pray, the susbstitution algorithm may return something
   * adequate ;-).
   *
   * The extremum colors get computed using whichever formula results
   * in the greatest change in color:
   * 1. Lighter color is half-way to white, darker color is half
   *    way to dark.
   * 2. Lighter color is 40% brighter than base, darker color
   *    is 40% darker than base.
   * The first approach works better for unsaturated colors, the
   * second for saturated ones.
   *
   * NOTE: Colors are computed with integers not color shorts which
   * may lead to overflow errors.
   */
  tmp1 = (30 * (int) base->red)/100;
  tmp2 = ((int) base->red)/2;
  dark_color.red = MIN(tmp1, tmp2);
  tmp1 = (30 * (int) base->green)/100;
  tmp2 = ((int) base->green)/2;
  dark_color.green = MIN(tmp1, tmp2);
  tmp1 = (30 * (int) base->blue)/100;
  tmp2 = ((int) base->blue)/2;
  dark_color.blue = MIN(tmp1, tmp2);
  
  tmp1 = MAX_INTENSITY;/*(170 * (int) base->red)/10;*/
  if (tmp1 > MAX_INTENSITY) {
    tmp1 = MAX_INTENSITY;
  }
  tmp2 = (MAX_INTENSITY + (int) base->red)/2;
  light_color.red = MAX(tmp1, tmp2);
  tmp1 = MAX_INTENSITY;/*(170 * (int) base->green)/10;*/
  if (tmp1 > MAX_INTENSITY) {
    tmp1 = MAX_INTENSITY;
  }
  tmp2 = (MAX_INTENSITY + (int) base->green)/2;
  light_color.green = MAX(tmp1, tmp2);
  tmp1 = MAX_INTENSITY;/*(170 * (int) base->blue)/10;*/
  if (tmp1 > MAX_INTENSITY) {
    tmp1 = MAX_INTENSITY;
  }
  tmp2 = (MAX_INTENSITY + (int) base->blue)/2;
  light_color.blue = MAX(tmp1, tmp2);

  buffer[0] = 0;
  sprintf(color_name, "#%02x%02x%02x;%d|",
 	  dark_color.red/256, dark_color.green/256, dark_color.blue/256, alpha);
  red_range = (int) base->red - (int) dark_color.red;
  green_range = (int) base->green - (int) dark_color.green;
  blue_range = (int) base->blue - (int) dark_color.blue;
  strcat(buffer, color_name);
  for (j = 1; j < ZN_RELIEF_STEPS; j++) {
    color.red =(int) dark_color.red +  red_range * j/ZN_RELIEF_STEPS;
    color.green = (int) dark_color.green + green_range * j/ZN_RELIEF_STEPS;
    color.blue = (int) dark_color.blue + blue_range * j/ZN_RELIEF_STEPS;
    sprintf(color_name, "#%02x%02x%02x;%d %d|",
	    color.red/256, color.green/256, color.blue/256, alpha, 50/ZN_RELIEF_STEPS*j);
    strcat(buffer, color_name);
  }
  sprintf(color_name, "#%02x%02x%02x;%d 50|",
	  base->red/256, base->green/256, base->blue/256, alpha);
  strcat(buffer, color_name);
  red_range = (int) light_color.red - (int) base->red;
  green_range = (int) light_color.green - (int) base->green;
  blue_range = (int) light_color.blue - (int) base->blue;
  for (j = 1; j < ZN_RELIEF_STEPS; j++) {
    color.red = (int) base->red +  red_range * j/ZN_RELIEF_STEPS;
    color.green = (int) base->green + green_range * j/ZN_RELIEF_STEPS;
    color.blue = (int) base->blue + blue_range * j/ZN_RELIEF_STEPS;
    sprintf(color_name, "#%02x%02x%02x;%d %d|",
	    color.red/256, color.green/256, color.blue/256, alpha, 50+50/ZN_RELIEF_STEPS*j);
    strcat(buffer, color_name);
  }
  sprintf(color_name, "#%02x%02x%02x;%d",
	  light_color.red/256, light_color.green/256, light_color.blue/256, alpha);
  strcat(buffer, color_name);

  /*printf("gradient relief: %s \n", buffer);*/
  return ZnGetGradient(interp, tkwin, buffer);
}


/*
 *--------------------------------------------------------------
 *
 * ZnNameGradient
 * ZnDeleteGradientName --
 *
 *	Save a gradient under a name or suppress the gradient
 *	name binding. The save function returns false if the
 *	name is already in use.
 *
 *--------------------------------------------------------------
 */
ZnBool
ZnNameGradient(Tcl_Interp	*interp,
	       Tk_Window	tkwin,
	       char		*grad_descr,
	       char		*name)
{
  Tcl_HashEntry	*hash;
  int		new;
  ZnGradient	*grad;
  XColor	color;

  grad = ZnGetGradient(interp, tkwin, grad_descr);
  if (!grad) {
    Tcl_AppendResult(interp, "gradient specification \"", grad_descr,
		     "\", is invalid", NULL);
    return False;
  }
  /*
   * First try to find if the name interfere with a color name,
   * this must be avoided. Gradients may be described by a single
   * color name and gradient descriptions / names share the same
   * name space.
   */
  if (XParseColor(Tk_Display(tkwin), Tk_Colormap(tkwin), name, &color)) {
    Tcl_AppendResult(interp, "gradient name \"", name,
		     "\", is a color name", NULL);
    return False;
  }
  hash = Tcl_CreateHashEntry(&gradient_table, Tk_GetUid(name), &new);
  if (!new) {
    Tcl_AppendResult(interp, "gradient name \"", name,
		     "\", is already in use", NULL);
    return False;
  }
  else {
    Tcl_SetHashValue(hash, grad);
  }
  
  return True;
}

ZnBool
ZnGradientNameExists(char	*name)
{
  if (!initialized) {
    return False;
  }
  return Tcl_FindHashEntry(&gradient_table, Tk_GetUid(name)) != NULL;
}

void
ZnDeleteGradientName(char	*name)
{
  Tcl_HashEntry	*hash;

  if (!initialized) {
    return;
  }
  
  hash = Tcl_FindHashEntry(&gradient_table, Tk_GetUid(name));
  if (hash) {
    Tcl_DeleteHashEntry(hash);
    ZnFreeGradient((ZnGradient *) Tcl_GetHashValue(hash));
  }
}

/*
 *--------------------------------------------------------------
 *
 * ZnGetGradient --
 *
 *	Create a data structure containing a range of colors
 *	used to display a gradient. 
 *
 *	The gradient should have the following syntax:
 *
 *	gradient := [graddesc|]color[|....|color]
 *	  where the | are real characters not meta-syntax.
 *
 *	graddesc := =type args
 *	  where type := axial | radial | path
 *
 *	  If type = axial
 *		args := angle (0..360) | xs ys xe ye (reals)
 *
 *        The first form define the axial gradiant by its slope.
 *        With this syntax the gradient fits the whole shape.
 *	  This is a backward compatible syntax.
 *	  The second form specifies a vector which will be used
 *	  to draw the gradient. The vector defines both the angle
 *	  and the gradient area. Parts of the shape that lie before
 *	  the vector origin are filled with the first color and
 *	  parts that lie after the vector end are filled with the
 *	  last color.
 *
 *	  If type = radial or path
 *		args := xs ys [xe ye] (reals)
 *
 *	  The vector specified by the 4 coordinates defines the
 *	  gradient area.  Parts of the shape that lie before
 *	  the vector origin are filled with the first color and
 *	  parts that lie after the vector end are filled with the
 *	  last color. The vector end may be omitted, in such case
 *	  the gradient fits exactly the whole shape to be filled,
 *	  this is backward compatible with older gradients.
 *	  
 *	color := colorvalue | colorvalue position |
 *		 colorvalue control position
 *	  where position and control are in (0..100)
 *
 *	colorvalue := (colorname | #rgb | cievalue)[;alpha]
 *	  where alpha is in (0..100)
 *
 * Results:
 *	The return value is a token for a data structure
 *	describing a gradient. This token may be passed
 *	to the drawing routines.
 *	If an error prevented the gradient from being created
 *	then NULL is returned and an error message will be
 *	left in interp.
 *
 * Side effects:
 *	Data structures, etc. are allocated.
 *	It is the caller's responsibility to eventually call
 *	ZnFreeGradient to release the resources.
 *
 *--------------------------------------------------------------
 */
ZnGradient *
ZnGetGradientByValue(ZnGradient	*grad)
{
  grad->ref_count++;
  return grad;
}


static int
ParseRealList(const char *str,
	      const char *stop,
	      ZnReal	 *list,
	      int	 max)
{
  int	 num;
  char	 *end;

  num = 0;
  while ((num < max) && (str != stop)) {
    list[num] = strtod(str, &end);
    if (end == str) {
      /* A syntax error occured, return a 0 count
       * as a hint for the caller.
       */
      return 0;
    }
    num++;
    str = end+strspn(end, " \t");
  }
  return num;
}

ZnGradient *
ZnGetGradient(Tcl_Interp	*interp,
	      Tk_Window		tkwin,
	      Tk_Uid		desc)
{
  #define SEGMENT_SIZE 64
  Tcl_HashEntry	*hash;
  ZnGradient	*grad;
  unsigned int	i, j, nspace, num_colors;
  unsigned int	size, num_coords;
  char		type;
  char const	*scan_ptr, *next_ptr, *str_ptr;
  int		angle, position, control;
  ZnReal	coords[4];
  char		*color_ptr, *end, segment[SEGMENT_SIZE];
  ZnGradientColor *first, *last;
  XColor	color;
  int		new, red_range, green_range, blue_range;

  /*  printf("ZnGetGradient : %s\n", desc);*/
  if (!desc || !*desc) {
    return NULL;
  }
  if (!initialized) {
    ColorInit();
  }
  
  /*
   * First, check to see if there's already a gradient that will work
   * for this request.
   */  
  desc = Tk_GetUid(desc);

  hash = Tcl_CreateHashEntry(&gradient_table, desc, &new);
  if (!new) {
    grad = (ZnGradient *) Tcl_GetHashValue(hash);
    grad->ref_count++;
  }
  else {
    /*
     * No satisfactory gradient exists yet.  Initialize a new one.
     */
    type = ZN_AXIAL_GRADIENT;
    angle = 0;
    /*
     * Skip the trailing spaces.
     */
    while (*desc == ' ') {
      desc++;
    }
    /*
     * Count the sections in the description. It should give
     * the number of colors plus may be the gradient description.
     */
    scan_ptr = desc;
    /*
     * If the first section is the gradient description, start color
     * counts up from zero.
     */
    num_colors = (*scan_ptr == '=') ? 0 : 1;
    while ((scan_ptr = strchr(scan_ptr, '|'))) {
      num_colors++;
      scan_ptr++;
    }
    if (num_colors == 0) {
      Tcl_AppendResult(interp, "gradient should have at least one color \"",
		       desc, "\",", NULL);
    grad_err1:
      Tcl_DeleteHashEntry(hash);
      /*printf("ZnGetGradient error : %s\n", desc);*/
      return NULL;
    }
    /*
     * Then look at the gradient type.
     */
    scan_ptr = desc;
    /*
     * next_ptr can't be NULL in the following code,
     * we checked that at least one color was specified
     * after the gradient description.
     */
    next_ptr = strchr(scan_ptr, '|');
    if (*scan_ptr == '=') {
      scan_ptr++;
      if ((*scan_ptr == 'a') && (strncmp(scan_ptr, "axial", 5) == 0)) {
	scan_ptr += 5;
	if (ParseRealList(scan_ptr, next_ptr, coords, 1) != 1) {
	grad_err3:
	  Tcl_AppendResult(interp, "invalid gradient parameter \"",
			   desc, "\",", NULL);
	  goto grad_err1;
	}
	angle = (int) coords[0];
      }
      else if (((*scan_ptr == 'r') && (strncmp(scan_ptr, "radial", 6) == 0)) ||
	       ((*scan_ptr == 'p') && (strncmp(scan_ptr, "path", 4) == 0))) {
	if (*scan_ptr == 'r') {
	  type = ZN_RADIAL_GRADIENT;
	  scan_ptr += 6;
	}
	else {
	  type = ZN_PATH_GRADIENT;
	  scan_ptr += 4;
	}
	num_coords = ParseRealList(scan_ptr, next_ptr, coords, 4);
	if ((num_coords != 2) && (num_coords != 4)) {
	  goto grad_err3;
	}
      }
      else {
	Tcl_AppendResult(interp, "invalid gradient type \"",
			 desc, "\",", NULL);
	goto grad_err1;
      }
      scan_ptr = next_ptr + 1;
      next_ptr = strchr(scan_ptr, '|');
    }
    /*
     * Create the gradient structure.
     */
    grad = (ZnGradient *) ZnMalloc(sizeof(ZnGradient) +
				   sizeof(ZnGradientColor)*(num_colors-1));
    grad->ref_count = 1;
    grad->simple = True;
    grad->num_colors = num_colors;
    grad->type = type;
    if (type == ZN_AXIAL_GRADIENT) {
      if (num_coords == 4) {
	grad->simple = False;
	grad->g.p.x = coords[0];
	grad->g.p.y = coords[1];
	grad->e.x = coords[2];
	grad->e.y = coords[3];
      }
      else {
	grad->g.angle = angle;
      }
    }
    else {
      grad->g.p.x = coords[0];
      grad->g.p.y = coords[1];
      if (num_coords == 4) {
	grad->simple = False;
	grad->e.x = coords[2];
	grad->e.y = coords[3];
      }
    }
    grad->hash = hash;
    Tcl_SetHashValue(hash, grad);

    for (i = 0; i < num_colors; i++) {
      grad->colors[i].alpha = 100;
      /*
       * Try to parse the color name.
       */
      nspace = strspn(scan_ptr, " \t");	
      scan_ptr += nspace;
      str_ptr = strpbrk(scan_ptr, " \t|");
      if (str_ptr) {
	size = str_ptr - scan_ptr;
      }
      else {
	size = strlen(scan_ptr);
      }
      if (size > (SEGMENT_SIZE-1)) {
	Tcl_AppendResult(interp, "color name too long in gradient \"",
			 desc, "\",", NULL);
      grad_err2:
	for (j = 0; j < i; j++) {
	  Tk_FreeColor(grad->colors[j].rgb);
	}
	ZnFree(grad);
	goto grad_err1;
      }
      strncpy(segment, scan_ptr, size);
      segment[size] = 0;
      scan_ptr += size;
      /*
       * Try to parse the color position.
       */
      grad->colors[i].position = 0;
      grad->colors[i].control = 50;
      position = strtol(scan_ptr, &end, 10);
      if (end != scan_ptr) {
	grad->colors[i].position = position;
	scan_ptr = end;
	/*
	 * Try to parse the control point
	 */
	control = strtol(scan_ptr, &end, 10);
	if (end != scan_ptr) {
	  grad->colors[i].control = control;
	  scan_ptr = end;
	}
      }
      nspace = strspn(scan_ptr, " \t");
      if ((scan_ptr[nspace] != 0) && (scan_ptr+nspace != next_ptr)) {
	Tcl_AppendResult(interp, "incorrect color description in gradient \"",
			 desc, "\",", NULL);
	goto grad_err2;
      }

      color_ptr = strchr(segment, ';');
      if (color_ptr) {
	*color_ptr = 0;
      }
      grad->colors[i].rgb = Tk_GetColor(interp, tkwin, Tk_GetUid(segment));
      if (grad->colors[i].rgb == NULL) {
	Tcl_AppendResult(interp, "incorrect color value in gradient \"",
			 desc, "\",", NULL);
	goto grad_err2;
      }
      if (color_ptr) {
	color_ptr++;
	grad->colors[i].alpha = atoi(color_ptr);
      }
      if (i == 0) {
	grad->colors[i].position = 0;
      }
      else if (i == num_colors - 1) {
	grad->colors[i].position = 100;
      }
      if ((i > 0) &&
	  ((grad->colors[i].position > 100) ||
	   (grad->colors[i].position < grad->colors[i-1].position))) {
	Tcl_AppendResult(interp, "incorrect color position in gradient \"",
			 desc, "\",", NULL);
	goto grad_err2;
      }
      if (grad->colors[i].control > 100) {
	grad->colors[i].control = 100;
      }
      if (grad->colors[i].alpha > 100) {
	grad->colors[i].alpha = 100;
      }
      if (next_ptr) {
	scan_ptr = next_ptr + 1;
	next_ptr = strchr(scan_ptr, '|');
      }
    }
  }

  /*
   * Compute the mid alpha and mid color values. These will be
   * used by the gradient rendering primitives when a control
   * is not at mid range. The last color has no mid_* values.
   */
  for (i = 0; i < grad->num_colors-1; i++) {
    first = &grad->colors[i];
    last = &grad->colors[i+1];
    red_range = (int) last->rgb->red - (int) first->rgb->red;
    green_range = (int) last->rgb->green - (int) first->rgb->green;
    blue_range = (int) last->rgb->blue - (int) first->rgb->blue;
    color.red =(int) first->rgb->red +  red_range/2;
    color.green = (int) first->rgb->green + green_range/2;
    color.blue = (int) first->rgb->blue + blue_range/2;
    first->mid_rgb = Tk_GetColorByValue(tkwin, &color);
    first->mid_alpha = first->alpha + (last->alpha-first->alpha)/2;
  }
  grad->colors[grad->num_colors-1].mid_rgb = NULL;

  /* printf("ZnGetGradient end : %s\n", desc);*/
  return grad;
}


/*
 *--------------------------------------------------------------
 *
 * ZnNameOfGradient --
 *
 *	Given a gradient, return a textual string identifying
 *	the gradient.
 *
 * Results:
 *	The return value is the string that was used to create
 *	the gradient.
 *
 * Side effects:
 *	None.
 *
 *--------------------------------------------------------------
 */
char *
ZnNameOfGradient(ZnGradient	*grad)
{
  return (char *) grad->hash->key.words;
}


/*
 *--------------------------------------------------------------
 *
 * ZnFreeGradient --
 *
 *	This procedure is called when a gradient is no longer
 *	needed.  It frees the resources associated with the
 *	gradient.  After this call, the caller should never
 *	again use the gradient.
 *
 * Results:
 *	None.
 *
 * Side effects:
 *	Resources are freed.
 *
 *--------------------------------------------------------------
 */
void
ZnFreeGradient(ZnGradient	*grad)
{
  unsigned int	i;
  
  grad->ref_count--;
  if (grad->ref_count == 0) {
    Tcl_DeleteHashEntry(grad->hash);
    for (i = 0; i < grad->num_colors; i++) {
      Tk_FreeColor(grad->colors[i].rgb);
      if (grad->colors[i].mid_rgb) {
	Tk_FreeColor(grad->colors[i].mid_rgb);
      }
    }
    ZnFree(grad);
  }
}


/*
 *--------------------------------------------------------------
 *
 * ZnComposeAlpha --
 *
 *	This procedure takes two alpha values in percent and
 *	returns the composite value between 0 and 65535.
 *
 *--------------------------------------------------------------
 */
int
ZnComposeAlpha(unsigned short	alpha1,
	       unsigned short	alpha2)
{
  return (alpha1*alpha2/100)*65535/100;
}