blob: 1f87dbb22b92429eb2d12ab14e2dd8513dd12e52 (
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
|
/*
See license.txt in the root of this project.
*/
# ifndef LMT_NESTING_H
# define LMT_NESTING_H
/*
Todo: make this record 6*4 smaller, not all are halfwords, although padding might then make us
end up with the same size. We also end up with plenty of casts elsewhere.
*/
typedef struct list_state_record {
int mode; // singleword
halfword head;
halfword tail;
int prev_graf;
int mode_line;
halfword prev_depth; // scaled
halfword space_factor;
halfword direction_stack;
int math_dir; // singleword
int math_style; // singleword
int math_scale;
int math_main_style; // singleword
halfword delimiter; // todo: get rid of these and use the stack
halfword incomplete_noad; // todo: get rid of these and use the stack
halfword math_flatten; // singleword
halfword math_begin; // singleword
halfword math_end; // singleword
halfword math_mode; // singleword
} list_state_record;
typedef struct nest_state_info {
list_state_record *nest;
memory_data nest_data;
int shown_mode; // singleword
int math_mode; // singleword
} nest_state_info;
extern nest_state_info lmt_nest_state;
# define cur_list lmt_nest_state.nest[lmt_nest_state.nest_data.ptr] /*tex The \quote {top} semantic state. */
# define cur_mode (abs(cur_list.mode))
extern void tex_initialize_nest_state (void);
/* int tex_room_on_nest_stack (void); */
extern void tex_initialize_nesting (void);
extern void tex_push_nest (void);
extern void tex_pop_nest (void);
extern void tex_tail_append (halfword p);
extern halfword tex_pop_tail (void);
extern const char *tex_string_mode (int m);
extern void tex_show_activities (void);
extern int tex_vmode_nest_index (void);
/*tex
When we use a macro instead of a function we need to use an intermediate variable because |_p_|
can be a functioncall itself (something |new_*|). The gain is a little performance because this
one is called a lot. The loss is a bit larger binary. There are some more macros sensitive for
this, like the ones that couple nodes. Also, inlining a function can spoil this game!
*/
/*
# define tail_append(_p_) do { \
halfword __p__ = _p_ ; \
tex_couple_nodes(cur_list.tail, __p__); \
cur_list.tail = __p__; \
} while (0)
*/
/*
# define tail_append tex_tail_append
*/
# endif
|
