qbits.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. /* quwei encoding for gb */
  7. Bitmap *
  8. qreadbits(char *file, int n, long *chars, int size, uchar *bits, int **doneptr)
  9. {
  10. Bitmap *bm;
  11. Biobuf *bf;
  12. char *p;
  13. long kmin, kmax;
  14. int i, j, byt;
  15. int nch;
  16. long c;
  17. uchar *b;
  18. int *done;
  19. uchar *nbits;
  20. static int dig[256] = {
  21. ['0'] 0, ['1'] 1, ['2'] 2, ['3'] 3, ['4'] 4, ['5'] 5, ['6'] 6, ['7'] 7,
  22. ['8'] 8, ['9'] 9, ['a'] 10, ['b'] 11, ['c'] 12, ['d'] 13, ['e'] 14, ['f'] 15,
  23. };
  24. bf = Bopen(file, OREAD);
  25. if(bf == 0){
  26. fprint(2, "%s: %s: %r\n", argv0, file);
  27. exits("bitfile open error");
  28. }
  29. done = (int *)malloc(n*sizeof(done[0]));
  30. if(done == 0){
  31. fprint(2, "%s: malloc error (%d bytes)\n", argv0, n);
  32. exits("malloc error");
  33. }
  34. *doneptr = done;
  35. memset(done, 0, n*sizeof(done[0]));
  36. kmin = 65536;
  37. kmax = 0;
  38. for(i = 0; i < n; i++){
  39. c = chars[i];
  40. if(kmin > c)
  41. kmin = c;
  42. if(kmax < c)
  43. kmax = c;
  44. }
  45. nch = 0;
  46. byt = size/8;
  47. while(p = (char *)Brdline(bf, '\n')){
  48. c = (p[0]-'0')*1000 + (p[1]-'0')*100 + (p[2]-'0')*10 + (p[3]-'0');
  49. if((c < kmin) || (c > kmax))
  50. continue;
  51. for(i = 0; i < n; i++)
  52. if(c == chars[i]){
  53. nch++;
  54. done[i] = 1;
  55. p += 5;
  56. b = bits + i*byt;
  57. for(i = 0; i < size; i++){ /* rows */
  58. for(j = 0; j < byt; j++){
  59. *b++ = (dig[*p]<<4) | dig[p[1]];
  60. p += 2;
  61. }
  62. b += (n-1)*byt;
  63. }
  64. break;
  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. for(i = 0; i < n; i++)
  86. if(done[i] == 0){
  87. /*fprint(2, "char 0x%x (%d) not found\n", chars[i], chars[i]);/**/
  88. }
  89. return(bm);
  90. }