urtware / doc / activitydiagrams / subscriber / functions.iuml @ 408b49ce
History | View | Annotate | Download (2.24 KB)
| 1 | e87bd7c7 | Thomas Schöpping | /' |
|---|---|---|---|
| 2 | µRtWare is a lightweight publish/subscribe middleware for real-time |
||
| 3 | applications. It was developed as part of the software habitat for the |
||
| 4 | Autonomous Mini Robot [1] (AMiRo) but can be used for other purposes as well. |
||
| 5 | |||
| 6 | Copyright (C) 2018..2020 Thomas Schöpping et al. |
||
| 7 | |||
| 8 | This program is free software: you can redistribute it and/or modify |
||
| 9 | it under the terms of the GNU General Public License as published by |
||
| 10 | the Free Software Foundation, either version 3 of the License, or |
||
| 11 | (at your option) any later version. |
||
| 12 | |||
| 13 | This program is distributed in the hope that it will be useful, |
||
| 14 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
||
| 15 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||
| 16 | GNU General Public License for more details. |
||
| 17 | |||
| 18 | You should have received a copy of the GNU General Public License |
||
| 19 | along with this program. If not, see <http://www.gnu.org/licenses/>. |
||
| 20 | '/ |
||
| 21 | |||
| 22 | /' Fetch a message and update/copy all data. '/ |
||
| 23 | !function $fetch_message() |
||
| 24 | partition "fetch message" {
|
||
| 25 | fork |
||
| 26 | :update message pointer; |
||
| 27 | fork again |
||
| 28 | dd31cb03 | Thomas Schöpping | :copy message origin time; |
| 29 | e87bd7c7 | Thomas Schöpping | fork again |
| 30 | :copy message payload; |
||
| 31 | endfork |
||
| 32 | } |
||
| 33 | !endfunction |
||
| 34 | |||
| 35 | /' Find the latest message in the circular message buffer. '/ |
||
| 36 | !function $find_latest_message() |
||
| 37 | partition "find latest message" {
|
||
| 38 | dd31cb03 | Thomas Schöpping | :access ""lastMessage""; |
| 39 | e87bd7c7 | Thomas Schöpping | while (Timestamp of next message is younger?) is (yes) |
| 40 | dd31cb03 | Thomas Schöpping | fork |
| 41 | :proceed to next message; |
||
| 42 | #EEEEEE:..//URT_CFG_PUBSUB_PROFILING == true//..\ndecrement counter of consumers left (@message); |
||
| 43 | fork again |
||
| 44 | #EEEEEE:..//URT_CFG_PUBSUB_PROFILING == true//..\nincrement counter of received messages; |
||
| 45 | endfork |
||
| 46 | e87bd7c7 | Thomas Schöpping | endwhile (no) |
| 47 | } |
||
| 48 | !endfunction |
||
| 49 | |||
| 50 | /' Find the oldest message in the circular message buffer. '/ |
||
| 51 | !function $find_oldest_message() |
||
| 52 | partition "find oldest valid message" {
|
||
| 53 | if (Timestamp of last read message euqals local copy?) then (yes) |
||
| 54 | else (no) |
||
| 55 | while (Timestamp of next message is younger?) is (yes) |
||
| 56 | dd31cb03 | Thomas Schöpping | #EEEEEE:..//URT_CFG_PUBSUB_PROFILING == true//..\ndecrement counter of consumers left (@message); |
| 57 | e87bd7c7 | Thomas Schöpping | :proceed to next message; |
| 58 | endwhile (no) |
||
| 59 | endif |
||
| 60 | dd31cb03 | Thomas Schöpping | #EEEEEE:..//URT_CFG_PUBSUB_PROFILING == true//..\ndecrement counter of consumers left (@message); |
| 61 | e87bd7c7 | Thomas Schöpping | :proceed to next message; |
| 62 | } |
||
| 63 | !endfunction |