rtems - RTEMS Kernel, file-systems, drivers, BSPs, samples, and testsuite.

	Commit message (Collapse)	Author	Age	Files	Lines
*	cpukit, testsuite: Add rtems_printf and rtems_printer support.	Chris Johns	2016-05-25	1	-3/+5
\| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \| \|	This change adds rtems_printf and related functions and wraps the RTEMS print plugin support into a user API. All references to the plugin are removed and replaced with the rtems_printer interface. Printk and related functions are made to return a valid number of characters formatted and output. The function attribute to check printf functions has been added to rtems_printf and printk. No changes to remove warrnings are part of this patch set. The testsuite has been moved over to the rtems_printer. The testsuite has a mix of rtems_printer access and direct print control via the tmacros.h header file. The support for begink/endk has been removed as it served no purpose and only confused the code base. The testsuite has not been refactored to use rtems_printf. This is future work.
*	smptests/smpfatal08: Workaround for QorIQ BSPs	Sebastian Huber	2015-03-24	1	-0/+8
\|
*	score: Add _CPU_SMP_Prepare_start_multitasking()	Sebastian Huber	2015-02-17	1	-7/+5
\| \| \| \|	Update #2268.
*	smptests/smpfatal08: Fix link error	Sebastian Huber	2014-09-01	1	-0/+7
\|
*	smptests/smpfatal08: Support RTEMS_PARAVIRT	Sebastian Huber	2014-06-30	1	-1/+2
\|
*	bsps: Use bsp_start_on_secondary_processor()	Sebastian Huber	2014-05-12	1	-12/+3
\| \| \| \|	Use a standard function for startup on secondary processors.
*	score: Add clustered/partitioned scheduling	Sebastian Huber	2014-04-15	4	-0/+164
	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.