1 | /* Message_queue_task |
---|
2 | * |
---|
3 | * This task continuously sends messages to and receives messages from |
---|
4 | * a global message queue. The message buffer is viewed as an array |
---|
5 | * of two sixty-four bit counts which are incremented when a message is |
---|
6 | * received. |
---|
7 | * |
---|
8 | * Input parameters: |
---|
9 | * argument - task argument |
---|
10 | * |
---|
11 | * Output parameters: NONE |
---|
12 | * |
---|
13 | * COPYRIGHT (c) 1989-1999. |
---|
14 | * On-Line Applications Research Corporation (OAR). |
---|
15 | * |
---|
16 | * The license and distribution terms for this file may be |
---|
17 | * found in the file LICENSE in this distribution or at |
---|
18 | * http://www.rtems.com/license/LICENSE. |
---|
19 | * |
---|
20 | * $Id$ |
---|
21 | */ |
---|
22 | |
---|
23 | #include "system.h" |
---|
24 | |
---|
25 | rtems_task Message_queue_task( |
---|
26 | rtems_task_argument index |
---|
27 | ) |
---|
28 | { |
---|
29 | rtems_status_code status; |
---|
30 | uint32_t count; |
---|
31 | uint32_t yield_count; |
---|
32 | uint32_t *buffer_count; |
---|
33 | uint32_t *overflow_count; |
---|
34 | uint32_t size; |
---|
35 | |
---|
36 | Msg_buffer[ index ][0] = 0; |
---|
37 | Msg_buffer[ index ][1] = 0; |
---|
38 | Msg_buffer[ index ][2] = 0; |
---|
39 | Msg_buffer[ index ][3] = 0; |
---|
40 | |
---|
41 | puts( "Getting ID of msg queue" ); |
---|
42 | while ( FOREVER ) { |
---|
43 | status = rtems_message_queue_ident( |
---|
44 | Queue_name[ 1 ], |
---|
45 | RTEMS_SEARCH_ALL_NODES, |
---|
46 | &Queue_id[ 1 ] |
---|
47 | ); |
---|
48 | if ( status == RTEMS_SUCCESSFUL ) |
---|
49 | break; |
---|
50 | puts( "rtems_message_queue_ident FAILED!!" ); |
---|
51 | rtems_task_wake_after(2); |
---|
52 | } |
---|
53 | |
---|
54 | if ( Multiprocessing_configuration.node == 1 ) { |
---|
55 | status = rtems_message_queue_send( |
---|
56 | Queue_id[ 1 ], |
---|
57 | (long (*)[4])Msg_buffer[ index ], |
---|
58 | 16 |
---|
59 | ); |
---|
60 | directive_failed( status, "rtems_message_queue_send" ); |
---|
61 | overflow_count = &Msg_buffer[ index ][0]; |
---|
62 | buffer_count = &Msg_buffer[ index ][1]; |
---|
63 | } else { |
---|
64 | overflow_count = &Msg_buffer[ index ][2]; |
---|
65 | buffer_count = &Msg_buffer[ index ][3]; |
---|
66 | } |
---|
67 | |
---|
68 | while ( Stop_Test == FALSE ) { |
---|
69 | yield_count = 100; |
---|
70 | |
---|
71 | for ( count=MESSAGE_DOT_COUNT ; Stop_Test == FALSE && count ; count-- ) { |
---|
72 | status = rtems_message_queue_receive( |
---|
73 | Queue_id[ 1 ], |
---|
74 | (long (*)[4])Msg_buffer[ index ], |
---|
75 | &size, |
---|
76 | RTEMS_DEFAULT_OPTIONS, |
---|
77 | RTEMS_NO_TIMEOUT |
---|
78 | ); |
---|
79 | directive_failed( status, "rtems_message_queue_receive" ); |
---|
80 | |
---|
81 | if ( *buffer_count == (uint32_t )0xffffffff ) { |
---|
82 | *buffer_count = 0; |
---|
83 | *overflow_count += 1; |
---|
84 | } else |
---|
85 | *buffer_count += 1; |
---|
86 | |
---|
87 | status = rtems_message_queue_send( |
---|
88 | Queue_id[ 1 ], |
---|
89 | (long (*)[4])Msg_buffer[ index ], |
---|
90 | 16 |
---|
91 | ); |
---|
92 | directive_failed( status, "rtems_message_queue_send" ); |
---|
93 | |
---|
94 | if (Stop_Test == FALSE) |
---|
95 | if ( Multiprocessing_configuration.node == 1 && --yield_count == 0 ) { |
---|
96 | status = rtems_task_wake_after( RTEMS_YIELD_PROCESSOR ); |
---|
97 | directive_failed( status, "rtems_task_wake_after" ); |
---|
98 | |
---|
99 | yield_count = 100; |
---|
100 | } |
---|
101 | } |
---|
102 | put_dot( 'm' ); |
---|
103 | } |
---|
104 | |
---|
105 | Exit_test(); |
---|
106 | } |
---|