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
|
/*
* psstat.c
*
* Recording information about the PostScript process
* Copyright (c) 1988, 89, 90, 91, 92, 93 Miguel Santana
* Copyright (c) 1995, 96, 97, 98 Akim Demaille, Miguel Santana
*/
/*
* This file is part of a2ps.
*
* 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 3, 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; see the file COPYING. If not, write to
* the Free Software Foundation, 59 Temple Place - Suite 330,
* Boston, MA 02111-1307, USA.
*/
/*
* $Id: psstat.c,v 1.1.1.1.2.1 2007/12/29 01:58:22 mhatta Exp $
*/
#include "a2ps.h"
#include "psstat.h"
#include "jobs.h"
#include "routines.h"
#include "dsc.h"
/************************************************************************
* Monovalued hash tables *
************************************************************************/
/* Definition of the hash'd structure used for page device definitions */
typedef struct dict_entry
{
char * key;
char * value;
int def;
} dict_entry;
/*
* Used with the page device(-D), and status dict (-S) definitions
*/
static unsigned long
key_hash_1 (void const *key)
{
return_STRING_HASH_1 (((const dict_entry *)key)->key);
}
static unsigned long
key_hash_2 (void const *key)
{
return_STRING_HASH_2 (((const dict_entry *)key)->key);
}
static int
key_hash_cmp (void const *x, void const *y)
{
return_STRING_COMPARE (((const dict_entry *)x)->key,
((const dict_entry *)y)->key);
}
static struct hash_table_s *
new_dict_entry_table (void)
{
static struct hash_table_s * res;
res = XMALLOC (hash_table, 1);
hash_init (res, 8,
key_hash_1, key_hash_2, key_hash_cmp);
return res;
}
static void
dict_entry_add (struct hash_table_s * table,
const char * key, const char * value, int def)
{
NEW (dict_entry, item);
item->key = xstrdup (key);
item->value = xstrdup (value);
item->def = def;
hash_insert (table, item);
}
static dict_entry *
dict_entry_get (struct hash_table_s * table, const char * key)
{
struct dict_entry token;
token.key = (char *) key;
return (struct dict_entry *) hash_find_item (table, &token);
}
static void
free_dict_entry (struct dict_entry * entry)
{
free (entry->key);
free (entry->value);
free (entry);
}
static void
dict_entry_remove (struct hash_table_s * table, const char * key)
{
struct dict_entry * item;
item = dict_entry_get (table, key);
if (item) {
hash_delete (table, item);
free_dict_entry (item);
}
}
static void
free_dict_entry_table (struct hash_table_s * table)
{
hash_free (table, (hash_map_func_t) free_dict_entry);
free (table);
}
/************************************************************************/
/* Dealing with the structure (creation etc.) that will be kept */
/* in JOB */
/************************************************************************/
/*
* Private information for the PS generation engine
*/
struct ps_status *
new_ps_status (void)
{
struct ps_status * res = XMALLOC (struct ps_status, 1);
/* The very first line of a PS file */
res->magic_number = xustrdup ("%!PS-Adobe-3.0");
/* By default, the list of page number intervals */
res->page_label_format = xustrdup ("#!s|$p-|, |");
/* At the beginning, no encoding dict is opened */
res->opened_encoding = NULL;
/* After delegating the order is no longer respected */
res->page_are_ordered = true;
/* for fonts etc. */
res->needed_resources = multivalued_table_new ();
/* Things to put in the preamble */
res->supplied_resources = multivalued_table_new ();
/* for setpagedevice */
res->pagedevice = new_dict_entry_table ();
/* PS statusdict definitions */
res->statusdict = new_dict_entry_table ();
/* The setups read in the files */
res->setup = output_new ("setup");
return res;
}
void
ps_status_free (struct ps_status * status)
{
free (status->magic_number);
free (status->page_label_format);
multivalued_table_free (status->needed_resources);
multivalued_table_free (status->supplied_resources);
free_dict_entry_table (status->pagedevice);
free_dict_entry_table (status->statusdict);
output_free (status->setup);
free (status);
}
/*
* Called for each new input session.
*/
void
initialize_ps_status (struct ps_status * status)
{
/* This one will be malloc'd for each (physical) page.
* Hence, do not risk to touch it, unless you want to SEGV */
/* status->page_label = NULL;*/
/* Reinitialize the ps status */
status->start_page = true;
status->start_line = true;
status->line_continued = false;
status->is_in_cut = false;
status->face = Plain;
status->face_declared = false; /* One could think in using
* an extra value in ->face
* (eg No_face), but it gets
* painful with switches of
* encodings... */
status->nonprinting_chars = 0;
status->chars = 0;
status->line = 0;
status->column = 0;
status->wx = 0;
}
/************************************************************************/
/* Dealing with the various components of this structure */
/************************************************************************/
/*
* Used with the page device definitions (-D)
*/
static void
dict_entry_print (void const * item, FILE * stream)
{
const dict_entry * tok = (const dict_entry *) item;
if (tok->def)
fprintf (stream, "%s::%s ", tok->key, tok->value);
else
fprintf (stream, "%s:%s ", tok->key, tok->value);
}
/*
* Listing the content of a dict entry hash table
*/
static void
dict_entry_table_dump (struct hash_table_s * table, FILE * stream)
{
int i;
struct dict_entry ** items;
items = (struct dict_entry **) hash_dump (table, NULL, NULL);
for (i = 0 ; items [i] ; i++)
dict_entry_print (items [i], stream);
putc ('\n', stream);
free (items);
}
/* Page device definitions */
void
output_pagedevice (a2ps_job * job)
{
dict_entry ** entries = NULL;
dict_entry ** entry;
entries = (dict_entry **) hash_dump (job->status->pagedevice, NULL, NULL);
if (!*entries)
return;
/* Protect calls to setpagedevice through a stopped environment.
* (Cf. PDF spec, by Adobe) */
output (job->divertion, "\
%%%% Pagedevice definitions:\n\
countdictstack\n\
%% Push our own mark, since there can be several PS marks pushed depending\n\
%% where the failure really occured.\n\
/a2ps_mark\n\
{\n");
/* Each Pagedevice */
for (entry = entries ; *entry ; entry++)
output (job->divertion, "\
%%%%BeginFeature: *%s %c%s\n\
(<<) cvx exec /%s (%s) cvx exec (>>) cvx exec setpagedevice\n\
%%%%EndFeature\n",
(*entry)->key, toupper ((*entry)->value[0]),
(*entry)->value + 1,
(*entry)->key, (*entry)->value);
/* Close the stopped env, and clear the stack */
output (job->divertion, "\
} stopped\n\
%% My cleartomark\n\
{ /a2ps_mark eq { exit } if } loop\n\
countdictstack exch sub dup 0 gt\n\
{\n\
{ end } repeat\n\
}{\n\
pop\n\
} ifelse\n");
free (entries);
}
/* FIXME: Find some better scheme. But I don't want to do that before
4.11. This is the same routine as above, but which fputs instead of
output.
This routine will only be call when only a single delegated job
is output, therefore a2ps' prologue will not be output, therefore
there is a very high chance (contrary to the previous item) that
the psutils have neutralized the setpagedevice operator. Here
we really want to use it, hence the `systemdict /setpagedevice get exec'
sequence instead of just `setpagdevice'.
*/
void
pagedevice_dump (FILE *stream, a2ps_job * job)
{
dict_entry ** entries = NULL;
dict_entry ** entry;
entries = (dict_entry **) hash_dump (job->status->pagedevice, NULL, NULL);
if (!*entries)
return;
/* Protect calls to setpagedevice through a stopped environment.
* (Cf. PDF spec, by Adobe) */
fputs ("\
%% Pagedevice definitions:\n\
countdictstack\n\
% Push our own mark, since there can be several PS marks pushed depending\n\
% where the failure really occured.\n\
/a2ps_mark\n\
{\n", stream);
/* Each Pagedevice */
for (entry = entries ; *entry ; entry++)
fprintf (stream, "\
%%%%BeginFeature: *%s %c%s\n\
(<<) cvx exec /%s (%s) cvx exec (>>) cvx exec\n\
systemdict /setpagedevice get exec\n\
%%%%EndFeature\n",
(*entry)->key, toupper ((*entry)->value[0]),
(*entry)->value + 1,
(*entry)->key, (*entry)->value);
/* Close the stopped env, and clear the stack */
fputs ("\
} stopped\n\
% My cleartomark\n\
{ /a2ps_mark eq { exit } if } loop\n\
countdictstack exch sub dup 0 gt\n\
{\n\
{ end } repeat\n\
}{\n\
pop\n\
} ifelse\n", stream);
free (entries);
}
void
dump_requirements (FILE * stream, struct a2ps_job * job)
{
dict_entry ** entries = NULL;
dict_entry ** entry;
entries = (dict_entry **) hash_dump (job->status->pagedevice, NULL, NULL);
/* Dump only if there is something to say */
if (*entries)
{
fputs ("%%Requirements: ", stream);
for (entry = entries ; *entry ; entry++)
fprintf (stream, "%s ", (*entry)->key);
putc ('\n', stream);
}
/* We don't want this one which breaks some collating systems
output (job->divertion, "numcopies(%d)", job->copies);
*/
free (entries);
}
void
setpagedevice (a2ps_job * job, const char * key, const char * value)
{
dict_entry_add (job->status->pagedevice, key, value, false);
}
void
delpagedevice (a2ps_job * job, const char * key)
{
dict_entry_remove (job->status->pagedevice, key);
}
/*
* For --list-options
*/
void
list_pagedevice (a2ps_job * job, FILE * stream)
{
dict_entry_table_dump (job->status->pagedevice, stream);
}
/*
* Used with the status dict definitions (-S)
*/
void
setstatusdict (a2ps_job * job, const char * key, const char * value, int def)
{
dict_entry_add (job->status->statusdict, key, value, def);
}
void
delstatusdict (a2ps_job * job, const char * key)
{
dict_entry_remove (job->status->statusdict, key);
}
void
output_statusdict (a2ps_job * job)
{
dict_entry ** entries = NULL;
dict_entry ** entry;
entries = (dict_entry **) hash_dump (job->status->statusdict, NULL, NULL);
if (*entries) {
output (job->divertion, "%% Statustdict definitions:\n");
output (job->divertion, "statusdict begin\n");
for ( entry = entries ; *entry ; entry++)
if ((*entry)->def)
output (job->divertion, " /%s %s def\n",
(*entry)->key, (*entry)->value);
else
output (job->divertion, " %s %s\n",
(*entry)->value, (*entry)->key);
output (job->divertion, "end\n");
}
free (entries);
}
/*
* For --list-options
*/
void
list_statusdict (a2ps_job * job, FILE * stream)
{
dict_entry_table_dump (job->status->statusdict, stream);
}
|