bbits.c 2.1 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889
  1. #include <u.h>
  2. #include <libc.h>
  3. #include <libg.h>
  4. #include <bio.h>
  5. #include "hdr.h"
  6. enum {
  7. Charsperfont = 157,
  8. Void1b = (0xC6-0xA2)*Charsperfont+0x3f,
  9. Void1e = (0xC9-0xA2)*Charsperfont - 1 ,
  10. };
  11. Bitmap *
  12. breadbits(char *file, int n, long *chars, int size, uchar *bits, int **doneptr)
  13. {
  14. Bitmap *bm;
  15. Biobuf *bf;
  16. int i, j, byt;
  17. int nch;
  18. long c;
  19. uchar *b, *nbits;
  20. int *done;
  21. static uchar missing[32] = {0x00, 0x00, 0x00, 0x00, 0x10, 0x00, 0x08, 0x00, 0x04, 0x00, 0x02, 0x00, 0x01, 0x00, 0x00, 0x80, 0x00, 0x40, 0x00, 0x20, 0x00, 0x10, 0x00, 0x08, 0x00, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 };
  22. uchar buf[32];
  23. bf = Bopen(file, OREAD);
  24. if(bf == 0){
  25. fprint(2, "%s: %s: %r\n", argv0, file);
  26. exits("bitfile open error");
  27. }
  28. done = (int *)malloc(n*sizeof(done[0]));
  29. if(done == 0){
  30. fprint(2, "%s: malloc error (%d bytes)\n", argv0, n);
  31. exits("malloc error");
  32. }
  33. *doneptr = done;
  34. byt = size/8;
  35. nch = 0;
  36. for(i = 0; i < n; i++){
  37. done[i] = 1;
  38. nch++;
  39. c = chars[i];
  40. if((c >= Void1b) && (c <= Void1e)){
  41. done[i] = 0;
  42. nch--;
  43. continue;
  44. }
  45. /* magic via presotto for calculating the seek */
  46. j = c;
  47. if(c >= 2*Charsperfont)
  48. j += 294; /* baffling hole between A3 and A4 */
  49. if(c > Void1e)
  50. j -= 3*Charsperfont - 0x3F;
  51. j *= byt*size; /* bytes per char */
  52. j += 256; /* 256 front matter */
  53. Bseek(bf, j, 0);
  54. Bread(bf, buf, sizeof(missing));
  55. if(memcmp(buf, missing, sizeof(missing)) == 0){
  56. done[i] = 0;
  57. nch--;
  58. continue;
  59. }
  60. Bseek(bf, j, 0);
  61. b = bits + i*byt;
  62. for(j = 0; j < size; j++){ /* rows */
  63. Bread(bf, b, byt);
  64. b += n*byt;
  65. }
  66. }
  67. nbits = (uchar *)malloc(nch*byt*size);
  68. if(nbits == 0){
  69. fprint(2, "%s: malloc error (%d bytes)\n", argv0, nch*byt);
  70. exits("malloc error");
  71. }
  72. c = 0;
  73. for(i = 0; i < n; i++)
  74. if(done[i]){
  75. for(j = 0; j < size; j++)
  76. memmove(nbits+c*byt+j*nch*byt, bits+i*byt+j*n*byt, byt);
  77. c++;
  78. }
  79. bm = balloc((Rectangle){(Point){0, 0}, (Point){nch*size, size}}, 0);
  80. if(bm == 0){
  81. fprint(2, "%s: balloc failure\n", argv0);
  82. exits("balloc failure");
  83. }
  84. wrbitmap(bm, 0, size, nbits);
  85. return(bm);
  86. }