1 324891a5 2006-06-25 devnull #include <u.h>
 2 324891a5 2006-06-25 devnull #include <libc.h>
 3 324891a5 2006-06-25 devnull #include <draw.h>
 4 324891a5 2006-06-25 devnull #include <memdraw.h>
 5 324891a5 2006-06-25 devnull 
 6 324891a5 2006-06-25 devnull int
 7 324891a5 2006-06-25 devnull _loadmemimage(Memimage *i, Rectangle r, uchar *data, int ndata)
 8 324891a5 2006-06-25 devnull {
 9 324891a5 2006-06-25 devnull 	int y, l, lpart, rpart, mx, m, mr;
10 324891a5 2006-06-25 devnull 	uchar *q;
11 324891a5 2006-06-25 devnull 
12 324891a5 2006-06-25 devnull 	if(!rectinrect(r, i->r))
13 324891a5 2006-06-25 devnull 		return -1;
14 324891a5 2006-06-25 devnull 	l = bytesperline(r, i->depth);
15 324891a5 2006-06-25 devnull 	if(ndata < l*Dy(r))
16 324891a5 2006-06-25 devnull 		return -1;
17 324891a5 2006-06-25 devnull 	ndata = l*Dy(r);
18 324891a5 2006-06-25 devnull 	q = byteaddr(i, r.min);
19 324891a5 2006-06-25 devnull 	mx = 7/i->depth;
20 324891a5 2006-06-25 devnull 	lpart = (r.min.x & mx) * i->depth;
21 324891a5 2006-06-25 devnull 	rpart = (r.max.x & mx) * i->depth;
22 324891a5 2006-06-25 devnull 	m = 0xFF >> lpart;
23 324891a5 2006-06-25 devnull 	/* may need to do bit insertion on edges */
24 324891a5 2006-06-25 devnull 	if(l == 1){	/* all in one byte */
25 324891a5 2006-06-25 devnull 		if(rpart)
26 324891a5 2006-06-25 devnull 			m ^= 0xFF >> rpart;
27 324891a5 2006-06-25 devnull 		for(y=r.min.y; y<r.max.y; y++){
28 324891a5 2006-06-25 devnull 			*q ^= (*data^*q) & m;
29 324891a5 2006-06-25 devnull 			q += i->width*sizeof(u32int);
30 324891a5 2006-06-25 devnull 			data++;
31 324891a5 2006-06-25 devnull 		}
32 324891a5 2006-06-25 devnull 		return ndata;
33 324891a5 2006-06-25 devnull 	}
34 324891a5 2006-06-25 devnull 	if(lpart==0 && rpart==0){	/* easy case */
35 324891a5 2006-06-25 devnull 		for(y=r.min.y; y<r.max.y; y++){
36 324891a5 2006-06-25 devnull 			memmove(q, data, l);
37 324891a5 2006-06-25 devnull 			q += i->width*sizeof(u32int);
38 324891a5 2006-06-25 devnull 			data += l;
39 324891a5 2006-06-25 devnull 		}
40 324891a5 2006-06-25 devnull 		return ndata;
41 324891a5 2006-06-25 devnull 	}
42 324891a5 2006-06-25 devnull 	mr = 0xFF ^ (0xFF >> rpart);
43 324891a5 2006-06-25 devnull 	if(lpart!=0 && rpart==0){
44 324891a5 2006-06-25 devnull 		for(y=r.min.y; y<r.max.y; y++){
45 324891a5 2006-06-25 devnull 			*q ^= (*data^*q) & m;
46 324891a5 2006-06-25 devnull 			if(l > 1)
47 324891a5 2006-06-25 devnull 				memmove(q+1, data+1, l-1);
48 324891a5 2006-06-25 devnull 			q += i->width*sizeof(u32int);
49 324891a5 2006-06-25 devnull 			data += l;
50 324891a5 2006-06-25 devnull 		}
51 324891a5 2006-06-25 devnull 		return ndata;
52 324891a5 2006-06-25 devnull 	}
53 324891a5 2006-06-25 devnull 	if(lpart==0 && rpart!=0){
54 324891a5 2006-06-25 devnull 		for(y=r.min.y; y<r.max.y; y++){
55 324891a5 2006-06-25 devnull 			if(l > 1)
56 324891a5 2006-06-25 devnull 				memmove(q, data, l-1);
57 324891a5 2006-06-25 devnull 			q[l-1] ^= (data[l-1]^q[l-1]) & mr;
58 324891a5 2006-06-25 devnull 			q += i->width*sizeof(u32int);
59 324891a5 2006-06-25 devnull 			data += l;
60 324891a5 2006-06-25 devnull 		}
61 324891a5 2006-06-25 devnull 		return ndata;
62 324891a5 2006-06-25 devnull 	}
63 324891a5 2006-06-25 devnull 	for(y=r.min.y; y<r.max.y; y++){
64 324891a5 2006-06-25 devnull 		*q ^= (*data^*q) & m;
65 324891a5 2006-06-25 devnull 		if(l > 2)
66 324891a5 2006-06-25 devnull 			memmove(q+1, data+1, l-2);
67 324891a5 2006-06-25 devnull 		q[l-1] ^= (data[l-1]^q[l-1]) & mr;
68 324891a5 2006-06-25 devnull 		q += i->width*sizeof(u32int);
69 324891a5 2006-06-25 devnull 		data += l;
70 324891a5 2006-06-25 devnull 	}
71 324891a5 2006-06-25 devnull 	return ndata;
72 324891a5 2006-06-25 devnull }