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 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438
|
/*
* Copyright (c) 2006-2009 Red Hat Inc
*
* All rights reserved.
*
* Author: Christine Caulfield <ccaulfie@redhat.com>
*
* This software licensed under BSD license, the text of which follows:
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* - Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* - Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* - Neither the name of the MontaVista Software, Inc. nor the names of its
* contributors may be used to endorse or promote products derived from this
* software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
* THE POSSIBILITY OF SUCH DAMAGE.
*/
#include <config.h>
#include <inttypes.h>
#include <stdio.h>
#include <stdlib.h>
#include <errno.h>
#include <unistd.h>
#include <string.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <sys/select.h>
#include <sys/uio.h>
#include <sys/un.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <time.h>
#include <sys/time.h>
#include <assert.h>
#include <limits.h>
#include <corosync/corotypes.h>
#include <corosync/cpg.h>
#include <corosync/swab.h>
#ifdef QBLOG
#include <qb/qblog.h>
#endif
#ifndef HOST_NAME_MAX
#define HOST_NAME_MAX _POSIX_HOST_NAME_MAX
#endif
static int quit = 0;
static int show_ip = 0;
static int restart = 0;
static uint32_t nodeidStart = 0;
static void print_localnodeid(cpg_handle_t handle);
static void print_cpgname (const struct cpg_name *name)
{
unsigned int i;
for (i = 0; i < name->length; i++) {
printf ("%c", name->value[i]);
}
}
static char * node_pid_format(unsigned int nodeid, unsigned int pid) {
static char buffer[100];
if (show_ip) {
struct in_addr saddr;
#if __BYTE_ORDER == __LITTLE_ENDIAN
saddr.s_addr = swab32(nodeid);
#else
saddr.s_addr = nodeid;
#endif
sprintf(buffer, "node/pid %s/%d", inet_ntoa(saddr),pid);
}
else {
sprintf(buffer, "node/pid " CS_PRI_NODE_ID "/%d", nodeid, pid);
}
return buffer;
}
static void
print_time(void)
{
#define MAXLEN (256)
char buf[MAXLEN];
char hostname[HOST_NAME_MAX];
struct timeval tnow;
time_t t;
size_t len;
char *s = buf;
len = sizeof(hostname);
if(gethostname(hostname, len) == 0) {
char *longName;
hostname[len-1] = '\0';
longName = hostname;
if( (longName = strstr( hostname, "." )) != NULL )
*longName = '\0';
}
strcpy(s, hostname);
s += strlen(hostname);
s += snprintf(s, sizeof(buf)-(s-buf), ":%d", getpid());
t = time(0);
gettimeofday( &tnow, 0 );
s += strftime(s, sizeof(buf)-(s-buf) , " %Y-%m-%d %T", localtime(&t));
s += snprintf(s, sizeof(buf)-(s-buf), ".%03ld", tnow.tv_usec/1000);
assert(s-buf < (int)sizeof(buf));
printf("%s\n", buf);
}
static void DeliverCallback (
cpg_handle_t handle,
const struct cpg_name *groupName,
uint32_t nodeid,
uint32_t pid,
void *msg,
size_t msg_len)
{
print_time();
printf("DeliverCallback: message (len=%lu)from %s: '%s'\n",
(unsigned long int) msg_len, node_pid_format(nodeid, pid),
(const char *)msg);
}
static void ConfchgCallback (
cpg_handle_t handle,
const struct cpg_name *groupName,
const struct cpg_address *member_list, size_t member_list_entries,
const struct cpg_address *left_list, size_t left_list_entries,
const struct cpg_address *joined_list, size_t joined_list_entries)
{
unsigned int i;
int result;
uint32_t nodeid;
print_time();
printf("ConfchgCallback: group '");
print_cpgname(groupName);
printf("'\n");
print_localnodeid(handle);
for (i=0; i<joined_list_entries; i++) {
printf("joined %s reason: %d\n",
node_pid_format(joined_list[i].nodeid, joined_list[i].pid),
joined_list[i].reason);
}
for (i=0; i<left_list_entries; i++) {
printf("left %s reason: %d\n",
node_pid_format(left_list[i].nodeid, left_list[i].pid),
left_list[i].reason);
}
printf("nodes in group now %lu\n",
(unsigned long int) member_list_entries);
for (i=0; i<member_list_entries; i++) {
printf("%s\n",
node_pid_format(member_list[i].nodeid, member_list[i].pid));
}
result = cpg_local_get(handle, &nodeid);
if(result != CS_OK) {
printf("failed to get local nodeid %d\n", result);
nodeid = 0;
}
/* Is it us??
NOTE: in reality we should also check the nodeid */
if (left_list_entries && (pid_t)left_list[0].pid == getpid()) {
printf("We might have left the building pid %d\n", left_list[0].pid);
/* can only use nodeidStart as a reliable check (version <= 1.4.2) */
if(nodeidStart) {
/* report dynamic nature of nodeid returned from local_get */
/* local get of nodeid might change identity from original! */
if(htonl((uint32_t)nodeid) == INADDR_LOOPBACK) {
printf("We probably left the building switched identity? start nodeid " CS_PRI_NODE_ID " nodeid " CS_PRI_NODE_ID " current nodeid " CS_PRI_NODE_ID " pid %d\n", nodeidStart, left_list[0].nodeid, nodeid, left_list[0].pid);
} else if(htonl((uint32_t)left_list[0].nodeid) == INADDR_LOOPBACK) {
printf("We probably left the building started alone? start nodeid " CS_PRI_NODE_ID " nodeid " CS_PRI_NODE_ID " current nodeid " CS_PRI_NODE_ID " pid %d\n", nodeidStart, left_list[0].nodeid, nodeid, left_list[0].pid);
}
/* a possibly reliable way to check is based on original address */
if(left_list[0].nodeid == nodeidStart) {
printf("We have left the building direct match start nodeid " CS_PRI_NODE_ID " nodeid " CS_PRI_NODE_ID " local get current nodeid " CS_PRI_NODE_ID " pid %d\n", nodeidStart, left_list[0].nodeid, nodeid, left_list[0].pid);
// quit = 1;
restart = 1;
} else {
printf("Probably another node with matching pid start nodeid " CS_PRI_NODE_ID " nodeid " CS_PRI_NODE_ID " current nodeid " CS_PRI_NODE_ID " pid %d\n", nodeidStart, left_list[0].nodeid, nodeid, left_list[0].pid);
}
}
}
}
static void TotemConfchgCallback (
cpg_handle_t handle,
struct cpg_ring_id ring_id,
uint32_t member_list_entries,
const uint32_t *member_list)
{
unsigned int i;
printf("\n");
print_time();
printf ("TotemConfchgCallback: ringid (" CS_PRI_RING_ID ")\n",
ring_id.nodeid, ring_id.seq);
printf("active processors %lu: ",
(unsigned long int) member_list_entries);
for (i=0; i<member_list_entries; i++) {
printf(CS_PRI_NODE_ID " ", member_list[i]);
}
printf ("\n");
}
static cpg_model_v1_data_t model_data = {
.cpg_deliver_fn = DeliverCallback,
.cpg_confchg_fn = ConfchgCallback,
.cpg_totem_confchg_fn = TotemConfchgCallback,
.flags = CPG_MODEL_V1_DELIVER_INITIAL_TOTEM_CONF,
};
static struct cpg_name group_name;
#define retrybackoff(counter) { \
counter++; \
printf("Restart operation after %ds\n", counter); \
sleep((unsigned int)counter); \
restart = 1; \
continue; \
}
#define cs_repeat_init(counter, max, code) do { \
code; \
if (result == CS_ERR_TRY_AGAIN || result == CS_ERR_QUEUE_FULL || result == CS_ERR_LIBRARY) { \
counter++; \
printf("Retrying operation after %ds\n", counter); \
sleep((unsigned int)counter); \
} else { \
break; \
} \
} while (counter < max)
#define cs_repeat(counter, max, code) do { \
code; \
if (result == CS_ERR_TRY_AGAIN || result == CS_ERR_QUEUE_FULL) { \
counter++; \
printf("Retrying operation after %ds\n", counter); \
sleep((unsigned int)counter); \
} else { \
break; \
} \
} while (counter < max)
static void print_localnodeid(cpg_handle_t handle)
{
char addrStr[128];
unsigned int retries;
unsigned int nodeid;
struct sockaddr_storage addr;
struct sockaddr_in *v4addr = (struct sockaddr_in *)&addr;
int result;
retries = 0;
cs_repeat(retries, 30, result = cpg_local_get(handle, &nodeid));
if (result != CS_OK) {
printf ("Could not get local node id\n");
} else {
v4addr->sin_addr.s_addr = nodeid;
if(inet_ntop(AF_INET, (const void *)&v4addr->sin_addr.s_addr,
addrStr, (socklen_t)sizeof(addrStr)) == NULL) {
addrStr[0] = 0;
}
printf ("Local node id is %s/" CS_PRI_NODE_ID " result %d\n", addrStr, nodeid, result);
}
}
int main (int argc, char *argv[]) {
cpg_handle_t handle;
fd_set read_fds;
int select_fd;
int result;
int retries;
const char *options = "i";
int opt;
unsigned int nodeid;
char *fgets_res;
struct cpg_address member_list[CPG_MEMBERS_MAX];
int member_list_entries;
int i;
int recnt;
int doexit;
const char *exitStr = "EXIT";
doexit = 0;
#ifdef QBLOG
qb_log_init("testcpg", LOG_USER, LOG_ERR);
qb_log_ctl(QB_LOG_SYSLOG, QB_LOG_CONF_ENABLED, QB_FALSE);
qb_log_filter_ctl(QB_LOG_STDERR, QB_LOG_FILTER_ADD,
QB_LOG_FILTER_FILE, "*", LOG_TRACE);
qb_log_ctl(QB_LOG_STDERR, QB_LOG_CONF_ENABLED, QB_TRUE);
qb_log_format_set(QB_LOG_STDERR, "[%p] %f %b");
#endif
while ( (opt = getopt(argc, argv, options)) != -1 ) {
switch (opt) {
case 'i':
show_ip = 1;
break;
}
}
if (argc > optind) {
if (strlen(argv[optind]) >= CPG_MAX_NAME_LENGTH) {
fprintf(stderr, "Invalid name for cpg group\n");
return (1);
}
strcpy(group_name.value, argv[optind]);
group_name.length = strlen(argv[optind]);
}
else {
strcpy(group_name.value, "GROUP");
group_name.length = 6;
}
recnt = 0;
printf ("Type %s to finish\n", exitStr);
restart = 1;
do {
if(restart) {
restart = 0;
retries = 0;
cs_repeat_init(retries, 30, result = cpg_model_initialize (&handle, CPG_MODEL_V1, (cpg_model_data_t *)&model_data, NULL));
if (result != CS_OK) {
printf ("Could not initialize Cluster Process Group API instance error %d\n", result);
retrybackoff(recnt);
}
retries = 0;
cs_repeat(retries, 30, result = cpg_local_get(handle, &nodeid));
if (result != CS_OK) {
printf ("Could not get local node id\n");
retrybackoff(recnt);
}
printf ("Local node id is " CS_PRI_NODE_ID "\n", nodeid);
nodeidStart = nodeid;
retries = 0;
cs_repeat(retries, 30, result = cpg_join(handle, &group_name));
if (result != CS_OK) {
printf ("Could not join process group, error %d\n", result);
retrybackoff(recnt);
}
retries = 0;
cs_repeat(retries, 30, result = cpg_membership_get (handle, &group_name,
(struct cpg_address *)&member_list, &member_list_entries));
if (result != CS_OK) {
printf ("Could not get current membership list %d\n", result);
retrybackoff(recnt);
}
recnt = 0;
printf ("membership list\n");
for (i = 0; i < member_list_entries; i++) {
printf ("node id " CS_PRI_NODE_ID " pid %d\n", member_list[i].nodeid,
member_list[i].pid);
}
FD_ZERO (&read_fds);
cpg_fd_get(handle, &select_fd);
}
FD_SET (select_fd, &read_fds);
FD_SET (STDIN_FILENO, &read_fds);
result = select (select_fd + 1, &read_fds, 0, 0, 0);
if (result == -1) {
perror ("select\n");
}
if (FD_ISSET (STDIN_FILENO, &read_fds)) {
char inbuf[132];
struct iovec iov;
fgets_res = fgets(inbuf, (int)sizeof(inbuf), stdin);
if (fgets_res == NULL) {
doexit = 1;
cpg_leave(handle, &group_name);
}
if (strncmp(inbuf, exitStr, strlen(exitStr)) == 0) {
doexit = 1;
cpg_leave(handle, &group_name);
}
else {
iov.iov_base = inbuf;
iov.iov_len = strlen(inbuf)+1;
cpg_mcast_joined(handle, CPG_TYPE_AGREED, &iov, 1);
}
}
if (FD_ISSET (select_fd, &read_fds)) {
if (cpg_dispatch (handle, CS_DISPATCH_ALL) != CS_OK) {
if(doexit) {
exit(1);
}
restart = 1;
}
}
if(restart) {
if(!doexit) {
result = cpg_finalize (handle);
printf ("Finalize+restart result is %d (should be 1)\n", result);
continue;
}
}
} while (result && !quit && !doexit);
result = cpg_finalize (handle);
printf ("Finalize result is %d (should be 1)\n", result);
return (0);
}
|