![]() |
|
|||
File indexing completed on 2025-05-11 08:24:36
0001 /* SPDX-License-Identifier: BSD-2-Clause */ 0002 0003 /* Task_1 0004 * 0005 * This routine serves as a test task. It verifies the basic task 0006 * switching capabilities of the executive. 0007 * 0008 * Input parameters: 0009 * argument - task argument 0010 * 0011 * Output parameters: NONE 0012 * 0013 * COPYRIGHT (c) 1989-1999. 0014 * On-Line Applications Research Corporation (OAR). 0015 * 0016 * Redistribution and use in source and binary forms, with or without 0017 * modification, are permitted provided that the following conditions 0018 * are met: 0019 * 1. Redistributions of source code must retain the above copyright 0020 * notice, this list of conditions and the following disclaimer. 0021 * 2. Redistributions in binary form must reproduce the above copyright 0022 * notice, this list of conditions and the following disclaimer in the 0023 * documentation and/or other materials provided with the distribution. 0024 * 0025 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 0026 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 0027 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 0028 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE 0029 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 0030 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 0031 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 0032 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 0033 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 0034 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 0035 * POSSIBILITY OF SUCH DAMAGE. 0036 */ 0037 0038 #ifdef HAVE_CONFIG_H 0039 #include "config.h" 0040 #endif 0041 0042 #include "system.h" 0043 #include <time.h> 0044 #include <sched.h> 0045 0046 void *Task_1( 0047 void *argument 0048 ) 0049 { 0050 puts( "Task_1 - exitting" ); 0051 pthread_exit( NULL ); 0052 0053 return NULL; /* just so the compiler thinks we returned something */ 0054 } 0055 0056 void *Task_2( 0057 void *argument 0058 ) 0059 { 0060 int i = 0; 0061 time_t now, start; 0062 0063 /* 0064 * sleep long enough to let the init thread join with us. 0065 */ 0066 usleep(10000); 0067 0068 /* 0069 * Change our priority so we are running at a logically higher 0070 * priority than our "ss_high_priority". This should result in 0071 * our replenishment period not touching our priority. 0072 */ 0073 0074 /* 0075 * Consume time so the cpu budget callout will run. 0076 * 0077 * DO NOT BLOCK!!! 0078 */ 0079 start = time(&start); 0080 while( i <= 10 ) { 0081 do { 0082 now = time(&now); 0083 } while (start == now); 0084 start = time(&start); 0085 0086 printf( "Time elapsed Task_2: %2d (seconds)\n", i++ ); 0087 } 0088 0089 puts( "Task_2 - exitting" ); 0090 pthread_exit( NULL ); 0091 return NULL; 0092 }
[ Source navigation ] | [ Diff markup ] | [ Identifier search ] | [ general search ] |
This page was automatically generated by the 2.3.7 LXR engine. The LXR team |
![]() ![]() |