kbits.c 2.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293
  1. #include <u.h>
  2. #include <libc.h>
  3. #include <libg.h>
  4. #include <bio.h>
  5. #include "hdr.h"
  6. Bitmap *
  7. kreadbits(char *file, int n, long *chars, int size, uchar *bits, int **doneptr)
  8. {
  9. Bitmap *bm;
  10. Biobuf *bf;
  11. char *p;
  12. long kmin, kmax;
  13. int i, j, byt;
  14. int nch;
  15. long c;
  16. uchar *b;
  17. int *done;
  18. uchar *nbits;
  19. static int dig[256] = {
  20. ['0'] 0, ['1'] 1, ['2'] 2, ['3'] 3, ['4'] 4, ['5'] 5, ['6'] 6, ['7'] 7,
  21. ['8'] 8, ['9'] 9, ['a'] 10, ['b'] 11, ['c'] 12, ['d'] 13, ['e'] 14, ['f'] 15,
  22. };
  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. memset(done, 0, n*sizeof(done[0]));
  35. kmin = 65536;
  36. kmax = 0;
  37. for(i = 0; i < n; i++){
  38. c = chars[i];
  39. if(kmin > c)
  40. kmin = c;
  41. if(kmax < c)
  42. kmax = c;
  43. }
  44. nch = 0;
  45. byt = size/8;
  46. Brdline(bf, '\n'); /* header line 1 */
  47. Brdline(bf, '\n'); /* header line 2 */
  48. while(p = (char *)Brdline(bf, '\n')){
  49. c = strtol(p+17, (char **)0, 10);
  50. if((c < kmin) || (c > kmax))
  51. continue;
  52. for(i = 0; i < n; i++)
  53. if(c == chars[i]){
  54. nch++;
  55. done[i] = 1;
  56. p += 25;
  57. b = bits + i*byt;
  58. for(i = 0; i < size; i++){ /* rows */
  59. for(j = 0; j < byt; j++){
  60. *b++ = (dig[*p]<<4) | dig[p[1]];
  61. p += 2;
  62. }
  63. b += (n-1)*byt;
  64. }
  65. break;
  66. }
  67. }
  68. nbits = (uchar *)malloc(nch*byt*size);
  69. if(nbits == 0){
  70. fprint(2, "%s: malloc error (%d bytes)\n", argv0, nch*byt);
  71. exits("malloc error");
  72. }
  73. c = 0;
  74. for(i = 0; i < n; i++)
  75. if(done[i]){
  76. for(j = 0; j < size; j++)
  77. memmove(nbits+c*byt+j*nch*byt, bits+i*byt+j*n*byt, byt);
  78. c++;
  79. }
  80. bm = balloc((Rectangle){(Point){0, 0}, (Point){nch*size, size}}, 0);
  81. if(bm == 0){
  82. fprint(2, "%s: balloc failure\n", argv0);
  83. exits("balloc failure");
  84. }
  85. wrbitmap(bm, 0, size, nbits);
  86. for(i = 0; i < n; i++)
  87. if(done[i] == 0){
  88. /*fprint(2, "char 0x%x (%d) not found\n", chars[i], chars[i]);/**/
  89. }
  90. return(bm);
  91. }