2 Copyright 2004-2005 Chris Tallon
\r
4 This file is part of VOMP.
\r
6 VOMP is free software; you can redistribute it and/or modify
\r
7 it under the terms of the GNU General Public License as published by
\r
8 the Free Software Foundation; either version 2 of the License, or
\r
9 (at your option) any later version.
\r
11 VOMP is distributed in the hope that it will be useful,
\r
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
\r
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
\r
14 GNU General Public License for more details.
\r
16 You should have received a copy of the GNU General Public License
\r
17 along with VOMP; if not, write to the Free Software
\r
18 Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
\r
21 #include "boxstack.h"
\r
23 #include "command.h"
\r
27 BoxStack* BoxStack::instance = NULL;
\r
29 BoxStack::BoxStack()
\r
31 if (instance) return;
\r
37 BoxStack::~BoxStack()
\r
42 BoxStack* BoxStack::getInstance()
\r
47 int BoxStack::init()
\r
49 if (initted) return 0;
\r
53 pthread_mutex_init(&boxLock, NULL);
\r
55 boxLock = CreateMutex(NULL,FALSE,NULL);
\r
61 int BoxStack::shutdown()
\r
63 if (!initted) return 0;
\r
65 // FIXME don't think this can work properly, removeAll leaves the wallpaper there!
\r
72 int BoxStack::add(Boxx* v)
\r
74 if (!initted) return 0;
\r
75 Log::getInstance()->log("BoxStack", Log::DEBUG, "add called");
\r
77 pthread_mutex_lock(&boxLock);
\r
79 WaitForSingleObject(boxLock, INFINITE);
\r
81 Log::getInstance()->log("BoxStack", Log::DEBUG, "Locked for add");
\r
85 Log::getInstance()->log("BoxStack", Log::ERR, "More than 16 boxes! Unlocked for add");
\r
87 pthread_mutex_unlock(&boxLock);
\r
89 ReleaseMutex(boxLock);
\r
93 boxes[numBoxes++] = v;
\r
96 pthread_mutex_unlock(&boxLock);
\r
98 ReleaseMutex(boxLock);
\r
101 Log::getInstance()->log("BoxStack", Log::DEBUG, "Unlocked for add");
\r
106 // ---------------------------------------------------- REMOVE CODE
\r
108 int BoxStack::remove(Boxx* toDelete)
\r
110 if (!initted) return 0;
\r
113 pthread_mutex_lock(&boxLock);
\r
115 WaitForSingleObject(boxLock, INFINITE);
\r
117 Log::getInstance()->log("BoxStack", Log::DEBUG, "Locked for remove");
\r
122 pthread_mutex_unlock(&boxLock);
\r
124 ReleaseMutex(boxLock);
\r
126 Log::getInstance()->log("BoxStack", Log::ERR, "Unlocked for remove numBoxes == 0");
\r
130 // Log::getInstance()->log("BoxStack", Log::DEBUG, "entering remove, numBoxes=%i", numBoxes);
\r
134 if (toDelete == NULL)
\r
136 toDelete = boxes[numBoxes-1];
\r
141 // to be deleted box is more likely to be at the top
\r
142 for (i = numBoxes-1; i >= 0; i--)
\r
144 // Log::getInstance()->log("BoxStack", Log::DEBUG, "todel: %p, i=%i, boxes[i]=%p", toDelete, i, boxes[i]);
\r
145 if (boxes[i] == toDelete) break;
\r
150 // not a Box we have!
\r
153 pthread_mutex_unlock(&boxLock);
\r
155 ReleaseMutex(boxLock);
\r
157 Log::getInstance()->log("BoxStack", Log::ERR, "Unlocked for remove - no boxx deleted");
\r
163 pthread_mutex_unlock(&boxLock);
\r
165 ReleaseMutex(boxLock);
\r
168 toDelete->preDelete();
\r
171 pthread_mutex_lock(&boxLock);
\r
173 WaitForSingleObject(boxLock, INFINITE);
\r
176 // Log::getInstance()->log("BoxStack", Log::DEBUG, "Starting deleteBox");
\r
178 // Log::getInstance()->log("BoxStack", Log::DEBUG, "Done deleteBox");
\r
180 // Shift the boxes on top down one
\r
182 for(int j = i; j < numBoxes; j++) boxes[j] = boxes[j+1];
\r
184 // If there is only the wallpaper left signal command
\r
187 Message* m = new Message();
\r
188 m->to = Command::getInstance();
\r
189 m->message = Message::LAST_VIEW_CLOSE;
\r
190 Command::getInstance()->postMessageNoLock(m);
\r
194 pthread_mutex_unlock(&boxLock);
\r
196 ReleaseMutex(boxLock);
\r
198 Log::getInstance()->log("BoxStack", Log::DEBUG, "Unlocked for remove");
\r
201 //AVO: do this delete outside the lock to allow for recursive calls within the destructor
\r
202 // as this box is not in the stack any more, there is no chance for a second delete
\r
203 Log::getInstance()->log("BoxStack", Log::DEBUG, "remove: going to delete boxx %p, num %d", toDelete, numBoxes);
\r
209 /////////////////////////////////////////////////////////////////////////////
\r
211 /////////////////////////////////////////////////////////////////////////////
\r
213 void BoxStack::deleteBox(int z)
\r
215 // Log::getInstance()->log("BoxStack", Log::DEBUG, "Delete box %i of %i", z, numBoxes);
\r
217 boxSplit(boxes[z]->area, z + 1, numBoxes, 1, rl);
\r
220 repaintRevealed(z, rl.front());
\r
225 void BoxStack::update(Boxx* toUpdate, Region* regionToUpdate)
\r
227 Log::getInstance()->log("BoxStack", Log::DEBUG, "Update called");
\r
230 pthread_mutex_lock(&boxLock);
\r
232 WaitForSingleObject(boxLock, INFINITE);
\r
234 Log::getInstance()->log("BoxStack", Log::DEBUG, "Locked for update");
\r
236 // Get the z index of the box
\r
240 for (z = 0; z < numBoxes; z++)
\r
242 if (boxes[z] == toUpdate) break;
\r
247 // not a Box we have!
\r
249 pthread_mutex_unlock(&boxLock);
\r
251 ReleaseMutex(boxLock);
\r
253 Log::getInstance()->log("BoxStack", Log::ERR, "Unlocked for update! box not inside boxstack");
\r
259 toUpdate = boxes[0];
\r
262 // get the region for the whole box, could be less than that
\r
263 // for smaller updates
\r
265 Region r = toUpdate->area;
\r
267 if (regionToUpdate)
\r
269 // Can be null if the whole box should be updated
\r
270 // If this is given the numbers are relative to the size of the box, not the screen
\r
272 r.x += regionToUpdate->x;
\r
273 r.y += regionToUpdate->y;
\r
274 r.w = regionToUpdate->w;
\r
275 r.h = regionToUpdate->h;
\r
281 boxSplit(r, z+1, numBoxes, 1, rl);
\r
291 pthread_mutex_unlock(&boxLock);
\r
293 ReleaseMutex(boxLock);
\r
295 Log::getInstance()->log("BoxStack", Log::DEBUG, "Unlocked for update");
\r
298 void BoxStack::repaintRevealed(int x, Region r)
\r
301 boxSplit(r, x - 1, -1, -1, rl);
\r
307 boxes[r2.z]->blt(r2);
\r
312 void BoxStack::boxSplit(Region r, int start, int end, int direction, RegionList& rl)
\r
314 // printf("Y= S=%i E=%i D=%i: Boxsplit: %i %i %i %i\n", start, end, direction, r.x, r.y, r.w, r.h);
\r
316 for(int z = start; z != end; z += direction)
\r
318 if (r.overlappedBy(boxes[z]->area))
\r
320 // printf("Z=%i S=%i E=%i D=%i: %i overlaps\n", z, start, end, direction, z);
\r
325 if (boxes[z]->area.y > r.y)
\r
327 // printf("Z=%i S=%i E=%i D=%i: Case 1 for %i %i %i %i split by %i: %i %i %i %i\n", z, start, end, direction, r.x, r.y, r.w, r.h, z, boxes[z]->area.x, boxes[z]->area.y, boxes[z]->area.w, boxes[z]->area.h);
\r
328 top = boxes[z]->area.y;
\r
333 newR.h = boxes[z]->area.y - r.y;
\r
334 boxSplit(newR, z + direction, end, direction, rl);
\r
336 if (direction == -1)
\r
340 newR2.y = boxes[z]->area.y;
\r
342 newR2.h = r.h - newR.h;
\r
343 boxSplit(newR2, z, end, -1, rl);
\r
348 if (boxes[z]->area.y2() < r.y2())
\r
350 // printf("Z=%i S=%i E=%i D=%i: Case 2 for %i %i %i %i split by %i: %i %i %i %i\n", z, start, end, direction, r.x, r.y, r.w, r.h, z, boxes[z]->area.x, boxes[z]->area.y, boxes[z]->area.w, boxes[z]->area.h);
\r
351 btm = boxes[z]->area.y2();
\r
354 newR.y = boxes[z]->area.y2() + 1;
\r
356 newR.h = r.y2() - newR.y + 1;
\r
357 boxSplit(newR, z + direction, end, direction, rl);
\r
359 if (direction == -1)
\r
365 newR2.h = r.h - newR.h;
\r
366 boxSplit(newR2, z, end, -1, rl);
\r
371 if (boxes[z]->area.x > r.x)
\r
373 // printf("Z=%i S=%i E=%i D=%i: Case 3 for %i %i %i %i split by %i: %i %i %i %i\n", z, start, end, direction, r.x, r.y, r.w, r.h, z, boxes[z]->area.x, boxes[z]->area.y, boxes[z]->area.w, boxes[z]->area.h);
\r
377 newR.w = boxes[z]->area.x - r.x;
\r
378 newR.h = btm - top + 1;
\r
379 boxSplit(newR, z + direction, end, direction, rl);
\r
381 if (direction == -1)
\r
384 newR2.x = r.x + newR.w;
\r
386 newR2.w = r.w - newR.w;
\r
388 boxSplit(newR2, z, end, -1, rl);
\r
393 if (boxes[z]->area.x2() < r.x2())
\r
395 // printf("Z=%i S=%i E=%i D=%i: Case 4 for %i %i %i %i split by %i: %i %i %i %i\n", z, start, end, direction, r.x, r.y, r.w, r.h, z, boxes[z]->area.x, boxes[z]->area.y, boxes[z]->area.w, boxes[z]->area.h);
\r
397 newR.x = boxes[z]->area.x2() + 1;
\r
399 newR.w = r.x2() - newR.x + 1;
\r
400 newR.h = btm - top + 1;
\r
401 boxSplit(newR, z + direction, end, direction, rl);
\r
403 if (direction == -1)
\r
408 newR2.w = r.w - newR.w;
\r
410 boxSplit(newR2, z, end, -1, rl);
\r
415 if (direction == -1)
\r
417 // we are going down the stack
\r
418 // r is underlapped by boxes[z]
\r
419 // but we have not split
\r
420 // Therefore this region under test is
\r
421 // completely covering boxes[z]
\r
423 // don't go any further down, generate a region and quit
\r
425 // printf("Repaint region: %i %i %i %i\n", r.x, r.y, r.w, r.h);
\r
430 // printf("Returning from Z=%i\n", z);
\r
435 // printf("Z=%i S=%i E=%i D=%i: %i does not overlap\n", z, start, end, direction, z);
\r
439 // if direction = 1 then we have come to a region that is
\r
440 // entirely clear of higher boxes and needs to be redrawn
\r
442 // if direction = -1 then we have come to a region that is on
\r
443 // the very bottom with nothing below it to repaint.
\r
444 // do nothing. stale window data will be left on screen?
\r
446 if (direction == 1)
\r
452 /////////////////////////////////////////////////////////////////////////////
\r
454 /////////////////////////////////////////////////////////////////////////////
\r
456 // ---------------------------------------------------- END OF REMOVE CODE
\r
459 void BoxStack::removeAll()
\r
461 // 1.. Don't delete wallpaper. No point.
\r
463 // Need locking on this one??
\r
465 // This is pretty silly now that preDelete needs mutex unlocked
\r
467 Boxx* toDel = NULL;
\r
469 while(numBoxes > 1)
\r
472 pthread_mutex_lock(&boxLock);
\r
474 WaitForSingleObject(boxLock, INFINITE);
\r
480 pthread_mutex_unlock(&boxLock);
\r
482 ReleaseMutex(boxLock);
\r
487 toDel = boxes[numBoxes - 1];
\r
490 pthread_mutex_unlock(&boxLock);
\r
492 ReleaseMutex(boxLock);
\r
495 toDel->preDelete();
\r
498 pthread_mutex_lock(&boxLock);
\r
500 WaitForSingleObject(boxLock, INFINITE);
\r
503 // If boxes[numBoxes - 1] isn't toDel then there's a problem
\r
504 if (boxes[numBoxes - 1] == toDel)
\r
510 Log::getInstance()->log("BoxStack", Log::ERR, "Can this actually happen? Why?");
\r
515 pthread_mutex_unlock(&boxLock);
\r
517 ReleaseMutex(boxLock);
\r
520 //AVO: do the delete outside the lock to allow for recursive deletes
\r
521 Log::getInstance()->log("BoxStack", Log::DEBUG, "going to delete boxx %p, num=%d", toDel, numBoxes);
\r
522 if (toDel) delete toDel;
\r
526 int BoxStack::handleCommand(int command)
\r
532 if (command != Remote::NA_NONE)
\r
534 // handle command return values
\r
535 // 0 - drop through to next box
\r
536 // 1 - dont drop to next box, but not handled
\r
537 // 2 - handled - stop command here
\r
538 // 4 - handled - delete this box
\r
540 for (i=numBoxes-1; i>=0; i--)
\r
542 // Log::getInstance()->log("BoxStack", Log::DEBUG, "Giving command to i=%i", i);
\r
543 retVal = boxes[i]->handleCommand(command);
\r
546 // not handled but don't give to any more boxes
\r
556 else if (retVal == 4)
\r
558 // Log::getInstance()->log("BoxStack", Log::DEBUG, "Return 4: i=%i, boxes[i]=%p", i, boxes[i]);
\r
567 // fake the return code
\r
574 void BoxStack::processMessage(Message* m)
\r
578 for (int i = numBoxes-1; i >= 0; i--)
\r
580 if (boxes[i] == m->to)
\r
582 Log::getInstance()->log("BoxStack", Log::DEBUG, "sending message from box %p to box %p %lu", m->from, m->to, m->message);
\r
583 boxes[i]->processMessage(m);
\r
590 /* Handle mouse events*/
\r
591 // They come in with m->to = NULL? and just need to be delivered to top box?
\r
592 if ((numBoxes > 1) && ((m->message == Message::MOUSE_MOVE) || (m->message == Message::MOUSE_LBDOWN)
\r
593 || (m->message == Message::MOUSE_ANDROID_SCROLL)))
\r
595 boxes[numBoxes-1]->processMessage(m);
\r
599 Log::getInstance()->log("BoxStack", Log::DEBUG, "it's for meeee!");
\r
603 case Message::CLOSE_ME:
\r
605 remove((Boxx*)m->from);
\r
608 case Message::ADD_VIEW: // currently not used by anything but it might come in useful again
\r
610 Boxx* toAdd = (Boxx*)m->parameter;
\r