summaryrefslogtreecommitdiffstats
path: root/cpukit (follow)
Commit message (Collapse)AuthorAgeFilesLines
* Remove All CVS Id Strings Possible Using a ScriptJoel Sherrill2012-05-111906-3912/+0
| | | | | | | | | | | | Script does what is expected and tries to do it as smartly as possible. + remove occurrences of two blank comment lines next to each other after Id string line removed. + remove entire comment blocks which only exited to contain CVS Ids + If the processing left a blank line at the top of a file, it was removed.
* dosfs: Remove fat_file_datasync()Sebastian Huber2012-05-118-179/+73
| | | | | | | | | | | | | | | The fat_file_datasync() read every cluster of the file into the cache and then synchronized it step-by-step. For unmodified buffers this is a non-operation. For modified buffers this will wake-up the swapout task which performs then a single buffer write operation. This is usually quite inefficient. Firstly we do single buffer writes, secondly we may perform a lot of unnecessary read operations (for huge files this is really bad), and thirdly this leads likely to cache evictions. The synchronization procedure is replaced by a simple rtems_bdbuf_sync_dev(). This has the side-effect that also buffers not related to the file are synchronized, but since the modified list is normally short this should be acceptable.
* libblock: Add RTEMS_BLKIO_PURGEDEVSebastian Huber2012-05-112-0/+10
|
* Filesystem: PR1893: Fix write and truncate handlerSebastian Huber2012-05-119-37/+137
| | | | | Space that grows due to truncate or write offsets beyond the current file size must be zero filled.
* Filesystem: PR1871: Fix O_APPENDSebastian Huber2012-05-118-143/+33
|
* Filesystem: PR1398: Fix lseek() mechanicSebastian Huber2012-05-1123-391/+166
| | | | | | | | | | | | According to POSIX the lseek() function shall not, by itself, extend the size of a file. Remove the size field of rtems_libio_t. A file has only one size but may have multiple open file descriptors. Thus a file size field in the file descriptor may lead to inconsistencies. New default handlers rtems_filesystem_default_lseek_file() and rtems_filesystem_default_lseek_directory().
* Score ISR - Minimize Capabilities When Not Simple VectoredJoel Sherrill2012-05-094-9/+21
| | | | | | | | | | | In particular CPU_INTERRUPT_NUMBER_OF_VECTORS and CPU_INTERRUPT_MAXIMUM_VECTOR_NUMBER are only used on Simple Vectored Architectures, so do not depend on them being defined. This disables as much as possible that is specific to the Simple Vectored Model and not expected to be used on architectures which use the Programmable Interrupt Controller model for interrupt handler vectoring.
* Score Semaphore - Need Semaphore Seize Body When Multiprocessing is EnabledJoel Sherrill2012-05-091-1/+1
| | | | mptests did not link without this modification.
* rbtree: API changes. Remove rbtree control node from RBTree_Next.Gedare Bloom2012-05-087-34/+19
| | | | | | | | | | | | The implementation of RBTree_Next was using an awkward construction to detect and avoid accessing the false root of the red-black tree. To deal with the false root, RBTree_Next was comparing node parents with the control node. Instead the false root can be detected by checking if the grandparent of a node exists; the grandparent of the tree's true root is NULL by definition so the root of the tree is found while walking up the tree by checking for the non-existence of a grandparent. This change propagates into the predecessor/successor and iterate functions.
* PR2061: RBTree: updating min and max on insert with duplicatesGedare Bloom2012-05-081-1/+6
| | | | | | | When inserting to a red-black tree with duplicates the min and max pointers are not updated properly. We need to check the key of the min/max node against the insert node since the insert point could be the child of a node with an identical key to the min/max node.
* PR2060: RBTree: updating min and max on extract pathGedare Bloom2012-05-081-17/+9
| | | | | | During node extraction from a red-black tree the min and max values are updated incorrectly. We need to use the successor/predecessor functions to find the next/previous node when we remove the min/max from the tree.
* score/rbtree: eliminate unused function _RBTree_Peek.Gedare Bloom2012-05-083-68/+1
|
* rbtree: API ChangesGedare Bloom2012-05-082-11/+76
| | | | | Make default for rtems_rbtree functions be unprotected (preemption enabled) unless an unprotected variant e.g. rtems_rbtree_xxx_unprotected is available.
* score/rbtree: replace _RBTree_Peek_unprotected with _RBTree_First.Gedare Bloom2012-05-082-23/+3
|
* score/scheduling: Use RBTree_First instead of Peek in EDF scheduler.Gedare Bloom2012-05-081-6/+3
|
* Revert: Remove CVS IdsJoel Sherrill2012-05-0758-0/+194
| | | | | See http://www.rtems.org/pipermail/rtems-devel/2012-May/001006.html for details.
* nfsclient: Add rename operationSebastian Huber2012-05-041-1/+45
|
* nfsclient: Fix hard link operationSebastian Huber2012-05-041-1/+1
|
* Filesystem: Use proper parameter in NFSSebastian Huber2012-05-041-1/+1
|
* Filesystem: Remove pipe_lseek()Sebastian Huber2012-05-043-35/+1
|
* Filesystem: Remove per file descriptor semaphoreSebastian Huber2012-05-043-29/+6
| | | | | | | | | The per file descriptor semaphore (field of rtems_libio_t) is unused in RTEMS. There is a considerable memory overhead due to that. A semaphore needs roughly 124 bytes which is huge compared to the approximately 72 bytes for the file descriptor structure itself. Device drivers can create their own synchronization primitives in the open handler on demand.
* Remove CVS-Ids.Ralf Corsépius2012-05-0458-194/+0
|
* General - Remove extraneous blank line in license messageJoel Sherrill2012-05-031-0/+0
| | | | | | | | | | | | | Many files had an extra blank line in the license text found in the file header. This patch removes that line. * The license and distribution terms for this file may be * found in the file LICENSE in this distribution or at * * http://www.rtems.com/license/LICENSE. The script that did this also turned off execute permission when it was turned on incorrectly.
* IMFS: Update IMS_assert check when RTEMS_DEBUG is enabled.Chris Johns2012-04-281-1/+1
| | | | Update the assert macro to the new IMFS_jnode_t.
* Simple SMP Scheduler - Fix typo which likely broke schedulingJoel Sherrill2012-04-241-8/+31
|
* score: Remove _Stack_Adjust_size()Sebastian Huber2012-04-242-30/+0
| | | | | | | | | | The increase of the stack size by CPU_STACK_ALIGNMENT in _Thread_Stack_Allocate() is disadvantageous. This may lead to a huge over allocation for specialized stack allocators. The CPU_STACK_ALIGNMENT is at most 16 on all current RTEMS CPU ports. The mimimum stack size ensured by _Stack_Ensure_minimum() must be considerable larger than this value, otherwise stack overflows will likely occur. Thus the _Stack_Adjust_size() is also superfluous.
* nfsclient: Use UID and GID of NFS handleSebastian Huber2012-04-231-10/+10
| | | | Use UID and GID of the NFS handle for node and symbolic link creation.
* nfsclient: POSIX conformanceSebastian Huber2012-04-231-9/+37
| | | | | According to POSIX the read() call should return the maximum number of bytes available for regular files.
* PR1908: consolidate libqos code and fix installed header locationGedare Bloom2012-04-237-257/+195
|
* score: DocumentationSebastian Huber2012-04-201-0/+3
|
* score: Fix commentSebastian Huber2012-04-201-1/+2
|
* rbheap: API changes and documentationSebastian Huber2012-04-182-118/+258
|
* no_cpu: replace no_cpu_isr with rtems_isrGedare Bloom2012-04-161-6/+0
|
* libqos: generate preinstall.amGedare Bloom2012-04-161-0/+28
|
* lm32: replace lm32_isr with rtems_isrGedare Bloom2012-04-161-6/+0
|
* m68k: replace m68k_isr with rtems_isrGedare Bloom2012-04-161-2/+0
|
* libblock: PR2040: Fix recycle destination updateSebastian Huber2012-04-161-8/+7
| | | | | Check the availablity of a recycle destination segment only when it is necessary to avoid missing resycle source segment erasures.
* libblock: PR2040: Add starvation thresholdSebastian Huber2012-04-161-1/+15
| | | | | | Do not use the unavailable block count as the erased blocks starvation threshold. Use instead the block count of the largest segment. This improves the starvation resolution gain of available blocks.
* PR1908: QoS library for CBS schedulerPetr Benes2012-04-153-0/+307
| | | | Add the lipqos and sptest.
* PR1908: QoS library for CBS schedulerPetr Benes2012-04-152-0/+2
| | | | | | | Since the CBS scheduler is inspired by AQuoSA project for Linux, additional API (qreslib) compliant with Linux has been created. Sptest for qreslib included.
* rbtree: PR2046: Replace rtems_rbtree_uniqueSebastian Huber2012-04-132-17/+3
|
* libblock: Add rtems_bdbuf_set_block_size()Sebastian Huber2012-04-126-85/+165
| | | | | | | | The new function rtems_bdbuf_set_block_size() must be used to set the block size of a disk device. It will check if the block size is valid and set the new fields block_to_media_block_shift and bds_per_group of the rtems_disk_device structure. This helps to avoid complex arithmetic operations in the block device buffer get and read path.
* libblock: Change error status to fatal errorSebastian Huber2012-04-122-24/+47
| | | | | Calling the bdbuf API functions in the not configured state is now a fatal error.
* libblock: Use unprotected chain operationsSebastian Huber2012-04-121-4/+4
| | | | The transfer chain is accessed by at most one thread at a time.
* libblock: Use unprotected chain operationsSebastian Huber2012-04-121-17/+17
| | | | The chains are protected by the bdbuf cache lock.
* score: New macros and functionsSebastian Huber2012-04-114-5/+30
| | | | | | | | | | New macros o _Objects_Maximum_per_allocation(), o rtems_resource_is_unlimited(), and o rtems_resource_maximum_per_allocation(). New function o _Objects_Is_unlimited().
* nios2: New functionsSebastian Huber2012-04-112-0/+49
| | | | | | Add o _Nios2_MPU_Get_region_descriptor(), and o _Nios2_MPU_Set_region_registers().
* nios2: API changeSebastian Huber2012-04-113-4/+4
|
* rbheap: New filesSebastian Huber2012-04-114-1/+413
| | | | | | | In the Red-Black Tree Heap the administration data structures are not contained in the managed memory area. This can be used for example in a task stack allocator which protects the task stacks from access by other tasks.
* rbtree: New function _RBTree_Iterate_unprotected()Sebastian Huber2012-04-113-1/+80
|
generated by cgit v1.2.3 (git 2.25.1) at 2024-05-04 19:49:37 +0000