load.c 1.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081
  1. /*
  2. * This file is part of the UCB release of Plan 9. It is subject to the license
  3. * terms in the LICENSE file found in the top-level directory of this
  4. * distribution and at http://akaros.cs.berkeley.edu/files/Plan9License. No
  5. * part of the UCB release of Plan 9, including this file, may be copied,
  6. * modified, propagated, or distributed except according to the terms contained
  7. * in the LICENSE file.
  8. */
  9. #include <u.h>
  10. #include <libc.h>
  11. #include <draw.h>
  12. #include <memdraw.h>
  13. int
  14. loadmemimage(Memimage *i, Rectangle r, uint8_t *data, int ndata)
  15. {
  16. int y, l, lpart, rpart, mx, m, mr;
  17. uint8_t *q;
  18. if(!rectinrect(r, i->r))
  19. return -1;
  20. l = bytesperline(r, i->depth);
  21. if(ndata < l*Dy(r))
  22. return -1;
  23. ndata = l*Dy(r);
  24. q = byteaddr(i, r.min);
  25. mx = 7/i->depth;
  26. lpart = (r.min.x & mx) * i->depth;
  27. rpart = (r.max.x & mx) * i->depth;
  28. m = 0xFF >> lpart;
  29. /* may need to do bit insertion on edges */
  30. if(l == 1){ /* all in one byte */
  31. if(rpart)
  32. m ^= 0xFF >> rpart;
  33. for(y=r.min.y; y<r.max.y; y++){
  34. *q ^= (*data^*q) & m;
  35. q += i->width*sizeof(uint32_t);
  36. data++;
  37. }
  38. return ndata;
  39. }
  40. if(lpart==0 && rpart==0){ /* easy case */
  41. for(y=r.min.y; y<r.max.y; y++){
  42. memmove(q, data, l);
  43. q += i->width*sizeof(uint32_t);
  44. data += l;
  45. }
  46. return ndata;
  47. }
  48. mr = 0xFF ^ (0xFF >> rpart);
  49. if(lpart!=0 && rpart==0){
  50. for(y=r.min.y; y<r.max.y; y++){
  51. *q ^= (*data^*q) & m;
  52. if(l > 1)
  53. memmove(q+1, data+1, l-1);
  54. q += i->width*sizeof(uint32_t);
  55. data += l;
  56. }
  57. return ndata;
  58. }
  59. if(lpart==0 && rpart!=0){
  60. for(y=r.min.y; y<r.max.y; y++){
  61. if(l > 1)
  62. memmove(q, data, l-1);
  63. q[l-1] ^= (data[l-1]^q[l-1]) & mr;
  64. q += i->width*sizeof(uint32_t);
  65. data += l;
  66. }
  67. return ndata;
  68. }
  69. for(y=r.min.y; y<r.max.y; y++){
  70. *q ^= (*data^*q) & m;
  71. if(l > 2)
  72. memmove(q+1, data+1, l-2);
  73. q[l-1] ^= (data[l-1]^q[l-1]) & mr;
  74. q += i->width*sizeof(uint32_t);
  75. data += l;
  76. }
  77. return ndata;
  78. }