libtests/malloctest/task1.c

0001 /* SPDX-License-Identifier: BSD-2-Clause */
0002
0003 /*  task1.c
0004  *
0005  *  This set of three tasks do some simple task switching for about
0006  *  15 seconds and then call a routine to "blow the stack".
0007  *
0008  *  COPYRIGHT (c) 1989-2009.
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 #ifdef HAVE_CONFIG_H
0034 #include "config.h"
0035 #endif
0036
0037 #include "system.h"
0038 #include <rtems/malloc.h>
0039 #include <string.h>
0040 #include <stdlib.h>
0041
0042 #define NUM_PASSES 100
0043
0044 rtems_task Task_1_through_5(
0045   rtems_task_argument argument
0046 )
0047 {
0048   int i;
0049   unsigned int passes = 0;
0050   rtems_id          tid;
0051   rtems_time_of_day time;
0052   rtems_status_code status;
0053   unsigned char *mem_ptr;
0054   int mem_amt;
0055
0056   status = rtems_task_ident( RTEMS_WHO_AM_I, RTEMS_SEARCH_ALL_NODES, &tid );
0057   directive_failed( status, "rtems_task_ident" );
0058
0059   while (TRUE)
0060   {
0061     bool malloc_walk_ok;
0062
0063     if ( passes++ > NUM_PASSES ) {
0064     TEST_END();
0065         rtems_test_exit(0);
0066     }
0067
0068     status = rtems_clock_get_tod( &time );
0069     directive_failed( status, "rtems_clock_get_tod" );
0070
0071     put_name( Task_name[ task_number( tid ) ], FALSE );
0072     print_time( " - rtems_clock_get_tod - ", &time, "\n" );
0073
0074     mem_amt = ((int)((float)rand()*1000.0/(float)RAND_MAX));
0075     while (!(mem_ptr = malloc ( mem_amt))) {
0076     printf("out of memory... trying again.\n");
0077     mem_amt = ((int)((float)rand()*1000.0/(float)RAND_MAX));
0078     }
0079     printf("mallocing %d bytes\n",mem_amt);
0080     memset( mem_ptr, mem_amt, mem_amt );
0081     malloc_walk_ok = malloc_walk( 1, false );
0082     rtems_test_assert( malloc_walk_ok );
0083     status = rtems_task_wake_after(
0084       task_number( tid ) * 1 * rtems_clock_get_ticks_per_second()/4 );
0085     for (i=0; i < mem_amt; i++)
0086     {
0087        if ( mem_ptr[i] != (mem_amt & 0xff))
0088        {
0089           printf("failed %d, %d, 0x%x, 0x%x\n",i,mem_amt,mem_ptr[i],mem_amt&0xff);
0090           rtems_test_exit(1);
0091        }
0092     }
0093     directive_failed( status, "rtems_task_wake_after" );
0094     free( mem_ptr );
0095   }
0096 }