2 Copyright 2004-2020 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, see <https://www.gnu.org/licenses/>.
22 #include "messagequeue.h"
26 static const char* TAG = "BoxStack";
28 BoxStack* BoxStack::instance = NULL;
34 osd = Osd::getInstance();
42 BoxStack* BoxStack::getInstance()
49 if (initted) return 0;
55 int BoxStack::shutdown()
57 if (!initted) return 0;
63 void BoxStack::removeAll()
65 removeAllExceptWallpaper();
66 if (numBoxes == 1) remove(boxes[0]);
69 int BoxStack::addVideoDisplay(Boxx* box,VideoDisplay vd)
72 videoStack.push(std::pair<Boxx*,VideoDisplay>(box,vd));
74 Video::getInstance()->setVideoDisplay(vd);
78 int BoxStack::add(Boxx* v)
80 if (!initted) return 0;
81 LogNT::getInstance()->debug(TAG, "add called");
83 LogNT::getInstance()->debug(TAG, "Locked for add");
87 LogNT::getInstance()->error(TAG, "More than 16 boxes! Unlocked for add");
91 boxes[numBoxes++] = v;
94 if (v->getVideoDisplay(vd)) {
95 LogNT::getInstance()->debug(TAG, "Add video display");
96 addVideoDisplay(v,vd);
101 LogNT::getInstance()->debug(TAG, "Unlocked for add");
106 // ---------------------------------------------------- REMOVE CODE
108 int BoxStack::remove(Boxx* toDelete)
110 if (!initted) return 0;
111 VideoDisplay *display = NULL;
114 LogNT::getInstance()->debug(TAG, "Locked for remove");
119 LogNT::getInstance()->error(TAG, "Unlocked for remove numBoxes == 0");
123 // LogNT::getInstance()->debug(TAG, "entering remove, numBoxes={}", numBoxes);
127 if (toDelete == NULL)
129 toDelete = boxes[numBoxes-1];
134 // to be deleted box is more likely to be at the top
135 for (i = numBoxes-1; i >= 0; i--)
137 // LogNT::getInstance()->debug(TAG, "todel: {}, i={}, boxes[i]={}", (void*)toDelete, i, (void*)boxes[i]);
138 if (boxes[i] == toDelete) break;
143 // not a Box we have!
146 LogNT::getInstance()->error(TAG, "Unlocked for remove - no boxx deleted");
153 toDelete->preDelete();
157 //LogNT::getInstance()->debug(TAG, "Starting repaintRevealed loop");
159 boxSplit(boxes[i]->area, i + 1, numBoxes, 1, rl);
162 repaintRevealed(i, rl.front());
165 //LogNT::getInstance()->debug(TAG, "Done repaintRevealed loop");
167 // Shift the boxes on top down one
169 for(int j = i; j < numBoxes; j++) boxes[j] = boxes[j+1];
171 // If there is only the wallpaper left signal command
174 Message* m = new Message();
175 m->p_to = Message::CONTROL;
176 m->message = Message::LAST_VIEW_CLOSE;
177 MessageQueue::getInstance()->postMessage(m);
180 if (!videoStack.empty() && videoStack.top().first==toDelete) {
182 if (!videoStack.empty()) display=&videoStack.top().second;
185 LogNT::getInstance()->debug(TAG, "Unlocked for remove");
188 //AVO: do this delete outside the lock to allow for recursive calls within the destructor
189 // as this box is not in the stack any more, there is no chance for a second delete
190 LogNT::getInstance()->debug(TAG, "remove: going to delete boxx {}, num {}", static_cast<void*>(toDelete), numBoxes);
196 LogNT::getInstance()->debug(TAG, "setVideoDisplay {} {} {} {} {} {}", display->mode, display->fallbackMode,
197 display->x, display->y, display->width, display->height);
198 Video::getInstance()->setVideoDisplay(*display);
204 void BoxStack::redrawAllBoxes()
208 for (int z = 0; z < numBoxes; z++)
214 update(NULL,NULL); // should blt all
217 void BoxStack::update(Boxx* toUpdate, const Region* regionToUpdate)
219 // LogNT::getInstance()->debug(TAG, "Update called");
220 if (!initted) return; // it is allowed to call this before init
222 // LogNT::getInstance()->debug(TAG, "Locked for update");
224 // Get the z index of the box
228 for (z = 0; z < numBoxes; z++)
230 if (boxes[z] == toUpdate) break;
235 // not a Box we have!
237 LogNT::getInstance()->error(TAG, "Unlocked for update! box not inside boxstack");
248 LogNT::getInstance()->debug(TAG, "Unlocked for update, no box present");
252 // get the region for the whole box, could be less than that
253 // for smaller updates
255 Region r = toUpdate->area;
259 // Can be null if the whole box should be updated
260 // If this is given the numbers are relative to the size of the box, not the screen
262 r.x += regionToUpdate->x;
263 r.y += regionToUpdate->y;
264 r.w = regionToUpdate->w;
265 r.h = regionToUpdate->h;
271 boxSplit(r, z+1, numBoxes, 1, rl);
281 // LogNT::getInstance()->debug(TAG, "Unlocked for update");
284 void BoxStack::repaintRevealed(int x, Region r)
287 boxSplit(r, x - 1, -1, -1, rl);
293 boxes[r2.z]->blt(r2);
298 void BoxStack::boxSplit(Region r, int start, int end, int direction, RegionList& rl)
300 // 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);
302 for(int z = start; z != end; z += direction)
304 if (r.overlappedBy(boxes[z]->area))
306 // printf("Z=%i S=%i E=%i D=%i: %i overlaps\n", z, start, end, direction, z);
311 if (boxes[z]->area.y > r.y)
313 // 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);
314 top = boxes[z]->area.y;
319 newR.h = boxes[z]->area.y - r.y;
320 boxSplit(newR, z + direction, end, direction, rl);
326 newR2.y = boxes[z]->area.y;
328 newR2.h = r.h - newR.h;
329 boxSplit(newR2, z, end, -1, rl);
334 if (boxes[z]->area.y2() < r.y2())
336 // 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);
337 btm = boxes[z]->area.y2();
340 newR.y = boxes[z]->area.y2() + 1;
342 newR.h = r.y2() - newR.y + 1;
343 boxSplit(newR, z + direction, end, direction, rl);
351 newR2.h = r.h - newR.h;
352 boxSplit(newR2, z, end, -1, rl);
357 if (boxes[z]->area.x > r.x)
359 // 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);
363 newR.w = boxes[z]->area.x - r.x;
364 newR.h = btm - top + 1;
365 boxSplit(newR, z + direction, end, direction, rl);
370 newR2.x = r.x + newR.w;
372 newR2.w = r.w - newR.w;
374 boxSplit(newR2, z, end, -1, rl);
379 if (boxes[z]->area.x2() < r.x2())
381 // 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);
383 newR.x = boxes[z]->area.x2() + 1;
385 newR.w = r.x2() - newR.x + 1;
386 newR.h = btm - top + 1;
387 boxSplit(newR, z + direction, end, direction, rl);
394 newR2.w = r.w - newR.w;
396 boxSplit(newR2, z, end, -1, rl);
403 // we are going down the stack
404 // r is underlapped by boxes[z]
405 // but we have not split
406 // Therefore this region under test is
407 // completely covering boxes[z]
409 // don't go any further down, generate a region and quit
411 // printf("Repaint region: %i %i %i %i\n", r.x, r.y, r.w, r.h);
416 // printf("Returning from Z=%i\n", z);
421 // printf("Z=%i S=%i E=%i D=%i: %i does not overlap\n", z, start, end, direction, z);
425 // if direction = 1 then we have come to a region that is
426 // entirely clear of higher boxes and needs to be redrawn
428 // if direction = -1 then we have come to a region that is on
429 // the very bottom with nothing below it to repaint.
430 // do nothing. stale window data will be left on screen?
438 void BoxStack::removeAllExceptWallpaper()
440 // 1.. Don't delete wallpaper. No point.
442 // Need locking on this one??
444 // This is pretty silly now that preDelete needs mutex unlocked
447 VideoDisplay *display = NULL;
459 toDel = boxes[numBoxes - 1];
467 // If boxes[numBoxes - 1] isn't toDel then there's a problem
468 if (boxes[numBoxes - 1] == toDel)
474 LogNT::getInstance()->error(TAG, "Can this actually happen? Why?");
478 // FIXME what is this?
479 if (!videoStack.empty() && videoStack.top().first==toDel) {
481 if (!videoStack.empty()) display=&videoStack.top().second;
485 //AVO: do the delete outside the lock to allow for recursive deletes
486 LogNT::getInstance()->debug(TAG, "removeall: going to delete boxx {}, num={}", static_cast<void*>(toDel), numBoxes);
487 if (display) Video::getInstance()->setVideoDisplay(*display);
489 if (toDel) delete toDel;
493 int BoxStack::handleCommand(int command)
499 LogNT::getInstance()->debug(TAG, "handle command {}", command);
501 if (command != Input::NA_NONE)
503 // handle command return values
504 // 0 - drop through to next box
505 // 1 - dont drop to next box, but not handled
506 // 2 - handled - stop command here
507 // 4 - handled - delete this box
509 for (i=numBoxes-1; i>=0; i--)
511 LogNT::getInstance()->debug(TAG, "Giving command to i={}", i);
512 retVal = boxes[i]->handleCommand(command);
513 if (retVal == ABANDON_COMMAND)
515 // not handled but don't give to any more boxes
519 if (retVal == COMMAND_HANDLED)
524 else if (retVal == DELETE_ME)
526 // LogNT::getInstance()->debug(TAG, "Return 4: i={}, boxes[i]={}", i, (void*)boxes[i]);
535 // fake the return code
542 void BoxStack::processMessage(Message* m)
544 if (m->p_to == Message::MOUSE_RECEIVER)
546 // Handle mouse events
547 // They just need to be delivered to top box
548 if (numBoxes > 1) boxes[numBoxes-1]->processMessage(m);
551 else if (m->p_to == Message::BOXSTACK)
555 case Message::CLOSE_ME:
557 remove(static_cast<Boxx*>(m->from));
560 case Message::ADD_VIEW:
562 Boxx* toAdd = reinterpret_cast<Boxx*>(m->data);