diff options
Diffstat (limited to 'gs/src/gxcolor2.h')
| -rw-r--r-- | gs/src/gxcolor2.h | 72 |
1 files changed, 72 insertions, 0 deletions
diff --git a/gs/src/gxcolor2.h b/gs/src/gxcolor2.h new file mode 100644 index 000000000..7c49b71e3 --- /dev/null +++ b/gs/src/gxcolor2.h @@ -0,0 +1,72 @@ +/* Copyright (C) 1993, 1995, 1997 Aladdin Enterprises. All rights reserved. + + This file is part of Aladdin Ghostscript. + + Aladdin Ghostscript is distributed with NO WARRANTY OF ANY KIND. No author + or distributor accepts any responsibility for the consequences of using it, + or for whether it serves any particular purpose or works at all, unless he + or she says so in writing. Refer to the Aladdin Ghostscript Free Public + License (the "License") for full details. + + Every copy of Aladdin Ghostscript must include a copy of the License, + normally in a plain ASCII text file named PUBLIC. The License grants you + the right to copy, modify and redistribute Aladdin Ghostscript, but only + under certain conditions described in the License. Among other things, the + License requires that the copyright notice and this notice be preserved on + all copies. +*/ + +/* gxcolor2.h */ +/* Internal definitions for Level 2 color routines */ +/* Requires gsstruct.h, gxfixed.h */ +#include "gscolor2.h" +#include "gsrefct.h" +#include "gxbitmap.h" + +/* Cache for Indexed color with procedure, or Separation color. */ +struct gs_indexed_map_s { + rc_header rc; + union { + int (*lookup_index)(P3(const gs_indexed_params *, int, float *)); + int (*tint_transform)(P3(const gs_separation_params *, floatp, float *)); + } proc; + uint num_values; /* base_space->type->num_components * (hival + 1) */ + float *values; /* actually [num_values] */ +}; +extern_st(st_indexed_map); +#define public_st_indexed_map() /* in gscolor2.c */\ + gs_public_st_ptrs1(st_indexed_map, gs_indexed_map, "gs_indexed_map",\ + indexed_map_enum_ptrs, indexed_map_reloc_ptrs, values) + +/* + * We define 'tiling space' as the space in which (0,0) is the origin of + * the key pattern cell and in which coordinate (i,j) is displaced by + * i * XStep + j * YStep from the origin. In this space, it is easy to + * compute a (rectangular) set of tile copies that cover a (rectangular) + * region to be tiled. Note that since all we care about is that the + * stepping matrix (the transformation from tiling space to device space) + * yield the right set of coordinates for integral X and Y values, we can + * adjust it to make the tiling computation easier; in particular, we can + * arrange it so that all 4 transformation factors are non-negative. + */ + +/* Implementation of Pattern instances. */ +struct gs_pattern_instance_s { + rc_header rc; + gs_client_pattern template; + /* Following are created by makepattern */ + gs_state *saved; + gs_matrix step_matrix; /* tiling space -> device space */ + gs_rect bbox; /* bbox of tile in tiling space */ + bool is_simple; /* true if xstep/ystep = tile size */ + gs_int_point size; /* in device coordinates */ + gx_bitmap_id id; /* key for cached bitmap */ + /* (= id of mask) */ +}; +/* The following is only public for a type test in the interpreter */ +/* (.buildpattern operator). */ +extern_st(st_pattern_instance); +#define public_st_pattern_instance() /* in gspcolor.c */\ + gs_public_st_ptrs_add1(st_pattern_instance, gs_pattern_instance,\ + "pattern instance", pattern_instance_enum_ptrs,\ + pattern_instance_reloc_ptrs, st_client_pattern, template, saved) |