![]() |
|
|||
File indexing completed on 2025-05-11 08:24:46
0001 /* SPDX-License-Identifier: BSD-2-Clause */ 0002 0003 /* cbsparams.h 0004 * 0005 * This include file contains information that is included in every 0006 * function in the test set. 0007 * 0008 * COPYRIGHT (c) 1989-1999. 0009 * On-Line Applications Research Corporation (OAR). 0010 * 0011 * Redistribution and use in source and binary forms, with or without 0012 * modification, are permitted provided that the following conditions 0013 * are met: 0014 * 1. Redistributions of source code must retain the above copyright 0015 * notice, this list of conditions and the following disclaimer. 0016 * 2. Redistributions in binary form must reproduce the above copyright 0017 * notice, this list of conditions and the following disclaimer in the 0018 * documentation and/or other materials provided with the distribution. 0019 * 0020 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 0021 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 0022 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 0023 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE 0024 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 0025 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 0026 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 0027 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 0028 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 0029 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 0030 * POSSIBILITY OF SUCH DAMAGE. 0031 */ 0032 0033 /* This file was generated with the following parameters: 0034 -T 30,10,0 -T 40,10,0 -T 50,10,0 -T 70,10,0 -A 1,100,7 -A 100,5,4 0035 */ 0036 0037 #ifndef __CBSPARAMS_H_ 0038 #define __CBSPARAMS_H_ 0039 0040 #include "system.h" 0041 0042 rtems_task_priority Priorities[1+NUM_TASKS]= { 0, 30, 40, 50, 70, 254, 254 }; 0043 0044 uint32_t Periods[1+NUM_PERIODIC_TASKS] = { 0, 30, 40, 50, 70 }; 0045 0046 uint32_t Execution[1+NUM_TASKS] = { 0, 10, 10, 10, 10, 100, 5 }; 0047 0048 uint32_t Phases[1+NUM_TASKS] = { 0, 0, 0, 0, 0, 7, 4 }; 0049 0050 #define build_task_name() do { \ 0051 Task_name[ 1 ] = rtems_build_name( 'P', 'T', '1', ' ' );\ 0052 Task_name[ 2 ] = rtems_build_name( 'P', 'T', '2', ' ' );\ 0053 Task_name[ 3 ] = rtems_build_name( 'P', 'T', '3', ' ' );\ 0054 Task_name[ 4 ] = rtems_build_name( 'P', 'T', '4', ' ' );\ 0055 Task_name[ 5 ] = rtems_build_name( 'A', 'T', '5', ' ' );\ 0056 Task_name[ 6 ] = rtems_build_name( 'A', 'T', '6', ' ' );\ 0057 } while(0) 0058 0059 #endif
[ Source navigation ] | [ Diff markup ] | [ Identifier search ] | [ general search ] |
This page was automatically generated by the 2.3.7 LXR engine. The LXR team |
![]() ![]() |