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, 2016, Intel Corporation.
29 * This file is part of Lustre, http://www.lustre.org/
30 * Lustre is a trademark of Sun Microsystems, Inc.
32 * lnet/lnet/nidstrings.c
34 * Author: Phil Schwan <phil@clusterfs.com>
37 #define DEBUG_SUBSYSTEM S_LNET
39 #include <libcfs/libcfs.h>
40 #include <lnet/nidstr.h>
42 /* max value for numeric network address */
43 #define MAX_NUMERIC_VALUE 0xffffffff
45 #define IPSTRING_LENGTH 16
47 /* CAVEAT VENDITOR! Keep the canonical string representation of nets/nids
48 * consistent in all conversion functions. Some code fragments are copied
49 * around for the sake of clarity...
52 /* CAVEAT EMPTOR! Racey temporary buffer allocation!
53 * Choose the number of nidstrings to support the MAXIMUM expected number of
54 * concurrent users. If there are more, the returned string will be volatile.
55 * NB this number must allow for a process to be descheduled for a timeslice
56 * between getting its string and using it.
59 static char libcfs_nidstrings[LNET_NIDSTR_COUNT][LNET_NIDSTR_SIZE];
60 static int libcfs_nidstring_idx;
62 static DEFINE_SPINLOCK(libcfs_nidstring_lock);
64 static struct netstrfns *libcfs_namenum2netstrfns(const char *name);
67 libcfs_next_nidstring(void)
72 spin_lock_irqsave(&libcfs_nidstring_lock, flags);
74 str = libcfs_nidstrings[libcfs_nidstring_idx++];
75 if (libcfs_nidstring_idx == ARRAY_SIZE(libcfs_nidstrings))
76 libcfs_nidstring_idx = 0;
78 spin_unlock_irqrestore(&libcfs_nidstring_lock, flags);
81 EXPORT_SYMBOL(libcfs_next_nidstring);
84 * Nid range list syntax.
87 * <nidlist> :== <nidrange> [ ' ' <nidrange> ]
88 * <nidrange> :== <addrrange> '@' <net>
89 * <addrrange> :== '*' |
92 * <ipaddr_range> :== <cfs_expr_list>.<cfs_expr_list>.<cfs_expr_list>.
94 * <cfs_expr_list> :== <number> |
96 * <expr_list> :== '[' <range_expr> [ ',' <range_expr>] ']'
97 * <range_expr> :== <number> |
98 * <number> '-' <number> |
99 * <number> '-' <number> '/' <number>
100 * <net> :== <netname> | <netname><number>
101 * <netname> :== "lo" | "tcp" | "o2ib" | "cib" | "openib" | "iib" |
102 * "vib" | "ra" | "elan" | "mx" | "ptl"
107 * Structure to represent \<nidrange\> token of the syntax.
109 * One of this is created for each \<net\> parsed.
113 * Link to list of this structures which is built on nid range
116 struct list_head nr_link;
118 * List head for addrrange::ar_link.
120 struct list_head nr_addrranges;
122 * Flag indicating that *@<net> is found.
126 * Pointer to corresponding element of libcfs_netstrfns.
128 struct netstrfns *nr_netstrfns;
130 * Number of network. E.g. 5 if \<net\> is "elan5".
136 * Structure to represent \<addrrange\> token of the syntax.
140 * Link to nidrange::nr_addrranges.
142 struct list_head ar_link;
144 * List head for cfs_expr_list::el_list.
146 struct list_head ar_numaddr_ranges;
150 * Parses \<addrrange\> token on the syntax.
152 * Allocates struct addrrange and links to \a nidrange via
153 * (nidrange::nr_addrranges)
155 * \retval 0 if \a src parses to '*' | \<ipaddr_range\> | \<cfs_expr_list\>
156 * \retval -errno otherwise
159 parse_addrange(const struct cfs_lstr *src, struct nidrange *nidrange)
161 struct addrrange *addrrange;
163 if (src->ls_len == 1 && src->ls_str[0] == '*') {
164 nidrange->nr_all = 1;
168 LIBCFS_ALLOC(addrrange, sizeof(struct addrrange));
169 if (addrrange == NULL)
171 list_add_tail(&addrrange->ar_link, &nidrange->nr_addrranges);
172 INIT_LIST_HEAD(&addrrange->ar_numaddr_ranges);
174 return nidrange->nr_netstrfns->nf_parse_addrlist(src->ls_str,
176 &addrrange->ar_numaddr_ranges);
180 * Finds or creates struct nidrange.
182 * Checks if \a src is a valid network name, looks for corresponding
183 * nidrange on the ist of nidranges (\a nidlist), creates new struct
184 * nidrange if it is not found.
186 * \retval pointer to struct nidrange matching network specified via \a src
187 * \retval NULL if \a src does not match any network
189 static struct nidrange *
190 add_nidrange(const struct cfs_lstr *src,
191 struct list_head *nidlist)
193 struct netstrfns *nf;
198 if (src->ls_len >= LNET_NIDSTR_SIZE)
201 nf = libcfs_namenum2netstrfns(src->ls_str);
204 endlen = src->ls_len - strlen(nf->nf_name);
206 /* network name only, e.g. "elan" or "tcp" */
209 /* e.g. "elan25" or "tcp23", refuse to parse if
210 * network name is not appended with decimal or
211 * hexadecimal number */
212 if (!cfs_str2num_check(src->ls_str + strlen(nf->nf_name),
213 endlen, &netnum, 0, MAX_NUMERIC_VALUE))
217 list_for_each_entry(nr, nidlist, nr_link) {
218 if (nr->nr_netstrfns != nf)
220 if (nr->nr_netnum != netnum)
225 LIBCFS_ALLOC(nr, sizeof(struct nidrange));
228 list_add_tail(&nr->nr_link, nidlist);
229 INIT_LIST_HEAD(&nr->nr_addrranges);
230 nr->nr_netstrfns = nf;
232 nr->nr_netnum = netnum;
238 * Parses \<nidrange\> token of the syntax.
240 * \retval 1 if \a src parses to \<addrrange\> '@' \<net\>
241 * \retval 0 otherwise
244 parse_nidrange(struct cfs_lstr *src, struct list_head *nidlist)
246 struct cfs_lstr addrrange;
250 if (cfs_gettok(src, '@', &addrrange) == 0)
253 if (cfs_gettok(src, '@', &net) == 0 || src->ls_str != NULL)
256 nr = add_nidrange(&net, nidlist);
260 if (parse_addrange(&addrrange, nr) != 0)
269 * Frees addrrange structures of \a list.
271 * For each struct addrrange structure found on \a list it frees
272 * cfs_expr_list list attached to it and frees the addrrange itself.
277 free_addrranges(struct list_head *list)
279 while (!list_empty(list)) {
280 struct addrrange *ar;
282 ar = list_entry(list->next, struct addrrange, ar_link);
284 cfs_expr_list_free_list(&ar->ar_numaddr_ranges);
285 list_del(&ar->ar_link);
286 LIBCFS_FREE(ar, sizeof(struct addrrange));
291 * Frees nidrange strutures of \a list.
293 * For each struct nidrange structure found on \a list it frees
294 * addrrange list attached to it and frees the nidrange itself.
299 cfs_free_nidlist(struct list_head *list)
301 struct list_head *pos, *next;
304 list_for_each_safe(pos, next, list) {
305 nr = list_entry(pos, struct nidrange, nr_link);
306 free_addrranges(&nr->nr_addrranges);
308 LIBCFS_FREE(nr, sizeof(struct nidrange));
311 EXPORT_SYMBOL(cfs_free_nidlist);
314 * Parses nid range list.
316 * Parses with rigorous syntax and overflow checking \a str into
317 * \<nidrange\> [ ' ' \<nidrange\> ], compiles \a str into set of
318 * structures and links that structure to \a nidlist. The resulting
319 * list can be used to match a NID againts set of NIDS defined by \a
323 * \retval 1 on success
324 * \retval 0 otherwise
327 cfs_parse_nidlist(char *str, int len, struct list_head *nidlist)
335 INIT_LIST_HEAD(nidlist);
337 rc = cfs_gettok(&src, ' ', &res);
339 cfs_free_nidlist(nidlist);
342 rc = parse_nidrange(&res, nidlist);
344 cfs_free_nidlist(nidlist);
350 EXPORT_SYMBOL(cfs_parse_nidlist);
353 * Matches a nid (\a nid) against the compiled list of nidranges (\a nidlist).
355 * \see cfs_parse_nidlist()
358 * \retval 0 otherwises
360 int cfs_match_nid(lnet_nid_t nid, struct list_head *nidlist)
363 struct addrrange *ar;
365 list_for_each_entry(nr, nidlist, nr_link) {
366 if (nr->nr_netstrfns->nf_type != LNET_NETTYP(LNET_NIDNET(nid)))
368 if (nr->nr_netnum != LNET_NETNUM(LNET_NIDNET(nid)))
372 list_for_each_entry(ar, &nr->nr_addrranges, ar_link)
373 if (nr->nr_netstrfns->nf_match_addr(LNET_NIDADDR(nid),
374 &ar->ar_numaddr_ranges))
379 EXPORT_SYMBOL(cfs_match_nid);
382 * Print the network part of the nidrange \a nr into the specified \a buffer.
384 * \retval number of characters written
387 cfs_print_network(char *buffer, int count, struct nidrange *nr)
389 struct netstrfns *nf = nr->nr_netstrfns;
391 if (nr->nr_netnum == 0)
392 return scnprintf(buffer, count, "@%s", nf->nf_name);
394 return scnprintf(buffer, count, "@%s%u",
395 nf->nf_name, nr->nr_netnum);
399 * Print a list of addrrange (\a addrranges) into the specified \a buffer.
400 * At max \a count characters can be printed into \a buffer.
402 * \retval number of characters written
405 cfs_print_addrranges(char *buffer, int count, struct list_head *addrranges,
409 struct addrrange *ar;
410 struct netstrfns *nf = nr->nr_netstrfns;
412 list_for_each_entry(ar, addrranges, ar_link) {
414 i += scnprintf(buffer + i, count - i, " ");
415 i += nf->nf_print_addrlist(buffer + i, count - i,
416 &ar->ar_numaddr_ranges);
417 i += cfs_print_network(buffer + i, count - i, nr);
423 * Print a list of nidranges (\a nidlist) into the specified \a buffer.
424 * At max \a count characters can be printed into \a buffer.
425 * Nidranges are separated by a space character.
427 * \retval number of characters written
429 int cfs_print_nidlist(char *buffer, int count, struct list_head *nidlist)
437 list_for_each_entry(nr, nidlist, nr_link) {
439 i += scnprintf(buffer + i, count - i, " ");
441 if (nr->nr_all != 0) {
442 LASSERT(list_empty(&nr->nr_addrranges));
443 i += scnprintf(buffer + i, count - i, "*");
444 i += cfs_print_network(buffer + i, count - i, nr);
446 i += cfs_print_addrranges(buffer + i, count - i,
447 &nr->nr_addrranges, nr);
452 EXPORT_SYMBOL(cfs_print_nidlist);
455 * Determines minimum and maximum addresses for a single
456 * numeric address range
462 static void cfs_ip_ar_min_max(struct addrrange *ar, __u32 *min_nid,
465 struct cfs_expr_list *el;
466 struct cfs_range_expr *re;
467 __u32 tmp_ip_addr = 0;
468 unsigned int min_ip[4] = {0};
469 unsigned int max_ip[4] = {0};
472 list_for_each_entry(el, &ar->ar_numaddr_ranges, el_link) {
473 list_for_each_entry(re, &el->el_exprs, re_link) {
474 min_ip[re_count] = re->re_lo;
475 max_ip[re_count] = re->re_hi;
480 tmp_ip_addr = ((min_ip[0] << 24) | (min_ip[1] << 16) |
481 (min_ip[2] << 8) | min_ip[3]);
484 *min_nid = tmp_ip_addr;
486 tmp_ip_addr = ((max_ip[0] << 24) | (max_ip[1] << 16) |
487 (max_ip[2] << 8) | max_ip[3]);
490 *max_nid = tmp_ip_addr;
494 * Determines minimum and maximum addresses for a single
495 * numeric address range
501 static void cfs_num_ar_min_max(struct addrrange *ar, __u32 *min_nid,
504 struct cfs_expr_list *el;
505 struct cfs_range_expr *re;
506 unsigned int min_addr = 0;
507 unsigned int max_addr = 0;
509 list_for_each_entry(el, &ar->ar_numaddr_ranges, el_link) {
510 list_for_each_entry(re, &el->el_exprs, re_link) {
511 if (re->re_lo < min_addr || min_addr == 0)
512 min_addr = re->re_lo;
513 if (re->re_hi > max_addr)
514 max_addr = re->re_hi;
525 * Determines whether an expression list in an nidrange contains exactly
526 * one contiguous address range. Calls the correct netstrfns for the LND
530 * \retval true if contiguous
531 * \retval false if not contiguous
533 bool cfs_nidrange_is_contiguous(struct list_head *nidlist)
536 struct netstrfns *nf = NULL;
537 char *lndname = NULL;
540 list_for_each_entry(nr, nidlist, nr_link) {
541 nf = nr->nr_netstrfns;
543 lndname = nf->nf_name;
545 netnum = nr->nr_netnum;
547 if (strcmp(lndname, nf->nf_name) != 0 ||
548 netnum != nr->nr_netnum)
555 if (!nf->nf_is_contiguous(nidlist))
560 EXPORT_SYMBOL(cfs_nidrange_is_contiguous);
563 * Determines whether an expression list in an num nidrange contains exactly
564 * one contiguous address range.
568 * \retval true if contiguous
569 * \retval false if not contiguous
571 static bool cfs_num_is_contiguous(struct list_head *nidlist)
574 struct addrrange *ar;
575 struct cfs_expr_list *el;
576 struct cfs_range_expr *re;
578 __u32 last_end_nid = 0;
579 __u32 current_start_nid = 0;
580 __u32 current_end_nid = 0;
582 list_for_each_entry(nr, nidlist, nr_link) {
583 list_for_each_entry(ar, &nr->nr_addrranges, ar_link) {
584 cfs_num_ar_min_max(ar, ¤t_start_nid,
586 if (last_end_nid != 0 &&
587 (current_start_nid - last_end_nid != 1))
589 last_end_nid = current_end_nid;
590 list_for_each_entry(el, &ar->ar_numaddr_ranges,
592 list_for_each_entry(re, &el->el_exprs,
594 if (re->re_stride > 1)
596 else if (last_hi != 0 &&
597 re->re_hi - last_hi != 1)
609 * Determines whether an expression list in an ip nidrange contains exactly
610 * one contiguous address range.
614 * \retval true if contiguous
615 * \retval false if not contiguous
617 static bool cfs_ip_is_contiguous(struct list_head *nidlist)
620 struct addrrange *ar;
621 struct cfs_expr_list *el;
622 struct cfs_range_expr *re;
626 __u32 last_end_nid = 0;
627 __u32 current_start_nid = 0;
628 __u32 current_end_nid = 0;
630 list_for_each_entry(nr, nidlist, nr_link) {
631 list_for_each_entry(ar, &nr->nr_addrranges, ar_link) {
634 cfs_ip_ar_min_max(ar, ¤t_start_nid,
636 if (last_end_nid != 0 &&
637 (current_start_nid - last_end_nid != 1))
639 last_end_nid = current_end_nid;
640 list_for_each_entry(el,
641 &ar->ar_numaddr_ranges,
644 list_for_each_entry(re, &el->el_exprs,
647 if (re->re_stride > 1 ||
648 (last_diff > 0 && last_hi != 255) ||
649 (last_diff > 0 && last_hi == 255 &&
653 last_diff = re->re_hi - re->re_lo;
663 * Takes a linked list of nidrange expressions, determines the minimum
664 * and maximum nid and creates appropriate nid structures
670 void cfs_nidrange_find_min_max(struct list_head *nidlist, char *min_nid,
671 char *max_nid, size_t nidstr_length)
674 struct netstrfns *nf = NULL;
678 char *lndname = NULL;
679 char min_addr_str[IPSTRING_LENGTH];
680 char max_addr_str[IPSTRING_LENGTH];
682 list_for_each_entry(nr, nidlist, nr_link) {
683 nf = nr->nr_netstrfns;
684 lndname = nf->nf_name;
686 netnum = nr->nr_netnum;
688 nf->nf_min_max(nidlist, &min_addr, &max_addr);
690 nf->nf_addr2str(min_addr, min_addr_str, sizeof(min_addr_str));
691 nf->nf_addr2str(max_addr, max_addr_str, sizeof(max_addr_str));
693 snprintf(min_nid, nidstr_length, "%s@%s%d", min_addr_str, lndname,
695 snprintf(max_nid, nidstr_length, "%s@%s%d", max_addr_str, lndname,
698 EXPORT_SYMBOL(cfs_nidrange_find_min_max);
701 * Determines the min and max NID values for num LNDs
707 static void cfs_num_min_max(struct list_head *nidlist, __u32 *min_nid,
711 struct addrrange *ar;
712 unsigned int tmp_min_addr = 0;
713 unsigned int tmp_max_addr = 0;
714 unsigned int min_addr = 0;
715 unsigned int max_addr = 0;
717 list_for_each_entry(nr, nidlist, nr_link) {
718 list_for_each_entry(ar, &nr->nr_addrranges, ar_link) {
719 cfs_num_ar_min_max(ar, &tmp_min_addr,
721 if (tmp_min_addr < min_addr || min_addr == 0)
722 min_addr = tmp_min_addr;
723 if (tmp_max_addr > max_addr)
724 max_addr = tmp_min_addr;
732 * Takes an nidlist and determines the minimum and maximum
739 static void cfs_ip_min_max(struct list_head *nidlist, __u32 *min_nid,
743 struct addrrange *ar;
744 __u32 tmp_min_ip_addr = 0;
745 __u32 tmp_max_ip_addr = 0;
746 __u32 min_ip_addr = 0;
747 __u32 max_ip_addr = 0;
749 list_for_each_entry(nr, nidlist, nr_link) {
750 list_for_each_entry(ar, &nr->nr_addrranges, ar_link) {
751 cfs_ip_ar_min_max(ar, &tmp_min_ip_addr,
753 if (tmp_min_ip_addr < min_ip_addr || min_ip_addr == 0)
754 min_ip_addr = tmp_min_ip_addr;
755 if (tmp_max_ip_addr > max_ip_addr)
756 max_ip_addr = tmp_max_ip_addr;
761 *min_nid = min_ip_addr;
763 *max_nid = max_ip_addr;
767 libcfs_lo_str2addr(const char *str, int nob, __u32 *addr)
774 libcfs_ip_addr2str(__u32 addr, char *str, size_t size)
776 snprintf(str, size, "%u.%u.%u.%u",
777 (addr >> 24) & 0xff, (addr >> 16) & 0xff,
778 (addr >> 8) & 0xff, addr & 0xff);
781 /* CAVEAT EMPTOR XscanfX
782 * I use "%n" at the end of a sscanf format to detect trailing junk. However
783 * sscanf may return immediately if it sees the terminating '0' in a string, so
784 * I initialise the %n variable to the expected length. If sscanf sets it;
785 * fine, if it doesn't, then the scan ended at the end of the string, which is
788 libcfs_ip_str2addr(const char *str, int nob, __u32 *addr)
794 int n = nob; /* XscanfX */
797 if (sscanf(str, "%u.%u.%u.%u%n", &a, &b, &c, &d, &n) >= 4 &&
799 (a & ~0xff) == 0 && (b & ~0xff) == 0 &&
800 (c & ~0xff) == 0 && (d & ~0xff) == 0) {
801 *addr = ((a<<24)|(b<<16)|(c<<8)|d);
807 /* Used by lnet/config.c so it can't be static */
809 cfs_ip_addr_parse(char *str, int len, struct list_head *list)
811 struct cfs_expr_list *el;
820 while (src.ls_str != NULL) {
823 if (!cfs_gettok(&src, '.', &res)) {
828 rc = cfs_expr_list_parse(res.ls_str, res.ls_len, 0, 255, &el);
832 list_add_tail(&el->el_link, list);
841 cfs_expr_list_free_list(list);
847 libcfs_ip_addr_range_print(char *buffer, int count, struct list_head *list)
850 struct cfs_expr_list *el;
852 list_for_each_entry(el, list, el_link) {
855 i += scnprintf(buffer + i, count - i, ".");
856 i += cfs_expr_list_print(buffer + i, count - i, el);
862 * Matches address (\a addr) against address set encoded in \a list.
864 * \retval 1 if \a addr matches
865 * \retval 0 otherwise
868 cfs_ip_addr_match(__u32 addr, struct list_head *list)
870 struct cfs_expr_list *el;
873 list_for_each_entry_reverse(el, list, el_link) {
874 if (!cfs_expr_list_match(addr & 0xff, el))
884 * Print the network part of the nidrange \a nr into the specified \a buffer.
886 * \retval number of characters written
889 libcfs_decnum_addr2str(__u32 addr, char *str, size_t size)
891 snprintf(str, size, "%u", addr);
895 libcfs_num_str2addr(const char *str, int nob, __u32 *addr)
900 if (sscanf(str, "0x%x%n", addr, &n) >= 1 && n == nob)
904 if (sscanf(str, "0X%x%n", addr, &n) >= 1 && n == nob)
908 if (sscanf(str, "%u%n", addr, &n) >= 1 && n == nob)
915 * Nf_parse_addrlist method for networks using numeric addresses.
917 * Examples of such networks are gm and elan.
919 * \retval 0 if \a str parsed to numeric address
920 * \retval errno otherwise
923 libcfs_num_parse(char *str, int len, struct list_head *list)
925 struct cfs_expr_list *el;
928 rc = cfs_expr_list_parse(str, len, 0, MAX_NUMERIC_VALUE, &el);
930 list_add_tail(&el->el_link, list);
936 libcfs_num_addr_range_print(char *buffer, int count, struct list_head *list)
939 struct cfs_expr_list *el;
941 list_for_each_entry(el, list, el_link) {
943 i += cfs_expr_list_print(buffer + i, count - i, el);
949 * Nf_match_addr method for networks using numeric addresses
952 * \retval 0 otherwise
955 libcfs_num_match(__u32 addr, struct list_head *numaddr)
957 struct cfs_expr_list *el;
959 LASSERT(!list_empty(numaddr));
960 el = list_entry(numaddr->next, struct cfs_expr_list, el_link);
962 return cfs_expr_list_match(addr, el);
965 static struct netstrfns libcfs_netstrfns[] = {
968 .nf_modname = "klolnd",
969 .nf_addr2str = libcfs_decnum_addr2str,
970 .nf_str2addr = libcfs_lo_str2addr,
971 .nf_parse_addrlist = libcfs_num_parse,
972 .nf_print_addrlist = libcfs_num_addr_range_print,
973 .nf_match_addr = libcfs_num_match,
974 .nf_is_contiguous = cfs_num_is_contiguous,
975 .nf_min_max = cfs_num_min_max },
976 { .nf_type = SOCKLND,
978 .nf_modname = "ksocklnd",
979 .nf_addr2str = libcfs_ip_addr2str,
980 .nf_str2addr = libcfs_ip_str2addr,
981 .nf_parse_addrlist = cfs_ip_addr_parse,
982 .nf_print_addrlist = libcfs_ip_addr_range_print,
983 .nf_match_addr = cfs_ip_addr_match,
984 .nf_is_contiguous = cfs_ip_is_contiguous,
985 .nf_min_max = cfs_ip_min_max },
986 { .nf_type = O2IBLND,
988 .nf_modname = "ko2iblnd",
989 .nf_addr2str = libcfs_ip_addr2str,
990 .nf_str2addr = libcfs_ip_str2addr,
991 .nf_parse_addrlist = cfs_ip_addr_parse,
992 .nf_print_addrlist = libcfs_ip_addr_range_print,
993 .nf_match_addr = cfs_ip_addr_match,
994 .nf_is_contiguous = cfs_ip_is_contiguous,
995 .nf_min_max = cfs_ip_min_max },
998 .nf_modname = "kgnilnd",
999 .nf_addr2str = libcfs_decnum_addr2str,
1000 .nf_str2addr = libcfs_num_str2addr,
1001 .nf_parse_addrlist = libcfs_num_parse,
1002 .nf_print_addrlist = libcfs_num_addr_range_print,
1003 .nf_match_addr = libcfs_num_match,
1004 .nf_is_contiguous = cfs_num_is_contiguous,
1005 .nf_min_max = cfs_num_min_max },
1006 { .nf_type = GNIIPLND,
1008 .nf_modname = "kgnilnd",
1009 .nf_addr2str = libcfs_ip_addr2str,
1010 .nf_str2addr = libcfs_ip_str2addr,
1011 .nf_parse_addrlist = cfs_ip_addr_parse,
1012 .nf_print_addrlist = libcfs_ip_addr_range_print,
1013 .nf_match_addr = cfs_ip_addr_match,
1014 .nf_is_contiguous = cfs_ip_is_contiguous,
1015 .nf_min_max = cfs_ip_min_max },
1016 { .nf_type = PTL4LND,
1018 .nf_modname = "kptl4lnd",
1019 .nf_addr2str = libcfs_decnum_addr2str,
1020 .nf_str2addr = libcfs_num_str2addr,
1021 .nf_parse_addrlist = libcfs_num_parse,
1022 .nf_print_addrlist = libcfs_num_addr_range_print,
1023 .nf_match_addr = libcfs_num_match,
1024 .nf_is_contiguous = cfs_num_is_contiguous,
1025 .nf_min_max = cfs_num_min_max},
1028 static const size_t libcfs_nnetstrfns = ARRAY_SIZE(libcfs_netstrfns);
1030 static struct netstrfns *
1031 libcfs_lnd2netstrfns(__u32 lnd)
1035 for (i = 0; i < libcfs_nnetstrfns; i++)
1036 if (lnd == libcfs_netstrfns[i].nf_type)
1037 return &libcfs_netstrfns[i];
1042 static struct netstrfns *
1043 libcfs_namenum2netstrfns(const char *name)
1045 struct netstrfns *nf;
1048 for (i = 0; i < libcfs_nnetstrfns; i++) {
1049 nf = &libcfs_netstrfns[i];
1050 if (!strncmp(name, nf->nf_name, strlen(nf->nf_name)))
1056 static struct netstrfns *
1057 libcfs_name2netstrfns(const char *name)
1061 for (i = 0; i < libcfs_nnetstrfns; i++)
1062 if (!strcmp(libcfs_netstrfns[i].nf_name, name))
1063 return &libcfs_netstrfns[i];
1069 libcfs_isknown_lnd(__u32 lnd)
1071 return libcfs_lnd2netstrfns(lnd) != NULL;
1073 EXPORT_SYMBOL(libcfs_isknown_lnd);
1076 libcfs_lnd2modname(__u32 lnd)
1078 struct netstrfns *nf = libcfs_lnd2netstrfns(lnd);
1080 return (nf == NULL) ? NULL : nf->nf_modname;
1082 EXPORT_SYMBOL(libcfs_lnd2modname);
1085 libcfs_str2lnd(const char *str)
1087 struct netstrfns *nf = libcfs_name2netstrfns(str);
1094 EXPORT_SYMBOL(libcfs_str2lnd);
1097 libcfs_lnd2str_r(__u32 lnd, char *buf, size_t buf_size)
1099 struct netstrfns *nf;
1101 nf = libcfs_lnd2netstrfns(lnd);
1103 snprintf(buf, buf_size, "?%u?", lnd);
1105 snprintf(buf, buf_size, "%s", nf->nf_name);
1109 EXPORT_SYMBOL(libcfs_lnd2str_r);
1112 libcfs_net2str_r(__u32 net, char *buf, size_t buf_size)
1114 __u32 nnum = LNET_NETNUM(net);
1115 __u32 lnd = LNET_NETTYP(net);
1116 struct netstrfns *nf;
1118 nf = libcfs_lnd2netstrfns(lnd);
1120 snprintf(buf, buf_size, "<%u:%u>", lnd, nnum);
1122 snprintf(buf, buf_size, "%s", nf->nf_name);
1124 snprintf(buf, buf_size, "%s%u", nf->nf_name, nnum);
1128 EXPORT_SYMBOL(libcfs_net2str_r);
1131 libcfs_nid2str_r(lnet_nid_t nid, char *buf, size_t buf_size)
1133 __u32 addr = LNET_NIDADDR(nid);
1134 __u32 net = LNET_NIDNET(nid);
1135 __u32 nnum = LNET_NETNUM(net);
1136 __u32 lnd = LNET_NETTYP(net);
1137 struct netstrfns *nf;
1139 if (nid == LNET_NID_ANY) {
1140 strncpy(buf, "<?>", buf_size);
1141 buf[buf_size - 1] = '\0';
1145 nf = libcfs_lnd2netstrfns(lnd);
1147 snprintf(buf, buf_size, "%x@<%u:%u>", addr, lnd, nnum);
1151 nf->nf_addr2str(addr, buf, buf_size);
1152 addr_len = strlen(buf);
1154 snprintf(buf + addr_len, buf_size - addr_len, "@%s",
1157 snprintf(buf + addr_len, buf_size - addr_len, "@%s%u",
1163 EXPORT_SYMBOL(libcfs_nid2str_r);
1165 static struct netstrfns *
1166 libcfs_str2net_internal(const char *str, __u32 *net)
1168 struct netstrfns *nf = NULL;
1170 unsigned int netnum;
1173 for (i = 0; i < libcfs_nnetstrfns; i++) {
1174 nf = &libcfs_netstrfns[i];
1175 if (!strncmp(str, nf->nf_name, strlen(nf->nf_name)))
1179 if (i == libcfs_nnetstrfns)
1182 nob = strlen(nf->nf_name);
1184 if (strlen(str) == (unsigned int)nob) {
1187 if (nf->nf_type == LOLND) /* net number not allowed */
1192 if (sscanf(str, "%u%n", &netnum, &i) < 1 ||
1193 i != (int)strlen(str))
1197 *net = LNET_MKNET(nf->nf_type, netnum);
1202 libcfs_str2net(const char *str)
1206 if (libcfs_str2net_internal(str, &net) != NULL)
1209 return LNET_NIDNET(LNET_NID_ANY);
1211 EXPORT_SYMBOL(libcfs_str2net);
1214 libcfs_str2nid(const char *str)
1216 const char *sep = strchr(str, '@');
1217 struct netstrfns *nf;
1222 nf = libcfs_str2net_internal(sep + 1, &net);
1224 return LNET_NID_ANY;
1226 sep = str + strlen(str);
1227 net = LNET_MKNET(SOCKLND, 0);
1228 nf = libcfs_lnd2netstrfns(SOCKLND);
1229 LASSERT(nf != NULL);
1232 if (!nf->nf_str2addr(str, (int)(sep - str), &addr))
1233 return LNET_NID_ANY;
1235 return LNET_MKNID(net, addr);
1237 EXPORT_SYMBOL(libcfs_str2nid);
1240 libcfs_id2str(lnet_process_id_t id)
1242 char *str = libcfs_next_nidstring();
1244 if (id.pid == LNET_PID_ANY) {
1245 snprintf(str, LNET_NIDSTR_SIZE,
1246 "LNET_PID_ANY-%s", libcfs_nid2str(id.nid));
1250 snprintf(str, LNET_NIDSTR_SIZE, "%s%u-%s",
1251 ((id.pid & LNET_PID_USERFLAG) != 0) ? "U" : "",
1252 (id.pid & ~LNET_PID_USERFLAG), libcfs_nid2str(id.nid));
1255 EXPORT_SYMBOL(libcfs_id2str);
1258 libcfs_str2anynid(lnet_nid_t *nidp, const char *str)
1260 if (!strcmp(str, "*")) {
1261 *nidp = LNET_NID_ANY;
1265 *nidp = libcfs_str2nid(str);
1266 return *nidp != LNET_NID_ANY;
1268 EXPORT_SYMBOL(libcfs_str2anynid);