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)
275 * Frees addrrange structures of \a list.
277 * For each struct addrrange structure found on \a list it frees
278 * cfs_expr_list list attached to it and frees the addrrange itself.
283 free_addrranges(struct list_head *list)
285 while (!list_empty(list)) {
286 struct addrrange *ar;
288 ar = list_entry(list->next, struct addrrange, ar_link);
290 cfs_expr_list_free_list(&ar->ar_numaddr_ranges);
291 list_del(&ar->ar_link);
292 LIBCFS_FREE(ar, sizeof(struct addrrange));
297 * Frees nidrange strutures of \a list.
299 * For each struct nidrange structure found on \a list it frees
300 * addrrange list attached to it and frees the nidrange itself.
305 cfs_free_nidlist(struct list_head *list)
307 struct list_head *pos, *next;
310 list_for_each_safe(pos, next, list) {
311 nr = list_entry(pos, struct nidrange, nr_link);
312 free_addrranges(&nr->nr_addrranges);
314 LIBCFS_FREE(nr, sizeof(struct nidrange));
317 EXPORT_SYMBOL(cfs_free_nidlist);
320 * Parses nid range list.
322 * Parses with rigorous syntax and overflow checking \a str into
323 * \<nidrange\> [ ' ' \<nidrange\> ], compiles \a str into set of
324 * structures and links that structure to \a nidlist. The resulting
325 * list can be used to match a NID againts set of NIDS defined by \a
329 * \retval 1 on success
330 * \retval 0 otherwise
333 cfs_parse_nidlist(char *str, int len, struct list_head *nidlist)
341 INIT_LIST_HEAD(nidlist);
343 rc = cfs_gettok(&src, ' ', &res);
345 cfs_free_nidlist(nidlist);
348 rc = parse_nidrange(&res, nidlist);
350 cfs_free_nidlist(nidlist);
356 EXPORT_SYMBOL(cfs_parse_nidlist);
359 * Matches a nid (\a nid) against the compiled list of nidranges (\a nidlist).
361 * \see cfs_parse_nidlist()
364 * \retval 0 otherwises
366 int cfs_match_nid(lnet_nid_t nid, struct list_head *nidlist)
369 struct addrrange *ar;
371 list_for_each_entry(nr, nidlist, nr_link) {
372 if (nr->nr_netstrfns->nf_type != LNET_NETTYP(LNET_NIDNET(nid)))
374 if (nr->nr_netnum != LNET_NETNUM(LNET_NIDNET(nid)))
378 list_for_each_entry(ar, &nr->nr_addrranges, ar_link)
379 if (nr->nr_netstrfns->nf_match_addr(LNET_NIDADDR(nid),
380 &ar->ar_numaddr_ranges))
385 EXPORT_SYMBOL(cfs_match_nid);
388 * Print the network part of the nidrange \a nr into the specified \a buffer.
390 * \retval number of characters written
393 cfs_print_network(char *buffer, int count, struct nidrange *nr)
395 struct netstrfns *nf = nr->nr_netstrfns;
397 if (nr->nr_netnum == 0)
398 return scnprintf(buffer, count, "@%s", nf->nf_name);
400 return scnprintf(buffer, count, "@%s%u",
401 nf->nf_name, nr->nr_netnum);
405 * Print a list of addrrange (\a addrranges) into the specified \a buffer.
406 * At max \a count characters can be printed into \a buffer.
408 * \retval number of characters written
411 cfs_print_addrranges(char *buffer, int count, struct list_head *addrranges,
415 struct addrrange *ar;
416 struct netstrfns *nf = nr->nr_netstrfns;
418 list_for_each_entry(ar, addrranges, ar_link) {
420 i += scnprintf(buffer + i, count - i, " ");
421 i += nf->nf_print_addrlist(buffer + i, count - i,
422 &ar->ar_numaddr_ranges);
423 i += cfs_print_network(buffer + i, count - i, nr);
429 * Print a list of nidranges (\a nidlist) into the specified \a buffer.
430 * At max \a count characters can be printed into \a buffer.
431 * Nidranges are separated by a space character.
433 * \retval number of characters written
435 int cfs_print_nidlist(char *buffer, int count, struct list_head *nidlist)
443 list_for_each_entry(nr, nidlist, nr_link) {
445 i += scnprintf(buffer + i, count - i, " ");
447 if (nr->nr_all != 0) {
448 LASSERT(list_empty(&nr->nr_addrranges));
449 i += scnprintf(buffer + i, count - i, "*");
450 i += cfs_print_network(buffer + i, count - i, nr);
452 i += cfs_print_addrranges(buffer + i, count - i,
453 &nr->nr_addrranges, nr);
458 EXPORT_SYMBOL(cfs_print_nidlist);
461 * Determines minimum and maximum addresses for a single
462 * numeric address range
468 static void cfs_ip_ar_min_max(struct addrrange *ar, __u32 *min_nid,
471 struct cfs_expr_list *el;
472 struct cfs_range_expr *re;
473 __u32 tmp_ip_addr = 0;
474 unsigned int min_ip[4] = {0};
475 unsigned int max_ip[4] = {0};
478 list_for_each_entry(el, &ar->ar_numaddr_ranges, el_link) {
479 list_for_each_entry(re, &el->el_exprs, re_link) {
480 min_ip[re_count] = re->re_lo;
481 max_ip[re_count] = re->re_hi;
486 tmp_ip_addr = ((min_ip[0] << 24) | (min_ip[1] << 16) |
487 (min_ip[2] << 8) | min_ip[3]);
490 *min_nid = tmp_ip_addr;
492 tmp_ip_addr = ((max_ip[0] << 24) | (max_ip[1] << 16) |
493 (max_ip[2] << 8) | max_ip[3]);
496 *max_nid = tmp_ip_addr;
500 * Determines minimum and maximum addresses for a single
501 * numeric address range
507 static void cfs_num_ar_min_max(struct addrrange *ar, __u32 *min_nid,
510 struct cfs_expr_list *el;
511 struct cfs_range_expr *re;
512 unsigned int min_addr = 0;
513 unsigned int max_addr = 0;
515 list_for_each_entry(el, &ar->ar_numaddr_ranges, el_link) {
516 list_for_each_entry(re, &el->el_exprs, re_link) {
517 if (re->re_lo < min_addr || min_addr == 0)
518 min_addr = re->re_lo;
519 if (re->re_hi > max_addr)
520 max_addr = re->re_hi;
531 * Determines whether an expression list in an nidrange contains exactly
532 * one contiguous address range. Calls the correct netstrfns for the LND
536 * \retval true if contiguous
537 * \retval false if not contiguous
539 bool cfs_nidrange_is_contiguous(struct list_head *nidlist)
542 struct netstrfns *nf = NULL;
543 char *lndname = NULL;
546 list_for_each_entry(nr, nidlist, nr_link) {
547 nf = nr->nr_netstrfns;
549 lndname = nf->nf_name;
551 netnum = nr->nr_netnum;
553 if (strcmp(lndname, nf->nf_name) != 0 ||
554 netnum != nr->nr_netnum)
561 if (!nf->nf_is_contiguous(nidlist))
566 EXPORT_SYMBOL(cfs_nidrange_is_contiguous);
569 * Determines whether an expression list in an num nidrange contains exactly
570 * one contiguous address range.
574 * \retval true if contiguous
575 * \retval false if not contiguous
577 static bool cfs_num_is_contiguous(struct list_head *nidlist)
580 struct addrrange *ar;
581 struct cfs_expr_list *el;
582 struct cfs_range_expr *re;
584 __u32 last_end_nid = 0;
585 __u32 current_start_nid = 0;
586 __u32 current_end_nid = 0;
588 list_for_each_entry(nr, nidlist, nr_link) {
589 list_for_each_entry(ar, &nr->nr_addrranges, ar_link) {
590 cfs_num_ar_min_max(ar, ¤t_start_nid,
592 if (last_end_nid != 0 &&
593 (current_start_nid - last_end_nid != 1))
595 last_end_nid = current_end_nid;
596 list_for_each_entry(el, &ar->ar_numaddr_ranges,
598 list_for_each_entry(re, &el->el_exprs,
600 if (re->re_stride > 1)
602 else if (last_hi != 0 &&
603 re->re_hi - last_hi != 1)
615 * Determines whether an expression list in an ip nidrange contains exactly
616 * one contiguous address range.
620 * \retval true if contiguous
621 * \retval false if not contiguous
623 static bool cfs_ip_is_contiguous(struct list_head *nidlist)
626 struct addrrange *ar;
627 struct cfs_expr_list *el;
628 struct cfs_range_expr *re;
632 __u32 last_end_nid = 0;
633 __u32 current_start_nid = 0;
634 __u32 current_end_nid = 0;
636 list_for_each_entry(nr, nidlist, nr_link) {
637 list_for_each_entry(ar, &nr->nr_addrranges, ar_link) {
640 cfs_ip_ar_min_max(ar, ¤t_start_nid,
642 if (last_end_nid != 0 &&
643 (current_start_nid - last_end_nid != 1))
645 last_end_nid = current_end_nid;
646 list_for_each_entry(el,
647 &ar->ar_numaddr_ranges,
650 list_for_each_entry(re, &el->el_exprs,
653 if (re->re_stride > 1 ||
654 (last_diff > 0 && last_hi != 255) ||
655 (last_diff > 0 && last_hi == 255 &&
659 last_diff = re->re_hi - re->re_lo;
669 * Takes a linked list of nidrange expressions, determines the minimum
670 * and maximum nid and creates appropriate nid structures
676 void cfs_nidrange_find_min_max(struct list_head *nidlist, char *min_nid,
677 char *max_nid, size_t nidstr_length)
680 struct netstrfns *nf = NULL;
684 char *lndname = NULL;
685 char min_addr_str[IPSTRING_LENGTH];
686 char max_addr_str[IPSTRING_LENGTH];
688 list_for_each_entry(nr, nidlist, nr_link) {
689 nf = nr->nr_netstrfns;
690 lndname = nf->nf_name;
692 netnum = nr->nr_netnum;
694 nf->nf_min_max(nidlist, &min_addr, &max_addr);
696 nf->nf_addr2str(min_addr, min_addr_str, sizeof(min_addr_str));
697 nf->nf_addr2str(max_addr, max_addr_str, sizeof(max_addr_str));
699 snprintf(min_nid, nidstr_length, "%s@%s%d", min_addr_str, lndname,
701 snprintf(max_nid, nidstr_length, "%s@%s%d", max_addr_str, lndname,
704 EXPORT_SYMBOL(cfs_nidrange_find_min_max);
707 * Determines the min and max NID values for num LNDs
713 static void cfs_num_min_max(struct list_head *nidlist, __u32 *min_nid,
717 struct addrrange *ar;
718 unsigned int tmp_min_addr = 0;
719 unsigned int tmp_max_addr = 0;
720 unsigned int min_addr = 0;
721 unsigned int max_addr = 0;
723 list_for_each_entry(nr, nidlist, nr_link) {
724 list_for_each_entry(ar, &nr->nr_addrranges, ar_link) {
725 cfs_num_ar_min_max(ar, &tmp_min_addr,
727 if (tmp_min_addr < min_addr || min_addr == 0)
728 min_addr = tmp_min_addr;
729 if (tmp_max_addr > max_addr)
730 max_addr = tmp_min_addr;
738 * Takes an nidlist and determines the minimum and maximum
745 static void cfs_ip_min_max(struct list_head *nidlist, __u32 *min_nid,
749 struct addrrange *ar;
750 __u32 tmp_min_ip_addr = 0;
751 __u32 tmp_max_ip_addr = 0;
752 __u32 min_ip_addr = 0;
753 __u32 max_ip_addr = 0;
755 list_for_each_entry(nr, nidlist, nr_link) {
756 list_for_each_entry(ar, &nr->nr_addrranges, ar_link) {
757 cfs_ip_ar_min_max(ar, &tmp_min_ip_addr,
759 if (tmp_min_ip_addr < min_ip_addr || min_ip_addr == 0)
760 min_ip_addr = tmp_min_ip_addr;
761 if (tmp_max_ip_addr > max_ip_addr)
762 max_ip_addr = tmp_max_ip_addr;
767 *min_nid = min_ip_addr;
769 *max_nid = max_ip_addr;
773 libcfs_lo_str2addr(const char *str, int nob, __u32 *addr)
780 libcfs_ip_addr2str(__u32 addr, char *str, size_t size)
782 snprintf(str, size, "%u.%u.%u.%u",
783 (addr >> 24) & 0xff, (addr >> 16) & 0xff,
784 (addr >> 8) & 0xff, addr & 0xff);
787 /* CAVEAT EMPTOR XscanfX
788 * I use "%n" at the end of a sscanf format to detect trailing junk. However
789 * sscanf may return immediately if it sees the terminating '0' in a string, so
790 * I initialise the %n variable to the expected length. If sscanf sets it;
791 * fine, if it doesn't, then the scan ended at the end of the string, which is
794 libcfs_ip_str2addr(const char *str, int nob, __u32 *addr)
800 int n = nob; /* XscanfX */
803 if (sscanf(str, "%u.%u.%u.%u%n", &a, &b, &c, &d, &n) >= 4 &&
805 (a & ~0xff) == 0 && (b & ~0xff) == 0 &&
806 (c & ~0xff) == 0 && (d & ~0xff) == 0) {
807 *addr = ((a<<24)|(b<<16)|(c<<8)|d);
813 /* Used by lnet/config.c so it can't be static */
815 cfs_ip_addr_parse(char *str, int len, struct list_head *list)
817 struct cfs_expr_list *el;
826 while (src.ls_str != NULL) {
829 if (!cfs_gettok(&src, '.', &res)) {
834 rc = cfs_expr_list_parse(res.ls_str, res.ls_len, 0, 255, &el);
838 list_add_tail(&el->el_link, list);
847 cfs_expr_list_free_list(list);
853 libcfs_ip_addr_range_print(char *buffer, int count, struct list_head *list)
856 struct cfs_expr_list *el;
858 list_for_each_entry(el, list, el_link) {
861 i += scnprintf(buffer + i, count - i, ".");
862 i += cfs_expr_list_print(buffer + i, count - i, el);
868 * Matches address (\a addr) against address set encoded in \a list.
870 * \retval 1 if \a addr matches
871 * \retval 0 otherwise
874 cfs_ip_addr_match(__u32 addr, struct list_head *list)
876 struct cfs_expr_list *el;
879 list_for_each_entry_reverse(el, list, el_link) {
880 if (!cfs_expr_list_match(addr & 0xff, el))
890 * Print the network part of the nidrange \a nr into the specified \a buffer.
892 * \retval number of characters written
895 libcfs_decnum_addr2str(__u32 addr, char *str, size_t size)
897 snprintf(str, size, "%u", addr);
901 libcfs_num_str2addr(const char *str, int nob, __u32 *addr)
906 if (sscanf(str, "0x%x%n", addr, &n) >= 1 && n == nob)
910 if (sscanf(str, "0X%x%n", addr, &n) >= 1 && n == nob)
914 if (sscanf(str, "%u%n", addr, &n) >= 1 && n == nob)
921 * Nf_parse_addrlist method for networks using numeric addresses.
923 * Examples of such networks are gm and elan.
925 * \retval 0 if \a str parsed to numeric address
926 * \retval errno otherwise
929 libcfs_num_parse(char *str, int len, struct list_head *list)
931 struct cfs_expr_list *el;
934 rc = cfs_expr_list_parse(str, len, 0, MAX_NUMERIC_VALUE, &el);
936 list_add_tail(&el->el_link, list);
942 libcfs_num_addr_range_print(char *buffer, int count, struct list_head *list)
945 struct cfs_expr_list *el;
947 list_for_each_entry(el, list, el_link) {
949 i += cfs_expr_list_print(buffer + i, count - i, el);
955 * Nf_match_addr method for networks using numeric addresses
958 * \retval 0 otherwise
961 libcfs_num_match(__u32 addr, struct list_head *numaddr)
963 struct cfs_expr_list *el;
965 LASSERT(!list_empty(numaddr));
966 el = list_entry(numaddr->next, struct cfs_expr_list, el_link);
968 return cfs_expr_list_match(addr, el);
971 static struct netstrfns libcfs_netstrfns[] = {
974 .nf_modname = "klolnd",
975 .nf_addr2str = libcfs_decnum_addr2str,
976 .nf_str2addr = libcfs_lo_str2addr,
977 .nf_parse_addrlist = libcfs_num_parse,
978 .nf_print_addrlist = libcfs_num_addr_range_print,
979 .nf_match_addr = libcfs_num_match,
980 .nf_is_contiguous = cfs_num_is_contiguous,
981 .nf_min_max = cfs_num_min_max },
982 { .nf_type = SOCKLND,
984 .nf_modname = "ksocklnd",
985 .nf_addr2str = libcfs_ip_addr2str,
986 .nf_str2addr = libcfs_ip_str2addr,
987 .nf_parse_addrlist = cfs_ip_addr_parse,
988 .nf_print_addrlist = libcfs_ip_addr_range_print,
989 .nf_match_addr = cfs_ip_addr_match,
990 .nf_is_contiguous = cfs_ip_is_contiguous,
991 .nf_min_max = cfs_ip_min_max },
992 { .nf_type = O2IBLND,
994 .nf_modname = "ko2iblnd",
995 .nf_addr2str = libcfs_ip_addr2str,
996 .nf_str2addr = libcfs_ip_str2addr,
997 .nf_parse_addrlist = cfs_ip_addr_parse,
998 .nf_print_addrlist = libcfs_ip_addr_range_print,
999 .nf_match_addr = cfs_ip_addr_match,
1000 .nf_is_contiguous = cfs_ip_is_contiguous,
1001 .nf_min_max = cfs_ip_min_max },
1002 { .nf_type = GNILND,
1004 .nf_modname = "kgnilnd",
1005 .nf_addr2str = libcfs_decnum_addr2str,
1006 .nf_str2addr = libcfs_num_str2addr,
1007 .nf_parse_addrlist = libcfs_num_parse,
1008 .nf_print_addrlist = libcfs_num_addr_range_print,
1009 .nf_match_addr = libcfs_num_match,
1010 .nf_is_contiguous = cfs_num_is_contiguous,
1011 .nf_min_max = cfs_num_min_max },
1012 { .nf_type = GNIIPLND,
1014 .nf_modname = "kgnilnd",
1015 .nf_addr2str = libcfs_ip_addr2str,
1016 .nf_str2addr = libcfs_ip_str2addr,
1017 .nf_parse_addrlist = cfs_ip_addr_parse,
1018 .nf_print_addrlist = libcfs_ip_addr_range_print,
1019 .nf_match_addr = cfs_ip_addr_match,
1020 .nf_is_contiguous = cfs_ip_is_contiguous,
1021 .nf_min_max = cfs_ip_min_max },
1024 static const size_t libcfs_nnetstrfns = ARRAY_SIZE(libcfs_netstrfns);
1026 static struct netstrfns *
1027 libcfs_lnd2netstrfns(__u32 lnd)
1031 for (i = 0; i < libcfs_nnetstrfns; i++)
1032 if (lnd == libcfs_netstrfns[i].nf_type)
1033 return &libcfs_netstrfns[i];
1038 static struct netstrfns *
1039 libcfs_namenum2netstrfns(const char *name)
1041 struct netstrfns *nf;
1044 for (i = 0; i < libcfs_nnetstrfns; i++) {
1045 nf = &libcfs_netstrfns[i];
1046 if (!strncmp(name, nf->nf_name, strlen(nf->nf_name)))
1052 static struct netstrfns *
1053 libcfs_name2netstrfns(const char *name)
1057 for (i = 0; i < libcfs_nnetstrfns; i++)
1058 if (!strcmp(libcfs_netstrfns[i].nf_name, name))
1059 return &libcfs_netstrfns[i];
1065 libcfs_isknown_lnd(__u32 lnd)
1067 return libcfs_lnd2netstrfns(lnd) != NULL;
1069 EXPORT_SYMBOL(libcfs_isknown_lnd);
1072 libcfs_lnd2modname(__u32 lnd)
1074 struct netstrfns *nf = libcfs_lnd2netstrfns(lnd);
1076 return (nf == NULL) ? NULL : nf->nf_modname;
1078 EXPORT_SYMBOL(libcfs_lnd2modname);
1081 libcfs_str2lnd(const char *str)
1083 struct netstrfns *nf = libcfs_name2netstrfns(str);
1090 EXPORT_SYMBOL(libcfs_str2lnd);
1093 libcfs_lnd2str_r(__u32 lnd, char *buf, size_t buf_size)
1095 struct netstrfns *nf;
1097 nf = libcfs_lnd2netstrfns(lnd);
1099 snprintf(buf, buf_size, "?%u?", lnd);
1101 snprintf(buf, buf_size, "%s", nf->nf_name);
1105 EXPORT_SYMBOL(libcfs_lnd2str_r);
1108 libcfs_net2str_r(__u32 net, char *buf, size_t buf_size)
1110 __u32 nnum = LNET_NETNUM(net);
1111 __u32 lnd = LNET_NETTYP(net);
1112 struct netstrfns *nf;
1114 nf = libcfs_lnd2netstrfns(lnd);
1116 snprintf(buf, buf_size, "<%u:%u>", lnd, nnum);
1118 snprintf(buf, buf_size, "%s", nf->nf_name);
1120 snprintf(buf, buf_size, "%s%u", nf->nf_name, nnum);
1124 EXPORT_SYMBOL(libcfs_net2str_r);
1127 libcfs_nid2str_r(lnet_nid_t nid, char *buf, size_t buf_size)
1129 __u32 addr = LNET_NIDADDR(nid);
1130 __u32 net = LNET_NIDNET(nid);
1131 __u32 nnum = LNET_NETNUM(net);
1132 __u32 lnd = LNET_NETTYP(net);
1133 struct netstrfns *nf;
1135 if (nid == LNET_NID_ANY) {
1136 strncpy(buf, "<?>", buf_size);
1137 buf[buf_size - 1] = '\0';
1141 nf = libcfs_lnd2netstrfns(lnd);
1143 snprintf(buf, buf_size, "%x@<%u:%u>", addr, lnd, nnum);
1147 nf->nf_addr2str(addr, buf, buf_size);
1148 addr_len = strlen(buf);
1150 snprintf(buf + addr_len, buf_size - addr_len, "@%s",
1153 snprintf(buf + addr_len, buf_size - addr_len, "@%s%u",
1159 EXPORT_SYMBOL(libcfs_nid2str_r);
1161 static struct netstrfns *
1162 libcfs_str2net_internal(const char *str, __u32 *net)
1164 struct netstrfns *nf = NULL;
1166 unsigned int netnum;
1169 for (i = 0; i < libcfs_nnetstrfns; i++) {
1170 nf = &libcfs_netstrfns[i];
1171 if (!strncmp(str, nf->nf_name, strlen(nf->nf_name)))
1175 if (i == libcfs_nnetstrfns)
1178 nob = strlen(nf->nf_name);
1180 if (strlen(str) == (unsigned int)nob) {
1183 if (nf->nf_type == LOLND) /* net number not allowed */
1188 if (sscanf(str, "%u%n", &netnum, &i) < 1 ||
1189 i != (int)strlen(str))
1193 *net = LNET_MKNET(nf->nf_type, netnum);
1198 libcfs_str2net(const char *str)
1202 if (libcfs_str2net_internal(str, &net) != NULL)
1205 return LNET_NIDNET(LNET_NID_ANY);
1207 EXPORT_SYMBOL(libcfs_str2net);
1210 libcfs_str2nid(const char *str)
1212 const char *sep = strchr(str, '@');
1213 struct netstrfns *nf;
1218 nf = libcfs_str2net_internal(sep + 1, &net);
1220 return LNET_NID_ANY;
1222 sep = str + strlen(str);
1223 net = LNET_MKNET(SOCKLND, 0);
1224 nf = libcfs_lnd2netstrfns(SOCKLND);
1225 LASSERT(nf != NULL);
1228 if (!nf->nf_str2addr(str, (int)(sep - str), &addr))
1229 return LNET_NID_ANY;
1231 return LNET_MKNID(net, addr);
1233 EXPORT_SYMBOL(libcfs_str2nid);
1236 libcfs_id2str(lnet_process_id_t id)
1238 char *str = libcfs_next_nidstring();
1240 if (id.pid == LNET_PID_ANY) {
1241 snprintf(str, LNET_NIDSTR_SIZE,
1242 "LNET_PID_ANY-%s", libcfs_nid2str(id.nid));
1246 snprintf(str, LNET_NIDSTR_SIZE, "%s%u-%s",
1247 ((id.pid & LNET_PID_USERFLAG) != 0) ? "U" : "",
1248 (id.pid & ~LNET_PID_USERFLAG), libcfs_nid2str(id.nid));
1251 EXPORT_SYMBOL(libcfs_id2str);
1254 libcfs_str2anynid(lnet_nid_t *nidp, const char *str)
1256 if (!strcmp(str, "*")) {
1257 *nidp = LNET_NID_ANY;
1261 *nidp = libcfs_str2nid(str);
1262 return *nidp != LNET_NID_ANY;
1264 EXPORT_SYMBOL(libcfs_str2anynid);