2 Copyright 2004-2005 Chris Tallon
4 This file is part of VOMP.
6 VOMP is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2 of the License, or
9 (at your option) any later version.
11 VOMP is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with VOMP; if not, write to the Free Software
18 Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
24 #include "messagequeue.h"
28 BoxStack* BoxStack::instance = NULL;
43 BoxStack* BoxStack::getInstance()
50 if (initted) return 0;
56 int BoxStack::shutdown()
58 if (!initted) return 0;
64 void BoxStack::removeAll()
66 removeAllExceptWallpaper();
67 if (numBoxes == 1) remove(boxes[0]);
70 int BoxStack::addVideoDisplay(Boxx* box,VideoDisplay vd)
73 videoStack.push(std::pair<Boxx*,VideoDisplay>(box,vd));
75 Video::getInstance()->setVideoDisplay(vd);
79 int BoxStack::add(Boxx* v)
81 if (!initted) return 0;
82 Log::getInstance()->log("BoxStack", Log::DEBUG, "add called");
84 Log::getInstance()->log("BoxStack", Log::DEBUG, "Locked for add");
88 Log::getInstance()->log("BoxStack", Log::ERR, "More than 16 boxes! Unlocked for add");
92 boxes[numBoxes++] = v;
95 if (v->getVideoDisplay(vd)) {
96 Log::getInstance()->log("BoxStack", Log::DEBUG, "Add video display");
97 addVideoDisplay(v,vd);
102 Log::getInstance()->log("BoxStack", Log::DEBUG, "Unlocked for add");
107 // ---------------------------------------------------- REMOVE CODE
109 int BoxStack::remove(Boxx* toDelete)
111 if (!initted) return 0;
112 VideoDisplay *display = NULL;
115 Log::getInstance()->log("BoxStack", Log::DEBUG, "Locked for remove");
120 Log::getInstance()->log("BoxStack", Log::ERR, "Unlocked for remove numBoxes == 0");
124 // Log::getInstance()->log("BoxStack", Log::DEBUG, "entering remove, numBoxes=%i", numBoxes);
128 if (toDelete == NULL)
130 toDelete = boxes[numBoxes-1];
135 // to be deleted box is more likely to be at the top
136 for (i = numBoxes-1; i >= 0; i--)
138 // Log::getInstance()->log("BoxStack", Log::DEBUG, "todel: %p, i=%i, boxes[i]=%p", toDelete, i, boxes[i]);
139 if (boxes[i] == toDelete) break;
144 // not a Box we have!
147 Log::getInstance()->log("BoxStack", Log::ERR, "Unlocked for remove - no boxx deleted");
154 toDelete->preDelete();
158 // Log::getInstance()->log("BoxStack", Log::DEBUG, "Starting deleteBox");
160 // Log::getInstance()->log("BoxStack", Log::DEBUG, "Done deleteBox");
162 // Shift the boxes on top down one
164 for(int j = i; j < numBoxes; j++) boxes[j] = boxes[j+1];
166 // If there is only the wallpaper left signal command
169 Message* m = new Message();
170 m->to = Command::getInstance();
171 m->message = Message::LAST_VIEW_CLOSE;
172 MessageQueue::getInstance()->postMessage(m);
175 if (!videoStack.empty() && videoStack.top().first==toDelete) {
177 if (!videoStack.empty()) display=&videoStack.top().second;
180 Log::getInstance()->log("BoxStack", Log::DEBUG, "Unlocked for remove");
183 //AVO: do this delete outside the lock to allow for recursive calls within the destructor
184 // as this box is not in the stack any more, there is no chance for a second delete
185 Log::getInstance()->log("BoxStack", Log::DEBUG, "remove: going to delete boxx %p, num %d", toDelete, numBoxes);
188 Log::getInstance()->log("BoxStack", Log::DEBUG, "setVideoDisplay %d %d %d %d %d %d", display->mode, display->fallbackMode,
189 display->x, display->y, display->width, display->height);
190 Video::getInstance()->setVideoDisplay(*display);
196 /////////////////////////////////////////////////////////////////////////////
198 /////////////////////////////////////////////////////////////////////////////
200 void BoxStack::deleteBox(int z)
202 // Log::getInstance()->log("BoxStack", Log::DEBUG, "Delete box %i of %i", z, numBoxes);
204 boxSplit(boxes[z]->area, z + 1, numBoxes, 1, rl);
207 repaintRevealed(z, rl.front());
212 void BoxStack::redrawAllBoxes()
216 for (int z = 0; z < numBoxes; z++)
223 update(NULL,NULL); // should blt all
226 void BoxStack::update(Boxx* toUpdate, Region* regionToUpdate)
228 Log::getInstance()->log("BoxStack", Log::DEBUG, "Update called");
229 if (!initted) return; // it is allowed to call this before init
231 Log::getInstance()->log("BoxStack", Log::DEBUG, "Locked for update");
233 // Get the z index of the box
237 for (z = 0; z < numBoxes; z++)
239 if (boxes[z] == toUpdate) break;
244 // not a Box we have!
246 Log::getInstance()->log("BoxStack", Log::ERR, "Unlocked for update! box not inside boxstack");
257 Log::getInstance()->log("BoxStack", Log::DEBUG, "Unlocked for update, no box present");
261 // get the region for the whole box, could be less than that
262 // for smaller updates
264 Region r = toUpdate->area;
268 // Can be null if the whole box should be updated
269 // If this is given the numbers are relative to the size of the box, not the screen
271 r.x += regionToUpdate->x;
272 r.y += regionToUpdate->y;
273 r.w = regionToUpdate->w;
274 r.h = regionToUpdate->h;
280 boxSplit(r, z+1, numBoxes, 1, rl);
290 Log::getInstance()->log("BoxStack", Log::DEBUG, "Unlocked for update");
293 void BoxStack::repaintRevealed(int x, Region r)
296 boxSplit(r, x - 1, -1, -1, rl);
302 boxes[r2.z]->blt(r2);
307 void BoxStack::boxSplit(Region r, int start, int end, int direction, RegionList& rl)
309 // 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);
311 for(int z = start; z != end; z += direction)
313 if (r.overlappedBy(boxes[z]->area))
315 // printf("Z=%i S=%i E=%i D=%i: %i overlaps\n", z, start, end, direction, z);
320 if (boxes[z]->area.y > r.y)
322 // 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);
323 top = boxes[z]->area.y;
328 newR.h = boxes[z]->area.y - r.y;
329 boxSplit(newR, z + direction, end, direction, rl);
335 newR2.y = boxes[z]->area.y;
337 newR2.h = r.h - newR.h;
338 boxSplit(newR2, z, end, -1, rl);
343 if (boxes[z]->area.y2() < r.y2())
345 // 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);
346 btm = boxes[z]->area.y2();
349 newR.y = boxes[z]->area.y2() + 1;
351 newR.h = r.y2() - newR.y + 1;
352 boxSplit(newR, z + direction, end, direction, rl);
360 newR2.h = r.h - newR.h;
361 boxSplit(newR2, z, end, -1, rl);
366 if (boxes[z]->area.x > r.x)
368 // 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);
372 newR.w = boxes[z]->area.x - r.x;
373 newR.h = btm - top + 1;
374 boxSplit(newR, z + direction, end, direction, rl);
379 newR2.x = r.x + newR.w;
381 newR2.w = r.w - newR.w;
383 boxSplit(newR2, z, end, -1, rl);
388 if (boxes[z]->area.x2() < r.x2())
390 // 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);
392 newR.x = boxes[z]->area.x2() + 1;
394 newR.w = r.x2() - newR.x + 1;
395 newR.h = btm - top + 1;
396 boxSplit(newR, z + direction, end, direction, rl);
403 newR2.w = r.w - newR.w;
405 boxSplit(newR2, z, end, -1, rl);
412 // we are going down the stack
413 // r is underlapped by boxes[z]
414 // but we have not split
415 // Therefore this region under test is
416 // completely covering boxes[z]
418 // don't go any further down, generate a region and quit
420 // printf("Repaint region: %i %i %i %i\n", r.x, r.y, r.w, r.h);
425 // printf("Returning from Z=%i\n", z);
430 // printf("Z=%i S=%i E=%i D=%i: %i does not overlap\n", z, start, end, direction, z);
434 // if direction = 1 then we have come to a region that is
435 // entirely clear of higher boxes and needs to be redrawn
437 // if direction = -1 then we have come to a region that is on
438 // the very bottom with nothing below it to repaint.
439 // do nothing. stale window data will be left on screen?
447 /////////////////////////////////////////////////////////////////////////////
449 /////////////////////////////////////////////////////////////////////////////
451 // ---------------------------------------------------- END OF REMOVE CODE
454 void BoxStack::removeAllExceptWallpaper()
456 // 1.. Don't delete wallpaper. No point.
458 // Need locking on this one??
460 // This is pretty silly now that preDelete needs mutex unlocked
463 VideoDisplay *display = NULL;
475 toDel = boxes[numBoxes - 1];
483 // If boxes[numBoxes - 1] isn't toDel then there's a problem
484 if (boxes[numBoxes - 1] == toDel)
490 Log::getInstance()->log("BoxStack", Log::ERR, "Can this actually happen? Why?");
494 if (!videoStack.empty() && videoStack.top().first==toDel) {
496 if (!videoStack.empty()) display=&videoStack.top().second;
500 //AVO: do the delete outside the lock to allow for recursive deletes
501 Log::getInstance()->log("BoxStack", Log::DEBUG, "going to delete boxx %p, num=%d", toDel, numBoxes);
502 if (display) Video::getInstance()->setVideoDisplay(*display);
505 if (toDel) delete toDel;
511 int BoxStack::handleCommand(int command)
517 if (command != Remote::NA_NONE)
519 // handle command return values
520 // 0 - drop through to next box
521 // 1 - dont drop to next box, but not handled
522 // 2 - handled - stop command here
523 // 4 - handled - delete this box
525 for (i=numBoxes-1; i>=0; i--)
527 // Log::getInstance()->log("BoxStack", Log::DEBUG, "Giving command to i=%i", i);
528 retVal = boxes[i]->handleCommand(command);
531 // not handled but don't give to any more boxes
541 else if (retVal == 4)
543 // Log::getInstance()->log("BoxStack", Log::DEBUG, "Return 4: i=%i, boxes[i]=%p", i, boxes[i]);
552 // fake the return code
559 void BoxStack::processMessage(Message* m)
563 for (int i = numBoxes-1; i >= 0; i--)
565 if (boxes[i] == m->to)
567 Log::getInstance()->log("BoxStack", Log::DEBUG, "sending message from box %p to box %p %lu", m->from, m->to, m->message);
568 boxes[i]->processMessage(m);
575 /* Handle mouse events*/
576 // They come in with m->to = NULL? and just need to be delivered to top box?
577 if ((numBoxes > 1) && ((m->message == Message::MOUSE_MOVE) || (m->message == Message::MOUSE_LBDOWN)
578 || (m->message == Message::MOUSE_SCROLL)))
580 boxes[numBoxes-1]->processMessage(m);
584 Log::getInstance()->log("BoxStack", Log::DEBUG, "it's for meeee!");
588 case Message::CLOSE_ME:
590 remove((Boxx*)m->from);
593 case Message::ADD_VIEW:
595 Boxx* toAdd = (Boxx*)m->parameter;