Statistics
| Branch: | Revision:

urtware / doc / activitydiagrams / subscriber / functions.iuml @ e87bd7c7

History | View | Annotate | Download (1.965 KB)

1
/'
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
        :copy timestamp of message;
29
    fork again
30
      :copy message payload;
31
    fork again
32
      if (Optional output argument ""latency"" given?) then (yes)
33
        :set ""latency"" value (now - message origin time);
34
      else (no)
35
      endif
36
    endfork
37
  }
38
!endfunction
39

    
40
/' Find the latest message in the circular message buffer. '/
41
!function $find_latest_message()
42
  partition "find latest message" {
43
    :access last read message;
44
    while (Timestamp of next message is younger?) is (yes)
45
      :proceed to next message;
46
    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
        :proceed to next message;
57
      endwhile (no)
58
    endif
59
    :proceed to next message;
60
  }
61
!endfunction
62