| Commit message (Collapse) | Author | Age | Files | Lines |
| |
|
|
|
|
|
| |
Destroy the thread queue in case of a priority ceiling violation,
otherwise the SMP profiling data gets corrupted.
|
|
|
|
| |
Update #2738.
|
| |
|
|
|
|
| |
Remove double declarations, useless comments and unused functions.
|
|
|
|
|
|
| |
Enable for all configurations since it pulls in no additional
dependencies. Return value of the scheduler instance of the executing
thread.
|
|
|
|
|
| |
Enable for all configurations since it pulls in no additional
dependencies.
|
|
|
|
|
| |
Use priority maximum of scheduler instance. This avoids a potential
memory corruption on SMP configurations.
|
|
|
|
| |
Use priority maximum of scheduler instance.
|
|
|
|
| |
Close #2734.
|
|
|
|
| |
Close #2735.
|
|
|
|
|
|
| |
Return the unmodified thread priority value according to POSIX.
Close #2736.
|
|
|
|
| |
Bug introduced by b04b76c6a0c87ffc9670d356e793108411ce355a.
|
| |
|
|
|
|
|
| |
Do not hide network file systems if RTEMS_NETWORKING is not defined,
since they may be provided by the LibBSD.
|
| |
|
| |
|
|
|
|
|
|
| |
In case the CPU architecture provides no specialized
_CPU_Bitfield_Find_first_bit() macro, then use the __builtin_clz()
builtin in case __GNUC__ is defined.
|
|
|
|
| |
Turn _Bitfield_Find_first_bit() macro into an inline function.
|
| |
|
| |
|
|
|
|
|
|
|
|
|
|
| |
The priority bit map can deal with a maximum of 256 priority values
ranging from 0 to 255. Consistently use an unsigned int for
computation, due to the usual integer promotion rules.
Make Priority_bit_map_Word definition architecture-independent and
define it to uint16_t. This was already the case for all architectures
except PowerPC. Adjust the PowerPC bitmap support accordingly.
|
|
|
|
|
|
| |
Rename __log2table into _Bitfield_Leading_zeros since it acually returns
the count of leading zeros of an 8-bit integer. The value for zero is a
bit odd. Provide it unconditionally.
|
| |
|
| |
|
|
|
|
|
| |
Remove superfluous includes. Use one attribute compare for each
semaphore variant. Text size drops by 10% on PowerPC due to this.
|
| |
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
The Classic binary semaphores without a locking protocol
(RTEMS_BINARY_SEMAPHORE) could be released by everyone, e.g. in contrast
to the POSIX mutexes (all variants) or the Classic binary semphores with
priority inheritance or ceiling, there was no owner check in the release
path.
This behaviour was a bit unexpected and not documented. Add an owner
check to the release path. Update sptests/sp42 accordingly.
This change has nothing to do with the simple binary semaphores
(RTEMS_SIMPLE_BINARY_SEMAPHORE) which have no owner at all.
Update #2725
|
|
|
|
| |
Close #2729.
|
|
|
|
| |
Close #2728.
|
|
|
|
| |
Close #2727.
|
|
|
|
| |
Close #1452.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
Support creating directories for files with a path depth greater than 1. Some
tar files can have files with a path depth greater than 1 and no directory
entry in the tar file to create a directory.
Support overwriting existing files and directories failing in a similar
way to tar on common hosts. If a file is replaced with a file delete the
file and create a new file. If a directory replaces a file remove the file
and create the directory. If a file replaces a directory remove the directory,
and if the directory is not empty and cannot be removed report an error. If a
directory alreday exists do nothing leaving the contents untouched.
The untar code now shares the common header parsing and initial processing
with the actual writes still separate. No changes to the IMFS have been made.
Updates #2415.
Closes #2207.
|
| |
|
| |
|
|
|
|
|
|
|
| |
The approach with the generation number was broken. The load/store of
the current lock, the thread queue and the thread queue operations were not
properly synchronized. Under certain conditions on a PowerPC T4240 old
thread queue operations operated on a new thread queue (NULL pointer).
|
|
|
|
|
|
|
|
|
| |
A read-modify-write operation is necessary to read the last value
written.
See for example C11 standard or Power ISA 2.07, Book II: Power ISA
Virtual Environment Architecture, Section 1.6.3 Memory Coherence
Required [Category: Memory Coherence] and Section 1.7.3 Atomic Update.
|
|
|
|
|
| |
Demonstrate that a read-modify-write atomic operation may be necessary
on some archtitectures to observe the latest value written.
|
|
|
|
| |
Update #2723.
|
| |
|
|
|
|
| |
We must use vfprintf().
|
| |
|
| |
|
| |
|
|
|
|
|
| |
Move MrsP semaphore operations to a less prominent location. Fix field
name.
|
|
|
|
|
| |
Provide dedicated seize and surrender methods for inherit priority
mutexes. This eliminates CORE_mutex_Attributes.
|
|
|
|
|
| |
Rework seize and surrender methods to use CORE_ceiling_mutex_Control.
This eliminates CORE_mutex_Disciplines.
|
|
|
|
|
|
|
|
| |
Add CORE_recursive_mutex_Control and CORE_ceiling_mutex_Control to avoid
the run-time evaluation of attributes to figure out how a particular
mutex methods should behave. Start with the no protocol variants. This
eliminates the CORE_MUTEX_DISCIPLINES_FIFO and
CORE_MUTEX_DISCIPLINES_PRIORITY disciplines.
|
| |
|