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
|
/*
* Copyright (c) Xerox Corporation 1998. All rights reserved.
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by the
* Free Software Foundation; either version 2 of the License, or (at your
* option) any later version.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License along
* with this program; if not, write to the Free Software Foundation, Inc.,
* 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*
* Linking this file statically or dynamically with other modules is making
* a combined work based on this file. Thus, the terms and conditions of
* the GNU General Public License cover the whole combination.
*
* In addition, as a special exception, the copyright holders of this file
* give you permission to combine this file with free software programs or
* libraries that are released under the GNU LGPL and with code included in
* the standard release of ns-2 under the Apache 2.0 license or under
* otherwise-compatible licenses with advertising requirements (or modified
* versions of such code, with unchanged license). You may copy and
* distribute such a system following the terms of the GNU GPL for this
* file and the licenses of the other code concerned, provided that you
* include the source code of that other code when and as the GNU GPL
* requires distribution of source code.
*
* Note that people who make modified versions of this file are not
* obligated to grant this special exception for their modified versions;
* it is their choice whether to do so. The GNU General Public License
* gives permission to release a modified version without this exception;
* this exception also makes it possible to release a modified version
* which carries forward this exception.
*
*/
//
// Auxiliary classes for Http multicast invalidation proxy cache
//
#include "http-aux.h"
#include "http.h"
void PushTimer::expire(Event *)
{
a_->timeout(HTTP_UPDATE);
}
void HBTimer::expire(Event *)
{
a_->timeout(HTTP_INVALIDATION);
}
void LivenessTimer::expire(Event *)
{
a_->handle_node_failure(nbr_);
}
void HttpHbData::extract(InvalidationRec*& head)
{
// XXX head must be passed in from outside, because the
// InvalidationRec list will obtain the address of head
head = NULL;
InvalidationRec *q = NULL;
// reconstruct a list of invalidation records.
// We keep the updating record
for (int i = 0; i < num_inv(); i++) {
// Used only to mark that this page will be send in
// the next multicast update. The updating field in
// this agent will only be set after it gets the real
// update. Here we set this field temporarily so that
// recv_inv can find out the
q = inv_rec()[i].copyto();
q->insert(&head);
}
}
NeighborCache::~NeighborCache()
{
timer_->cancel();
delete timer_;
ServerEntry *s = sl_.gethead(), *p;
while (s != NULL) {
p = s;
s = s->next();
delete p;
}
}
int NeighborCache::is_server_down(int sid)
{
ServerEntry *s = sl_.gethead();
while (s != NULL) {
if (s->server() == sid)
return s->is_down();
s = s->next();
}
return 0;
}
void NeighborCache::server_down(int sid)
{
ServerEntry *s = sl_.gethead();
while (s != NULL) {
if (s->server() == sid)
s->down();
s = s->next();
}
}
void NeighborCache::server_up(int sid)
{
ServerEntry *s = sl_.gethead();
while (s != NULL) {
if (s->server() == sid)
s->up();
s = s->next();
}
}
void NeighborCache::invalidate(HttpMInvalCache *c)
{
ServerEntry *s = sl_.gethead();
while (s != NULL) {
c->invalidate_server(s->server());
s = s->next();
}
}
void NeighborCache::pack_leave(HttpLeaveData& data)
{
int i;
ServerEntry *s;
for (i = 0, s = sl_.gethead(); s != NULL; s = s->next(), i++)
data.add(i, s->server());
}
void NeighborCache::add_server(int sid)
{
ServerEntry *s = new ServerEntry(sid);
sl_.insert(s);
}
|
