summaryrefslogtreecommitdiff
AgeCommit message (Collapse)Author
2021-09-16build: Remove old build systemremove-old-build-systemSebastian Huber
Close #3250. Close #4081.
2021-09-15rtems: Improve Classic API group descriptionSebastian Huber
2021-09-15rtems: Fix message manager documentationSebastian Huber
Remove bogus return status from rtems_message_queue_receive(). Clarify rtems_message_queue_flush(). Update #4508.
2021-09-15rtems: Generate <rtems/extension.h>Sebastian Huber
Remove the duplicated description which is an out dated copy and paste from the Classic API Guide. Instead, thoroughly document the individual extensions. Change license to BSD-2-Clause according to file histories and documentation re-licensing agreement. Update #3899. Update #3993.
2021-09-15rtems: Generate <rtems/rtems/cache.h>Sebastian Huber
Change license to BSD-2-Clause according to file histories and documentation re-licensing agreement. Update #3899. Update #3993. Update #4513.
2021-09-14build: Remove invalid attributesSebastian Huber
2021-09-14bsps/arm: Fix ABI flags for Cortex-M4Sebastian Huber
Close #4504.
2021-09-09bsps/zynqmp: Added I2C support for ZynqMPStephen Clark
Added I2C drivers for ZynqMP and updated build system accordingly.
2021-09-09bsps/zynq: Moved general i2c files to shared directoriesStephen Clark
Certain files related to the Zynq BSP's I2C driver are useable by the ZynqMP BSP as well. Moved these files to shared directory in anticipation of I2C support for ZynqMP.
2021-09-09rtems: Initialize count of postponed jobsSebastian Huber
The rtems_rate_monotonic_get_status() directive returns an arbitrary number for the count of postponed jobs if it is called for a newly created period object. Set the count of postponed jobs to zero during object creation. Close #4511.
2021-09-06rtems: Document time of day constraintsSebastian Huber
Update #4338.
2021-09-06score: Split up rbtreenext.cSebastian Huber
Split up rbtreenext.c since only _RBTree_Minimum() is used by the operating system core services (thread queues and the EDF scheduler). Change license to BSD-2-Clause according to file history and re-licensing agreement. Update #3053.
2021-09-06score: Change TOD_LATEST_YEAR to 2099Sebastian Huber
This simplifies the implementation a bit. Declare _TOD_Days_to_date[] in <rtems/score/todimpl.h>. Make _TOD_Days_per_month[] and _TOD_Days_since_last_leap_year[] static. Update #4338.
2021-09-06score: Simplify _TOD_Validate()Sebastian Huber
Split up the multi line if statement into smaller parts.
2021-09-06score: Limit the CLOCK_REALTIME settingSebastian Huber
Limit the CLOCK_REALTIME setting to ensure that the CLOCK_REALTIME is defined for a system uptime of at least 114 years.
2021-09-06score: Add _TOD_Is_valid_new_time_of_day()Sebastian Huber
Move the TOD validation to the callers of _TOD_Set(). This avoids dead code in case only rtems_clock_set() is used in an application because rtems_clock_set() always calls _TOD_Set() with a valid time of day.
2021-09-06score: Remove TOD_TICKS_PER_SECOND_method()Sebastian Huber
Use _Watchdog_Ticks_per_second instead.
2021-09-06score: Return status in _TOD_Adjust()Sebastian Huber
2021-09-03score: Move _Thread_Dispatch()Sebastian Huber
The _Thread_Dispatch() function was customized over time and now the work is done by _Thread_Do_dispatch() and specialized wrappers. The plain _Thread_Dispatch() is now only used in some CPU ports. Move it to a separate file to avoid dead code in the general. Change license to BSD-2-Clause according to file history and re-licensing agreement. Update #3053.
2021-09-03score: Document thread queue operationsSebastian Huber
2021-09-02bsps/leon3: Rename fatal error codeSebastian Huber
Rename LEON3_FATAL_INVALID_CACHE_CONFIG_MAIN_PROCESSOR in LEON3_FATAL_INVALID_CACHE_CONFIG_BOOT_PROCESSOR since the term "boot processor" is used elsewhere in the code base.
2021-09-02Improve test of rtems_interrupt_get_affinity()Sebastian Huber
Use a CPU set which is larger than the internal processor set representation.
2021-09-02validation: Improve generated test codeSebastian Huber
Move the transition map members of the test context to a dedicated structure. Move the transition variant pre-condition prepare, action, and post-condition checks to a separate function to reduce the indentation level and allow skipping of transition variants.
2021-09-02libtest: Return fixture context in T_case_begin()Sebastian Huber
This makes it similar to T_push_fixture().
2021-09-02bsps/imxrt: Improve SPI driverChristian Mauderer
It wasn't possible to keep the CS line low between multiple message descriptors in one transfer. This patch reworks the driver so that it is possible. Update #4180
2021-09-01score: Update priority only if necessarySebastian Huber
In _Thread_queue_Flush_critical(), update the priority of the thread queue owner only if necessary. The scheduler update priority operation could be expensive.
2021-09-01score: Remove _Thread_queue_Unblock_critical()Sebastian Huber
This function was only used in one place. Replace it with a call to _Thread_queue_Resume().
2021-09-01score: Remove _Thread_queue_First_locked()Sebastian Huber
The _Thread_queue_First_locked() was only used in one place. Move the code of this inline function to this place.
2021-09-01score: Fix blocking message queue receiveSebastian Huber
In order to ensure FIFO fairness across schedulers, the thread queue surrender operation must be used to dequeue a thread from the thread queue. The thread queue extract operation is intended for timeouts. Add _Thread_queue_Resume() which may be used to make extracted or surrendered threads ready again. Remove the now unused _Thread_queue_Extract_critical() function. Close #4509.
2021-09-01score: Fix priority discipline handlingSebastian Huber
The priority queues in clustered scheduling configurations use a per scheduler priority queue rotation to ensure FIFO fairness across schedulers. This mechanism is implemented in the thread queue surrender operation. Unfortunately some semaphore and message queue directives used wrongly the thread queue extract operation. Fix this through the use of _Thread_queue_Surrender(). Update #4358.
2021-09-01score: Document Futex HandlerSebastian Huber
The behaviour of the futex operations is defined by Linux: https://man7.org/linux/man-pages/man2/futex.2.html Use EAGIN instead of EWOULDBLOCK to be in line with the Linux man page. These error numbers have the same value in Newlib. Using the same error numbers helps to avoid confusion. When you look at the history of the Linux man page you see that they replaced EWOULDBLOCK with EAGAIN over time. At the time of the RTEMS futex implementation they used EWOULDBLOCK.
2021-08-31rtems: Fix partitions with RTEMS_MULIPROCESSINGSebastian Huber
Replace call to removed _Partition_Free() with a call to _Objects_Free().
2021-08-30psxtests/psxconfstr: Fix test caseSebastian Huber
Update #3373.
2021-08-30smpfatal01: Fix test time out on sparc/leon3Sebastian Huber
End the test on the processor which triggers the test condition. This avoids endless power down loops in the sparc/leon3 BSP.
2021-08-21libmisc/shell: Check the shell command pointers when adding a commandChris Johns
2021-08-21libmisc/fdt: fix node initialise error with RTEMS_DEBUGChris Johns
2021-08-19cpukit/mghttpd: Support all descriptors in selectChris Johns
- Support all possible descriptors in a select call. Borrowed from Christain and his mDNS change in LibBSD - If select (or poll) fails pause for a bit rather than locking up in a hard loop
2021-08-19aarch64/versal: Enable TX and RX FIFOsChris Johns
- Wait for the tx holding register to empty in a tx flush
2021-08-18bsps/raspberrypi: Add SEV Instruction for RPi SMP firmware changes.pranav
The Pi firmware added a wfe(wait for event), the cores 1-3 wait for the start address being written to the mailbox register, followed by a SEV poke to the mailbox that acts as a wfe wake-up event.
2021-08-18confstr() support for RTEMSEshan dhawan
Closes #3373 confstr() style update Signed-off-by: Eshan Dhawan <eshandhawan51@gmail.com>
2021-08-18score: Delete unused rtems_ada_selfSebastian Huber
2021-08-18score: Make zombie registry observableSebastian Huber
This helps to write tests for _Thread_Wait_for_execution_stop(). Rename Thread_Zombie_control in Thread_Zombie_registry.
2021-08-18score: Simplify _Thread_Kill_zombies()Sebastian Huber
2021-08-18score: Simplify _Per_CPU_Wait_for_job()Sebastian Huber
The _SMP_Fatal() is a no-return function, so the "break" statement is superfluous.
2021-08-18score: Simplify _Thread_Create_idle_for_CPU()Sebastian Huber
Online processors have a scheduler assigned.
2021-08-18build: Merge default-by-family into by-variantSebastian Huber
Prefix the BSP family name with "bsps/" to make it distinct to the BSP variant names. Update #4468.
2021-08-12bsp/leon3: Fix rtems_interrupt_is_pending()Sebastian Huber
Take the interrupt force register into account in all configurations. Update #3269.
2021-08-12score: Simplify _Scheduler_Tick()Sebastian Huber
The NULL pointer check for the executing thread was introduced by commit: commit be3c257286ad870d8d1a64941cde53fd2d33a633 Author: Sebastian Huber <sebastian.huber@embedded-brains.de> Date: Thu Jun 5 11:17:26 2014 +0200 score: Avoid NULL pointer access Check that the executing thread is not NULL in _Scheduler_Tick(). It may be NULL in case the processor has an optional scheduler assigned and the system was not able to start the processor. However, it is no longer necessary since now the clock interrupt is distributed to the online processors.
2021-08-12score: Replace the single use of a sequence lockSebastian Huber
In SMP configurations, on 64-bit architectures use plain atomic operations to set/get the priority value of a scheduler node. On 32-bit architectures use an ISR lock. Using a sequence lock has no real benefit since it uses atomic read-modify-write operations for both the read and the write lock. Simply use a ticket lock instead so that only one SMP synchronization primitive is used for everything.
2021-08-12score: Replace priority prepend it with an enumSebastian Huber
Use the new Priority_Group_order enum instead of a boolean to indicated if a priority should be inserted as the first or last node into its priority group. This makes the code more expressive. It is also a bit more efficient since a branch in _Scheduler_Node_set_priority() is avoided and a simple bitwise or operation can be used.