mirror of
https://github.com/bsnes-emu/bsnes.git
synced 2025-10-04 02:11:55 +02:00
84e98833ca
byuu says:
This release refines HSU1 support as a bidirectional protocol, nests SFC
manifests as "release/cartridge" and "release/information" (but release/
is not guaranteed to be finalized just yet), removes the database
integration, and adds support for ananke.
ananke represents inevitability. It's a library that, when installed,
higan can use to load files from the command-line, and also from a new
File -> Load Game menu option.
I need to change the build rules a bit for it to work on Windows (need
to make phoenix a DLL, basically), but it works now on Linux.
Right now, it only takes *.sfc file names, looks them up in the included
database, converts them to game folders, and returns the game folder
path for higan to load.
The idea is to continue expanding it to support everything we can that
I don't want in the higan core:
- load *.sfc, *.smc, *.swc, *.fig files
- remove SNES copier headers
- split apart merged firmware files
- pull in external firmware files (eg dsp1b.rom - these are staying
merged, just as SPC7110 prg+dat are merged)
- load *.zip and *.7z archives
- prompt for selection on multi-file archives
- generate manifest files based on heuristics
- apply BPS patches
The "Load" menu option has been renamed to "Library", to represent games
in your library. I'm going to add some sort of suffix to indicate
unverified games, and use a different folder icon for those (eg
manifests built on heuristics rather than from the database.)
So basically, to future end users:
File -> Load Game will be how they play games.
Library -> (specific system) can be thought of as an infinitely-sized
recent games list.
purify will likely become a simple stub that invokes ananke's functions.
No reason to duplicate all that code.
110 lines
2.9 KiB
C++
110 lines
2.9 KiB
C++
#ifndef NALL_PRIORITY_QUEUE_HPP
|
|
#define NALL_PRIORITY_QUEUE_HPP
|
|
|
|
#include <limits>
|
|
#include <nall/function.hpp>
|
|
#include <nall/serializer.hpp>
|
|
#include <nall/utility.hpp>
|
|
|
|
namespace nall {
|
|
template<typename type_t> void priority_queue_nocallback(type_t) {}
|
|
|
|
//priority queue implementation using binary min-heap array;
|
|
//does not require normalize() function.
|
|
//O(1) find (tick)
|
|
//O(log n) append (enqueue)
|
|
//O(log n) remove (dequeue)
|
|
template<typename type_t> class priority_queue {
|
|
public:
|
|
inline void tick(unsigned ticks) {
|
|
basecounter += ticks;
|
|
while(heapsize && gte(basecounter, heap[0].counter)) callback(dequeue());
|
|
}
|
|
|
|
//counter is relative to current time (eg enqueue(64, ...) fires in 64 ticks);
|
|
//counter cannot exceed std::numeric_limits<unsigned>::max() >> 1.
|
|
void enqueue(unsigned counter, type_t event) {
|
|
unsigned child = heapsize++;
|
|
counter += basecounter;
|
|
|
|
while(child) {
|
|
unsigned parent = (child - 1) >> 1;
|
|
if(gte(counter, heap[parent].counter)) break;
|
|
|
|
heap[child].counter = heap[parent].counter;
|
|
heap[child].event = heap[parent].event;
|
|
child = parent;
|
|
}
|
|
|
|
heap[child].counter = counter;
|
|
heap[child].event = event;
|
|
}
|
|
|
|
type_t dequeue() {
|
|
type_t event(heap[0].event);
|
|
unsigned parent = 0;
|
|
unsigned counter = heap[--heapsize].counter;
|
|
|
|
while(true) {
|
|
unsigned child = (parent << 1) + 1;
|
|
if(child >= heapsize) break;
|
|
if(child + 1 < heapsize && gte(heap[child].counter, heap[child + 1].counter)) child++;
|
|
if(gte(heap[child].counter, counter)) break;
|
|
|
|
heap[parent].counter = heap[child].counter;
|
|
heap[parent].event = heap[child].event;
|
|
parent = child;
|
|
}
|
|
|
|
heap[parent].counter = counter;
|
|
heap[parent].event = heap[heapsize].event;
|
|
return event;
|
|
}
|
|
|
|
void reset() {
|
|
basecounter = 0;
|
|
heapsize = 0;
|
|
}
|
|
|
|
void serialize(serializer &s) {
|
|
s.integer(basecounter);
|
|
s.integer(heapsize);
|
|
for(unsigned n = 0; n < heapcapacity; n++) {
|
|
s.integer(heap[n].counter);
|
|
s.integer(heap[n].event);
|
|
}
|
|
}
|
|
|
|
priority_queue(unsigned size, function<void (type_t)> callback_ = &priority_queue_nocallback<type_t>)
|
|
: callback(callback_) {
|
|
heap = new heap_t[size];
|
|
heapcapacity = size;
|
|
reset();
|
|
}
|
|
|
|
~priority_queue() {
|
|
delete[] heap;
|
|
}
|
|
|
|
priority_queue& operator=(const priority_queue&) = delete;
|
|
priority_queue(const priority_queue&) = delete;
|
|
|
|
private:
|
|
function<void (type_t)> callback;
|
|
unsigned basecounter;
|
|
unsigned heapsize;
|
|
unsigned heapcapacity;
|
|
struct heap_t {
|
|
unsigned counter;
|
|
type_t event;
|
|
} *heap;
|
|
|
|
//return true if x is greater than or equal to y
|
|
inline bool gte(unsigned x, unsigned y) {
|
|
return x - y < (std::numeric_limits<unsigned>::max() >> 1);
|
|
}
|
|
};
|
|
}
|
|
|
|
#endif
|