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.sun.com/software/products/lustre/docs/GPLv2.pdf
20 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
21 * CA 95054 USA or visit www.sun.com if you need additional information or
27 * Copyright (c) 2008, 2010, Oracle and/or its affiliates. All rights reserved.
28 * Use is subject to license terms.
30 * Copyright (c) 2011, 2014, Intel Corporation.
33 * This file is part of Lustre, http://www.lustre.org/
34 * Lustre is a trademark of Sun Microsystems, Inc.
36 * lnet/lnet/nidstrings.c
38 * Author: Phil Schwan <phil@clusterfs.com>
41 #define DEBUG_SUBSYSTEM S_LNET
43 #include <libcfs/libcfs.h>
44 #include <lnet/nidstr.h>
46 /* max value for numeric network address */
47 #define MAX_NUMERIC_VALUE 0xffffffff
49 #define IPSTRING_LENGTH 16
51 /* CAVEAT VENDITOR! Keep the canonical string representation of nets/nids
52 * consistent in all conversion functions. Some code fragments are copied
53 * around for the sake of clarity...
56 /* CAVEAT EMPTOR! Racey temporary buffer allocation!
57 * Choose the number of nidstrings to support the MAXIMUM expected number of
58 * concurrent users. If there are more, the returned string will be volatile.
59 * NB this number must allow for a process to be descheduled for a timeslice
60 * between getting its string and using it.
63 static char libcfs_nidstrings[LNET_NIDSTR_COUNT][LNET_NIDSTR_SIZE];
64 static int libcfs_nidstring_idx;
66 static DEFINE_SPINLOCK(libcfs_nidstring_lock);
68 static struct netstrfns *libcfs_namenum2netstrfns(const char *name);
71 libcfs_next_nidstring(void)
76 spin_lock_irqsave(&libcfs_nidstring_lock, flags);
78 str = libcfs_nidstrings[libcfs_nidstring_idx++];
79 if (libcfs_nidstring_idx == ARRAY_SIZE(libcfs_nidstrings))
80 libcfs_nidstring_idx = 0;
82 spin_unlock_irqrestore(&libcfs_nidstring_lock, flags);
85 EXPORT_SYMBOL(libcfs_next_nidstring);
88 * Nid range list syntax.
91 * <nidlist> :== <nidrange> [ ' ' <nidrange> ]
92 * <nidrange> :== <addrrange> '@' <net>
93 * <addrrange> :== '*' |
96 * <ipaddr_range> :== <cfs_expr_list>.<cfs_expr_list>.<cfs_expr_list>.
98 * <cfs_expr_list> :== <number> |
100 * <expr_list> :== '[' <range_expr> [ ',' <range_expr>] ']'
101 * <range_expr> :== <number> |
102 * <number> '-' <number> |
103 * <number> '-' <number> '/' <number>
104 * <net> :== <netname> | <netname><number>
105 * <netname> :== "lo" | "tcp" | "o2ib" | "cib" | "openib" | "iib" |
106 * "vib" | "ra" | "elan" | "mx" | "ptl"
111 * Structure to represent \<nidrange\> token of the syntax.
113 * One of this is created for each \<net\> parsed.
117 * Link to list of this structures which is built on nid range
120 struct list_head nr_link;
122 * List head for addrrange::ar_link.
124 struct list_head nr_addrranges;
126 * Flag indicating that *@<net> is found.
130 * Pointer to corresponding element of libcfs_netstrfns.
132 struct netstrfns *nr_netstrfns;
134 * Number of network. E.g. 5 if \<net\> is "elan5".
140 * Structure to represent \<addrrange\> token of the syntax.
144 * Link to nidrange::nr_addrranges.
146 struct list_head ar_link;
148 * List head for cfs_expr_list::el_list.
150 struct list_head ar_numaddr_ranges;
154 * Parses \<addrrange\> token on the syntax.
156 * Allocates struct addrrange and links to \a nidrange via
157 * (nidrange::nr_addrranges)
159 * \retval 0 if \a src parses to '*' | \<ipaddr_range\> | \<cfs_expr_list\>
160 * \retval -errno otherwise
163 parse_addrange(const struct cfs_lstr *src, struct nidrange *nidrange)
165 struct addrrange *addrrange;
167 if (src->ls_len == 1 && src->ls_str[0] == '*') {
168 nidrange->nr_all = 1;
172 LIBCFS_ALLOC(addrrange, sizeof(struct addrrange));
173 if (addrrange == NULL)
175 list_add_tail(&addrrange->ar_link, &nidrange->nr_addrranges);
176 INIT_LIST_HEAD(&addrrange->ar_numaddr_ranges);
178 return nidrange->nr_netstrfns->nf_parse_addrlist(src->ls_str,
180 &addrrange->ar_numaddr_ranges);
184 * Finds or creates struct nidrange.
186 * Checks if \a src is a valid network name, looks for corresponding
187 * nidrange on the ist of nidranges (\a nidlist), creates new struct
188 * nidrange if it is not found.
190 * \retval pointer to struct nidrange matching network specified via \a src
191 * \retval NULL if \a src does not match any network
193 static struct nidrange *
194 add_nidrange(const struct cfs_lstr *src,
195 struct list_head *nidlist)
197 struct netstrfns *nf;
202 if (src->ls_len >= LNET_NIDSTR_SIZE)
205 nf = libcfs_namenum2netstrfns(src->ls_str);
208 endlen = src->ls_len - strlen(nf->nf_name);
210 /* network name only, e.g. "elan" or "tcp" */
213 /* e.g. "elan25" or "tcp23", refuse to parse if
214 * network name is not appended with decimal or
215 * hexadecimal number */
216 if (!cfs_str2num_check(src->ls_str + strlen(nf->nf_name),
217 endlen, &netnum, 0, MAX_NUMERIC_VALUE))
221 list_for_each_entry(nr, nidlist, nr_link) {
222 if (nr->nr_netstrfns != nf)
224 if (nr->nr_netnum != netnum)
229 LIBCFS_ALLOC(nr, sizeof(struct nidrange));
232 list_add_tail(&nr->nr_link, nidlist);
233 INIT_LIST_HEAD(&nr->nr_addrranges);
234 nr->nr_netstrfns = nf;
236 nr->nr_netnum = netnum;
242 * Parses \<nidrange\> token of the syntax.
244 * \retval 1 if \a src parses to \<addrrange\> '@' \<net\>
245 * \retval 0 otherwise
248 parse_nidrange(struct cfs_lstr *src, struct list_head *nidlist)
250 struct cfs_lstr addrrange;
256 if (cfs_gettok(src, '@', &addrrange) == 0)
259 if (cfs_gettok(src, '@', &net) == 0 || src->ls_str != NULL)
262 nr = add_nidrange(&net, nidlist);
266 if (parse_addrange(&addrrange, nr) != 0)
271 CWARN("can't parse nidrange: \"%.*s\"\n", tmp.ls_len, tmp.ls_str);
276 * Frees addrrange structures of \a list.
278 * For each struct addrrange structure found on \a list it frees
279 * cfs_expr_list list attached to it and frees the addrrange itself.
284 free_addrranges(struct list_head *list)
286 while (!list_empty(list)) {
287 struct addrrange *ar;
289 ar = list_entry(list->next, struct addrrange, ar_link);
291 cfs_expr_list_free_list(&ar->ar_numaddr_ranges);
292 list_del(&ar->ar_link);
293 LIBCFS_FREE(ar, sizeof(struct addrrange));
298 * Frees nidrange strutures of \a list.
300 * For each struct nidrange structure found on \a list it frees
301 * addrrange list attached to it and frees the nidrange itself.
306 cfs_free_nidlist(struct list_head *list)
308 struct list_head *pos, *next;
311 list_for_each_safe(pos, next, list) {
312 nr = list_entry(pos, struct nidrange, nr_link);
313 free_addrranges(&nr->nr_addrranges);
315 LIBCFS_FREE(nr, sizeof(struct nidrange));
318 EXPORT_SYMBOL(cfs_free_nidlist);
321 * Parses nid range list.
323 * Parses with rigorous syntax and overflow checking \a str into
324 * \<nidrange\> [ ' ' \<nidrange\> ], compiles \a str into set of
325 * structures and links that structure to \a nidlist. The resulting
326 * list can be used to match a NID againts set of NIDS defined by \a
330 * \retval 1 on success
331 * \retval 0 otherwise
334 cfs_parse_nidlist(char *str, int len, struct list_head *nidlist)
342 INIT_LIST_HEAD(nidlist);
344 rc = cfs_gettok(&src, ' ', &res);
346 cfs_free_nidlist(nidlist);
349 rc = parse_nidrange(&res, nidlist);
351 cfs_free_nidlist(nidlist);
357 EXPORT_SYMBOL(cfs_parse_nidlist);
360 * Matches a nid (\a nid) against the compiled list of nidranges (\a nidlist).
362 * \see cfs_parse_nidlist()
365 * \retval 0 otherwises
367 int cfs_match_nid(lnet_nid_t nid, struct list_head *nidlist)
370 struct addrrange *ar;
372 list_for_each_entry(nr, nidlist, nr_link) {
373 if (nr->nr_netstrfns->nf_type != LNET_NETTYP(LNET_NIDNET(nid)))
375 if (nr->nr_netnum != LNET_NETNUM(LNET_NIDNET(nid)))
379 list_for_each_entry(ar, &nr->nr_addrranges, ar_link)
380 if (nr->nr_netstrfns->nf_match_addr(LNET_NIDADDR(nid),
381 &ar->ar_numaddr_ranges))
386 EXPORT_SYMBOL(cfs_match_nid);
389 * Print the network part of the nidrange \a nr into the specified \a buffer.
391 * \retval number of characters written
394 cfs_print_network(char *buffer, int count, struct nidrange *nr)
396 struct netstrfns *nf = nr->nr_netstrfns;
398 if (nr->nr_netnum == 0)
399 return scnprintf(buffer, count, "@%s", nf->nf_name);
401 return scnprintf(buffer, count, "@%s%u",
402 nf->nf_name, nr->nr_netnum);
406 * Print a list of addrrange (\a addrranges) into the specified \a buffer.
407 * At max \a count characters can be printed into \a buffer.
409 * \retval number of characters written
412 cfs_print_addrranges(char *buffer, int count, struct list_head *addrranges,
416 struct addrrange *ar;
417 struct netstrfns *nf = nr->nr_netstrfns;
419 list_for_each_entry(ar, addrranges, ar_link) {
421 i += scnprintf(buffer + i, count - i, " ");
422 i += nf->nf_print_addrlist(buffer + i, count - i,
423 &ar->ar_numaddr_ranges);
424 i += cfs_print_network(buffer + i, count - i, nr);
430 * Print a list of nidranges (\a nidlist) into the specified \a buffer.
431 * At max \a count characters can be printed into \a buffer.
432 * Nidranges are separated by a space character.
434 * \retval number of characters written
436 int cfs_print_nidlist(char *buffer, int count, struct list_head *nidlist)
444 list_for_each_entry(nr, nidlist, nr_link) {
446 i += scnprintf(buffer + i, count - i, " ");
448 if (nr->nr_all != 0) {
449 LASSERT(list_empty(&nr->nr_addrranges));
450 i += scnprintf(buffer + i, count - i, "*");
451 i += cfs_print_network(buffer + i, count - i, nr);
453 i += cfs_print_addrranges(buffer + i, count - i,
454 &nr->nr_addrranges, nr);
459 EXPORT_SYMBOL(cfs_print_nidlist);
462 * Determines minimum and maximum addresses for a single
463 * numeric address range
469 static void cfs_ip_ar_min_max(struct addrrange *ar, __u32 *min_nid,
472 struct cfs_expr_list *el;
473 struct cfs_range_expr *re;
474 __u32 tmp_ip_addr = 0;
475 unsigned int min_ip[4] = {0};
476 unsigned int max_ip[4] = {0};
479 list_for_each_entry(el, &ar->ar_numaddr_ranges, el_link) {
480 list_for_each_entry(re, &el->el_exprs, re_link) {
481 min_ip[re_count] = re->re_lo;
482 max_ip[re_count] = re->re_hi;
487 tmp_ip_addr = ((min_ip[0] << 24) | (min_ip[1] << 16) |
488 (min_ip[2] << 8) | min_ip[3]);
491 *min_nid = tmp_ip_addr;
493 tmp_ip_addr = ((max_ip[0] << 24) | (max_ip[1] << 16) |
494 (max_ip[2] << 8) | max_ip[3]);
497 *max_nid = tmp_ip_addr;
501 * Determines minimum and maximum addresses for a single
502 * numeric address range
508 static void cfs_num_ar_min_max(struct addrrange *ar, __u32 *min_nid,
511 struct cfs_expr_list *el;
512 struct cfs_range_expr *re;
513 unsigned int min_addr = 0;
514 unsigned int max_addr = 0;
516 list_for_each_entry(el, &ar->ar_numaddr_ranges, el_link) {
517 list_for_each_entry(re, &el->el_exprs, re_link) {
518 if (re->re_lo < min_addr || min_addr == 0)
519 min_addr = re->re_lo;
520 if (re->re_hi > max_addr)
521 max_addr = re->re_hi;
532 * Determines whether an expression list in an nidrange contains exactly
533 * one contiguous address range. Calls the correct netstrfns for the LND
537 * \retval true if contiguous
538 * \retval false if not contiguous
540 bool cfs_nidrange_is_contiguous(struct list_head *nidlist)
543 struct netstrfns *nf = NULL;
544 char *lndname = NULL;
547 list_for_each_entry(nr, nidlist, nr_link) {
548 nf = nr->nr_netstrfns;
550 lndname = nf->nf_name;
552 netnum = nr->nr_netnum;
554 if (strcmp(lndname, nf->nf_name) != 0 ||
555 netnum != nr->nr_netnum)
562 if (!nf->nf_is_contiguous(nidlist))
567 EXPORT_SYMBOL(cfs_nidrange_is_contiguous);
570 * Determines whether an expression list in an num nidrange contains exactly
571 * one contiguous address range.
575 * \retval true if contiguous
576 * \retval false if not contiguous
578 static bool cfs_num_is_contiguous(struct list_head *nidlist)
581 struct addrrange *ar;
582 struct cfs_expr_list *el;
583 struct cfs_range_expr *re;
585 __u32 last_end_nid = 0;
586 __u32 current_start_nid = 0;
587 __u32 current_end_nid = 0;
589 list_for_each_entry(nr, nidlist, nr_link) {
590 list_for_each_entry(ar, &nr->nr_addrranges, ar_link) {
591 cfs_num_ar_min_max(ar, ¤t_start_nid,
593 if (last_end_nid != 0 &&
594 (current_start_nid - last_end_nid != 1))
596 last_end_nid = current_end_nid;
597 list_for_each_entry(el, &ar->ar_numaddr_ranges,
599 list_for_each_entry(re, &el->el_exprs,
601 if (re->re_stride > 1)
603 else if (last_hi != 0 &&
604 re->re_hi - last_hi != 1)
616 * Determines whether an expression list in an ip nidrange contains exactly
617 * one contiguous address range.
621 * \retval true if contiguous
622 * \retval false if not contiguous
624 static bool cfs_ip_is_contiguous(struct list_head *nidlist)
627 struct addrrange *ar;
628 struct cfs_expr_list *el;
629 struct cfs_range_expr *re;
633 __u32 last_end_nid = 0;
634 __u32 current_start_nid = 0;
635 __u32 current_end_nid = 0;
637 list_for_each_entry(nr, nidlist, nr_link) {
638 list_for_each_entry(ar, &nr->nr_addrranges, ar_link) {
641 cfs_ip_ar_min_max(ar, ¤t_start_nid,
643 if (last_end_nid != 0 &&
644 (current_start_nid - last_end_nid != 1))
646 last_end_nid = current_end_nid;
647 list_for_each_entry(el,
648 &ar->ar_numaddr_ranges,
651 list_for_each_entry(re, &el->el_exprs,
654 if (re->re_stride > 1 ||
655 (last_diff > 0 && last_hi != 255) ||
656 (last_diff > 0 && last_hi == 255 &&
660 last_diff = re->re_hi - re->re_lo;
670 * Takes a linked list of nidrange expressions, determines the minimum
671 * and maximum nid and creates appropriate nid structures
677 void cfs_nidrange_find_min_max(struct list_head *nidlist, char *min_nid,
678 char *max_nid, size_t nidstr_length)
681 struct netstrfns *nf = NULL;
685 char *lndname = NULL;
686 char min_addr_str[IPSTRING_LENGTH];
687 char max_addr_str[IPSTRING_LENGTH];
689 list_for_each_entry(nr, nidlist, nr_link) {
690 nf = nr->nr_netstrfns;
691 lndname = nf->nf_name;
693 netnum = nr->nr_netnum;
695 nf->nf_min_max(nidlist, &min_addr, &max_addr);
697 nf->nf_addr2str(min_addr, min_addr_str, sizeof(min_addr_str));
698 nf->nf_addr2str(max_addr, max_addr_str, sizeof(max_addr_str));
700 snprintf(min_nid, nidstr_length, "%s@%s%d", min_addr_str, lndname,
702 snprintf(max_nid, nidstr_length, "%s@%s%d", max_addr_str, lndname,
705 EXPORT_SYMBOL(cfs_nidrange_find_min_max);
708 * Determines the min and max NID values for num LNDs
714 static void cfs_num_min_max(struct list_head *nidlist, __u32 *min_nid,
718 struct addrrange *ar;
719 unsigned int tmp_min_addr = 0;
720 unsigned int tmp_max_addr = 0;
721 unsigned int min_addr = 0;
722 unsigned int max_addr = 0;
724 list_for_each_entry(nr, nidlist, nr_link) {
725 list_for_each_entry(ar, &nr->nr_addrranges, ar_link) {
726 cfs_num_ar_min_max(ar, &tmp_min_addr,
728 if (tmp_min_addr < min_addr || min_addr == 0)
729 min_addr = tmp_min_addr;
730 if (tmp_max_addr > max_addr)
731 max_addr = tmp_min_addr;
739 * Takes an nidlist and determines the minimum and maximum
746 static void cfs_ip_min_max(struct list_head *nidlist, __u32 *min_nid,
750 struct addrrange *ar;
751 __u32 tmp_min_ip_addr = 0;
752 __u32 tmp_max_ip_addr = 0;
753 __u32 min_ip_addr = 0;
754 __u32 max_ip_addr = 0;
756 list_for_each_entry(nr, nidlist, nr_link) {
757 list_for_each_entry(ar, &nr->nr_addrranges, ar_link) {
758 cfs_ip_ar_min_max(ar, &tmp_min_ip_addr,
760 if (tmp_min_ip_addr < min_ip_addr || min_ip_addr == 0)
761 min_ip_addr = tmp_min_ip_addr;
762 if (tmp_max_ip_addr > max_ip_addr)
763 max_ip_addr = tmp_max_ip_addr;
768 *min_nid = min_ip_addr;
770 *max_nid = max_ip_addr;
774 libcfs_lo_str2addr(const char *str, int nob, __u32 *addr)
781 libcfs_ip_addr2str(__u32 addr, char *str, size_t size)
783 snprintf(str, size, "%u.%u.%u.%u",
784 (addr >> 24) & 0xff, (addr >> 16) & 0xff,
785 (addr >> 8) & 0xff, addr & 0xff);
788 /* CAVEAT EMPTOR XscanfX
789 * I use "%n" at the end of a sscanf format to detect trailing junk. However
790 * sscanf may return immediately if it sees the terminating '0' in a string, so
791 * I initialise the %n variable to the expected length. If sscanf sets it;
792 * fine, if it doesn't, then the scan ended at the end of the string, which is
795 libcfs_ip_str2addr(const char *str, int nob, __u32 *addr)
801 int n = nob; /* XscanfX */
804 if (sscanf(str, "%u.%u.%u.%u%n", &a, &b, &c, &d, &n) >= 4 &&
806 (a & ~0xff) == 0 && (b & ~0xff) == 0 &&
807 (c & ~0xff) == 0 && (d & ~0xff) == 0) {
808 *addr = ((a<<24)|(b<<16)|(c<<8)|d);
814 /* Used by lnet/config.c so it can't be static */
816 cfs_ip_addr_parse(char *str, int len, struct list_head *list)
818 struct cfs_expr_list *el;
827 while (src.ls_str != NULL) {
830 if (!cfs_gettok(&src, '.', &res)) {
835 rc = cfs_expr_list_parse(res.ls_str, res.ls_len, 0, 255, &el);
839 list_add_tail(&el->el_link, list);
848 cfs_expr_list_free_list(list);
854 libcfs_ip_addr_range_print(char *buffer, int count, struct list_head *list)
857 struct cfs_expr_list *el;
859 list_for_each_entry(el, list, el_link) {
862 i += scnprintf(buffer + i, count - i, ".");
863 i += cfs_expr_list_print(buffer + i, count - i, el);
869 * Matches address (\a addr) against address set encoded in \a list.
871 * \retval 1 if \a addr matches
872 * \retval 0 otherwise
875 cfs_ip_addr_match(__u32 addr, struct list_head *list)
877 struct cfs_expr_list *el;
880 list_for_each_entry_reverse(el, list, el_link) {
881 if (!cfs_expr_list_match(addr & 0xff, el))
891 * Print the network part of the nidrange \a nr into the specified \a buffer.
893 * \retval number of characters written
896 libcfs_decnum_addr2str(__u32 addr, char *str, size_t size)
898 snprintf(str, size, "%u", addr);
902 libcfs_hexnum_addr2str(__u32 addr, char *str, size_t size)
904 snprintf(str, size, "0x%x", addr);
908 libcfs_num_str2addr(const char *str, int nob, __u32 *addr)
913 if (sscanf(str, "0x%x%n", addr, &n) >= 1 && n == nob)
917 if (sscanf(str, "0X%x%n", addr, &n) >= 1 && n == nob)
921 if (sscanf(str, "%u%n", addr, &n) >= 1 && n == nob)
928 * Nf_parse_addrlist method for networks using numeric addresses.
930 * Examples of such networks are gm and elan.
932 * \retval 0 if \a str parsed to numeric address
933 * \retval errno otherwise
936 libcfs_num_parse(char *str, int len, struct list_head *list)
938 struct cfs_expr_list *el;
941 rc = cfs_expr_list_parse(str, len, 0, MAX_NUMERIC_VALUE, &el);
943 list_add_tail(&el->el_link, list);
949 libcfs_num_addr_range_print(char *buffer, int count, struct list_head *list)
952 struct cfs_expr_list *el;
954 list_for_each_entry(el, list, el_link) {
956 i += cfs_expr_list_print(buffer + i, count - i, el);
962 * Nf_match_addr method for networks using numeric addresses
965 * \retval 0 otherwise
968 libcfs_num_match(__u32 addr, struct list_head *numaddr)
970 struct cfs_expr_list *el;
972 LASSERT(!list_empty(numaddr));
973 el = list_entry(numaddr->next, struct cfs_expr_list, el_link);
975 return cfs_expr_list_match(addr, el);
978 static struct netstrfns libcfs_netstrfns[] = {
979 {/* .nf_type */ LOLND,
981 /* .nf_modname */ "klolnd",
982 /* .nf_addr2str */ libcfs_decnum_addr2str,
983 /* .nf_str2addr */ libcfs_lo_str2addr,
984 /* .nf_parse_addr*/ libcfs_num_parse,
985 /* .nf_print_addrlist*/ libcfs_num_addr_range_print,
986 /* .nf_match_addr*/ libcfs_num_match,
987 /* .nf_is_contiguous */ cfs_num_is_contiguous,
988 /* .nf_min_max */ cfs_num_min_max},
989 {/* .nf_type */ SOCKLND,
990 /* .nf_name */ "tcp",
991 /* .nf_modname */ "ksocklnd",
992 /* .nf_addr2str */ libcfs_ip_addr2str,
993 /* .nf_str2addr */ libcfs_ip_str2addr,
994 /* .nf_parse_addrlist*/ cfs_ip_addr_parse,
995 /* .nf_print_addrlist*/ libcfs_ip_addr_range_print,
996 /* .nf_match_addr*/ cfs_ip_addr_match,
997 /* .nf_is_contiguous */ cfs_ip_is_contiguous,
998 /* .nf_min_max */ cfs_ip_min_max},
999 {/* .nf_type */ O2IBLND,
1000 /* .nf_name */ "o2ib",
1001 /* .nf_modname */ "ko2iblnd",
1002 /* .nf_addr2str */ libcfs_ip_addr2str,
1003 /* .nf_str2addr */ libcfs_ip_str2addr,
1004 /* .nf_parse_addrlist*/ cfs_ip_addr_parse,
1005 /* .nf_print_addrlist*/ libcfs_ip_addr_range_print,
1006 /* .nf_match_addr*/ cfs_ip_addr_match,
1007 /* .nf_is_contiguous */ cfs_ip_is_contiguous,
1008 /* .nf_min_max */ cfs_ip_min_max},
1009 {/* .nf_type */ CIBLND,
1010 /* .nf_name */ "cib",
1011 /* .nf_modname */ "kciblnd",
1012 /* .nf_addr2str */ libcfs_ip_addr2str,
1013 /* .nf_str2addr */ libcfs_ip_str2addr,
1014 /* .nf_parse_addrlist*/ cfs_ip_addr_parse,
1015 /* .nf_print_addrlist*/ libcfs_ip_addr_range_print,
1016 /* .nf_match_addr*/ cfs_ip_addr_match,
1017 /* .nf_is_contiguous */ cfs_ip_is_contiguous,
1018 /* .nf_min_max */ cfs_ip_min_max},
1019 {/* .nf_type */ OPENIBLND,
1020 /* .nf_name */ "openib",
1021 /* .nf_modname */ "kopeniblnd",
1022 /* .nf_addr2str */ libcfs_ip_addr2str,
1023 /* .nf_str2addr */ libcfs_ip_str2addr,
1024 /* .nf_parse_addrlist*/ cfs_ip_addr_parse,
1025 /* .nf_print_addrlist*/ libcfs_ip_addr_range_print,
1026 /* .nf_match_addr*/ cfs_ip_addr_match,
1027 /* .nf_is_contiguous */ cfs_ip_is_contiguous,
1028 /* .nf_min_max */ cfs_ip_min_max},
1029 {/* .nf_type */ IIBLND,
1030 /* .nf_name */ "iib",
1031 /* .nf_modname */ "kiiblnd",
1032 /* .nf_addr2str */ libcfs_ip_addr2str,
1033 /* .nf_str2addr */ libcfs_ip_str2addr,
1034 /* .nf_parse_addrlist*/ cfs_ip_addr_parse,
1035 /* .nf_print_addrlist*/ libcfs_ip_addr_range_print,
1036 /* .nf_match_addr*/ cfs_ip_addr_match,
1037 /* .nf_is_contiguous */ cfs_ip_is_contiguous,
1038 /* .nf_min_max */ cfs_ip_min_max},
1039 {/* .nf_type */ VIBLND,
1040 /* .nf_name */ "vib",
1041 /* .nf_modname */ "kviblnd",
1042 /* .nf_addr2str */ libcfs_ip_addr2str,
1043 /* .nf_str2addr */ libcfs_ip_str2addr,
1044 /* .nf_parse_addrlist*/ cfs_ip_addr_parse,
1045 /* .nf_print_addrlist*/ libcfs_ip_addr_range_print,
1046 /* .nf_match_addr*/ cfs_ip_addr_match,
1047 /* .nf_is_contiguous */ cfs_ip_is_contiguous,
1048 /* .nf_min_max */ cfs_ip_min_max},
1049 {/* .nf_type */ RALND,
1050 /* .nf_name */ "ra",
1051 /* .nf_modname */ "kralnd",
1052 /* .nf_addr2str */ libcfs_ip_addr2str,
1053 /* .nf_str2addr */ libcfs_ip_str2addr,
1054 /* .nf_parse_addrlist*/ cfs_ip_addr_parse,
1055 /* .nf_print_addrlist*/ libcfs_ip_addr_range_print,
1056 /* .nf_match_addr*/ cfs_ip_addr_match,
1057 /* .nf_is_contiguous */ cfs_ip_is_contiguous,
1058 /* .nf_min_max */ cfs_ip_min_max},
1059 {/* .nf_type */ QSWLND,
1060 /* .nf_name */ "elan",
1061 /* .nf_modname */ "kqswlnd",
1062 /* .nf_addr2str */ libcfs_decnum_addr2str,
1063 /* .nf_str2addr */ libcfs_num_str2addr,
1064 /* .nf_parse_addrlist*/ libcfs_num_parse,
1065 /* .nf_print_addrlist*/ libcfs_num_addr_range_print,
1066 /* .nf_match_addr*/ libcfs_num_match,
1067 /* .nf_is_contiguous */ cfs_num_is_contiguous,
1068 /* .nf_min_max */ cfs_num_min_max},
1069 {/* .nf_type */ GMLND,
1070 /* .nf_name */ "gm",
1071 /* .nf_modname */ "kgmlnd",
1072 /* .nf_addr2str */ libcfs_hexnum_addr2str,
1073 /* .nf_str2addr */ libcfs_num_str2addr,
1074 /* .nf_parse_addrlist*/ libcfs_num_parse,
1075 /* .nf_print_addrlist*/ libcfs_num_addr_range_print,
1076 /* .nf_match_addr*/ libcfs_num_match,
1077 /* .nf_is_contiguous */ cfs_num_is_contiguous,
1078 /* .nf_min_max */ cfs_num_min_max},
1079 {/* .nf_type */ MXLND,
1080 /* .nf_name */ "mx",
1081 /* .nf_modname */ "kmxlnd",
1082 /* .nf_addr2str */ libcfs_ip_addr2str,
1083 /* .nf_str2addr */ libcfs_ip_str2addr,
1084 /* .nf_parse_addrlist*/ cfs_ip_addr_parse,
1085 /* .nf_print_addrlist*/ libcfs_ip_addr_range_print,
1086 /* .nf_match_addr*/ cfs_ip_addr_match,
1087 /* .nf_is_contiguous */ cfs_ip_is_contiguous,
1088 /* .nf_min_max */ cfs_ip_min_max},
1089 {/* .nf_type */ PTLLND,
1090 /* .nf_name */ "ptl",
1091 /* .nf_modname */ "kptllnd",
1092 /* .nf_addr2str */ libcfs_decnum_addr2str,
1093 /* .nf_str2addr */ libcfs_num_str2addr,
1094 /* .nf_parse_addrlist*/ libcfs_num_parse,
1095 /* .nf_print_addrlist*/ libcfs_num_addr_range_print,
1096 /* .nf_match_addr*/ libcfs_num_match,
1097 /* .nf_is_contiguous */ cfs_num_is_contiguous,
1098 /* .nf_min_max */ cfs_num_min_max},
1099 {/* .nf_type */ GNILND,
1100 /* .nf_name */ "gni",
1101 /* .nf_modname */ "kgnilnd",
1102 /* .nf_addr2str */ libcfs_decnum_addr2str,
1103 /* .nf_str2addr */ libcfs_num_str2addr,
1104 /* .nf_parse_addrlist*/ libcfs_num_parse,
1105 /* .nf_print_addrlist*/ libcfs_num_addr_range_print,
1106 /* .nf_match_addr*/ libcfs_num_match,
1107 /* .nf_is_contiguous */ cfs_num_is_contiguous,
1108 /* .nf_min_max */ cfs_num_min_max},
1109 {/* .nf_type */ GNIIPLND,
1110 /* .nf_name */ "gip",
1111 /* .nf_modname */ "kgnilnd",
1112 /* .nf_addr2str */ libcfs_ip_addr2str,
1113 /* .nf_str2addr */ libcfs_ip_str2addr,
1114 /* .nf_parse_addrlist*/ cfs_ip_addr_parse,
1115 /* .nf_print_addrlist*/ libcfs_ip_addr_range_print,
1116 /* .nf_match_addr*/ cfs_ip_addr_match,
1117 /* .nf_is_contiguous */ cfs_ip_is_contiguous,
1118 /* .nf_min_max */ cfs_ip_min_max},
1121 static const size_t libcfs_nnetstrfns = ARRAY_SIZE(libcfs_netstrfns);
1123 static struct netstrfns *
1124 libcfs_lnd2netstrfns(__u32 lnd)
1128 for (i = 0; i < libcfs_nnetstrfns; i++)
1129 if (lnd == libcfs_netstrfns[i].nf_type)
1130 return &libcfs_netstrfns[i];
1135 static struct netstrfns *
1136 libcfs_namenum2netstrfns(const char *name)
1138 struct netstrfns *nf;
1141 for (i = 0; i < libcfs_nnetstrfns; i++) {
1142 nf = &libcfs_netstrfns[i];
1143 if (!strncmp(name, nf->nf_name, strlen(nf->nf_name)))
1149 static struct netstrfns *
1150 libcfs_name2netstrfns(const char *name)
1154 for (i = 0; i < libcfs_nnetstrfns; i++)
1155 if (!strcmp(libcfs_netstrfns[i].nf_name, name))
1156 return &libcfs_netstrfns[i];
1162 libcfs_isknown_lnd(__u32 lnd)
1164 return libcfs_lnd2netstrfns(lnd) != NULL;
1166 EXPORT_SYMBOL(libcfs_isknown_lnd);
1169 libcfs_lnd2modname(__u32 lnd)
1171 struct netstrfns *nf = libcfs_lnd2netstrfns(lnd);
1173 return (nf == NULL) ? NULL : nf->nf_modname;
1175 EXPORT_SYMBOL(libcfs_lnd2modname);
1178 libcfs_str2lnd(const char *str)
1180 struct netstrfns *nf = libcfs_name2netstrfns(str);
1187 EXPORT_SYMBOL(libcfs_str2lnd);
1190 libcfs_lnd2str_r(__u32 lnd, char *buf, size_t buf_size)
1192 struct netstrfns *nf;
1194 nf = libcfs_lnd2netstrfns(lnd);
1196 snprintf(buf, buf_size, "?%u?", lnd);
1198 snprintf(buf, buf_size, "%s", nf->nf_name);
1202 EXPORT_SYMBOL(libcfs_lnd2str_r);
1205 libcfs_net2str_r(__u32 net, char *buf, size_t buf_size)
1207 __u32 nnum = LNET_NETNUM(net);
1208 __u32 lnd = LNET_NETTYP(net);
1209 struct netstrfns *nf;
1211 nf = libcfs_lnd2netstrfns(lnd);
1213 snprintf(buf, buf_size, "<%u:%u>", lnd, nnum);
1215 snprintf(buf, buf_size, "%s", nf->nf_name);
1217 snprintf(buf, buf_size, "%s%u", nf->nf_name, nnum);
1221 EXPORT_SYMBOL(libcfs_net2str_r);
1224 libcfs_nid2str_r(lnet_nid_t nid, char *buf, size_t buf_size)
1226 __u32 addr = LNET_NIDADDR(nid);
1227 __u32 net = LNET_NIDNET(nid);
1228 __u32 nnum = LNET_NETNUM(net);
1229 __u32 lnd = LNET_NETTYP(net);
1230 struct netstrfns *nf;
1232 if (nid == LNET_NID_ANY) {
1233 strncpy(buf, "<?>", buf_size);
1234 buf[buf_size - 1] = '\0';
1238 nf = libcfs_lnd2netstrfns(lnd);
1240 snprintf(buf, buf_size, "%x@<%u:%u>", addr, lnd, nnum);
1244 nf->nf_addr2str(addr, buf, buf_size);
1245 addr_len = strlen(buf);
1247 snprintf(buf + addr_len, buf_size - addr_len, "@%s",
1250 snprintf(buf + addr_len, buf_size - addr_len, "@%s%u",
1256 EXPORT_SYMBOL(libcfs_nid2str_r);
1258 static struct netstrfns *
1259 libcfs_str2net_internal(const char *str, __u32 *net)
1261 struct netstrfns *nf = NULL;
1263 unsigned int netnum;
1266 for (i = 0; i < libcfs_nnetstrfns; i++) {
1267 nf = &libcfs_netstrfns[i];
1268 if (!strncmp(str, nf->nf_name, strlen(nf->nf_name)))
1272 if (i == libcfs_nnetstrfns)
1275 nob = strlen(nf->nf_name);
1277 if (strlen(str) == (unsigned int)nob) {
1280 if (nf->nf_type == LOLND) /* net number not allowed */
1285 if (sscanf(str, "%u%n", &netnum, &i) < 1 ||
1286 i != (int)strlen(str))
1290 *net = LNET_MKNET(nf->nf_type, netnum);
1295 libcfs_str2net(const char *str)
1299 if (libcfs_str2net_internal(str, &net) != NULL)
1302 return LNET_NIDNET(LNET_NID_ANY);
1304 EXPORT_SYMBOL(libcfs_str2net);
1307 libcfs_str2nid(const char *str)
1309 const char *sep = strchr(str, '@');
1310 struct netstrfns *nf;
1315 nf = libcfs_str2net_internal(sep + 1, &net);
1317 return LNET_NID_ANY;
1319 sep = str + strlen(str);
1320 net = LNET_MKNET(SOCKLND, 0);
1321 nf = libcfs_lnd2netstrfns(SOCKLND);
1322 LASSERT(nf != NULL);
1325 if (!nf->nf_str2addr(str, (int)(sep - str), &addr))
1326 return LNET_NID_ANY;
1328 return LNET_MKNID(net, addr);
1330 EXPORT_SYMBOL(libcfs_str2nid);
1333 libcfs_id2str(lnet_process_id_t id)
1335 char *str = libcfs_next_nidstring();
1337 if (id.pid == LNET_PID_ANY) {
1338 snprintf(str, LNET_NIDSTR_SIZE,
1339 "LNET_PID_ANY-%s", libcfs_nid2str(id.nid));
1343 snprintf(str, LNET_NIDSTR_SIZE, "%s%u-%s",
1344 ((id.pid & LNET_PID_USERFLAG) != 0) ? "U" : "",
1345 (id.pid & ~LNET_PID_USERFLAG), libcfs_nid2str(id.nid));
1348 EXPORT_SYMBOL(libcfs_id2str);
1351 libcfs_str2anynid(lnet_nid_t *nidp, const char *str)
1353 if (!strcmp(str, "*")) {
1354 *nidp = LNET_NID_ANY;
1358 *nidp = libcfs_str2nid(str);
1359 return *nidp != LNET_NID_ANY;
1361 EXPORT_SYMBOL(libcfs_str2anynid);