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
|
// **********************************************************************
//
// Copyright (c) 2003-2005 ZeroC, Inc. All rights reserved.
//
// This copy of Ice is licensed to you under the terms described in the
// ICE_LICENSE file included in this distribution.
//
// **********************************************************************
package IceGrid.TreeNode;
import IceGrid.ApplicationDescriptor;
import IceGrid.NodeDescriptor;
import IceGrid.TreeModelI;
import IceGrid.Model;
import IceGrid.NodeDescriptor;
import IceGrid.NodeDynamicInfo;
import IceGrid.NodeUpdateDescriptor;
import IceGrid.ServerDynamicInfo;
import IceGrid.AdapterDynamicInfo;
import IceGrid.ServerState;
public class Nodes extends Parent
{
public Nodes(java.util.Map nodeMap, Application application)
{
super("Nodes", application.getModel());
_descriptors = nodeMap;
java.util.Iterator p = nodeMap.entrySet().iterator();
while(p.hasNext())
{
java.util.Map.Entry entry = (java.util.Map.Entry)p.next();
String nodeName = (String)entry.getKey();
NodeDescriptor nodeDescriptor = (NodeDescriptor)entry.getValue();
addChild(new Node(nodeName, nodeDescriptor, application));
}
//
// Also create a Node for each node that is up
//
Root root = _model.getRoot();
p = root.getNodesUp().iterator();
while(p.hasNext())
{
String nodeName = (String)p.next();
if(findChild(nodeName) == null)
{
addChild(new Node(nodeName, application.getModel()));
}
}
}
void update(java.util.List updates, String[] removeNodes)
{
Application application = (Application)getParent();
//
// Note: _descriptors has already the nodes removed but
// needs to get the updated and new NodeDescriptors
//
//
// One big set of removes
//
removeChildren(removeNodes);
//
// One big set of updates, followed by inserts
//
java.util.Vector newChildren = new java.util.Vector();
java.util.Iterator p = updates.iterator();
while(p.hasNext())
{
NodeUpdateDescriptor update = (NodeUpdateDescriptor)p.next();
Node node = findNode(update.name);
if(node == null)
{
NodeDescriptor nodeDescriptor = new NodeDescriptor(update.variables,
update.serverInstances,
update.servers);
_descriptors.put(update.name, nodeDescriptor);
node = new Node(update.name, nodeDescriptor, application);
newChildren.add(node);
}
else
{
NodeDescriptor nodeDescriptor = node.update(update, application);
if(nodeDescriptor != null)
{
_descriptors.put(update.name, nodeDescriptor);
}
}
}
addChildren((CommonBaseI[])newChildren.toArray(new CommonBaseI[0]));
p = newChildren.iterator();
while(p.hasNext())
{
ServerTemplate serverTemplate = (ServerTemplate)p.next();
serverTemplate.setParent(this);
}
}
void nodeUp(String nodeName)
{
Node node = findNode(nodeName);
if(node == null)
{
node = new Node(nodeName, _model);
addChild(node, true);
}
else
{
node.up();
}
}
void nodeDown(String nodeName)
{
//
// We remove nodes that are down and without descriptor
//
Node node = findNode(nodeName);
if(node != null)
{
if(node.down())
{
removeChild(nodeName, true);
}
}
//
// Else log a warning?
//
}
public void cleanup()
{
java.util.Iterator p = _children.iterator();
while(p.hasNext())
{
Node node = (Node)p.next();
node.cleanup();
}
}
Node findNode(String nodeName)
{
return (Node)findChild(nodeName);
}
private java.util.Map _descriptors;
}
|
