summaryrefslogtreecommitdiff
path: root/Build/source/texk/web2c/omegafonts/list_routines.h
blob: c2ca6d654dd4ed1a6331a84d3d0d1a82522cbcbf (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
/* list_routines.h: Types used in this program.

This file is part of Omega,
which is based on the web2c distribution of TeX,

Copyright (c) 1994--2001 John Plaice and Yannis Haralambous

Omega 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.

Omega 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 Omega; if not, write to the Free Software Foundation, Inc.,
59 Temple Place, Suite 330, Boston, MA 02111-1307, USA.

*/

typedef int fix;

typedef struct cell_struct {
    struct cell_struct *ptr;
    void *contents;
} cell;
typedef cell *list;

typedef struct av_cell_struct {
    struct av_cell_struct *ptr;
    int attribute;
    int value;
} av_cell;
typedef av_cell *av_list;

typedef struct in_cell_struct {
    struct in_cell_struct *ptr;
    struct in_cell_struct *actual;
    int value;
    int index;
} in_cell;
typedef in_cell *in_list;

typedef struct hash_cell_struct {
    int x;
    int y;
    int new_class;
    int lig_z;
    struct hash_cell_struct *ptr;
} hash_cell;

typedef hash_cell *hash_list;

typedef struct queue_struct {
    struct cell_struct *front;
    struct cell_struct *tail;
} queue;

extern list cons(void *, list);
extern list list1(void *);
extern list list2(void *, void *);
extern list append(list, list);
extern list append1(list, void *);

extern av_list av_cons(int,int,  av_list);
extern av_list av_list1(int,int);
extern av_list av_list2(int,int,  int,int);
extern av_list av_append(av_list,  av_list);
extern av_list av_append1(av_list,  int,int);

extern in_list in_cons(int,in_list,  in_list);
extern in_list in_list1(int,in_list);
extern in_list in_list2(int,in_list,  int,in_list);
extern in_list in_append(in_list,  in_list);
extern in_list in_append1(in_list,  int,in_list);

extern hash_list hash_cons(int,int,int,int,  hash_list);
extern hash_list hash_list1(int,int,int,int);
extern hash_list hash_list2(int,int,int,int,  int,int,int,int);
extern hash_list hash_append(hash_list,  hash_list);
extern hash_list hash_append1(hash_list,  int,int,int,int);

#define lattr(L) (L->attribute)
#define lval(L) (L->value)

typedef struct four_pieces_struct {
    unsigned int pieces[4];
} four_pieces;

typedef struct four_entries_struct {
    int entries[4];
} four_entries;

#define lb0(L) (((four_entries *)((L)->contents))->entries[0])
#define lb1(L) (((four_entries *)((L)->contents))->entries[1])
#define lb2(L) (((four_entries *)((L)->contents))->entries[2])
#define lb3(L) (((four_entries *)((L)->contents))->entries[3])


extern void init_queue(queue *);
extern void append_to_queue(queue *, void *);