| Commit message (Collapse) | Author | Age | Files | Lines |
| |\
| |
| | |
service/am: Correct behavior of CreateTransferMemoryStorage()
|
| | |
| |
| |
| |
| |
| |
| |
| | |
For whatever reason, shared memory was being used here instead of
transfer memory, which (quite clearly) will not work based off the name
of the function.
This corrects this wonky usage of shared memory.
|
| | |
| |
| |
| | |
Also amend erroneous use of size_t. We should be using u64 here.
|
| |\ \
| | |
| | | |
Better LZ4 compression utilization for the disk based shader cache and the yuzu build system
|
| | | | |
|
| | | |
| | |
| | |
| | | |
decompression instead.
|
| |\ \ \
| | | |
| | | | |
kernel/object: Remove unused handle type entry
|
| | | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
The AddressArbiter type isn't actually used, given the arbiter itself
isn't a direct kernel object (or object that implements the wait object
facilities).
Given this, we can remove the enum entry entirely.
|
| |\ \ \ \
| |_|_|/
|/| | | |
service/am: Implement EnterFatalSection/LeaveFatalSection
|
| | | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
These functions act in tandem similar to how a lock or mutex require a
balanced lock()/unlock() sequence.
EnterFatalSection simply increments a counter for how many times it has
been called, while LeaveFatalSection ensures that a previous call to
EnterFatalSection has occured. If a previous call has occurred (the
counter is not zero), then the counter gets decremented as one would
expect. If a previous call has not occurred (the counter is zero), then
an error code is returned.
|
| | | | |
| | | |
| | | |
| | | |
| | | | |
Makes the declaration order of the handling functions consistent with
the handler table itself.
|
| |\ \ \ \
| | | | |
| | | | | |
kernel/shared_memory: Sanitize supplied size when unmapping
|
| | | | | |
| | | | |
| | | | |
| | | | |
| | | | | |
Nothing from this header is used, so we can remove this include, getting
rid of a dependency on it.
|
| | | |_|/
| |/| |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
The kernel makes sure that the given size to unmap is always the same
size as the entire region managed by the shared memory instance,
otherwise it returns an error code signifying an invalid size.
This is similarly done for transfer memory (which we already check for).
|
| |\ \ \ \
| |_|_|/
|/| | | |
kernel/thread: Minor interface cleanup
|
| | | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
Now that ShouldWait() is a const qualified member function, this one can
be made const qualified as well, since it can handle passing a const
qualified this pointer to ShouldWait().
|
| | | | |
| | | |
| | | |
| | | |
| | | | |
Given this is intended as a querying function, it doesn't make sense to
allow the implementer to modify the state of the given thread.
|
| | | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
Previously this was performing a u64 + int sign conversion. When dealing
with addresses, we should generally be keeping the arithmetic in the
same signedness type.
This also gets rid of the static lifetime of the constant, as there's no
need to make a trivial type like this potentially live for the entire
duration of the program.
|
| | | | |
| | | |
| | | |
| | | |
| | | | |
The pointed to member is never actually modified, so it can be made
const.
|
| |\ \ \ \
| | | | |
| | | | | |
kernel/svc: Implement svcGetProcessList and svcGetThreadList
|
| | | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | | |
Similarly like svcGetProcessList, this retrieves the list of threads
from the current process. In the kernel itself, a process instance
maintains a list of threads, which are used within this function.
Threads are registered to a process' thread list at thread
initialization, and unregistered from the list upon thread destruction
(if said thread has a non-null owning process).
We assert on the debug event case, as we currently don't implement
kernel debug objects.
|
| | | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | | |
This service function simply copies out a specified number of kernel
process IDs, while simultaneously reporting the total number of
processes.
|
| |\ \ \ \ \
| |/ / / /
|/| | | | |
kernel/resource_limit: Remove the name member from resource limits
|
| | |/ / /
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
This doesn't really provide any benefit to the resource limit interface.
There's no way for callers to any of the service functions for resource
limits to provide a custom name, so all created instances of resource
limits other than the system resource limit would have a name of
"Unknown".
The system resource limit itself is already trivially identifiable from
its limit values, so there's no real need to take up space in the object to
identify one object meaningfully out of N total objects.
|
| | | | | |
|
| |\ \ \ \
| |/ / /
|/| | | |
kernel/codeset: Make CodeSet's memory data member a regular std::vector
|
| | | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
The use of a shared_ptr is an implementation detail of the VMManager
itself when mapping memory. Because of that, we shouldn't require all
users of the CodeSet to have to allocate the shared_ptr ahead of time.
It's intended that CodeSet simply pass in the required direct data, and
that the memory manager takes care of it from that point on.
This means we just do the shared pointer allocation in a single place,
when loading modules, as opposed to in each loader.
|
| |\ \ \ \
| | | | |
| | | | | |
core/yuzu: Remove enable_nfc setting
|
| | | |_|/
| |/| |
| | | |
| | | | |
This was initially added to prevent problems from stubbed/not implemented NFC services, but as we never encountered such and as it's only used in a deprecated function anyway, I guess we can just remove it to prevent more clutter of the settings.
|
| | | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
Since C++17, the introduction of deduction guides for locking facilities
means that we no longer need to hardcode the mutex type into the locks
themselves, making it easier to switch mutex types, should it ever be
necessary in the future.
|
| |\ \ \ \
| | | | |
| | | | | |
kernel/process: Report total physical memory used to svcGetInfo slightly better
|
| | | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | | |
Reports the (mostly) correct size through svcGetInfo now for queries to
total used physical memory. This still doesn't correctly handle memory
allocated via svcMapPhysicalMemory, however, we don't currently handle
that case anyways.
|
| | | | | |
| | | | |
| | | | |
| | | | |
| | | | | |
This will be necessary to properly report the used memory size in
svcGetInfo.
|
| | | | | |
| | | | |
| | | | |
| | | | |
| | | | | |
This will be necessary in order to properly report memory usage within
svcGetInfo.
|
| | | | | |
| | | | |
| | | | |
| | | | |
| | | | |
| | | | | |
This will make operating with the process-related SVC commands much
nicer in the future (the parameter representing the stack size in
svcStartProcess is a 64-bit value).
|
| | | | | |
| | | | |
| | | | |
| | | | |
| | | | | |
The kernel always makes sure that the given stack size is aligned to
page boundaries.
|
| |\ \ \ \ \
| | | | | |
| | | | | | |
kernel/scheduler: Minor tidying up
|
| | | | | | |
| | | | | |
| | | | | |
| | | | | |
| | | | | | |
This was made unused in b404fcdf1443b91ac9994c05ad1fe039fcd9675e, but
the parameter itself wasn't removed.
|
| | | |_|_|/
| |/| | |
| | | | |
| | | | |
| | | | |
| | | | | |
Since C++17, we no longer need to explicitly specify the type of the
mutex within the lock_guard. The type system can now deduce these with
deduction guides.
|
| | | | | | |
|
| | | | | |
| | | | |
| | | | |
| | | | | |
Resolves a -Wextra-semi warning.
|
| |/ / / /
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | |
| | | | |
Based off RE, most of these structure members are register values, which
makes, sense given this service is used to convey fatal errors.
One member indicates the program entry point address, one is a set of
bit flags used to determine which registers to print, and one member
indicates the architecture type.
The only member that still isn't determined is the final member within
the data structure.
|
| |\ \ \ \
| | | | |
| | | | | |
Kernel: Fixes to Arbitration and SignalProcessWideKey Management
|
| | | | | | |
|
| | | | | | |
|
| | | | | | |
|
| |\ \ \ \ \
| |_|/ / /
|/| | | | |
Replace old Thread Queue for a new Multi Level Queue
|
| | | | | | |
|
| | | |/ /
| |/| | |
|
| |\ \ \ \
| |/ / /
|/| | | |
kernel/vm_manager: Unify heap allocation/freeing functions
|