ltorear.c 1.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778
  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. #include <memlayer.h>
  14. void
  15. _memltorear(Memimage *i, Memimage *rear)
  16. {
  17. Memlayer *l;
  18. Memscreen *s;
  19. Memimage *f, *r, *rr;
  20. Rectangle x;
  21. int overlap;
  22. l = i->layer;
  23. s = l->screen;
  24. while(l->rear != rear){
  25. r = l->rear;
  26. x = l->screenr;
  27. overlap = rectclip(&x, r->layer->screenr);
  28. if(overlap){
  29. memlhide(i, x);
  30. l->clear = 0;
  31. }
  32. /* swap l and r in screen's list */
  33. rr = r->layer->rear;
  34. f = l->front;
  35. if(rr == nil)
  36. s->rearmost = i;
  37. else
  38. rr->layer->front = i;
  39. if(f == nil)
  40. s->frontmost = r;
  41. else
  42. f->layer->rear = r;
  43. l->rear = rr;
  44. l->front = r;
  45. r->layer->rear = i;
  46. r->layer->front = f;
  47. if(overlap)
  48. memlexpose(r, x);
  49. }
  50. }
  51. void
  52. memltorear(Memimage *i)
  53. {
  54. _memltorear(i, nil);
  55. _memlsetclear(i->layer->screen);
  56. }
  57. void
  58. memltorearn(Memimage **ip, int n)
  59. {
  60. Memimage *i, *rear;
  61. Memscreen *s;
  62. if(n == 0)
  63. return;
  64. rear = nil;
  65. while(--n >= 0){
  66. i = *ip++;
  67. _memltorear(i, rear);
  68. rear = i;
  69. }
  70. s = rear->layer->screen;
  71. _memlsetclear(s);
  72. }