Ph.D. - geht es zur Homepage der Informatik des Fachbereiches 3 ...

Appendix E. openETCS Generator
46
47 } // e l s e i f ( Object−>second−>m_Type == "SubFunction ")
48
49 } // f o r ( Object = pFunctionBlock−>m_ObjectSet . begin ( ) ; Object !=
pFunctionBlock−>m_ObjectSet . end ( ) ; Object++)
50
51 } // void CCPPGenerator : : BuildAbstractModel ( )
Listing E.2: Abstract data flow model full creation
1 // process a l l nodes found ( i n c l u d i n g sub−graphs )
2 f o r ( n = FBNodes . b e g i n ( ) ; n != FBNodes . end ( ) ; n++)
3 {
4 // process a l l i n p u t s o f current node
5 f o r ( i = n−>second . m_Inputs . b e g i n ( ) ; i != n−>second . m_Inputs . end ( ) ; i ++)
6 {
7 // s t o r e OID o f current output node
8 OID = (∗ i )−>m_OID;
9
10 // d e l e t e current undefined o b j e c t
11 delete (∗ i ) ;
12
13 // use p o i n t e r to a c t u a l node at i t e r a t o r s p l a c e
14 ∗ i = &FBNodes [ OID ] ;
15
16 } // f o r ( i = n−>second . m_Inputs . begin ( ) ; i != n−>second . m_Inputs . end ( ) ; i++)
17
18 } // f o r (n = FBNodes . begin ( ) ; n != FBNodes . end ( ) ; n++)
Listing E.3: Abstract data flow model processing
1 void CCPPGenerator : : P r o c e s s A b s t r a c t M o d e l ( const oETCS : : GEN : : CFBNode & Node , : : s t d : : l i s t <
: : s t d : : s t r i n g >& ExecutionOrder , : : s t d : : v e c t o r < const oETCS : : GEN : : CFBNode ∗ >& NodeStack )
throw ( )
2 {
3 d e c l t y p e ( Node . m_Inputs . b e g i n ( ) ) i ;
4 d e c l t y p e ( ExecutionOrder . b e g i n ( ) ) s ;
5 d e c l t y p e ( NodeStack . b e g i n ( ) ) ns ;
6 bool bFound ( f a l s e ) ;
7 bool bOnStack ( f a l s e ) ;
8
9
10 // check i f t h i s node i s already on node s t a c k
11 f o r ( ns = NodeStack . b e g i n ( ) ; ns != NodeStack . end ( ) && not bOnStack ; ns++)
12 {
13 // check i f current node on s t a c k i s current node
14 bOnStack = (∗ ns == &Node ) ;
15
16 } // f o r ( ns = NodeStack . begin ( ) ; ns != NodeStack . end ( ) && not bOnStack ; ns++)
17
18
19 // only process node i f i t i s not on s t a c k to avoid i n f i n i t e r e c u r s i o n s on data f l o w l o o p s
20 i f ( not bOnStack )
21 {
22 // check i f current node already e x i s t s on execution order s t a c k
23 f o r ( s = ExecutionOrder . b e g i n ( ) ; s != ExecutionOrder . end ( ) && not bFound ; s++)
24 {
25 // check i f current s t a c k element corresponds to current node ’ s OID
26 bFound = (∗ s == Node .m_OID) ;
27
28 } // f o r ( s = ExecutionOrder . begin ( ) ; s != ExecutionOrder . end ( ) && not bFound ; s++)
29
30
31 // check i f node has any input
32 i f ( Node . m_Inputs . empty ( ) )
33 {
34 // check i f node i s already on s t a c k
35 i f ( not bFound )
36 {
37 // node i s a flow−chain s t a r t point and i s d i r e c t l y added to the execution order
38 ExecutionOrder . push_back ( Node .m_OID) ;
39
40 } // i f ( not bFound)
41
42 } // i f (Node . m_Inputs . empty ( ) )
43 e l s e
44 {
45 // process a l l input nodes
46 f o r ( i = Node . m_Inputs . b e g i n ( ) ; i != Node . m_Inputs . end ( ) ; i ++)
47 {
48 // p l a c e current node on s t a c k
264