1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
|
// $Id$
#include "TreeBaseC.h"
#include "TreeControllerC.h"
#include "TreeNodeC.h"
#include "ace/Get_Opt.h"
ACE_RCSID(Forward, client, "$Id$")
const char *ior = "file://test.ior";
int
parse_args (int argc, char *argv[])
{
ACE_Get_Opt get_opts (argc, argv, "k:");
int c;
while ((c = get_opts ()) != -1)
switch (c)
{
case 'k':
ior = get_opts.optarg;
break;
case '?':
default:
ACE_ERROR_RETURN ((LM_ERROR,
"usage: %s "
"-k <ior> "
"\n",
argv [0]),
-1);
}
// Indicates sucessful parsing of the command line
return 0;
}
void
dump_node (BaseNode *bn, int indent)
{
if (bn == 0) return;
// This is ugly I know
int i = indent;
for (; i != 0; i--) ACE_DEBUG ((LM_DEBUG, " "));
StringNode *sn = StringNode::_downcast (bn);
if (sn != 0)
{
ACE_DEBUG ((LM_DEBUG, "%x <StringNode> %s\n",
bn,
sn->name ()));
}
else
{
ACE_DEBUG ((LM_DEBUG,
"%x <BaseNode> \n",
bn));
}
dump_node (bn->left (), indent + 1);
dump_node (bn->right (), indent + 1);
}
void
dump_tree (TreeController *tc)
{
ACE_DEBUG ((LM_DEBUG,
"(%P|%t) start tree dump <%x>\n",
tc));
dump_node (tc->root (), 1);
ACE_DEBUG ((LM_DEBUG,
"(%P|%t) end tree dump <%x>\n",
tc));
}
int
main (int argc, char *argv[])
{
try
{
CORBA::ORB_var orb =
CORBA::ORB_init (argc, argv);
if (parse_args (argc, argv) != 0)
return 1;
// All factories are kindly provided by
// compiler so we just to put everything in a right order.
// Create and register factory for BaseNode.
BaseNode_init *bn_factory = 0;
ACE_NEW_RETURN (bn_factory,
BaseNode_init,
1);
orb->register_value_factory (bn_factory->tao_repository_id (),
bn_factory);
bn_factory->_remove_ref (); // release ownership
// Create and register factory for TreeController.
TreeController_init *tc_factory = 0;
ACE_NEW_RETURN (tc_factory,
TreeController_init,
1);
orb->register_value_factory (tc_factory->tao_repository_id (),
tc_factory);
tc_factory->_remove_ref (); // release ownership
// Create and register factory for StringNode.
StringNode_init *sn_factory = 0;
ACE_NEW_RETURN (sn_factory,
StringNode_init,
1);
orb->register_value_factory (sn_factory->tao_repository_id (),
sn_factory);
sn_factory->_remove_ref (); // release ownership
//Well, done with factories.
// Obtain reference to the object.
CORBA::Object_var tmp =
orb->string_to_object(ior);
Test_var test = Test::_narrow(tmp.in ());
if (CORBA::is_nil (test.in ()))
{
ACE_ERROR_RETURN ((LM_DEBUG,
"Nil Test reference <%s>\n",
ior),
1);
}
// Now build simple graph (tree in our case).
TreeController_var tc;
ACE_NEW_RETURN (tc.inout (),
OBV_TreeController,
1);
// Create the root node.
{
StringNode_var sn;
ACE_NEW_RETURN (sn.inout (),
OBV_StringNode,
1);
sn->name ((const char*)("RootNode"));
tc->root (sn);
// Create the left leaf.
{
StringNode_var dummy;
ACE_NEW_RETURN (dummy.inout (),
OBV_StringNode,
1);
dummy->name ((const char*)("LeftNode"));
sn->left (dummy);
}
// Create the right leaf.
{
StringNode_var dummy;
ACE_NEW_RETURN (dummy.inout (),
OBV_StringNode,
1);
dummy->name ((const char*)("RightNode"));
sn->right (dummy);
// dummy->right (sn); // ;-)
}
}
// Dump the tree.
dump_tree (tc.in ());
TreeController_var result_tc =
test->reflect (tc.in ());
// Dump the resulting tree.
dump_tree (result_tc.in ());
test->shutdown ();
ACE_DEBUG ((LM_DEBUG, "(%P|%t) client - test finished\n"));
orb->destroy ();
}
catch (const CORBA::Exception& ex)
{
ex._tao_print_exception ("Exception caught:");
return 1;
}
return 0;
}
|
