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
|
% mathnodes.w
%
% Copyright 2006-2012 Taco Hoekwater <taco@@luatex.org>
% Copyright 2012 Khaled Hosny <khaledhosny@@eglug.org>
%
% This file is part of LuaTeX.
%
% LuaTeX 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.
%
% LuaTeX 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 Lesser General Public
% License for more details.
%
% You should have received a copy of the GNU General Public License along
% with LuaTeX; if not, see <http://www.gnu.org/licenses/>.
@ @c
#include "ptexlib.h"
@ math codes
@c
static sa_tree mathcode_head = NULL;
/* the 0xFFFFFFFF is a flag value */
#define MATHCODESTACK 8
#define MATHCODEDEFAULT 0xFFFFFFFF
#define MATHCODEACTIVE 0xFFFFFFFE
@ delcodes
@c
static sa_tree delcode_head = NULL;
#define DELCODESTACK 4
#define DELCODEDEFAULT 0xFFFFFFFF
@ some helpers for mathcode printing
@c
#define print_hex_digit(A) do { \
if ((A)>=10) print_char('A'+(A)-10); \
else print_char('0'+(A)); \
} while (0)
#define two_hex(A) do { \
print_hex_digit((A)/16); \
print_hex_digit((A)%16); \
} while (0)
#define four_hex(A) do { \
two_hex((A)/256); \
two_hex((A)%256); \
} while (0)
#define six_hex(A) do { \
two_hex((A)/65536); \
two_hex(((A)%65536)/256); \
two_hex((A)%256); \
} while (0)
/*
At some point we will drop the mathchardef 8 bit storage (c_mathoption_umathcode_meaning_code => 1)
and then some of the conversion can go away. Like mathchar_from_integer: only wide characters are
possible then.
*/
@ @c
mathcodeval mathchar_from_integer(int value, int extcode)
{
mathcodeval mval;
if (extcode == tex_mathcode) {
/* printf("can't happen: tex_mathcode\n"); */
mval.class_value = (value / 0x1000);
mval.family_value = ((value % 0x1000) / 0x100);
mval.character_value = (value % 0x100);
} else {
int mfam = (value / 0x200000) & 0x7FF;
mval.class_value = mfam % 0x08;
mval.family_value = mfam / 0x08;
mval.character_value = value & 0x1FFFFF;
}
return mval;
}
@ @c
void show_mathcode_value_old(int value)
{
print_char('"');
four_hex(value);
}
void show_mathcode_value(mathcodeval c)
{
print_char('"');
print_hex_digit(c.class_value);
print_char('"');
two_hex(c.family_value);
print_char('"');
six_hex(c.character_value);
}
@ @c
static void show_mathcode(int n)
{
mathcodeval c = get_math_code(n);
tprint_esc("Umathcode");
print_int(n);
print_char('=');
show_mathcode_value(c);
}
@ @c
static void unsavemathcode(quarterword gl)
{
sa_stack_item st;
if (mathcode_head->stack == NULL)
return;
while (mathcode_head->stack_ptr > 0 && abs(mathcode_head->stack[mathcode_head->stack_ptr].level) >= gl) {
st = mathcode_head->stack[mathcode_head->stack_ptr];
if (st.level > 0) {
rawset_sa_item(mathcode_head, st.code, st.value);
if (tracing_restores_par > 1) {
begin_diagnostic();
print_char('{');
tprint("restoring");
print_char(' ');
show_mathcode(st.code);
print_char('}');
end_diagnostic(false);
}
}
(mathcode_head->stack_ptr)--;
}
}
@ @c
void set_math_code(int n, int mathclass, int mathfamily, int mathcharacter, quarterword level)
{
sa_tree_item v;
if (mathclass == 8 && mathfamily == 0 && mathcharacter == 0) {
v.uint_value = MATHCODEACTIVE;
} else {
v.math_code_value.class_value = mathclass;
v.math_code_value.family_value = mathfamily;
v.math_code_value.character_value = mathcharacter;
}
set_sa_item(mathcode_head, n, v, level);
if (tracing_assigns_par > 1) {
begin_diagnostic();
print_char('{');
tprint("assigning");
print_char(' ');
show_mathcode(n);
print_char('}');
end_diagnostic(false);
}
}
@ @c
/* we could use two structs ... tex and umath */
mathcodeval get_math_code(int n)
{
mathcodeval d;
sa_tree_item v = get_sa_item(mathcode_head, n);
if (v.uint_value == MATHCODEDEFAULT) {
d.class_value = 0;
d.family_value = 0;
d.character_value = n;
} else if (v.uint_value == MATHCODEACTIVE) {
d.class_value = 8;
d.family_value = 0;
d.character_value = 0;
} else {
d.class_value = v.math_code_value.class_value;
if (d.class_value == 8) {
d.family_value = 0;
d.character_value = n;
} else {
d.family_value = v.math_code_value.family_value;
d.character_value = v.math_code_value.character_value;
}
}
return d;
}
@ @c
int get_math_code_num(int n)
{
mathcodeval d = get_math_code(n);
return (d.class_value + (d.family_value * 8)) * (65536 * 32) + d.character_value;
}
@ @c
static void initializemathcode(void)
{
sa_tree_item sa_value = { 0 };
sa_value.uint_value = MATHCODEDEFAULT;
mathcode_head = new_sa_tree(MATHCODESTACK, 1, sa_value);
}
static void dumpmathcode(void)
{
dump_sa_tree(mathcode_head,"mathcodes");
}
static void undumpmathcode(void)
{
mathcode_head = undump_sa_tree("mathcodes");
}
@ @c
static void show_delcode(int n)
{
delcodeval c;
c = get_del_code(n);
tprint_esc("Udelcode");
print_int(n);
print_char('=');
if (c.small_family_value < 0) {
print_char('-');
print_char('1');
} else {
print_char('"');
two_hex(c.small_family_value);
six_hex(c.small_character_value);
}
}
@ @c
static void unsavedelcode(quarterword gl)
{
sa_stack_item st;
if (delcode_head->stack == NULL)
return;
while (delcode_head->stack_ptr > 0 && abs(delcode_head->stack[delcode_head->stack_ptr].level) >= gl) {
st = delcode_head->stack[delcode_head->stack_ptr];
if (st.level > 0) {
rawset_sa_item(delcode_head, st.code, st.value);
if (tracing_restores_par > 1) {
begin_diagnostic();
print_char('{');
tprint("restoring");
print_char(' ');
show_delcode(st.code);
print_char('}');
end_diagnostic(false);
}
}
(delcode_head->stack_ptr)--;
}
}
@ @c
void set_del_code(int n, int smathfamily, int smathcharacter, int lmathfamily, int lmathcharacter, quarterword gl)
{
sa_tree_item v;
v.del_code_value.class_value = 0;
v.del_code_value.small_family_value = smathfamily;
v.del_code_value.small_character_value = smathcharacter;
v.del_code_value.dummy_value = 0;
v.del_code_value.large_family_value = lmathfamily;
v.del_code_value.large_character_value = lmathcharacter;
set_sa_item(delcode_head, n, v, gl); /* always global */
if (tracing_assigns_par > 1) {
begin_diagnostic();
print_char('{');
tprint("assigning");
print_char(' ');
show_delcode(n);
print_char('}');
end_diagnostic(false);
}
}
@ @c
delcodeval get_del_code(int n)
{
delcodeval d;
sa_tree_item v = get_sa_item(delcode_head, n);
if (v.uint_value == DELCODEDEFAULT) {
d.class_value = 0;
d.small_family_value = -1;
d.small_character_value = 0;
d.large_family_value = 0;
d.large_character_value = 0;
} else {
d.class_value = v.del_code_value.class_value;
d.small_family_value = v.del_code_value.small_family_value;
d.small_character_value = v.del_code_value.small_character_value;
d.large_family_value = v.del_code_value.large_family_value;
d.large_character_value = v.del_code_value.large_character_value;
}
return d;
}
@ this really only works for old-style delcodes!
@c
int get_del_code_num(int n)
{
delcodeval d = get_del_code(n);
if (d.small_family_value < 0) {
return -1;
} else {
return ((d.small_family_value * 256 + d.small_character_value) * 4096 +
(d.large_family_value * 256) + d.large_character_value);
}
}
@ @c
static void initializedelcode(void)
{
sa_tree_item sa_value = { 0 };
sa_value.uint_value = DELCODEDEFAULT;
delcode_head = new_sa_tree(DELCODESTACK, 2, sa_value);
}
@ @c
static void dumpdelcode(void)
{
dump_sa_tree(delcode_head,"delcodes");
}
static void undumpdelcode(void)
{
delcode_head = undump_sa_tree("delcodes");
}
@ @c
void unsave_math_codes(quarterword grouplevel)
{
unsavemathcode(grouplevel);
unsavedelcode(grouplevel);
}
@ @c
void initialize_math_codes(void)
{
initializemathcode();
initializedelcode();
}
@ @c
void free_math_codes(void)
{
destroy_sa_tree(mathcode_head);
destroy_sa_tree(delcode_head);
}
@ @c
void dump_math_codes(void)
{
dumpmathcode();
dumpdelcode();
}
void undump_math_codes(void)
{
undumpmathcode();
undumpdelcode();
}
|