4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License version 2 only,
8 * as published by the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License version 2 for more details (a copy is included
14 * in the LICENSE file that accompanied this code).
16 * You should have received a copy of the GNU General Public License
17 * version 2 along with this program; If not, see
18 * http://www.gnu.org/licenses/gpl-2.0.html
23 * Copyright (c) 2008, 2010, Oracle and/or its affiliates. All rights reserved.
24 * Use is subject to license terms.
26 * Copyright (c) 2011, 2015, Intel Corporation.
29 * This file is part of Lustre, http://www.lustre.org/
30 * Lustre is a trademark of Sun Microsystems, Inc.
32 * libcfs/libcfs/util/nidstrings.c
34 * Author: Phil Schwan <phil@clusterfs.com>
37 #define DEBUG_SUBSYSTEM S_LNET
46 #include <libcfs/util/string.h>
47 #include <lnet/types.h>
48 #include <lnet/nidstr.h>
53 /* max value for numeric network address */
54 #define MAX_NUMERIC_VALUE 0xffffffff
56 #define IPSTRING_LENGTH 16
58 /* CAVEAT VENDITOR! Keep the canonical string representation of nets/nids
59 * consistent in all conversion functions. Some code fragments are copied
60 * around for the sake of clarity...
63 /* CAVEAT EMPTOR! Racey temporary buffer allocation!
64 * Choose the number of nidstrings to support the MAXIMUM expected number of
65 * concurrent users. If there are more, the returned string will be volatile.
66 * NB this number must allow for a process to be descheduled for a timeslice
67 * between getting its string and using it.
70 static char libcfs_nidstrings[LNET_NIDSTR_COUNT][LNET_NIDSTR_SIZE];
71 static int libcfs_nidstring_idx;
74 libcfs_next_nidstring(void)
78 str = libcfs_nidstrings[libcfs_nidstring_idx++];
79 if (libcfs_nidstring_idx ==
80 sizeof(libcfs_nidstrings)/sizeof(libcfs_nidstrings[0]))
81 libcfs_nidstring_idx = 0;
87 libcfs_lo_str2addr(const char *str, int nob, __u32 *addr)
94 libcfs_ip_addr2str(__u32 addr, char *str, size_t size)
96 snprintf(str, size, "%u.%u.%u.%u",
97 (addr >> 24) & 0xff, (addr >> 16) & 0xff,
98 (addr >> 8) & 0xff, addr & 0xff);
101 /* CAVEAT EMPTOR XscanfX
102 * I use "%n" at the end of a sscanf format to detect trailing junk. However
103 * sscanf may return immediately if it sees the terminating '0' in a string, so
104 * I initialise the %n variable to the expected length. If sscanf sets it;
105 * fine, if it doesn't, then the scan ended at the end of the string, which is
108 libcfs_ip_str2addr(const char *str, int nob, __u32 *addr)
114 int n = nob; /* XscanfX */
117 if (sscanf(str, "%u.%u.%u.%u%n", &a, &b, &c, &d, &n) >= 4 &&
119 (a & ~0xff) == 0 && (b & ~0xff) == 0 &&
120 (c & ~0xff) == 0 && (d & ~0xff) == 0) {
121 *addr = ((a<<24)|(b<<16)|(c<<8)|d);
125 #ifdef HAVE_GETHOSTBYNAME
126 /* known hostname? */
127 if (('a' <= str[0] && str[0] <= 'z') ||
128 ('A' <= str[0] && str[0] <= 'Z')) {
131 tmp = calloc(1, nob + 1);
135 memcpy(tmp, str, nob);
138 he = gethostbyname(tmp);
143 __u32 ip = *(__u32 *)he->h_addr;
155 cfs_ip_addr_parse(char *str, int len, struct list_head *list)
157 struct cfs_expr_list *el;
166 while (src.ls_str != NULL) {
169 if (!cfs_gettok(&src, '.', &res)) {
174 rc = cfs_expr_list_parse(res.ls_str, res.ls_len, 0, 255, &el);
178 list_add_tail(&el->el_link, list);
187 cfs_expr_list_free_list(list);
193 libcfs_ip_addr_range_print(char *buffer, int count, struct list_head *list)
196 struct cfs_expr_list *el;
198 list_for_each_entry(el, list, el_link) {
201 i += snprintf(buffer + i, count - i, ".");
202 i += cfs_expr_list_print(buffer + i, count - i, el);
208 * Matches address (\a addr) against address set encoded in \a list.
210 * \retval 1 if \a addr matches
211 * \retval 0 otherwise
214 cfs_ip_addr_match(__u32 addr, struct list_head *list)
216 struct cfs_expr_list *el;
219 list_for_each_entry_reverse(el, list, el_link) {
220 if (!cfs_expr_list_match(addr & 0xff, el))
230 libcfs_decnum_addr2str(__u32 addr, char *str, size_t size)
232 snprintf(str, size, "%u", addr);
236 libcfs_hexnum_addr2str(__u32 addr, char *str, size_t size)
238 snprintf(str, size, "0x%x", addr);
242 libcfs_num_str2addr(const char *str, int nob, __u32 *addr)
247 if (sscanf(str, "0x%x%n", addr, &n) >= 1 && n == nob)
251 if (sscanf(str, "0X%x%n", addr, &n) >= 1 && n == nob)
255 if (sscanf(str, "%u%n", addr, &n) >= 1 && n == nob)
262 * Nf_parse_addrlist method for networks using numeric addresses.
264 * Examples of such networks are gm and elan.
266 * \retval 0 if \a str parsed to numeric address
267 * \retval errno otherwise
270 libcfs_num_parse(char *str, int len, struct list_head *list)
272 struct cfs_expr_list *el;
275 rc = cfs_expr_list_parse(str, len, 0, MAX_NUMERIC_VALUE, &el);
277 list_add_tail(&el->el_link, list);
283 libcfs_num_addr_range_print(char *buffer, int count, struct list_head *list)
285 struct cfs_expr_list *el;
288 list_for_each_entry(el, list, el_link) {
290 i += cfs_expr_list_print(buffer + i, count - i, el);
296 * Nf_match_addr method for networks using numeric addresses
299 * \retval 0 otherwise
302 libcfs_num_match(__u32 addr, struct list_head *numaddr)
304 struct cfs_expr_list *el;
306 assert(!list_empty(numaddr));
307 el = list_entry(numaddr->next, struct cfs_expr_list, el_link);
309 return cfs_expr_list_match(addr, el);
312 static bool cfs_ip_is_contiguous(struct list_head *nidlist);
313 static void cfs_ip_min_max(struct list_head *nidlist, __u32 *min, __u32 *max);
314 static bool cfs_num_is_contiguous(struct list_head *nidlist);
315 static void cfs_num_min_max(struct list_head *nidlist, __u32 *min, __u32 *max);
317 static struct netstrfns libcfs_netstrfns[] = {
321 .nf_modname = "klolnd",
322 .nf_addr2str = libcfs_decnum_addr2str,
323 .nf_str2addr = libcfs_lo_str2addr,
324 .nf_parse_addrlist = libcfs_num_parse,
325 .nf_print_addrlist = libcfs_num_addr_range_print,
326 .nf_match_addr = libcfs_num_match,
327 .nf_is_contiguous = cfs_num_is_contiguous,
328 .nf_min_max = cfs_num_min_max
333 .nf_modname = "ksocklnd",
334 .nf_addr2str = libcfs_ip_addr2str,
335 .nf_str2addr = libcfs_ip_str2addr,
336 .nf_parse_addrlist = cfs_ip_addr_parse,
337 .nf_print_addrlist = libcfs_ip_addr_range_print,
338 .nf_match_addr = cfs_ip_addr_match,
339 .nf_is_contiguous = cfs_ip_is_contiguous,
340 .nf_min_max = cfs_ip_min_max
345 .nf_modname = "ko2iblnd",
346 .nf_addr2str = libcfs_ip_addr2str,
347 .nf_str2addr = libcfs_ip_str2addr,
348 .nf_parse_addrlist = cfs_ip_addr_parse,
349 .nf_print_addrlist = libcfs_ip_addr_range_print,
350 .nf_match_addr = cfs_ip_addr_match,
351 .nf_is_contiguous = cfs_ip_is_contiguous,
352 .nf_min_max = cfs_ip_min_max
357 .nf_modname = "kciblnd",
358 .nf_addr2str = libcfs_ip_addr2str,
359 .nf_str2addr = libcfs_ip_str2addr,
360 .nf_parse_addrlist = cfs_ip_addr_parse,
361 .nf_print_addrlist = libcfs_ip_addr_range_print,
362 .nf_match_addr = cfs_ip_addr_match,
363 .nf_is_contiguous = cfs_ip_is_contiguous,
364 .nf_min_max = cfs_ip_min_max
367 .nf_type = OPENIBLND,
369 .nf_modname = "kopeniblnd",
370 .nf_addr2str = libcfs_ip_addr2str,
371 .nf_str2addr = libcfs_ip_str2addr,
372 .nf_parse_addrlist = cfs_ip_addr_parse,
373 .nf_print_addrlist = libcfs_ip_addr_range_print,
374 .nf_match_addr = cfs_ip_addr_match,
375 .nf_is_contiguous = cfs_ip_is_contiguous,
376 .nf_min_max = cfs_ip_min_max
381 .nf_modname = "kiiblnd",
382 .nf_addr2str = libcfs_ip_addr2str,
383 .nf_str2addr = libcfs_ip_str2addr,
384 .nf_parse_addrlist = cfs_ip_addr_parse,
385 .nf_print_addrlist = libcfs_ip_addr_range_print,
386 .nf_match_addr = cfs_ip_addr_match,
387 .nf_is_contiguous = cfs_ip_is_contiguous,
388 .nf_min_max = cfs_ip_min_max
393 .nf_modname = "kviblnd",
394 .nf_addr2str = libcfs_ip_addr2str,
395 .nf_str2addr = libcfs_ip_str2addr,
396 .nf_parse_addrlist = cfs_ip_addr_parse,
397 .nf_print_addrlist = libcfs_ip_addr_range_print,
398 .nf_match_addr = cfs_ip_addr_match,
399 .nf_is_contiguous = cfs_ip_is_contiguous,
400 .nf_min_max = cfs_ip_min_max
405 .nf_modname = "kralnd",
406 .nf_addr2str = libcfs_ip_addr2str,
407 .nf_str2addr = libcfs_ip_str2addr,
408 .nf_parse_addrlist = cfs_ip_addr_parse,
409 .nf_print_addrlist = libcfs_ip_addr_range_print,
410 .nf_match_addr = cfs_ip_addr_match,
411 .nf_is_contiguous = cfs_ip_is_contiguous,
412 .nf_min_max = cfs_ip_min_max
417 .nf_modname = "kqswlnd",
418 .nf_addr2str = libcfs_decnum_addr2str,
419 .nf_str2addr = libcfs_num_str2addr,
420 .nf_parse_addrlist = libcfs_num_parse,
421 .nf_print_addrlist = libcfs_num_addr_range_print,
422 .nf_match_addr = libcfs_num_match,
423 .nf_is_contiguous = cfs_num_is_contiguous,
424 .nf_min_max = cfs_num_min_max
429 .nf_modname = "kgmlnd",
430 .nf_addr2str = libcfs_hexnum_addr2str,
431 .nf_str2addr = libcfs_num_str2addr,
432 .nf_parse_addrlist = libcfs_num_parse,
433 .nf_print_addrlist = libcfs_num_addr_range_print,
434 .nf_match_addr = libcfs_num_match,
435 .nf_is_contiguous = cfs_num_is_contiguous,
436 .nf_min_max = cfs_num_min_max
441 .nf_modname = "kmxlnd",
442 .nf_addr2str = libcfs_ip_addr2str,
443 .nf_str2addr = libcfs_ip_str2addr,
444 .nf_parse_addrlist = cfs_ip_addr_parse,
445 .nf_print_addrlist = libcfs_ip_addr_range_print,
446 .nf_match_addr = cfs_ip_addr_match,
447 .nf_is_contiguous = cfs_ip_is_contiguous,
448 .nf_min_max = cfs_ip_min_max
453 .nf_modname = "kptllnd",
454 .nf_addr2str = libcfs_decnum_addr2str,
455 .nf_str2addr = libcfs_num_str2addr,
456 .nf_parse_addrlist = libcfs_num_parse,
457 .nf_print_addrlist = libcfs_num_addr_range_print,
458 .nf_match_addr = libcfs_num_match,
459 .nf_is_contiguous = cfs_num_is_contiguous,
460 .nf_min_max = cfs_num_min_max
465 .nf_modname = "kgnilnd",
466 .nf_addr2str = libcfs_decnum_addr2str,
467 .nf_str2addr = libcfs_num_str2addr,
468 .nf_parse_addrlist = libcfs_num_parse,
469 .nf_print_addrlist = libcfs_num_addr_range_print,
470 .nf_match_addr = libcfs_num_match,
471 .nf_is_contiguous = cfs_num_is_contiguous,
472 .nf_min_max = cfs_num_min_max
477 .nf_modname = "kgnilnd",
478 .nf_addr2str = libcfs_ip_addr2str,
479 .nf_str2addr = libcfs_ip_str2addr,
480 .nf_parse_addrlist = cfs_ip_addr_parse,
481 .nf_print_addrlist = libcfs_ip_addr_range_print,
482 .nf_match_addr = cfs_ip_addr_match,
483 .nf_is_contiguous = cfs_ip_is_contiguous,
484 .nf_min_max = cfs_ip_min_max
489 .nf_modname = "kptl4lnd",
490 .nf_addr2str = libcfs_decnum_addr2str,
491 .nf_str2addr = libcfs_num_str2addr,
492 .nf_parse_addrlist = libcfs_num_parse,
493 .nf_print_addrlist = libcfs_num_addr_range_print,
494 .nf_match_addr = libcfs_num_match,
495 .nf_is_contiguous = cfs_num_is_contiguous,
496 .nf_min_max = cfs_num_min_max
500 static const size_t libcfs_nnetstrfns =
501 sizeof(libcfs_netstrfns)/sizeof(libcfs_netstrfns[0]);
503 static struct netstrfns *
504 libcfs_lnd2netstrfns(__u32 lnd)
508 for (i = 0; i < libcfs_nnetstrfns; i++)
509 if (lnd == libcfs_netstrfns[i].nf_type)
510 return &libcfs_netstrfns[i];
515 static struct netstrfns *
516 libcfs_namenum2netstrfns(const char *name)
518 struct netstrfns *nf;
521 for (i = 0; i < libcfs_nnetstrfns; i++) {
522 nf = &libcfs_netstrfns[i];
523 if (!strncmp(name, nf->nf_name, strlen(nf->nf_name)))
529 static struct netstrfns *
530 libcfs_name2netstrfns(const char *name)
534 for (i = 0; i < libcfs_nnetstrfns; i++)
535 if (!strcmp(libcfs_netstrfns[i].nf_name, name))
536 return &libcfs_netstrfns[i];
542 libcfs_isknown_lnd(__u32 lnd)
544 return libcfs_lnd2netstrfns(lnd) != NULL;
548 libcfs_lnd2modname(__u32 lnd)
550 struct netstrfns *nf = libcfs_lnd2netstrfns(lnd);
552 return (nf == NULL) ? NULL : nf->nf_modname;
556 libcfs_str2lnd(const char *str)
558 struct netstrfns *nf = libcfs_name2netstrfns(str);
567 libcfs_lnd2str_r(__u32 lnd, char *buf, size_t buf_size)
569 struct netstrfns *nf;
571 nf = libcfs_lnd2netstrfns(lnd);
573 snprintf(buf, buf_size, "?%u?", lnd);
575 snprintf(buf, buf_size, "%s", nf->nf_name);
581 libcfs_net2str_r(__u32 net, char *buf, size_t buf_size)
583 __u32 nnum = LNET_NETNUM(net);
584 __u32 lnd = LNET_NETTYP(net);
585 struct netstrfns *nf;
587 nf = libcfs_lnd2netstrfns(lnd);
589 snprintf(buf, buf_size, "<%u:%u>", lnd, nnum);
591 snprintf(buf, buf_size, "%s", nf->nf_name);
593 snprintf(buf, buf_size, "%s%u", nf->nf_name, nnum);
599 libcfs_nid2str_r(lnet_nid_t nid, char *buf, size_t buf_size)
601 __u32 addr = LNET_NIDADDR(nid);
602 __u32 net = LNET_NIDNET(nid);
603 __u32 nnum = LNET_NETNUM(net);
604 __u32 lnd = LNET_NETTYP(net);
605 struct netstrfns *nf;
607 if (nid == LNET_NID_ANY) {
608 strncpy(buf, "<?>", buf_size);
609 buf[buf_size - 1] = '\0';
613 nf = libcfs_lnd2netstrfns(lnd);
615 snprintf(buf, buf_size, "%x@<%u:%u>", addr, lnd, nnum);
619 nf->nf_addr2str(addr, buf, buf_size);
620 addr_len = strlen(buf);
622 snprintf(buf + addr_len, buf_size - addr_len, "@%s",
625 snprintf(buf + addr_len, buf_size - addr_len, "@%s%u",
632 static struct netstrfns *
633 libcfs_str2net_internal(const char *str, __u32 *net)
635 struct netstrfns *nf = NULL;
640 for (i = 0; i < libcfs_nnetstrfns; i++) {
641 nf = &libcfs_netstrfns[i];
642 if (!strncmp(str, nf->nf_name, strlen(nf->nf_name)))
646 if (i == libcfs_nnetstrfns)
649 nob = strlen(nf->nf_name);
651 if (strlen(str) == (unsigned int)nob) {
654 if (nf->nf_type == LOLND) /* net number not allowed */
659 if (sscanf(str, "%u%n", &netnum, &i) < 1 ||
660 i != (int)strlen(str))
664 *net = LNET_MKNET(nf->nf_type, netnum);
669 libcfs_str2net(const char *str)
673 if (libcfs_str2net_internal(str, &net) != NULL)
676 return LNET_NIDNET(LNET_NID_ANY);
680 libcfs_str2nid(const char *str)
682 const char *sep = strchr(str, '@');
683 struct netstrfns *nf;
688 nf = libcfs_str2net_internal(sep + 1, &net);
692 sep = str + strlen(str);
693 net = LNET_MKNET(SOCKLND, 0);
694 nf = libcfs_lnd2netstrfns(SOCKLND);
698 if (!nf->nf_str2addr(str, (int)(sep - str), &addr))
701 return LNET_MKNID(net, addr);
705 libcfs_id2str(lnet_process_id_t id)
707 char *str = libcfs_next_nidstring();
709 if (id.pid == LNET_PID_ANY) {
710 snprintf(str, LNET_NIDSTR_SIZE,
711 "LNET_PID_ANY-%s", libcfs_nid2str(id.nid));
715 snprintf(str, LNET_NIDSTR_SIZE, "%s%u-%s",
716 ((id.pid & LNET_PID_USERFLAG) != 0) ? "U" : "",
717 (id.pid & ~LNET_PID_USERFLAG), libcfs_nid2str(id.nid));
722 libcfs_str2anynid(lnet_nid_t *nidp, const char *str)
724 if (!strcmp(str, "*")) {
725 *nidp = LNET_NID_ANY;
729 *nidp = libcfs_str2nid(str);
730 return *nidp != LNET_NID_ANY;
734 * Nid range list syntax.
737 * <nidlist> :== <nidrange> [ ' ' <nidrange> ]
738 * <nidrange> :== <addrrange> '@' <net>
739 * <addrrange> :== '*' |
742 * <ipaddr_range> :== <cfs_expr_list>.<cfs_expr_list>.<cfs_expr_list>.
744 * <cfs_expr_list> :== <number> |
746 * <expr_list> :== '[' <range_expr> [ ',' <range_expr>] ']'
747 * <range_expr> :== <number> |
748 * <number> '-' <number> |
749 * <number> '-' <number> '/' <number>
750 * <net> :== <netname> | <netname><number>
751 * <netname> :== "lo" | "tcp" | "o2ib" | "cib" | "openib" | "iib" |
752 * "vib" | "ra" | "elan" | "mx" | "ptl"
757 * Structure to represent \<nidrange\> token of the syntax.
759 * One of this is created for each \<net\> parsed.
763 * Link to list of this structures which is built on nid range
766 struct list_head nr_link;
768 * List head for addrrange::ar_link.
770 struct list_head nr_addrranges;
772 * Flag indicating that *@<net> is found.
776 * Pointer to corresponding element of libcfs_netstrfns.
778 struct netstrfns *nr_netstrfns;
780 * Number of network. E.g. 5 if \<net\> is "elan5".
786 * Structure to represent \<addrrange\> token of the syntax.
790 * Link to nidrange::nr_addrranges.
792 struct list_head ar_link;
794 * List head for cfs_expr_list::el_list.
796 struct list_head ar_numaddr_ranges;
800 * Parses \<addrrange\> token on the syntax.
802 * Allocates struct addrrange and links to \a nidrange via
803 * (nidrange::nr_addrranges)
805 * \retval 0 if \a src parses to '*' | \<ipaddr_range\> | \<cfs_expr_list\>
806 * \retval -errno otherwise
809 parse_addrange(const struct cfs_lstr *src, struct nidrange *nidrange)
811 struct addrrange *addrrange;
813 if (src->ls_len == 1 && src->ls_str[0] == '*') {
814 nidrange->nr_all = 1;
818 addrrange = calloc(1, sizeof(struct addrrange));
819 if (addrrange == NULL)
821 list_add_tail(&addrrange->ar_link, &nidrange->nr_addrranges);
822 INIT_LIST_HEAD(&addrrange->ar_numaddr_ranges);
824 return nidrange->nr_netstrfns->nf_parse_addrlist(src->ls_str,
826 &addrrange->ar_numaddr_ranges);
830 * Finds or creates struct nidrange.
832 * Checks if \a src is a valid network name, looks for corresponding
833 * nidrange on the ist of nidranges (\a nidlist), creates new struct
834 * nidrange if it is not found.
836 * \retval pointer to struct nidrange matching network specified via \a src
837 * \retval NULL if \a src does not match any network
839 static struct nidrange *
840 add_nidrange(const struct cfs_lstr *src,
841 struct list_head *nidlist)
843 struct netstrfns *nf;
848 if (src->ls_len >= LNET_NIDSTR_SIZE)
851 nf = libcfs_namenum2netstrfns(src->ls_str);
854 endlen = src->ls_len - strlen(nf->nf_name);
856 /* network name only, e.g. "elan" or "tcp" */
859 /* e.g. "elan25" or "tcp23", refuse to parse if
860 * network name is not appended with decimal or
861 * hexadecimal number */
862 if (!cfs_str2num_check(src->ls_str + strlen(nf->nf_name),
863 endlen, &netnum, 0, MAX_NUMERIC_VALUE))
867 list_for_each_entry(nr, nidlist, nr_link) {
868 if (nr->nr_netstrfns != nf)
870 if (nr->nr_netnum != netnum)
875 nr = calloc(1, sizeof(struct nidrange));
878 list_add_tail(&nr->nr_link, nidlist);
879 INIT_LIST_HEAD(&nr->nr_addrranges);
880 nr->nr_netstrfns = nf;
882 nr->nr_netnum = netnum;
888 * Parses \<nidrange\> token of the syntax.
890 * \retval 1 if \a src parses to \<addrrange\> '@' \<net\>
891 * \retval 0 otherwise
894 parse_nidrange(struct cfs_lstr *src, struct list_head *nidlist)
896 struct cfs_lstr addrrange;
902 if (cfs_gettok(src, '@', &addrrange) == 0)
905 if (cfs_gettok(src, '@', &net) == 0 || src->ls_str != NULL)
908 nr = add_nidrange(&net, nidlist);
912 if (parse_addrange(&addrrange, nr) != 0)
917 fprintf(stderr, "can't parse nidrange: \"%.*s\"\n",
918 tmp.ls_len, tmp.ls_str);
923 * Frees addrrange structures of \a list.
925 * For each struct addrrange structure found on \a list it frees
926 * cfs_expr_list list attached to it and frees the addrrange itself.
931 free_addrranges(struct list_head *list)
933 while (!list_empty(list)) {
934 struct addrrange *ar;
936 ar = list_entry(list->next, struct addrrange, ar_link);
938 cfs_expr_list_free_list(&ar->ar_numaddr_ranges);
939 list_del(&ar->ar_link);
945 * Frees nidrange strutures of \a list.
947 * For each struct nidrange structure found on \a list it frees
948 * addrrange list attached to it and frees the nidrange itself.
953 cfs_free_nidlist(struct list_head *list)
955 struct list_head *pos, *next;
958 list_for_each_safe(pos, next, list) {
959 nr = list_entry(pos, struct nidrange, nr_link);
960 free_addrranges(&nr->nr_addrranges);
967 * Parses nid range list.
969 * Parses with rigorous syntax and overflow checking \a str into
970 * \<nidrange\> [ ' ' \<nidrange\> ], compiles \a str into set of
971 * structures and links that structure to \a nidlist. The resulting
972 * list can be used to match a NID againts set of NIDS defined by \a
976 * \retval 1 on success
977 * \retval 0 otherwise
980 cfs_parse_nidlist(char *str, int len, struct list_head *nidlist)
988 INIT_LIST_HEAD(nidlist);
990 rc = cfs_gettok(&src, ' ', &res);
992 cfs_free_nidlist(nidlist);
995 rc = parse_nidrange(&res, nidlist);
997 cfs_free_nidlist(nidlist);
1005 * Matches a nid (\a nid) against the compiled list of nidranges (\a nidlist).
1007 * \see cfs_parse_nidlist()
1009 * \retval 1 on match
1010 * \retval 0 otherwises
1012 int cfs_match_nid(lnet_nid_t nid, struct list_head *nidlist)
1014 struct nidrange *nr;
1015 struct addrrange *ar;
1017 list_for_each_entry(nr, nidlist, nr_link) {
1018 if (nr->nr_netstrfns->nf_type != LNET_NETTYP(LNET_NIDNET(nid)))
1020 if (nr->nr_netnum != LNET_NETNUM(LNET_NIDNET(nid)))
1024 list_for_each_entry(ar, &nr->nr_addrranges, ar_link)
1025 if (nr->nr_netstrfns->nf_match_addr(LNET_NIDADDR(nid),
1026 &ar->ar_numaddr_ranges))
1033 * Print the network part of the nidrange \a nr into the specified \a buffer.
1035 * \retval number of characters written
1038 cfs_print_network(char *buffer, int count, struct nidrange *nr)
1040 struct netstrfns *nf = nr->nr_netstrfns;
1042 if (nr->nr_netnum == 0)
1043 return snprintf(buffer, count, "@%s", nf->nf_name);
1045 return snprintf(buffer, count, "@%s%u",
1046 nf->nf_name, nr->nr_netnum);
1051 * Print a list of addrrange (\a addrranges) into the specified \a buffer.
1052 * At max \a count characters can be printed into \a buffer.
1054 * \retval number of characters written
1057 cfs_print_addrranges(char *buffer, int count, struct list_head *addrranges,
1058 struct nidrange *nr)
1061 struct addrrange *ar;
1062 struct netstrfns *nf = nr->nr_netstrfns;
1064 list_for_each_entry(ar, addrranges, ar_link) {
1066 i += snprintf(buffer + i, count - i, " ");
1067 i += nf->nf_print_addrlist(buffer + i, count - i,
1068 &ar->ar_numaddr_ranges);
1069 i += cfs_print_network(buffer + i, count - i, nr);
1075 * Print a list of nidranges (\a nidlist) into the specified \a buffer.
1076 * At max \a count characters can be printed into \a buffer.
1077 * Nidranges are separated by a space character.
1079 * \retval number of characters written
1081 int cfs_print_nidlist(char *buffer, int count, struct list_head *nidlist)
1084 struct nidrange *nr;
1089 list_for_each_entry(nr, nidlist, nr_link) {
1091 i += snprintf(buffer + i, count - i, " ");
1093 if (nr->nr_all != 0) {
1094 assert(list_empty(&nr->nr_addrranges));
1095 i += snprintf(buffer + i, count - i, "*");
1096 i += cfs_print_network(buffer + i, count - i, nr);
1098 i += cfs_print_addrranges(buffer + i, count - i,
1099 &nr->nr_addrranges, nr);
1106 * Determines minimum and maximum addresses for a single
1107 * numeric address range
1113 static void cfs_ip_ar_min_max(struct addrrange *ar, __u32 *min_nid,
1116 struct cfs_expr_list *el;
1117 struct cfs_range_expr *re;
1118 __u32 tmp_ip_addr = 0;
1119 unsigned int min_ip[4] = {0};
1120 unsigned int max_ip[4] = {0};
1123 list_for_each_entry(el, &ar->ar_numaddr_ranges, el_link) {
1124 list_for_each_entry(re, &el->el_exprs, re_link) {
1125 min_ip[re_count] = re->re_lo;
1126 max_ip[re_count] = re->re_hi;
1131 tmp_ip_addr = ((min_ip[0] << 24) | (min_ip[1] << 16) |
1132 (min_ip[2] << 8) | min_ip[3]);
1134 if (min_nid != NULL)
1135 *min_nid = tmp_ip_addr;
1137 tmp_ip_addr = ((max_ip[0] << 24) | (max_ip[1] << 16) |
1138 (max_ip[2] << 8) | max_ip[3]);
1140 if (max_nid != NULL)
1141 *max_nid = tmp_ip_addr;
1145 * Determines minimum and maximum addresses for a single
1146 * numeric address range
1152 static void cfs_num_ar_min_max(struct addrrange *ar, __u32 *min_nid,
1155 struct cfs_expr_list *el;
1156 struct cfs_range_expr *re;
1157 unsigned int min_addr = 0;
1158 unsigned int max_addr = 0;
1160 list_for_each_entry(el, &ar->ar_numaddr_ranges, el_link) {
1161 list_for_each_entry(re, &el->el_exprs, re_link) {
1162 if (re->re_lo < min_addr || min_addr == 0)
1163 min_addr = re->re_lo;
1164 if (re->re_hi > max_addr)
1165 max_addr = re->re_hi;
1169 if (min_nid != NULL)
1170 *min_nid = min_addr;
1171 if (max_nid != NULL)
1172 *max_nid = max_addr;
1176 * Determines whether an expression list in an nidrange contains exactly
1177 * one contiguous address range. Calls the correct netstrfns for the LND
1181 * \retval true if contiguous
1182 * \retval false if not contiguous
1184 bool cfs_nidrange_is_contiguous(struct list_head *nidlist)
1186 struct nidrange *nr;
1187 struct netstrfns *nf = NULL;
1188 char *lndname = NULL;
1191 list_for_each_entry(nr, nidlist, nr_link) {
1192 nf = nr->nr_netstrfns;
1193 if (lndname == NULL)
1194 lndname = nf->nf_name;
1196 netnum = nr->nr_netnum;
1198 if (strcmp(lndname, nf->nf_name) != 0 ||
1199 netnum != nr->nr_netnum)
1206 if (!nf->nf_is_contiguous(nidlist))
1213 * Determines whether an expression list in an num nidrange contains exactly
1214 * one contiguous address range.
1218 * \retval true if contiguous
1219 * \retval false if not contiguous
1221 static bool cfs_num_is_contiguous(struct list_head *nidlist)
1223 struct nidrange *nr;
1224 struct addrrange *ar;
1225 struct cfs_expr_list *el;
1226 struct cfs_range_expr *re;
1228 __u32 last_end_nid = 0;
1229 __u32 current_start_nid = 0;
1230 __u32 current_end_nid = 0;
1232 list_for_each_entry(nr, nidlist, nr_link) {
1233 list_for_each_entry(ar, &nr->nr_addrranges, ar_link) {
1234 cfs_num_ar_min_max(ar, ¤t_start_nid,
1236 if (last_end_nid != 0 &&
1237 (current_start_nid - last_end_nid != 1))
1239 last_end_nid = current_end_nid;
1240 list_for_each_entry(el, &ar->ar_numaddr_ranges,
1242 list_for_each_entry(re, &el->el_exprs,
1244 if (re->re_stride > 1)
1246 else if (last_hi != 0 &&
1247 re->re_hi - last_hi != 1)
1249 last_hi = re->re_hi;
1259 * Determines whether an expression list in an ip nidrange contains exactly
1260 * one contiguous address range.
1264 * \retval true if contiguous
1265 * \retval false if not contiguous
1267 static bool cfs_ip_is_contiguous(struct list_head *nidlist)
1269 struct nidrange *nr;
1270 struct addrrange *ar;
1271 struct cfs_expr_list *el;
1272 struct cfs_range_expr *re;
1276 __u32 last_end_nid = 0;
1277 __u32 current_start_nid = 0;
1278 __u32 current_end_nid = 0;
1280 list_for_each_entry(nr, nidlist, nr_link) {
1281 list_for_each_entry(ar, &nr->nr_addrranges, ar_link) {
1284 cfs_ip_ar_min_max(ar, ¤t_start_nid,
1286 if (last_end_nid != 0 &&
1287 (current_start_nid - last_end_nid != 1))
1289 last_end_nid = current_end_nid;
1290 list_for_each_entry(el,
1291 &ar->ar_numaddr_ranges,
1294 list_for_each_entry(re, &el->el_exprs,
1297 if (re->re_stride > 1 ||
1298 (last_diff > 0 && last_hi != 255) ||
1299 (last_diff > 0 && last_hi == 255 &&
1302 last_hi = re->re_hi;
1303 last_diff = re->re_hi - re->re_lo;
1313 * Takes a linked list of nidrange expressions, determines the minimum
1314 * and maximum nid and creates appropriate nid structures
1320 void cfs_nidrange_find_min_max(struct list_head *nidlist, char *min_nid,
1321 char *max_nid, size_t nidstr_length)
1323 struct nidrange *nr;
1324 struct netstrfns *nf = NULL;
1328 char *lndname = NULL;
1329 char min_addr_str[IPSTRING_LENGTH];
1330 char max_addr_str[IPSTRING_LENGTH];
1332 list_for_each_entry(nr, nidlist, nr_link) {
1333 nf = nr->nr_netstrfns;
1334 lndname = nf->nf_name;
1336 netnum = nr->nr_netnum;
1338 nf->nf_min_max(nidlist, &min_addr, &max_addr);
1340 nf->nf_addr2str(min_addr, min_addr_str, sizeof(min_addr_str));
1341 nf->nf_addr2str(max_addr, max_addr_str, sizeof(max_addr_str));
1343 snprintf(min_nid, nidstr_length, "%s@%s%d", min_addr_str, lndname,
1345 snprintf(max_nid, nidstr_length, "%s@%s%d", max_addr_str, lndname,
1350 * Determines the min and max NID values for num LNDs
1356 static void cfs_num_min_max(struct list_head *nidlist, __u32 *min_nid,
1359 struct nidrange *nr;
1360 struct addrrange *ar;
1361 unsigned int tmp_min_addr = 0;
1362 unsigned int tmp_max_addr = 0;
1363 unsigned int min_addr = 0;
1364 unsigned int max_addr = 0;
1366 list_for_each_entry(nr, nidlist, nr_link) {
1367 list_for_each_entry(ar, &nr->nr_addrranges, ar_link) {
1368 cfs_num_ar_min_max(ar, &tmp_min_addr,
1370 if (tmp_min_addr < min_addr || min_addr == 0)
1371 min_addr = tmp_min_addr;
1372 if (tmp_max_addr > max_addr)
1373 max_addr = tmp_min_addr;
1376 *max_nid = max_addr;
1377 *min_nid = min_addr;
1381 * Takes an nidlist and determines the minimum and maximum
1388 static void cfs_ip_min_max(struct list_head *nidlist, __u32 *min_nid,
1391 struct nidrange *nr;
1392 struct addrrange *ar;
1393 __u32 tmp_min_ip_addr = 0;
1394 __u32 tmp_max_ip_addr = 0;
1395 __u32 min_ip_addr = 0;
1396 __u32 max_ip_addr = 0;
1398 list_for_each_entry(nr, nidlist, nr_link) {
1399 list_for_each_entry(ar, &nr->nr_addrranges, ar_link) {
1400 cfs_ip_ar_min_max(ar, &tmp_min_ip_addr,
1402 if (tmp_min_ip_addr < min_ip_addr || min_ip_addr == 0)
1403 min_ip_addr = tmp_min_ip_addr;
1404 if (tmp_max_ip_addr > max_ip_addr)
1405 max_ip_addr = tmp_max_ip_addr;
1409 if (min_nid != NULL)
1410 *min_nid = min_ip_addr;
1411 if (max_nid != NULL)
1412 *max_nid = max_ip_addr;