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
|
/*
* $Id: simnodes.c,v 1.7 2009-05-14 06:48:49 vrsieh Exp $
*
* Copyright (C) 2003-2009 FAUmachine Team <info@faumachine.org>.
* This program is free software. You can redistribute it and/or modify it
* under the terms of the GNU General Public License, either version 2 of
* the License, or (at your option) any later version. See COPYING.
*/
#include <assert.h>
#include <fcntl.h>
#include <stdio.h>
#include <string.h>
#include <unistd.h>
#include "glue-dist.h"
#include "simnodes.h"
static void
simnodes_add(const char *name, char *user_host_path)
{
char *user;
char *host;
char *path;
if (strchr(user_host_path, ':')) {
path = strchr(user_host_path, ':');
*path++ = '\0';
if (strchr(user_host_path, '@')) {
user = user_host_path;
host = strchr(user_host_path, '@');
*host++ = '\0';
} else {
user = NULL;
host = user_host_path;
}
} else {
user = NULL;
host = NULL;
path = user_host_path;
}
dist_node_create(name, user, host, path);
}
void
simnodes_create(void)
{
int fd;
int ret;
/*
* Read List of Nodes
*/
fd = open("simulation.nodes", O_RDONLY);
if (fd < 0) {
/*
* No "simulation.nodes" file.
* Use localhost as the only node.
*/
dist_node_create("default", NULL, NULL, NULL);
} else {
/*
* "simulation.nodes" file exists.
* Read entries and create nodes.
*/
char buffer[16*1024];
char name[32];
char user_host_path[32 + 1 + 64 + 1 + 1024];
unsigned int x;
const char *p;
ret = read(fd, buffer, sizeof(buffer) - 1);
assert(0 <= ret);
buffer[ret] = '\0';
for (p = buffer; *p; ) {
switch (*p) {
case '\n':
/* Skip return. */
p++;
break;
case '\t':
case ' ':
/* Skip white space. */
p++;
break;
case '#':
/* Skip comment. */
while (*p != '\0'
&& *p != '\n') {
p++;
}
break;
default:
/*
* Entry Found
*/
/* Read node name. */
x = 0;
while (*p != '\0'
&& *p != '\t'
&& *p != '\n'
&& *p != '\r'
&& *p != ' '
&& *p != '=') {
name[x++] = *p++;
}
name[x] = '\0';
/* Skip white space. */
while (*p == '\t'
|| *p == ' ') {
p++;
}
/* Skip '=' (if present). */
if (*p == '=') {
p++;
}
/* Skip white space. */
while (*p == '\t'
|| *p == ' ') {
p++;
}
/* Read user@host:path. */
x = 0;
while (*p != '\0'
&& *p != '\t'
&& *p != '\n'
&& *p != '\r'
&& *p != ' ') {
user_host_path[x++] = *p++;
}
user_host_path[x] = '\0';
simnodes_add(name, user_host_path);
}
}
ret = close(fd);
assert(0 <= ret);
}
}
void
simnodes_destroy(void)
{
unsigned int id;
/* FIXME */
for (id = 0; id < 1000; id++) {
(void) dist_node_destroy(id);
}
}
|
