pcollinsg.c 5.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248
  1. #include <u.h>
  2. #include <libc.h>
  3. #include <bio.h>
  4. #include "dict.h"
  5. /*
  6. * Routines for handling dictionaries in the "Paperback Collins"
  7. * `German' format (with tags surrounded by \5⋯\6 and \xba⋯\xba)
  8. */
  9. /*
  10. * \5⋯\6 escapes (fonts, mostly)
  11. *
  12. * h headword (helvetica 7 pt)
  13. * c clause (helvetica 7 pt)
  14. * 3 helvetica 7 pt
  15. * 4 helvetica 6.5 pt
  16. * s helvetica 8 pt
  17. * x helvetica 8 pt
  18. * y helvetica 5 pt
  19. * m helvetica 30 pt
  20. * 1 roman 6 pt
  21. * 9 roman 4.5 pt
  22. * p roman 7 pt
  23. * q roman 4.5 pt
  24. * 2 italic 6 pt
  25. * 7 italic 4.5 pt
  26. * b bold 6 pt
  27. * a `indent 0:4 left'
  28. * k `keep 9'
  29. * l `size 12'
  30. */
  31. enum {
  32. IBASE=L'i', /* dotless i */
  33. Taglen=32,
  34. };
  35. static Rune intab[256] = {
  36. /*0*/ /*1*/ /*2*/ /*3*/ /*4*/ /*5*/ /*6*/ /*7*/
  37. /*00*/ NONE, NONE, NONE, NONE, NONE, TAGS, TAGE, NONE,
  38. NONE, NONE, NONE, NONE, NONE, L' ', NONE, NONE,
  39. /*10*/ NONE, L'-', L' ', L' ', NONE, NONE, NONE, NONE,
  40. L' ', NONE, NONE, NONE, L' ', NONE, NONE, L'-',
  41. /*20*/ L' ', L'!', L'"', L'#', L'$', L'%', L'&', L'\'',
  42. L'(', L')', L'*', L'+', L',', L'-', L'.', L'/',
  43. /*30*/ L'0', L'1', L'2', L'3', L'4', L'5', L'6', L'7',
  44. L'8', L'9', L':', L';', L'<', L'=', L'>', L'?',
  45. /*40*/ L'@', L'A', L'B', L'C', L'D', L'E', L'F', L'G',
  46. L'H', L'I', L'J', L'K', L'L', L'M', L'N', L'O',
  47. /*50*/ L'P', L'Q', L'R', L'S', L'T', L'U', L'V', L'W',
  48. L'X', L'Y', L'Z', L'[', L'\\', L']', L'^', L'_',
  49. /*60*/ L'`', L'a', L'b', L'c', L'd', L'e', L'f', L'g',
  50. L'h', L'i', L'j', L'k', L'l', L'm', L'n', L'o',
  51. /*70*/ L'p', L'q', L'r', L's', L't', L'u', L'v', L'w',
  52. L'x', L'y', L'z', L'{', L'|', L'}', L'~', NONE,
  53. /*80*/ NONE, NONE, NONE, NONE, NONE, NONE, NONE, NONE,
  54. NONE, NONE, L' ', NONE, NONE, NONE, NONE, NONE,
  55. /*90*/ L'ß', L'æ', NONE, MOE, NONE, NONE, NONE, L'ø',
  56. NONE, NONE, NONE, NONE, NONE, NONE, NONE, NONE,
  57. /*A0*/ NONE, NONE, L'"', L'£', NONE, NONE, NONE, NONE,
  58. NONE, NONE, NONE, NONE, NONE, NONE, NONE, NONE,
  59. /*B0*/ NONE, NONE, NONE, NONE, NONE, NONE, NONE, L'~',
  60. NONE, IBASE, SPCS, NONE, NONE, NONE, NONE, NONE,
  61. /*C0*/ NONE, NONE, NONE, NONE, NONE, NONE, NONE, NONE,
  62. NONE, NONE, NONE, NONE, NONE, NONE, NONE, NONE,
  63. /*D0*/ NONE, NONE, NONE, NONE, NONE, NONE, NONE, NONE,
  64. NONE, NONE, NONE, NONE, NONE, NONE, NONE, NONE,
  65. /*E0*/ NONE, NONE, NONE, NONE, NONE, NONE, NONE, NONE,
  66. NONE, NONE, NONE, NONE, NONE, NONE, NONE, NONE,
  67. /*F0*/ L' ', L' ', NONE, NONE, NONE, NONE, NONE, NONE,
  68. NONE, NONE, NONE, NONE, NONE, NONE, NONE, NONE,
  69. };
  70. static Nassoc numtab[] = {
  71. {1, L'+'},
  72. {4, L'='},
  73. {7, L'°'},
  74. {11, L'≈'},
  75. {69, L'♦'},
  76. {114, L'®'},
  77. {340, L'ɛ'},
  78. {341, L'ɔ'},
  79. {342, L'ʌ'},
  80. {343, L'ə'},
  81. {345, L'ʒ'},
  82. {346, L'ʃ'},
  83. {347, L'ɵ'},
  84. {348, L'ʊ'},
  85. {349, L'ˈ'},
  86. {351, L'ɪ'},
  87. {352, L'ɜ'},
  88. {354, L'ɑ'},
  89. {355, L'~'},
  90. {356, L'ɒ'},
  91. {384, L'ɳ'},
  92. {445, L'ð'}, /* BUG -- should be script eth */
  93. };
  94. static Nassoc overtab[] = {
  95. {L',', LCED},
  96. {L'/', LACU},
  97. {L':', LUML},
  98. {L'\\', LGRV},
  99. {L'^', LFRN},
  100. {L'~', LTIL},
  101. };
  102. static uchar *reach(uchar*, int);
  103. static Entry curentry;
  104. static char tag[Taglen];
  105. void
  106. pcollgprintentry(Entry e, int cmd)
  107. {
  108. uchar *p, *pe;
  109. int r, rprev = NONE, rx, over = 0, font;
  110. char buf[16];
  111. p = (uchar *)e.start;
  112. pe = (uchar *)e.end;
  113. curentry = e;
  114. if(cmd == 'h')
  115. outinhibit = 1;
  116. while(p < pe){
  117. if(cmd == 'r'){
  118. outchar(*p++);
  119. continue;
  120. }
  121. switch(r = intab[*p++]){ /* assign = */
  122. case TAGS:
  123. if(rprev != NONE){
  124. outrune(rprev);
  125. rprev = NONE;
  126. }
  127. p = reach(p, 0x06);
  128. font = tag[0];
  129. if(cmd == 'h')
  130. outinhibit = (font != 'h');
  131. break;
  132. case TAGE: /* an extra one */
  133. break;
  134. case SPCS:
  135. p = reach(p, 0xba);
  136. r = looknassoc(numtab, asize(numtab), strtol(tag,0,0));
  137. if(r < 0){
  138. if(rprev != NONE){
  139. outrune(rprev);
  140. rprev = NONE;
  141. }
  142. sprint(buf, "\\N'%s'", tag);
  143. outchars(buf);
  144. break;
  145. }
  146. /* else fall through */
  147. default:
  148. if(over){
  149. rx = looknassoc(overtab, asize(overtab), r);
  150. if(rx > 0)
  151. rx = liglookup(rx, rprev);
  152. if(rx > 0 && rx != NONE)
  153. outrune(rx);
  154. else{
  155. outrune(rprev);
  156. if(r == ':')
  157. outrune(L'¨');
  158. else{
  159. outrune(L'^');
  160. outrune(r);
  161. }
  162. }
  163. over = 0;
  164. rprev = NONE;
  165. }else if(r == '^'){
  166. over = 1;
  167. }else{
  168. if(rprev != NONE)
  169. outrune(rprev);
  170. rprev = r;
  171. }
  172. }
  173. }
  174. if(rprev != NONE)
  175. outrune(rprev);
  176. if(cmd == 'h')
  177. outinhibit = 0;
  178. outnl(0);
  179. }
  180. long
  181. pcollgnextoff(long fromoff)
  182. {
  183. int c, state = 0, defoff = -1;
  184. if(Bseek(bdict, fromoff, 0) < 0)
  185. return -1;
  186. while((c = Bgetc(bdict)) >= 0){
  187. if(c == '\r')
  188. defoff = Boffset(bdict);
  189. switch(state){
  190. case 0:
  191. if(c == 0x05)
  192. state = 1;
  193. break;
  194. case 1:
  195. if(c == 'h')
  196. state = 2;
  197. else
  198. state = 0;
  199. break;
  200. case 2:
  201. if(c == 0x06)
  202. return (Boffset(bdict)-3);
  203. else
  204. state = 0;
  205. break;
  206. }
  207. }
  208. return defoff;
  209. }
  210. void
  211. pcollgprintkey(void)
  212. {
  213. Bprint(bout, "No pronunciation key yet\n");
  214. }
  215. static uchar *
  216. reach(uchar *p, int tagchar)
  217. {
  218. int c; char *q=tag;
  219. while(p < (uchar *)curentry.end){
  220. c = *p++;
  221. if(c == tagchar)
  222. break;
  223. *q++ = c;
  224. if(q >= &tag[sizeof tag-1])
  225. break;
  226. }
  227. *q = 0;
  228. return p;
  229. }