| /*****************************************************************************\ |
| * $Id$ |
| ***************************************************************************** |
| * $LSDId: hostlist.h,v 1.4 2003/09/19 21:37:34 grondo Exp $ |
| ***************************************************************************** |
| * 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-226842. |
| * |
| * 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. |
| * |
| * In addition, as a special exception, the copyright holders give permission |
| * to link the code of portions of this program with the OpenSSL library under |
| * certain conditions as described in each individual source file, and |
| * distribute linked combinations including the two. You must obey the GNU |
| * General Public License in all respects for all of the code used other than |
| * OpenSSL. If you modify file(s) with this exception, you may extend this |
| * exception to your version of the file(s), but you are not obligated to do |
| * so. If you do not wish to do so, delete this exception statement from your |
| * version. If you delete this exception statement from all source files in |
| * the program, then also delete it here. |
| * |
| * 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., |
| * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. |
| \*****************************************************************************/ |
| |
| #ifndef _HOSTLIST_H |
| #define _HOSTLIST_H |
| |
| /* max size of internal hostrange buffer */ |
| #define MAXHOSTRANGELEN 8192 |
| |
| #ifdef HAVE_BG |
| #define HOSTLIST_BASE 36 |
| #else |
| #define HOSTLIST_BASE 10 |
| #endif |
| |
| extern char *alpha_num; |
| |
| /* 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. |
| */ |
| #ifndef __hostlist_t_defined |
| # define __hostlist_t_defined |
| typedef struct hostlist * hostlist_t; |
| #endif |
| |
| /* 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 ]---- */ |
| |
| //int set_grid(hostlist_t hl, int count); |
| int set_grid(int start, int end, int count); |
| /* |
| * hostlist_create(): |
| * |
| * Create a new hostlist from a string representation. |
| * |
| * The string representation may contain one or more hostnames or |
| * bracketed hostlists separated by either `,' or whitespace (e.g. |
| * "alpha,beta,gamma"). 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 that the numeric ranges can include |
| * one or more leading zeros to indicate the numeric portion has a |
| * fixed number of digits (e.g. "linux[0000-1023]"). |
| * |
| * To support the BlueGene system's 3-D topology, a node name prefix |
| * is followed by three digits identifying the node's position in |
| * the X, Y and Z positions respectively. For example "bgl123" represents |
| * the node or midplane with an X position of 1, Y of 2, and Z of 3. |
| * A rectangular prism may be described using two endpoint locations |
| * separated by "x" (e.g. "bgl[123x456]" selects all nodes with X |
| * positions between 1 and 4 inclusive, Y between 2 and 5, and Z between |
| * 3 and 6 for a total of 4*4*4=64 nodes). Two or more rectangular |
| * prisms may be specified using comma separators within the brackets |
| * (e.g. "bgl[000x133,400x533]"). |
| * |
| * 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. |
| */ |
| size_t hostlist_ranged_string(hostlist_t hl, 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. |
| */ |
| size_t hostlist_deranged_string(hostlist_t hl, 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); |
| |
| /* hostset_find(): |
| * |
| * Searches hostset set for a host matching hostname |
| * and returns position in list if found. |
| * |
| * Returns -1 if host is not found. |
| */ |
| int hostset_find(hostset_t set, const char *hostname); |
| |
| char * hostset_nth(hostset_t set, int n); |
| |
| #endif /* !_HOSTLIST_H */ |