web2c/alephdir/omstr.ch

109 @!str_number = 0..max_strings; {for variables that point into |str_start|}
114 @!str_start : array[str_number] of pool_pointer; {the starting pointers}
118 @d str_start(#) == str_start_ar[#-too_big_char]
122 @!str_number = 0..max_strings; {for variables that point into |str_start|}
131 @d length(#)==(str_start[#+1]-str_start[#]) {the number of characters
136 begin if (s>=@"10000) then length:=str_start(s+1)-str_start(s)
145 @d cur_length == (pool_ptr - str_start[str_ptr])
147 @d cur_length == (pool_ptr - str_start(str_ptr))
151 incr(str_ptr); str_start[str_ptr]:=pool_ptr;
153 incr(str_ptr); str_start(str_ptr):=pool_ptr;
157 @d flush_string==begin decr(str_ptr); pool_ptr:=str_start[str_ptr];
159 @d flush_string==begin decr(str_ptr); pool_ptr:=str_start(str_ptr);
163 begin j:=str_start[s];
164 while j<str_start[s+1] do
166 begin j:=str_start(s);
167 while j<str_start(s+1) do
178 j:=str_start[s]; k:=str_start[t];
179 while j<str_start[s+1] do
200       if s<>str_pool[str_start(t)] then goto not_found;
205       if str_pool[str_start(s)]<>t then goto not_found;
208       if str_pool[str_start(s)]<>str_pool[str_start(t)] then
214   j:=str_start(s); k:=str_start(t);
215   while j<str_start(s+1) do
232 begin pool_ptr:=0; str_ptr:=0; str_start[0]:=0;
393     j:=str_start[s];
394     while j<str_start[s+1] do
399 j:=str_start[s];
400 while j<str_start[s+1] do
453 j:=str_start(s);
454 while j<str_start(s+1) do
461 else begin j:=str_start[s];
462   while j<str_start[s+1] do
467 else begin j:=str_start(s);
468   while j<str_start(s+1) do
503 begin j:=str_start["m2d5c2l5x2v5i"]; v:=1000;
509 begin j:=str_start("m2d5c2l5x2v5i"); v:=1000;
515 begin j:=str_start[str_ptr];
519 begin j:=str_start(str_ptr);
529 while pool_ptr>str_start[str_ptr] do
531 while pool_ptr>str_start(str_ptr) do
535 else  begin k:=str_start[s]; l:=str_start[s+1]-k;
537 else  begin k:=str_start(s); l:=str_start(s+1)-k;
636 begin p:=backup_head; link(p):=null; k:=str_start[s];
637 while k<str_start[s+1] do
668 k:=str_start(s);
669 while k<str_start(s+1) do
691   str_start[str_ptr+1]:=str_start[str_ptr]+area_delimiter; incr(str_ptr);
697   str_start[str_ptr+1]:=str_start[str_ptr]+ext_delimiter-area_delimiter-1;
705   str_start(str_ptr+1):=str_start(str_ptr)+area_delimiter; incr(str_ptr);
711   str_start(str_ptr+1):=str_start(str_ptr)+ext_delimiter-area_delimiter-1;
723 for j:=str_start[a] to str_start[a+1]-1 do append_to_name(so(str_pool[j]));
724 for j:=str_start[n] to str_start[n+1]-1 do append_to_name(so(str_pool[j]));
725 for j:=str_start[e] to str_start[e+1]-1 do append_to_name(so(str_pool[j]));
735 for j:=str_start(a) to str_start(a+1)-1 do append_to_name(so(str_pool[j]));
736 for j:=str_start(n) to str_start(n+1)-1 do append_to_name(so(str_pool[j]));
737 for j:=str_start(e) to str_start(e+1)-1 do append_to_name(so(str_pool[j]));
793   for s:=str_start[str_ptr] to pool_ptr-1 do dvi_out(so(str_pool[s]));
794   pool_ptr:=str_start[str_ptr]; {flush the current string}
796   for s:=str_start(str_ptr) to pool_ptr-1 do dvi_out(so(str_pool[s]));
797   pool_ptr:=str_start(str_ptr); {flush the current string}
801 magic_offset:=str_start[math_spacing]-9*ord_noad
803 magic_offset:=str_start(math_spacing)-9*ord_noad
807   begin j:=1; u:=str_start[k];
809   begin j:=1; u:=str_start(k);
813 u:=str_start[k]; v:=str_start[s];
817 until u=str_start[k+1];
819 u:=str_start(k); v:=str_start(s);
823 until u=str_start(k+1);
841 for k:=0 to str_ptr do dump_int(str_start[k]);
843 for k:=too_big_char to str_ptr do dump_int(str_start(k));
849 for k:=0 to str_ptr do undump(0)(pool_ptr)(str_start[k]);
851 for k:=too_big_char to str_ptr do undump(0)(pool_ptr)(str_start(k));
869 for k:=str_start[str_ptr] to pool_ptr-1 do dvi_out(so(str_pool[k]));
870 pool_ptr:=str_start[str_ptr]; {erase the string}
872 for k:=str_start(str_ptr) to pool_ptr-1 do dvi_out(so(str_pool[k]));
873 pool_ptr:=str_start(str_ptr); {erase the string}