/* stringpool.w Copyright 2009-2010 Taco Hoekwater 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 . */ #include "ptexlib.h" /*tex Control sequence names and diagnostic messages are variable-length strings of eight-bit characters. Since PASCAL did not have a well-developed string mechanism, \TeX\ did all of its string processing by homegrown methods. Elaborate facilities for dynamic strings are not needed, so all of the necessary operations can be handled with a simple data structure. The array |str_pool| contains all of the (eight-bit) bytes off all of the strings, and the array |str_start| contains indices of the starting points of each string. Strings are referred to by integer numbers, so that string number |s| comprises the characters |str_pool[j]| for |str_start_macro(s)<=j= STRING_OFFSET) { k = str_string(t); if (s <= 0x7F && (str_length(t) == 1) && *k == s) return true; a = pool_to_unichar(k); if (a != s) return false; } else { if (t != s) return false; } } else if (t < STRING_OFFSET) { j = str_string(s); if (t <= 0x7F && (str_length(s) == 1) && *j == t) return true; a = pool_to_unichar(j); if (a != t) return false; } else { if (str_length(s) != str_length(t)) return false; k = str_string(t); j = str_string(s); l = j + str_length(s); while (j < l) { if (*j++ != *k++) return false; } } return true; } /*tex A string compare helper: */ boolean str_eq_cstr(str_number r, const char *s, size_t l) { if (l != (size_t) str_length(r)) return false; return (strncmp((const char *) (str_string(r)), s, l) == 0); } /*tex The initial values of |str_pool|, |str_start|, |pool_ptr|, and |str_ptr| are computed by the \.{INITEX} program, based in part on the information that \.{WEB} has output while processing \TeX. The first |string_offset| strings are single-characters strings matching Unicode. There is no point in generating all of these. But |str_ptr| has initialized properly, otherwise |print_char| cannot see the difference between characters and strings. */ boolean get_strings_started(void) { reset_cur_string(); return true; } /*tex The string recycling routines. \TeX{} uses 2 upto 4 {\it new\/} strings when scanning a filename in an \.{\\input}, \.{\\openin}, or \.{\\openout} operation. These strings are normally lost because the reference to them are not saved after finishing the operation. |search_string| searches through the string pool for the given string and returns either 0 or the found string number. */ str_number search_string(str_number search) { str_number s; size_t len; len = str_length(search); if (len == 0) { return get_nullstr(); } else { /*tex We start the search with newest string below |s|; |search>1|! */ s = search - 1; while (s >= STRING_OFFSET) { /* The first |string_offset| of strings depend on the implementation! */ if (str_length(s) == len) if (str_eq_str(s, search)) return s; s--; } } return 0; } str_number maketexstring(const char *s) { if (s == NULL || *s == 0) return get_nullstr(); return maketexlstring(s, strlen(s)); } str_number maketexlstring(const char *s, size_t l) { if (s == NULL || l == 0) return get_nullstr(); str_string(str_ptr) = xmalloc((unsigned) (l + 1)); memcpy(str_string(str_ptr), s, (l + 1)); str_length(str_ptr) = (unsigned) l; str_ptr++; return (str_ptr - 1); } /*tex This appends a C string to a \TEX\ string: */ void append_string(const unsigned char *s, unsigned l) { if (s == NULL || *s == 0) return; l = (unsigned) strlen((const char *) s); str_room(l); memcpy(cur_string + cur_length, s, l); cur_length += l; return; } char *makecstring(int s) { size_t l; return makeclstring(s, &l); } char *makeclstring(int s, size_t * len) { if (s < STRING_OFFSET) { *len = (size_t) utf8_size(s); return (char *) uni2str((unsigned) s); } else { unsigned l = (unsigned) str_length(s); char *cstrbuf = xmalloc(l + 1); memcpy(cstrbuf, str_string(s), l); cstrbuf[l] = '\0'; *len = (size_t) l; return cstrbuf; } } int dump_string_pool(void) { int j; int l; int k = str_ptr; dump_int(k - STRING_OFFSET); for (j = STRING_OFFSET + 1; j < k; j++) { l = (int) str_length(j); if (str_string(j) == NULL) l = -1; dump_int(l); if (l > 0) dump_things(*str_string(j), str_length(j)); } return (k - STRING_OFFSET); } int undump_string_pool(void) { int j; int x; undump_int(str_ptr); if (max_strings < str_ptr + strings_free) max_strings = str_ptr + strings_free; str_ptr += STRING_OFFSET; if (ini_version) libcfree(string_pool); init_string_pool_array((unsigned) max_strings); for (j = STRING_OFFSET + 1; j < str_ptr; j++) { undump_int(x); if (x >= 0) { str_length(j) = (unsigned) x; pool_size += (unsigned) x; str_string(j) = xmallocarray(unsigned char, (unsigned) (x + 1)); undump_things(*str_string(j), (unsigned) x); *(str_string(j) + str_length(j)) = '\0'; } else { str_length(j) = 0; } } init_str_ptr = str_ptr; return str_ptr; } void init_string_pool_array(unsigned s) { string_pool = xmallocarray(lstring, s); _string_pool = string_pool - STRING_OFFSET; memset(string_pool, 0, s * sizeof(lstring)); /* seed the null string */ string_pool[0].s = xmalloc(1); string_pool[0].s[0] = '\0'; } /*tex To destroy an already made string, we say |flush_str|. */ void flush_str(str_number s) { if (s > STRING_OFFSET) { /*tex Don't ever delete the null string! */ pool_size -= (unsigned) str_length(s); str_length(s) = 0; xfree(str_string(s)); } while (str_string((str_ptr - 1)) == NULL) str_ptr--; }