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
|
/*****************************************************************************\
* $Id: hostlist.h 7428 2008-05-23 16:08:31Z grondo $
*****************************************************************************
* Copyright (C) 2002 The Regents of the University of California.
* Produced at Lawrence Livermore National Laboratory (cf, DISCLAIMER).
* Written by Mark Grondona <mgrondona@llnl.gov>
* UCRL-CODE-2002-040.
*
* This file is part of SLURM, a resource management program.
* For details, see <http://www.llnl.gov/linux/slurm/>.
*
* SLURM 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.
*
* SLURM 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 SLURM; if not, write to the Free Software Foundation, Inc.,
* 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.
\*****************************************************************************/
#ifndef _HOSTLIST_H
#define _HOSTLIST_H
#include <unistd.h>
/* Notes:
*
* If WITH_LSD_FATAL_ERROR_FUNC is defined, the linker will expect to
* find and external lsd_fatal_error(file,line,mesg) function. By default,
* lsd_fatal_error(file,line,mesg) is a macro definition that outputs an
* error message to stderr. This macro may be redefined to invoke another
* routine instead. e.g.:
*
* #define lsd_fatal_error(file,line,mesg) \
* error("%s:%s %s\n",file,line,mesg);
*
* If WITH_LSD_NOMEM_ERROR_FUNC is defined, the linker will expect to
* find an external lsd_nomem_error(file,line,mesg) function. By default,
* lsd_nomem_error(file,line,mesg) is a macro definition that returns NULL.
* This macro may be redefined to invoke another routine instead.
*
* If WITH_PTHREADS is defined, these routines will be thread-safe.
*
*/
/* The hostlist opaque data type
*
* A hostlist is a list of hostnames optimized for a prefixXXXX style
* naming convention, where XXXX is a decimal, numeric suffix.
*/
typedef struct hostlist * hostlist_t;
/* A hostset is a special case of a hostlist. It:
*
* 1. never contains duplicates
* 2. is always sorted
* (Note: sort occurs first on alphanumeric prefix -- where prefix
* matches, numeric suffixes will be sorted *by value*)
*/
typedef struct hostset * hostset_t;
/* The hostlist iterator type (may be used with a hostset as well)
* used for non-destructive access to hostlist members.
*
*/
typedef struct hostlist_iterator * hostlist_iterator_t;
/* ----[ hostlist_t functions: ]---- */
/* ----[ hostlist creation and destruction ]---- */
/*
* hostlist_create():
*
* Create a new hostlist from a string representation.
*
* The string representation (str) may contain one or more hostnames or
* bracketed hostlists separated by either `,' or whitespace. A bracketed
* hostlist is denoted by a common prefix followed by a list of numeric
* ranges contained within brackets: e.g. "tux[0-5,12,20-25]"
*
* Note: if this module is compiled with WANT_RECKLESS_HOSTRANGE_EXPANSION
* defined, a much more loose interpretation of host ranges is used.
* Reckless hostrange expansion allows all of the following (in addition to
* bracketed hostlists):
*
* o tux0-5,tux12,tux20-25
* o tux0-tux5,tux12,tux20-tux25
* o tux0-5,12,20-25
*
* If str is NULL, and empty hostlist is created and returned.
*
* If the create fails, hostlist_create() returns NULL.
*
* The returned hostlist must be freed with hostlist_destroy()
*
*/
hostlist_t hostlist_create(const char *hostlist);
/* hostlist_copy():
*
* Allocate a copy of a hostlist object. Returned hostlist must be freed
* with hostlist_destroy.
*/
hostlist_t hostlist_copy(const hostlist_t hl);
/* hostlist_destroy():
*
* Destroy a hostlist object. Frees all memory allocated to the hostlist.
*/
void hostlist_destroy(hostlist_t hl);
/* ----[ hostlist list operations ]---- */
/* hostlist_push():
*
* push a string representation of hostnames onto a hostlist.
*
* The hosts argument may take the same form as in hostlist_create()
*
* Returns the number of hostnames inserted into the list,
* or 0 on failure.
*/
int hostlist_push(hostlist_t hl, const char *hosts);
/* hostlist_push_host():
*
* Push a single host onto the hostlist hl.
* This function is more efficient than hostlist_push() for a single
* hostname, since the argument does not need to be checked for ranges.
*
* return value is 1 for success, 0 for failure.
*/
int hostlist_push_host(hostlist_t hl, const char *host);
/* hostlist_push_list():
*
* Push a hostlist (hl2) onto another list (hl1)
*
* Returns 1 for success, 0 for failure.
*
*/
int hostlist_push_list(hostlist_t hl1, hostlist_t hl2);
/* hostlist_pop():
*
* Returns the string representation of the last host pushed onto the list
* or NULL if hostlist is empty or there was an error allocating memory.
* The host is removed from the hostlist.
*
* Note: Caller is responsible for freeing the returned memory.
*/
char * hostlist_pop(hostlist_t hl);
char * hostlist_nth(hostlist_t hl, int n);
/* hostlist_shift():
*
* Returns the string representation of the first host in the hostlist
* or NULL if the hostlist is empty or there was an error allocating memory.
* The host is removed from the hostlist.
*
* Note: Caller is responsible for freeing the returned memory.
*/
char * hostlist_shift(hostlist_t hl);
/* hostlist_pop_range():
*
* Pop the last bracketed list of hosts of the hostlist hl.
* Returns the string representation in bracketed list form.
* All hosts associated with the returned list are removed
* from hl.
*
* Caller is responsible for freeing returned memory
*/
char * hostlist_pop_range(hostlist_t hl);
/* hostlist_shift_range():
*
* Shift the first bracketed hostlist (improperly: range) off the
* hostlist hl. Returns the string representation in bracketed list
* form. All hosts associated with the list are removed from the
* hostlist.
*
* Caller is responsible for freeing returned memory.
*/
char * hostlist_shift_range(hostlist_t hl);
/* hostlist_find():
*
* Searches hostlist hl for the first host matching hostname
* and returns position in list if found.
*
* Returns -1 if host is not found.
*
*/
int hostlist_find(hostlist_t hl, const char *hostname);
/* hostlist_delete():
*
* Deletes all hosts in the list represented by `hosts'
*
* Returns the number of hosts successfully deleted
*/
int hostlist_delete(hostlist_t hl, const char *hosts);
/* hostlist_delete_host():
*
* Deletes the first host that matches `hostname' from the hostlist hl.
* Note: "hostname" argument cannot contain a range of hosts
* (see hostlist_delete() for this functionality.)
*
* Returns 1 if successful, 0 if hostname is not found in list.
*/
int hostlist_delete_host(hostlist_t hl, const char *hostname);
/* hostlist_delete_nth():
*
* Deletes the host from position n in the hostlist.
*
* Returns 1 if successful 0 on error.
*
*/
int hostlist_delete_nth(hostlist_t hl, int n);
/* hostlist_count():
*
* Return the number of hosts in hostlist hl.
*/
int hostlist_count(hostlist_t hl);
/* hostlist_is_empty(): return true if hostlist is empty. */
#define hostlist_is_empty(__hl) ( hostlist_count(__hl) == 0 )
/* ----[ Other hostlist operations ]---- */
/* hostlist_sort():
*
* Sort the hostlist hl.
*
*/
void hostlist_sort(hostlist_t hl);
/* hostlist_uniq():
*
* Sort the hostlist hl and remove duplicate entries.
*
*/
void hostlist_uniq(hostlist_t hl);
/* ----[ hostlist print functions ]---- */
/* hostlist_ranged_string():
*
* Write the string representation of the hostlist hl into buf,
* writing at most n chars. Returns the number of bytes written,
* or -1 if truncation occurred.
*
* The result will be NULL terminated.
*
* hostlist_ranged_string() will write a bracketed hostlist representation
* where possible.
*/
ssize_t hostlist_ranged_string(hostlist_t hl, size_t n, char *buf);
ssize_t hostset_ranged_string(hostset_t hs, size_t n, char *buf);
/* hostlist_deranged_string():
*
* Writes the string representation of the hostlist hl into buf,
* writing at most n chars. Returns the number of bytes written,
* or -1 if truncation occurred.
*
* hostlist_deranged_string() will not attempt to write a bracketed
* hostlist representation. Every hostname will be explicitly written.
*/
ssize_t hostlist_deranged_string(hostlist_t hl, size_t n, char *buf);
ssize_t hostset_deranged_string(hostset_t hs, size_t n, char *buf);
/* ----[ hostlist utility functions ]---- */
/* hostlist_nranges():
*
* Return the number of ranges currently held in hostlist hl.
*/
int hostlist_nranges(hostlist_t hl);
/* ----[ hostlist iterator functions ]---- */
/* hostlist_iterator_create():
*
* Creates and returns a hostlist iterator used for non destructive
* access to a hostlist or hostset. Returns NULL on failure.
*/
hostlist_iterator_t hostlist_iterator_create(hostlist_t hl);
/* hostset_iterator_create():
*
* Same as hostlist_iterator_create(), but creates a hostlist_iterator
* from a hostset.
*/
hostlist_iterator_t hostset_iterator_create(hostset_t set);
/* hostlist_iterator_destroy():
*
* Destroys a hostlist iterator.
*/
void hostlist_iterator_destroy(hostlist_iterator_t i);
/* hostlist_iterator_reset():
*
* Reset an iterator to the beginning of the list.
*/
void hostlist_iterator_reset(hostlist_iterator_t i);
/* hostlist_next():
*
* Returns a pointer to the next hostname on the hostlist
* or NULL at the end of the list
*
* The caller is responsible for freeing the returned memory.
*/
char * hostlist_next(hostlist_iterator_t i);
/* hostlist_next_range():
*
* Returns the next bracketed hostlist or NULL if the iterator i is
* at the end of the list.
*
* The caller is responsible for freeing the returned memory.
*
*/
char * hostlist_next_range(hostlist_iterator_t i);
/* hostlist_remove():
* Removes the last host returned by hostlist iterator i
*
* Returns 1 for success, 0 for failure.
*/
int hostlist_remove(hostlist_iterator_t i);
/* ----[ hostset operations ]---- */
/* hostset_create():
*
* Create a new hostset object from a string representation of a list of
* hosts. See hostlist_create() for valid hostlist forms.
*/
hostset_t hostset_create(const char *hostlist);
/* hostset_copy():
*
* Copy a hostset object. Returned set must be freed with hostset_destroy().
*/
hostset_t hostset_copy(hostset_t set);
/* hostset_destroy():
*/
void hostset_destroy(hostset_t set);
/* hostset_insert():
* Add a host or list of hosts into hostset "set."
*
* Returns number of hosts successfully added to "set"
* (insertion of a duplicate is not considered successful)
*/
int hostset_insert(hostset_t set, const char *hosts);
/* hostset_delete():
* Delete a host or list of hosts from hostset "set."
* Returns number of hosts deleted from set.
*/
int hostset_delete(hostset_t set, const char *hosts);
/* hostset_within():
* Return 1 if all hosts specified by "hosts" are within the hostset "set"
* Retrun 0 if every host in "hosts" is not in the hostset "set"
*/
int hostset_within(hostset_t set, const char *hosts);
/* hostset_shift():
* hostset equivalent to hostlist_shift()
*/
char * hostset_shift(hostset_t set);
/* hostset_shift_range():
* hostset eqivalent to hostlist_shift_range()
*/
char * hostset_shift_range(hostset_t set);
/* hostset_count():
* Count the number of hosts currently in hostset
*/
int hostset_count(hostset_t set);
#endif /* !_HOSTLIST_H */
|