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_num_str2addr(const char *str, int nob, __u32 *addr)
241 if (sscanf(str, "0x%x%n", addr, &n) >= 1 && n == nob)
245 if (sscanf(str, "0X%x%n", addr, &n) >= 1 && n == nob)
249 if (sscanf(str, "%u%n", addr, &n) >= 1 && n == nob)
256 * Nf_parse_addrlist method for networks using numeric addresses.
258 * Examples of such networks are gm and elan.
260 * \retval 0 if \a str parsed to numeric address
261 * \retval errno otherwise
264 libcfs_num_parse(char *str, int len, struct list_head *list)
266 struct cfs_expr_list *el;
269 rc = cfs_expr_list_parse(str, len, 0, MAX_NUMERIC_VALUE, &el);
271 list_add_tail(&el->el_link, list);
277 libcfs_num_addr_range_print(char *buffer, int count, struct list_head *list)
279 struct cfs_expr_list *el;
282 list_for_each_entry(el, list, el_link) {
284 i += cfs_expr_list_print(buffer + i, count - i, el);
290 * Nf_match_addr method for networks using numeric addresses
293 * \retval 0 otherwise
296 libcfs_num_match(__u32 addr, struct list_head *numaddr)
298 struct cfs_expr_list *el;
300 assert(!list_empty(numaddr));
301 el = list_entry(numaddr->next, struct cfs_expr_list, el_link);
303 return cfs_expr_list_match(addr, el);
306 static bool cfs_ip_is_contiguous(struct list_head *nidlist);
307 static void cfs_ip_min_max(struct list_head *nidlist, __u32 *min, __u32 *max);
308 static bool cfs_num_is_contiguous(struct list_head *nidlist);
309 static void cfs_num_min_max(struct list_head *nidlist, __u32 *min, __u32 *max);
311 static struct netstrfns libcfs_netstrfns[] = {
315 .nf_modname = "klolnd",
316 .nf_addr2str = libcfs_decnum_addr2str,
317 .nf_str2addr = libcfs_lo_str2addr,
318 .nf_parse_addrlist = libcfs_num_parse,
319 .nf_print_addrlist = libcfs_num_addr_range_print,
320 .nf_match_addr = libcfs_num_match,
321 .nf_is_contiguous = cfs_num_is_contiguous,
322 .nf_min_max = cfs_num_min_max
327 .nf_modname = "ksocklnd",
328 .nf_addr2str = libcfs_ip_addr2str,
329 .nf_str2addr = libcfs_ip_str2addr,
330 .nf_parse_addrlist = cfs_ip_addr_parse,
331 .nf_print_addrlist = libcfs_ip_addr_range_print,
332 .nf_match_addr = cfs_ip_addr_match,
333 .nf_is_contiguous = cfs_ip_is_contiguous,
334 .nf_min_max = cfs_ip_min_max
339 .nf_modname = "ko2iblnd",
340 .nf_addr2str = libcfs_ip_addr2str,
341 .nf_str2addr = libcfs_ip_str2addr,
342 .nf_parse_addrlist = cfs_ip_addr_parse,
343 .nf_print_addrlist = libcfs_ip_addr_range_print,
344 .nf_match_addr = cfs_ip_addr_match,
345 .nf_is_contiguous = cfs_ip_is_contiguous,
346 .nf_min_max = cfs_ip_min_max
351 .nf_modname = "kgnilnd",
352 .nf_addr2str = libcfs_decnum_addr2str,
353 .nf_str2addr = libcfs_num_str2addr,
354 .nf_parse_addrlist = libcfs_num_parse,
355 .nf_print_addrlist = libcfs_num_addr_range_print,
356 .nf_match_addr = libcfs_num_match,
357 .nf_is_contiguous = cfs_num_is_contiguous,
358 .nf_min_max = cfs_num_min_max
363 .nf_modname = "kgnilnd",
364 .nf_addr2str = libcfs_ip_addr2str,
365 .nf_str2addr = libcfs_ip_str2addr,
366 .nf_parse_addrlist = cfs_ip_addr_parse,
367 .nf_print_addrlist = libcfs_ip_addr_range_print,
368 .nf_match_addr = cfs_ip_addr_match,
369 .nf_is_contiguous = cfs_ip_is_contiguous,
370 .nf_min_max = cfs_ip_min_max
375 .nf_modname = "kptl4lnd",
376 .nf_addr2str = libcfs_decnum_addr2str,
377 .nf_str2addr = libcfs_num_str2addr,
378 .nf_parse_addrlist = libcfs_num_parse,
379 .nf_print_addrlist = libcfs_num_addr_range_print,
380 .nf_match_addr = libcfs_num_match,
381 .nf_is_contiguous = cfs_num_is_contiguous,
382 .nf_min_max = cfs_num_min_max
386 static const size_t libcfs_nnetstrfns =
387 sizeof(libcfs_netstrfns)/sizeof(libcfs_netstrfns[0]);
389 static struct netstrfns *
390 libcfs_lnd2netstrfns(__u32 lnd)
394 for (i = 0; i < libcfs_nnetstrfns; i++)
395 if (lnd == libcfs_netstrfns[i].nf_type)
396 return &libcfs_netstrfns[i];
401 static struct netstrfns *
402 libcfs_namenum2netstrfns(const char *name)
404 struct netstrfns *nf;
407 for (i = 0; i < libcfs_nnetstrfns; i++) {
408 nf = &libcfs_netstrfns[i];
409 if (!strncmp(name, nf->nf_name, strlen(nf->nf_name)))
415 static struct netstrfns *
416 libcfs_name2netstrfns(const char *name)
420 for (i = 0; i < libcfs_nnetstrfns; i++)
421 if (!strcmp(libcfs_netstrfns[i].nf_name, name))
422 return &libcfs_netstrfns[i];
428 libcfs_isknown_lnd(__u32 lnd)
430 return libcfs_lnd2netstrfns(lnd) != NULL;
434 libcfs_lnd2modname(__u32 lnd)
436 struct netstrfns *nf = libcfs_lnd2netstrfns(lnd);
438 return (nf == NULL) ? NULL : nf->nf_modname;
442 libcfs_str2lnd(const char *str)
444 struct netstrfns *nf = libcfs_name2netstrfns(str);
453 libcfs_lnd2str_r(__u32 lnd, char *buf, size_t buf_size)
455 struct netstrfns *nf;
457 nf = libcfs_lnd2netstrfns(lnd);
459 snprintf(buf, buf_size, "?%u?", lnd);
461 snprintf(buf, buf_size, "%s", nf->nf_name);
467 libcfs_net2str_r(__u32 net, char *buf, size_t buf_size)
469 __u32 nnum = LNET_NETNUM(net);
470 __u32 lnd = LNET_NETTYP(net);
471 struct netstrfns *nf;
473 nf = libcfs_lnd2netstrfns(lnd);
475 snprintf(buf, buf_size, "<%u:%u>", lnd, nnum);
477 snprintf(buf, buf_size, "%s", nf->nf_name);
479 snprintf(buf, buf_size, "%s%u", nf->nf_name, nnum);
485 libcfs_nid2str_r(lnet_nid_t nid, char *buf, size_t buf_size)
487 __u32 addr = LNET_NIDADDR(nid);
488 __u32 net = LNET_NIDNET(nid);
489 __u32 nnum = LNET_NETNUM(net);
490 __u32 lnd = LNET_NETTYP(net);
491 struct netstrfns *nf;
493 if (nid == LNET_NID_ANY) {
494 strncpy(buf, "<?>", buf_size);
495 buf[buf_size - 1] = '\0';
499 nf = libcfs_lnd2netstrfns(lnd);
501 snprintf(buf, buf_size, "%x@<%u:%u>", addr, lnd, nnum);
505 nf->nf_addr2str(addr, buf, buf_size);
506 addr_len = strlen(buf);
508 snprintf(buf + addr_len, buf_size - addr_len, "@%s",
511 snprintf(buf + addr_len, buf_size - addr_len, "@%s%u",
518 static struct netstrfns *
519 libcfs_str2net_internal(const char *str, __u32 *net)
521 struct netstrfns *nf = NULL;
526 for (i = 0; i < libcfs_nnetstrfns; i++) {
527 nf = &libcfs_netstrfns[i];
528 if (!strncmp(str, nf->nf_name, strlen(nf->nf_name)))
532 if (i == libcfs_nnetstrfns)
535 nob = strlen(nf->nf_name);
537 if (strlen(str) == (unsigned int)nob) {
540 if (nf->nf_type == LOLND) /* net number not allowed */
545 if (sscanf(str, "%u%n", &netnum, &i) < 1 ||
546 i != (int)strlen(str))
550 *net = LNET_MKNET(nf->nf_type, netnum);
555 libcfs_str2net(const char *str)
559 if (libcfs_str2net_internal(str, &net) != NULL)
562 return LNET_NIDNET(LNET_NID_ANY);
566 libcfs_str2nid(const char *str)
568 const char *sep = strchr(str, '@');
569 struct netstrfns *nf;
574 nf = libcfs_str2net_internal(sep + 1, &net);
578 sep = str + strlen(str);
579 net = LNET_MKNET(SOCKLND, 0);
580 nf = libcfs_lnd2netstrfns(SOCKLND);
584 if (!nf->nf_str2addr(str, (int)(sep - str), &addr))
587 return LNET_MKNID(net, addr);
591 libcfs_id2str(struct lnet_process_id id)
593 char *str = libcfs_next_nidstring();
595 if (id.pid == LNET_PID_ANY) {
596 snprintf(str, LNET_NIDSTR_SIZE,
597 "LNET_PID_ANY-%s", libcfs_nid2str(id.nid));
601 snprintf(str, LNET_NIDSTR_SIZE, "%s%u-%s",
602 ((id.pid & LNET_PID_USERFLAG) != 0) ? "U" : "",
603 (id.pid & ~LNET_PID_USERFLAG), libcfs_nid2str(id.nid));
608 libcfs_str2anynid(lnet_nid_t *nidp, const char *str)
610 if (!strcmp(str, "*")) {
611 *nidp = LNET_NID_ANY;
615 *nidp = libcfs_str2nid(str);
616 return *nidp != LNET_NID_ANY;
620 * Nid range list syntax.
623 * <nidlist> :== <nidrange> [ ' ' <nidrange> ]
624 * <nidrange> :== <addrrange> '@' <net>
625 * <addrrange> :== '*' |
628 * <ipaddr_range> :== <cfs_expr_list>.<cfs_expr_list>.<cfs_expr_list>.
630 * <cfs_expr_list> :== <number> |
632 * <expr_list> :== '[' <range_expr> [ ',' <range_expr>] ']'
633 * <range_expr> :== <number> |
634 * <number> '-' <number> |
635 * <number> '-' <number> '/' <number>
636 * <net> :== <netname> | <netname><number>
637 * <netname> :== "lo" | "tcp" | "o2ib" | "cib" | "openib" | "iib" |
638 * "vib" | "ra" | "elan" | "mx" | "ptl"
643 * Structure to represent \<nidrange\> token of the syntax.
645 * One of this is created for each \<net\> parsed.
649 * Link to list of this structures which is built on nid range
652 struct list_head nr_link;
654 * List head for addrrange::ar_link.
656 struct list_head nr_addrranges;
658 * Flag indicating that *@<net> is found.
662 * Pointer to corresponding element of libcfs_netstrfns.
664 struct netstrfns *nr_netstrfns;
666 * Number of network. E.g. 5 if \<net\> is "elan5".
672 * Structure to represent \<addrrange\> token of the syntax.
676 * Link to nidrange::nr_addrranges.
678 struct list_head ar_link;
680 * List head for cfs_expr_list::el_list.
682 struct list_head ar_numaddr_ranges;
686 * Parses \<addrrange\> token on the syntax.
688 * Allocates struct addrrange and links to \a nidrange via
689 * (nidrange::nr_addrranges)
691 * \retval 0 if \a src parses to '*' | \<ipaddr_range\> | \<cfs_expr_list\>
692 * \retval -errno otherwise
695 parse_addrange(const struct cfs_lstr *src, struct nidrange *nidrange)
697 struct addrrange *addrrange;
699 if (src->ls_len == 1 && src->ls_str[0] == '*') {
700 nidrange->nr_all = 1;
704 addrrange = calloc(1, sizeof(struct addrrange));
705 if (addrrange == NULL)
707 list_add_tail(&addrrange->ar_link, &nidrange->nr_addrranges);
708 INIT_LIST_HEAD(&addrrange->ar_numaddr_ranges);
710 return nidrange->nr_netstrfns->nf_parse_addrlist(src->ls_str,
712 &addrrange->ar_numaddr_ranges);
716 * Finds or creates struct nidrange.
718 * Checks if \a src is a valid network name, looks for corresponding
719 * nidrange on the ist of nidranges (\a nidlist), creates new struct
720 * nidrange if it is not found.
722 * \retval pointer to struct nidrange matching network specified via \a src
723 * \retval NULL if \a src does not match any network
725 static struct nidrange *
726 add_nidrange(const struct cfs_lstr *src,
727 struct list_head *nidlist)
729 struct netstrfns *nf;
734 if (src->ls_len >= LNET_NIDSTR_SIZE)
737 nf = libcfs_namenum2netstrfns(src->ls_str);
740 endlen = src->ls_len - strlen(nf->nf_name);
742 /* network name only, e.g. "elan" or "tcp" */
745 /* e.g. "elan25" or "tcp23", refuse to parse if
746 * network name is not appended with decimal or
747 * hexadecimal number */
748 if (!cfs_str2num_check(src->ls_str + strlen(nf->nf_name),
749 endlen, &netnum, 0, MAX_NUMERIC_VALUE))
753 list_for_each_entry(nr, nidlist, nr_link) {
754 if (nr->nr_netstrfns != nf)
756 if (nr->nr_netnum != netnum)
761 nr = calloc(1, sizeof(struct nidrange));
764 list_add_tail(&nr->nr_link, nidlist);
765 INIT_LIST_HEAD(&nr->nr_addrranges);
766 nr->nr_netstrfns = nf;
768 nr->nr_netnum = netnum;
774 * Parses \<nidrange\> token of the syntax.
776 * \retval 1 if \a src parses to \<addrrange\> '@' \<net\>
777 * \retval 0 otherwise
780 parse_nidrange(struct cfs_lstr *src, struct list_head *nidlist)
782 struct cfs_lstr addrrange;
788 if (cfs_gettok(src, '@', &addrrange) == 0)
791 if (cfs_gettok(src, '@', &net) == 0 || src->ls_str != NULL)
794 nr = add_nidrange(&net, nidlist);
798 if (parse_addrange(&addrrange, nr) != 0)
803 fprintf(stderr, "can't parse nidrange: \"%.*s\"\n",
804 tmp.ls_len, tmp.ls_str);
809 * Frees addrrange structures of \a list.
811 * For each struct addrrange structure found on \a list it frees
812 * cfs_expr_list list attached to it and frees the addrrange itself.
817 free_addrranges(struct list_head *list)
819 while (!list_empty(list)) {
820 struct addrrange *ar;
822 ar = list_entry(list->next, struct addrrange, ar_link);
824 cfs_expr_list_free_list(&ar->ar_numaddr_ranges);
825 list_del(&ar->ar_link);
831 * Frees nidrange strutures of \a list.
833 * For each struct nidrange structure found on \a list it frees
834 * addrrange list attached to it and frees the nidrange itself.
839 cfs_free_nidlist(struct list_head *list)
841 struct list_head *pos, *next;
844 list_for_each_safe(pos, next, list) {
845 nr = list_entry(pos, struct nidrange, nr_link);
846 free_addrranges(&nr->nr_addrranges);
853 * Parses nid range list.
855 * Parses with rigorous syntax and overflow checking \a str into
856 * \<nidrange\> [ ' ' \<nidrange\> ], compiles \a str into set of
857 * structures and links that structure to \a nidlist. The resulting
858 * list can be used to match a NID againts set of NIDS defined by \a
862 * \retval 1 on success
863 * \retval 0 otherwise
866 cfs_parse_nidlist(char *str, int len, struct list_head *nidlist)
874 INIT_LIST_HEAD(nidlist);
876 rc = cfs_gettok(&src, ' ', &res);
878 cfs_free_nidlist(nidlist);
881 rc = parse_nidrange(&res, nidlist);
883 cfs_free_nidlist(nidlist);
891 * Matches a nid (\a nid) against the compiled list of nidranges (\a nidlist).
893 * \see cfs_parse_nidlist()
896 * \retval 0 otherwises
898 int cfs_match_nid(lnet_nid_t nid, struct list_head *nidlist)
901 struct addrrange *ar;
903 list_for_each_entry(nr, nidlist, nr_link) {
904 if (nr->nr_netstrfns->nf_type != LNET_NETTYP(LNET_NIDNET(nid)))
906 if (nr->nr_netnum != LNET_NETNUM(LNET_NIDNET(nid)))
910 list_for_each_entry(ar, &nr->nr_addrranges, ar_link)
911 if (nr->nr_netstrfns->nf_match_addr(LNET_NIDADDR(nid),
912 &ar->ar_numaddr_ranges))
919 * Print the network part of the nidrange \a nr into the specified \a buffer.
921 * \retval number of characters written
924 cfs_print_network(char *buffer, int count, struct nidrange *nr)
926 struct netstrfns *nf = nr->nr_netstrfns;
928 if (nr->nr_netnum == 0)
929 return snprintf(buffer, count, "@%s", nf->nf_name);
931 return snprintf(buffer, count, "@%s%u",
932 nf->nf_name, nr->nr_netnum);
937 * Print a list of addrrange (\a addrranges) into the specified \a buffer.
938 * At max \a count characters can be printed into \a buffer.
940 * \retval number of characters written
943 cfs_print_addrranges(char *buffer, int count, struct list_head *addrranges,
947 struct addrrange *ar;
948 struct netstrfns *nf = nr->nr_netstrfns;
950 list_for_each_entry(ar, addrranges, ar_link) {
952 i += snprintf(buffer + i, count - i, " ");
953 i += nf->nf_print_addrlist(buffer + i, count - i,
954 &ar->ar_numaddr_ranges);
955 i += cfs_print_network(buffer + i, count - i, nr);
961 * Print a list of nidranges (\a nidlist) into the specified \a buffer.
962 * At max \a count characters can be printed into \a buffer.
963 * Nidranges are separated by a space character.
965 * \retval number of characters written
967 int cfs_print_nidlist(char *buffer, int count, struct list_head *nidlist)
975 list_for_each_entry(nr, nidlist, nr_link) {
977 i += snprintf(buffer + i, count - i, " ");
979 if (nr->nr_all != 0) {
980 assert(list_empty(&nr->nr_addrranges));
981 i += snprintf(buffer + i, count - i, "*");
982 i += cfs_print_network(buffer + i, count - i, nr);
984 i += cfs_print_addrranges(buffer + i, count - i,
985 &nr->nr_addrranges, nr);
992 * Determines minimum and maximum addresses for a single
993 * numeric address range
999 static void cfs_ip_ar_min_max(struct addrrange *ar, __u32 *min_nid,
1002 struct cfs_expr_list *el;
1003 struct cfs_range_expr *re;
1004 __u32 tmp_ip_addr = 0;
1005 unsigned int min_ip[4] = {0};
1006 unsigned int max_ip[4] = {0};
1009 list_for_each_entry(el, &ar->ar_numaddr_ranges, el_link) {
1010 list_for_each_entry(re, &el->el_exprs, re_link) {
1011 min_ip[re_count] = re->re_lo;
1012 max_ip[re_count] = re->re_hi;
1017 tmp_ip_addr = ((min_ip[0] << 24) | (min_ip[1] << 16) |
1018 (min_ip[2] << 8) | min_ip[3]);
1020 if (min_nid != NULL)
1021 *min_nid = tmp_ip_addr;
1023 tmp_ip_addr = ((max_ip[0] << 24) | (max_ip[1] << 16) |
1024 (max_ip[2] << 8) | max_ip[3]);
1026 if (max_nid != NULL)
1027 *max_nid = tmp_ip_addr;
1031 * Determines minimum and maximum addresses for a single
1032 * numeric address range
1038 static void cfs_num_ar_min_max(struct addrrange *ar, __u32 *min_nid,
1041 struct cfs_expr_list *el;
1042 struct cfs_range_expr *re;
1043 unsigned int min_addr = 0;
1044 unsigned int max_addr = 0;
1046 list_for_each_entry(el, &ar->ar_numaddr_ranges, el_link) {
1047 list_for_each_entry(re, &el->el_exprs, re_link) {
1048 if (re->re_lo < min_addr || min_addr == 0)
1049 min_addr = re->re_lo;
1050 if (re->re_hi > max_addr)
1051 max_addr = re->re_hi;
1055 if (min_nid != NULL)
1056 *min_nid = min_addr;
1057 if (max_nid != NULL)
1058 *max_nid = max_addr;
1062 * Determines whether an expression list in an nidrange contains exactly
1063 * one contiguous address range. Calls the correct netstrfns for the LND
1067 * \retval true if contiguous
1068 * \retval false if not contiguous
1070 bool cfs_nidrange_is_contiguous(struct list_head *nidlist)
1072 struct nidrange *nr;
1073 struct netstrfns *nf = NULL;
1074 char *lndname = NULL;
1077 list_for_each_entry(nr, nidlist, nr_link) {
1078 nf = nr->nr_netstrfns;
1079 if (lndname == NULL)
1080 lndname = nf->nf_name;
1082 netnum = nr->nr_netnum;
1084 if (strcmp(lndname, nf->nf_name) != 0 ||
1085 netnum != nr->nr_netnum)
1092 if (!nf->nf_is_contiguous(nidlist))
1099 * Determines whether an expression list in an num nidrange contains exactly
1100 * one contiguous address range.
1104 * \retval true if contiguous
1105 * \retval false if not contiguous
1107 static bool cfs_num_is_contiguous(struct list_head *nidlist)
1109 struct nidrange *nr;
1110 struct addrrange *ar;
1111 struct cfs_expr_list *el;
1112 struct cfs_range_expr *re;
1114 __u32 last_end_nid = 0;
1115 __u32 current_start_nid = 0;
1116 __u32 current_end_nid = 0;
1118 list_for_each_entry(nr, nidlist, nr_link) {
1119 list_for_each_entry(ar, &nr->nr_addrranges, ar_link) {
1120 cfs_num_ar_min_max(ar, ¤t_start_nid,
1122 if (last_end_nid != 0 &&
1123 (current_start_nid - last_end_nid != 1))
1125 last_end_nid = current_end_nid;
1126 list_for_each_entry(el, &ar->ar_numaddr_ranges,
1128 list_for_each_entry(re, &el->el_exprs,
1130 if (re->re_stride > 1)
1132 else if (last_hi != 0 &&
1133 re->re_hi - last_hi != 1)
1135 last_hi = re->re_hi;
1145 * Determines whether an expression list in an ip nidrange contains exactly
1146 * one contiguous address range.
1150 * \retval true if contiguous
1151 * \retval false if not contiguous
1153 static bool cfs_ip_is_contiguous(struct list_head *nidlist)
1155 struct nidrange *nr;
1156 struct addrrange *ar;
1157 struct cfs_expr_list *el;
1158 struct cfs_range_expr *re;
1162 __u32 last_end_nid = 0;
1163 __u32 current_start_nid = 0;
1164 __u32 current_end_nid = 0;
1166 list_for_each_entry(nr, nidlist, nr_link) {
1167 list_for_each_entry(ar, &nr->nr_addrranges, ar_link) {
1170 cfs_ip_ar_min_max(ar, ¤t_start_nid,
1172 if (last_end_nid != 0 &&
1173 (current_start_nid - last_end_nid != 1))
1175 last_end_nid = current_end_nid;
1176 list_for_each_entry(el,
1177 &ar->ar_numaddr_ranges,
1180 list_for_each_entry(re, &el->el_exprs,
1183 if (re->re_stride > 1 ||
1184 (last_diff > 0 && last_hi != 255) ||
1185 (last_diff > 0 && last_hi == 255 &&
1188 last_hi = re->re_hi;
1189 last_diff = re->re_hi - re->re_lo;
1199 * Takes a linked list of nidrange expressions, determines the minimum
1200 * and maximum nid and creates appropriate nid structures
1206 void cfs_nidrange_find_min_max(struct list_head *nidlist, char *min_nid,
1207 char *max_nid, size_t nidstr_length)
1209 struct nidrange *nr;
1210 struct netstrfns *nf = NULL;
1214 char *lndname = NULL;
1215 char min_addr_str[IPSTRING_LENGTH];
1216 char max_addr_str[IPSTRING_LENGTH];
1218 list_for_each_entry(nr, nidlist, nr_link) {
1219 nf = nr->nr_netstrfns;
1220 lndname = nf->nf_name;
1222 netnum = nr->nr_netnum;
1224 nf->nf_min_max(nidlist, &min_addr, &max_addr);
1226 nf->nf_addr2str(min_addr, min_addr_str, sizeof(min_addr_str));
1227 nf->nf_addr2str(max_addr, max_addr_str, sizeof(max_addr_str));
1229 snprintf(min_nid, nidstr_length, "%s@%s%d", min_addr_str, lndname,
1231 snprintf(max_nid, nidstr_length, "%s@%s%d", max_addr_str, lndname,
1236 * Determines the min and max NID values for num LNDs
1242 static void cfs_num_min_max(struct list_head *nidlist, __u32 *min_nid,
1245 struct nidrange *nr;
1246 struct addrrange *ar;
1247 unsigned int tmp_min_addr = 0;
1248 unsigned int tmp_max_addr = 0;
1249 unsigned int min_addr = 0;
1250 unsigned int max_addr = 0;
1252 list_for_each_entry(nr, nidlist, nr_link) {
1253 list_for_each_entry(ar, &nr->nr_addrranges, ar_link) {
1254 cfs_num_ar_min_max(ar, &tmp_min_addr,
1256 if (tmp_min_addr < min_addr || min_addr == 0)
1257 min_addr = tmp_min_addr;
1258 if (tmp_max_addr > max_addr)
1259 max_addr = tmp_min_addr;
1262 *max_nid = max_addr;
1263 *min_nid = min_addr;
1267 * Takes an nidlist and determines the minimum and maximum
1274 static void cfs_ip_min_max(struct list_head *nidlist, __u32 *min_nid,
1277 struct nidrange *nr;
1278 struct addrrange *ar;
1279 __u32 tmp_min_ip_addr = 0;
1280 __u32 tmp_max_ip_addr = 0;
1281 __u32 min_ip_addr = 0;
1282 __u32 max_ip_addr = 0;
1284 list_for_each_entry(nr, nidlist, nr_link) {
1285 list_for_each_entry(ar, &nr->nr_addrranges, ar_link) {
1286 cfs_ip_ar_min_max(ar, &tmp_min_ip_addr,
1288 if (tmp_min_ip_addr < min_ip_addr || min_ip_addr == 0)
1289 min_ip_addr = tmp_min_ip_addr;
1290 if (tmp_max_ip_addr > max_ip_addr)
1291 max_ip_addr = tmp_max_ip_addr;
1295 if (min_nid != NULL)
1296 *min_nid = min_ip_addr;
1297 if (max_nid != NULL)
1298 *max_nid = max_ip_addr;