summaryrefslogtreecommitdiffstats
path: root/doc (follow)
Commit message (Collapse)AuthorAgeFilesLines
* shell: DocumentationSebastian Huber2014-11-202-3/+161
|
* shell: Add CMDLS, CMDCHOWN, CMDCHMOD commandsSebastian Huber2014-11-201-0/+186
|
* shell: Rename HALT to SHUTDOWN commandSebastian Huber2014-11-201-24/+13
| | | | Use a normal command for shutdown via exit().
* Eliminate use of /*PAGE and clean up formattingJoel Sherrill2014-10-093-65/+31
|
* avr/rtems/score/cpu.h: Fix macros to avoid warningsJoel Sherrill2014-10-091-31/+0
|
* termios: Partially hide rtems_termios_ttySebastian Huber2014-10-071-17/+21
| | | | | | | Move interrupt lock to device context and expose only this structure to the read, write and set attributes device handler. This makes these device handler independent of the general Termios infrastructure suitable for direct use in printk() support.
* termios: Separate flow control from normal handlerSebastian Huber2014-10-071-0/+1
|
* doc/shell: Correct build issues from fc9f8f5085724622a189ba5d44ac116d7b27e27cJoel Sherrill2014-09-183-2/+5
|
* Use correct prototype of benchmark_timer_read()Joel Sherrill2014-09-161-1/+1
| | | | | | | | | | | | | | This change starts with removing the effectively empty file timerdrv.h. The prototypes for benchmark_timer_XXX() were in btimer.h which was not universally used. Thus every use of timerdrv.h had to be changed to btimer.h. Then the prototypes for benchmark_timer_read() had to be adjusted to return benchmark_timer_t rather than int or uint32_t. I took this opportunity to also correct the file headers to separate the copyright from the file description comments which is needed to ensure the copyright isn't propagated into Doxygen output.
* doc: Sort the shell file commands into alphabetical order.Chris Johns2014-09-161-1354/+1433
|
* shell: Add an md5 hash command for files.Chris Johns2014-09-161-67/+139
| | | | This command lets you get an MD5 hash for a file in an RTEMS file system.
* shell: Add a ping command.Chris Johns2014-09-161-21/+290
| | | | | | | | | The ping code is taken from a recent FreeBSD release. Some options have been tested, other not tested or do not work. This could be due to the age of our TCP/IP stack. This version of ping will not work if more than 64 file descriptors are open at once because the select FD size is 64 as set in newlib.
* doc: Clarify ABI in SPARC CPU supplementSebastian Huber2014-09-121-11/+16
|
* doc/arm: Update floating point unit supportSebastian Huber2014-09-081-1/+9
|
* rtems: Add more clock tick functionsSebastian Huber2014-08-261-0/+104
| | | | | Add rtems_clock_tick_later(), rtems_clock_tick_later_usec() and rtems_clock_tick_before().
* rtems: Inline rtems_clock_get_ticks_since_boot()Sebastian Huber2014-08-251-21/+10
| | | | Update documentation.
* or1k.t: Fix spelling errorsJoel Sherrill2014-08-201-4/+4
|
* Add new documentation section for OpenRISC CPU architecture.Hesham ALMatary2014-08-203-0/+84
|
* doc: Update console driver documentationSebastian Huber2014-07-211-398/+344
|
* score: Implement scheduler helping protocolSebastian Huber2014-07-091-0/+78
| | | | | | | | | | | | | | | | | | | | | | | | | The following scheduler operations return a thread in need for help - unblock, - change priority, and - yield. A thread in need for help is a thread that encounters a scheduler state change from scheduled to ready or a thread that cannot be scheduled in an unblock operation. Such a thread can ask threads which depend on resources owned by this thread for help. Add a new ask for help scheduler operation. This operation is used by _Scheduler_Ask_for_help() to help threads in need for help returned by the operations mentioned above. This operation is also used by _Scheduler_Thread_change_resource_root() in case the root of a resource sub-tree changes. A use case is the ownership change of a resource. In case it is not possible to schedule a thread in need for help, then the corresponding scheduler node will be placed into the set of ready scheduler nodes of the scheduler instance. Once a state change from ready to scheduled happens for this scheduler node it may be used to schedule the thread in need for help.
* score: Use Resource Handler for MrsP semaphoresSebastian Huber2014-06-031-1/+10
| | | | | This enables proper resource dependency tracking and as a side-effect deadlock detection.
* score: _Scheduler_Set_affinity()Sebastian Huber2014-06-021-1/+9
| | | | | Do not change the scheduler with this function. Documentation. Coding style.
* score: Multiprocessor Resource Sharing ProtocolSebastian Huber2014-05-283-5/+242
| | | | | | | | | | | | | | | | | | | | | | Add basic support for the Multiprocessor Resource Sharing Protocol (MrsP). The Multiprocessor Resource Sharing Protocol (MrsP) is defined in A. Burns and A.J. Wellings, A Schedulability Compatible Multiprocessor Resource Sharing Protocol - MrsP, Proceedings of the 25th Euromicro Conference on Real-Time Systems (ECRTS 2013), July 2013. It is a generalization of the Priority Ceiling Protocol to SMP systems. Each MrsP semaphore uses a ceiling priority per scheduler instance. These ceiling priorities can be specified with rtems_semaphore_set_priority(). A task obtaining or owning a MrsP semaphore will execute with the ceiling priority for its scheduler instance as specified by the MrsP semaphore object. Tasks waiting to get ownership of a MrsP semaphore will not relinquish the processor voluntarily. In case the owner of a MrsP semaphore gets preempted it can ask all tasks waiting for this semaphore to help out and temporarily borrow the right to execute on one of their assigned processors. The help out feature is not implemented with this patch.
* rtems: Clarify task set/get scheduler parametersSebastian Huber2014-05-201-5/+7
|
* score: Simplify _Thread_Change_priority()Sebastian Huber2014-05-151-5/+0
| | | | | | | | | | | | | | | | | | | | | | | | The function to change a thread priority was too complex. Simplify it with a new scheduler operation. This increases the average case performance due to the simplified logic. The interrupt disabled critical section is a bit prolonged since now the extract, update and enqueue steps are executed atomically. This should however not impact the worst-case interrupt latency since at least for the Deterministic Priority Scheduler this sequence can be carried out with a wee bit of instructions and no loops. Add _Scheduler_Change_priority() to replace the sequence of - _Thread_Set_transient(), - _Scheduler_Extract(), - _Scheduler_Enqueue(), and - _Scheduler_Enqueue_first(). Delete STATES_TRANSIENT, _States_Is_transient() and _Thread_Set_transient() since this state is now superfluous. With this change it is possible to get rid of the SCHEDULER_SMP_NODE_IN_THE_AIR state. This considerably simplifies the implementation of the new SMP locking protocols.
* doc: Use @dfn for glossary termsSebastian Huber2014-05-081-1/+1
|
* doc: Move SMP glossary to global glossarySebastian Huber2014-05-082-126/+93
| | | | Add some terms.
* score: Implement forced thread migrationSebastian Huber2014-05-071-0/+46
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | The current implementation of task migration in RTEMS has some implications with respect to the interrupt latency. It is crucial to preserve the system invariant that a task can execute on at most one processor in the system at a time. This is accomplished with a boolean indicator in the task context. The processor architecture specific low-level task context switch code will mark that a task context is no longer executing and waits that the heir context stopped execution before it restores the heir context and resumes execution of the heir task. So there is one point in time in which a processor is without a task. This is essential to avoid cyclic dependencies in case multiple tasks migrate at once. Otherwise some supervising entity is necessary to prevent life-locks. Such a global supervisor would lead to scalability problems so this approach is not used. Currently the thread dispatch is performed with interrupts disabled. So in case the heir task is currently executing on another processor then this prolongs the time of disabled interrupts since one processor has to wait for another processor to make progress. It is difficult to avoid this issue with the interrupt latency since interrupts normally store the context of the interrupted task on its stack. In case a task is marked as not executing we must not use its task stack to store such an interrupt context. We cannot use the heir stack before it stopped execution on another processor. So if we enable interrupts during this transition we have to provide an alternative task independent stack for this time frame. This issue needs further investigation.
* score: SMP_FATAL_SCHEDULER_WITHOUT_PROCESSORSSebastian Huber2014-05-052-3/+3
| | | | | Avoid the SMP_FATAL_SCHEDULER_WITHOUT_PROCESSORS fatal error and make it a run-time error in rtems_scheduler_ident() and _Scheduler_Get_by_id().
* doc: Add SMP glossarySebastian Huber2014-05-051-0/+110
|
* doc: Extend documentation for unlimited objectsRalf Kirchner2014-04-301-4/+37
| | | | | | | Mark POSIX Keys and POSIX Key Value Pairs as supported. Add list of unsupported object classes. Add hint to unified work areas. Add example.
* sparc: Add _CPU_Get_current_per_CPU_control()Sebastian Huber2014-04-281-0/+5
| | | | | | | | | | | | | | | | Use register g6 for the per-CPU control of the current processor. The register g6 is reserved for the operating system by the SPARC ABI. On Linux register g6 is used for a similar purpose with the same method since 1996. The register g6 must be initialized during system startup and then must remain unchanged. Since the per-CPU control is used in all critical sections of the operating system, this is a performance optimization for the operating system core procedures. An additional benefit is that the low-level context switch and interrupt processing code is now identical on non-SMP and SMP configurations.
* sparc: Document register g7 usageSebastian Huber2014-04-281-0/+3
|
* sparc: Optimize context switchSebastian Huber2014-04-281-0/+3
| | | | | | The registers g2 through g4 are reserved for applications. GCC uses them as volatile registers by default. So they are treated like volatile registers in RTEMS as well.
* bsps: Fix TLS support in linker command filesSebastian Huber2014-04-221-1/+3
| | | | | The TLS section symbols had wrong values in case of an empty TLS data section and a nonempty TLS BSS section.
* doc: Setting Affinity to a Single ProcessorSebastian Huber2014-04-221-8/+20
|
* score: Clarify TLS supportSebastian Huber2014-04-171-1/+20
|
* doc: TypoSebastian Huber2014-04-171-2/+1
|
* doc: rtems_task_set_scheduler()Sebastian Huber2014-04-171-0/+77
|
* doc: rtems_task_get_scheduler()Sebastian Huber2014-04-171-0/+35
|
* doc: rtems_scheduler_get_processor_set()Sebastian Huber2014-04-171-0/+40
|
* doc: rtems_scheduler_ident()Sebastian Huber2014-04-171-0/+37
|
* doc: rtems_task_set_affinity()Sebastian Huber2014-04-172-32/+15
|
* doc: rtems_task_get_affinity()Sebastian Huber2014-04-171-24/+15
|
* doc: rtems_get_current_processor()Sebastian Huber2014-04-171-0/+39
|
* doc: rtems_get_processor_count()Sebastian Huber2014-04-171-11/+14
|
* score: Add clustered/partitioned schedulingSebastian Huber2014-04-151-13/+194
| | | | | | | | | | | | | | | Clustered/partitioned scheduling helps to control the worst-case latencies in the system. The goal is to reduce the amount of shared state in the system and thus prevention of lock contention. Modern multi-processor systems tend to have several layers of data and instruction caches. With clustered/partitioned scheduling it is possible to honour the cache topology of a system and thus avoid expensive cache synchronization traffic. We have clustered scheduling in case the set of processors of a system is partitioned into non-empty pairwise-disjoint subsets. These subsets are called clusters. Clusters with a cardinality of one are partitions. Each cluster is owned by exactly one scheduler instance.
* score: Add scheduler nameSebastian Huber2014-04-151-0/+37
|
* score: Static scheduler configurationSebastian Huber2014-04-151-7/+9
| | | | | | Do not allocate the scheduler control structures from the workspace. This is a preparation step for configuration of clustered/partitioned schedulers on SMP.
* score: Statically initialize IO managerSebastian Huber2014-04-101-33/+35
| | | | | | | | | | | | This simplifies the RTEMS initialization and helps to avoid a memory overhead. The workspace demands of the IO manager were not included in the <rtems/confdefs.h> workspace size estimate. This is also fixed as a side-effect. Update documentation and move "Specifying Application Defined Device Driver Table" to the section end. This sub-section is not that important for the user. Mentioning this at the beginning may lead to confusion.
generated by cgit v1.2.3 (git 2.25.1) at 2024-05-04 04:05:25 +0000