ipaddress.c 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784
  1. /* vi: set sw=4 ts=4: */
  2. /*
  3. * ipaddress.c "ip address".
  4. *
  5. * Licensed under GPLv2 or later, see file LICENSE in this tarball for details.
  6. *
  7. * Authors: Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru>
  8. *
  9. * Changes:
  10. * Laszlo Valko <valko@linux.karinthy.hu> 990223: address label must be zero terminated
  11. */
  12. #include <fnmatch.h>
  13. #include <net/if.h>
  14. #include <net/if_arp.h>
  15. #include "ip_common.h" /* #include "libbb.h" is inside */
  16. #include "rt_names.h"
  17. #include "utils.h"
  18. #ifndef IFF_LOWER_UP
  19. /* from linux/if.h */
  20. #define IFF_LOWER_UP 0x10000 /* driver signals L1 up*/
  21. #endif
  22. struct filter_t {
  23. char *label;
  24. char *flushb;
  25. struct rtnl_handle *rth;
  26. int scope, scopemask;
  27. int flags, flagmask;
  28. int flushp;
  29. int flushe;
  30. int ifindex;
  31. family_t family;
  32. smallint showqueue;
  33. smallint oneline;
  34. smallint up;
  35. smallint flushed;
  36. inet_prefix pfx;
  37. } FIX_ALIASING;
  38. typedef struct filter_t filter_t;
  39. #define G_filter (*(filter_t*)&bb_common_bufsiz1)
  40. static void print_link_flags(unsigned flags, unsigned mdown)
  41. {
  42. static const int flag_masks[] = {
  43. IFF_LOOPBACK, IFF_BROADCAST, IFF_POINTOPOINT,
  44. IFF_MULTICAST, IFF_NOARP, IFF_UP, IFF_LOWER_UP };
  45. static const char flag_labels[] ALIGN1 =
  46. "LOOPBACK\0""BROADCAST\0""POINTOPOINT\0"
  47. "MULTICAST\0""NOARP\0""UP\0""LOWER_UP\0";
  48. bb_putchar('<');
  49. flags &= ~IFF_RUNNING;
  50. #if 0
  51. _PF(ALLMULTI);
  52. _PF(PROMISC);
  53. _PF(MASTER);
  54. _PF(SLAVE);
  55. _PF(DEBUG);
  56. _PF(DYNAMIC);
  57. _PF(AUTOMEDIA);
  58. _PF(PORTSEL);
  59. _PF(NOTRAILERS);
  60. #endif
  61. flags = print_flags_separated(flag_masks, flag_labels, flags, ",");
  62. if (flags)
  63. printf("%x", flags);
  64. if (mdown)
  65. printf(",M-DOWN");
  66. printf("> ");
  67. }
  68. static void print_queuelen(char *name)
  69. {
  70. struct ifreq ifr;
  71. int s;
  72. s = socket(AF_INET, SOCK_STREAM, 0);
  73. if (s < 0)
  74. return;
  75. memset(&ifr, 0, sizeof(ifr));
  76. strncpy_IFNAMSIZ(ifr.ifr_name, name);
  77. if (ioctl_or_warn(s, SIOCGIFTXQLEN, &ifr) < 0) {
  78. close(s);
  79. return;
  80. }
  81. close(s);
  82. if (ifr.ifr_qlen)
  83. printf("qlen %d", ifr.ifr_qlen);
  84. }
  85. static NOINLINE int print_linkinfo(const struct nlmsghdr *n)
  86. {
  87. struct ifinfomsg *ifi = NLMSG_DATA(n);
  88. struct rtattr *tb[IFLA_MAX+1];
  89. int len = n->nlmsg_len;
  90. if (n->nlmsg_type != RTM_NEWLINK && n->nlmsg_type != RTM_DELLINK)
  91. return 0;
  92. len -= NLMSG_LENGTH(sizeof(*ifi));
  93. if (len < 0)
  94. return -1;
  95. if (G_filter.ifindex && ifi->ifi_index != G_filter.ifindex)
  96. return 0;
  97. if (G_filter.up && !(ifi->ifi_flags & IFF_UP))
  98. return 0;
  99. memset(tb, 0, sizeof(tb));
  100. parse_rtattr(tb, IFLA_MAX, IFLA_RTA(ifi), len);
  101. if (tb[IFLA_IFNAME] == NULL) {
  102. bb_error_msg("nil ifname");
  103. return -1;
  104. }
  105. if (G_filter.label
  106. && (!G_filter.family || G_filter.family == AF_PACKET)
  107. && fnmatch(G_filter.label, RTA_DATA(tb[IFLA_IFNAME]), 0)
  108. ) {
  109. return 0;
  110. }
  111. if (n->nlmsg_type == RTM_DELLINK)
  112. printf("Deleted ");
  113. printf("%d: %s", ifi->ifi_index,
  114. /*tb[IFLA_IFNAME] ? (char*)RTA_DATA(tb[IFLA_IFNAME]) : "<nil>" - we checked tb[IFLA_IFNAME] above*/
  115. (char*)RTA_DATA(tb[IFLA_IFNAME])
  116. );
  117. {
  118. unsigned m_flag = 0;
  119. if (tb[IFLA_LINK]) {
  120. SPRINT_BUF(b1);
  121. int iflink = *(int*)RTA_DATA(tb[IFLA_LINK]);
  122. if (iflink == 0)
  123. printf("@NONE: ");
  124. else {
  125. printf("@%s: ", ll_idx_n2a(iflink, b1));
  126. m_flag = ll_index_to_flags(iflink);
  127. m_flag = !(m_flag & IFF_UP);
  128. }
  129. } else {
  130. printf(": ");
  131. }
  132. print_link_flags(ifi->ifi_flags, m_flag);
  133. }
  134. if (tb[IFLA_MTU])
  135. printf("mtu %u ", *(int*)RTA_DATA(tb[IFLA_MTU]));
  136. if (tb[IFLA_QDISC])
  137. printf("qdisc %s ", (char*)RTA_DATA(tb[IFLA_QDISC]));
  138. #ifdef IFLA_MASTER
  139. if (tb[IFLA_MASTER]) {
  140. SPRINT_BUF(b1);
  141. printf("master %s ", ll_idx_n2a(*(int*)RTA_DATA(tb[IFLA_MASTER]), b1));
  142. }
  143. #endif
  144. if (G_filter.showqueue)
  145. print_queuelen((char*)RTA_DATA(tb[IFLA_IFNAME]));
  146. if (!G_filter.family || G_filter.family == AF_PACKET) {
  147. SPRINT_BUF(b1);
  148. printf("%c link/%s ", _SL_, ll_type_n2a(ifi->ifi_type, b1));
  149. if (tb[IFLA_ADDRESS]) {
  150. fputs(ll_addr_n2a(RTA_DATA(tb[IFLA_ADDRESS]),
  151. RTA_PAYLOAD(tb[IFLA_ADDRESS]),
  152. ifi->ifi_type,
  153. b1, sizeof(b1)), stdout);
  154. }
  155. if (tb[IFLA_BROADCAST]) {
  156. if (ifi->ifi_flags & IFF_POINTOPOINT)
  157. printf(" peer ");
  158. else
  159. printf(" brd ");
  160. fputs(ll_addr_n2a(RTA_DATA(tb[IFLA_BROADCAST]),
  161. RTA_PAYLOAD(tb[IFLA_BROADCAST]),
  162. ifi->ifi_type,
  163. b1, sizeof(b1)), stdout);
  164. }
  165. }
  166. bb_putchar('\n');
  167. /*fflush_all();*/
  168. return 0;
  169. }
  170. static int flush_update(void)
  171. {
  172. if (rtnl_send(G_filter.rth, G_filter.flushb, G_filter.flushp) < 0) {
  173. bb_perror_msg("can't send flush request");
  174. return -1;
  175. }
  176. G_filter.flushp = 0;
  177. return 0;
  178. }
  179. static int FAST_FUNC print_addrinfo(const struct sockaddr_nl *who UNUSED_PARAM,
  180. struct nlmsghdr *n, void *arg UNUSED_PARAM)
  181. {
  182. struct ifaddrmsg *ifa = NLMSG_DATA(n);
  183. int len = n->nlmsg_len;
  184. struct rtattr * rta_tb[IFA_MAX+1];
  185. char abuf[256];
  186. SPRINT_BUF(b1);
  187. if (n->nlmsg_type != RTM_NEWADDR && n->nlmsg_type != RTM_DELADDR)
  188. return 0;
  189. len -= NLMSG_LENGTH(sizeof(*ifa));
  190. if (len < 0) {
  191. bb_error_msg("wrong nlmsg len %d", len);
  192. return -1;
  193. }
  194. if (G_filter.flushb && n->nlmsg_type != RTM_NEWADDR)
  195. return 0;
  196. memset(rta_tb, 0, sizeof(rta_tb));
  197. parse_rtattr(rta_tb, IFA_MAX, IFA_RTA(ifa), n->nlmsg_len - NLMSG_LENGTH(sizeof(*ifa)));
  198. if (!rta_tb[IFA_LOCAL])
  199. rta_tb[IFA_LOCAL] = rta_tb[IFA_ADDRESS];
  200. if (!rta_tb[IFA_ADDRESS])
  201. rta_tb[IFA_ADDRESS] = rta_tb[IFA_LOCAL];
  202. if (G_filter.ifindex && G_filter.ifindex != ifa->ifa_index)
  203. return 0;
  204. if ((G_filter.scope ^ ifa->ifa_scope) & G_filter.scopemask)
  205. return 0;
  206. if ((G_filter.flags ^ ifa->ifa_flags) & G_filter.flagmask)
  207. return 0;
  208. if (G_filter.label) {
  209. const char *label;
  210. if (rta_tb[IFA_LABEL])
  211. label = RTA_DATA(rta_tb[IFA_LABEL]);
  212. else
  213. label = ll_idx_n2a(ifa->ifa_index, b1);
  214. if (fnmatch(G_filter.label, label, 0) != 0)
  215. return 0;
  216. }
  217. if (G_filter.pfx.family) {
  218. if (rta_tb[IFA_LOCAL]) {
  219. inet_prefix dst;
  220. memset(&dst, 0, sizeof(dst));
  221. dst.family = ifa->ifa_family;
  222. memcpy(&dst.data, RTA_DATA(rta_tb[IFA_LOCAL]), RTA_PAYLOAD(rta_tb[IFA_LOCAL]));
  223. if (inet_addr_match(&dst, &G_filter.pfx, G_filter.pfx.bitlen))
  224. return 0;
  225. }
  226. }
  227. if (G_filter.flushb) {
  228. struct nlmsghdr *fn;
  229. if (NLMSG_ALIGN(G_filter.flushp) + n->nlmsg_len > G_filter.flushe) {
  230. if (flush_update())
  231. return -1;
  232. }
  233. fn = (struct nlmsghdr*)(G_filter.flushb + NLMSG_ALIGN(G_filter.flushp));
  234. memcpy(fn, n, n->nlmsg_len);
  235. fn->nlmsg_type = RTM_DELADDR;
  236. fn->nlmsg_flags = NLM_F_REQUEST;
  237. fn->nlmsg_seq = ++G_filter.rth->seq;
  238. G_filter.flushp = (((char*)fn) + n->nlmsg_len) - G_filter.flushb;
  239. G_filter.flushed = 1;
  240. return 0;
  241. }
  242. if (n->nlmsg_type == RTM_DELADDR)
  243. printf("Deleted ");
  244. if (G_filter.oneline)
  245. printf("%u: %s", ifa->ifa_index, ll_index_to_name(ifa->ifa_index));
  246. if (ifa->ifa_family == AF_INET)
  247. printf(" inet ");
  248. else if (ifa->ifa_family == AF_INET6)
  249. printf(" inet6 ");
  250. else
  251. printf(" family %d ", ifa->ifa_family);
  252. if (rta_tb[IFA_LOCAL]) {
  253. fputs(rt_addr_n2a(ifa->ifa_family,
  254. RTA_DATA(rta_tb[IFA_LOCAL]),
  255. abuf, sizeof(abuf)), stdout);
  256. if (rta_tb[IFA_ADDRESS] == NULL
  257. || memcmp(RTA_DATA(rta_tb[IFA_ADDRESS]), RTA_DATA(rta_tb[IFA_LOCAL]), 4) == 0
  258. ) {
  259. printf("/%d ", ifa->ifa_prefixlen);
  260. } else {
  261. printf(" peer %s/%d ",
  262. rt_addr_n2a(ifa->ifa_family,
  263. RTA_DATA(rta_tb[IFA_ADDRESS]),
  264. abuf, sizeof(abuf)),
  265. ifa->ifa_prefixlen);
  266. }
  267. }
  268. if (rta_tb[IFA_BROADCAST]) {
  269. printf("brd %s ",
  270. rt_addr_n2a(ifa->ifa_family,
  271. RTA_DATA(rta_tb[IFA_BROADCAST]),
  272. abuf, sizeof(abuf)));
  273. }
  274. if (rta_tb[IFA_ANYCAST]) {
  275. printf("any %s ",
  276. rt_addr_n2a(ifa->ifa_family,
  277. RTA_DATA(rta_tb[IFA_ANYCAST]),
  278. abuf, sizeof(abuf)));
  279. }
  280. printf("scope %s ", rtnl_rtscope_n2a(ifa->ifa_scope, b1));
  281. if (ifa->ifa_flags & IFA_F_SECONDARY) {
  282. ifa->ifa_flags &= ~IFA_F_SECONDARY;
  283. printf("secondary ");
  284. }
  285. if (ifa->ifa_flags & IFA_F_TENTATIVE) {
  286. ifa->ifa_flags &= ~IFA_F_TENTATIVE;
  287. printf("tentative ");
  288. }
  289. if (ifa->ifa_flags & IFA_F_DEPRECATED) {
  290. ifa->ifa_flags &= ~IFA_F_DEPRECATED;
  291. printf("deprecated ");
  292. }
  293. if (!(ifa->ifa_flags & IFA_F_PERMANENT)) {
  294. printf("dynamic ");
  295. } else
  296. ifa->ifa_flags &= ~IFA_F_PERMANENT;
  297. if (ifa->ifa_flags)
  298. printf("flags %02x ", ifa->ifa_flags);
  299. if (rta_tb[IFA_LABEL])
  300. fputs((char*)RTA_DATA(rta_tb[IFA_LABEL]), stdout);
  301. if (rta_tb[IFA_CACHEINFO]) {
  302. struct ifa_cacheinfo *ci = RTA_DATA(rta_tb[IFA_CACHEINFO]);
  303. char buf[128];
  304. bb_putchar(_SL_);
  305. if (ci->ifa_valid == 0xFFFFFFFFU)
  306. sprintf(buf, "valid_lft forever");
  307. else
  308. sprintf(buf, "valid_lft %dsec", ci->ifa_valid);
  309. if (ci->ifa_prefered == 0xFFFFFFFFU)
  310. sprintf(buf+strlen(buf), " preferred_lft forever");
  311. else
  312. sprintf(buf+strlen(buf), " preferred_lft %dsec", ci->ifa_prefered);
  313. printf(" %s", buf);
  314. }
  315. bb_putchar('\n');
  316. /*fflush_all();*/
  317. return 0;
  318. }
  319. struct nlmsg_list {
  320. struct nlmsg_list *next;
  321. struct nlmsghdr h;
  322. };
  323. static int print_selected_addrinfo(int ifindex, struct nlmsg_list *ainfo)
  324. {
  325. for (; ainfo; ainfo = ainfo->next) {
  326. struct nlmsghdr *n = &ainfo->h;
  327. struct ifaddrmsg *ifa = NLMSG_DATA(n);
  328. if (n->nlmsg_type != RTM_NEWADDR)
  329. continue;
  330. if (n->nlmsg_len < NLMSG_LENGTH(sizeof(ifa)))
  331. return -1;
  332. if (ifa->ifa_index != ifindex
  333. || (G_filter.family && G_filter.family != ifa->ifa_family)
  334. ) {
  335. continue;
  336. }
  337. print_addrinfo(NULL, n, NULL);
  338. }
  339. return 0;
  340. }
  341. static int FAST_FUNC store_nlmsg(const struct sockaddr_nl *who, struct nlmsghdr *n, void *arg)
  342. {
  343. struct nlmsg_list **linfo = (struct nlmsg_list**)arg;
  344. struct nlmsg_list *h;
  345. struct nlmsg_list **lp;
  346. h = xzalloc(n->nlmsg_len + sizeof(void*));
  347. memcpy(&h->h, n, n->nlmsg_len);
  348. /*h->next = NULL; - xzalloc did it */
  349. for (lp = linfo; *lp; lp = &(*lp)->next)
  350. continue;
  351. *lp = h;
  352. ll_remember_index(who, n, NULL);
  353. return 0;
  354. }
  355. static void ipaddr_reset_filter(int _oneline)
  356. {
  357. memset(&G_filter, 0, sizeof(G_filter));
  358. G_filter.oneline = _oneline;
  359. }
  360. /* Return value becomes exitcode. It's okay to not return at all */
  361. int ipaddr_list_or_flush(char **argv, int flush)
  362. {
  363. static const char option[] ALIGN1 = "to\0""scope\0""up\0""label\0""dev\0";
  364. struct nlmsg_list *linfo = NULL;
  365. struct nlmsg_list *ainfo = NULL;
  366. struct nlmsg_list *l;
  367. struct rtnl_handle rth;
  368. char *filter_dev = NULL;
  369. int no_link = 0;
  370. ipaddr_reset_filter(oneline);
  371. G_filter.showqueue = 1;
  372. if (G_filter.family == AF_UNSPEC)
  373. G_filter.family = preferred_family;
  374. if (flush) {
  375. if (!*argv) {
  376. bb_error_msg_and_die(bb_msg_requires_arg, "flush");
  377. }
  378. if (G_filter.family == AF_PACKET) {
  379. bb_error_msg_and_die("can't flush link addresses");
  380. }
  381. }
  382. while (*argv) {
  383. const int option_num = index_in_strings(option, *argv);
  384. switch (option_num) {
  385. case 0: /* to */
  386. NEXT_ARG();
  387. get_prefix(&G_filter.pfx, *argv, G_filter.family);
  388. if (G_filter.family == AF_UNSPEC) {
  389. G_filter.family = G_filter.pfx.family;
  390. }
  391. break;
  392. case 1: { /* scope */
  393. uint32_t scope = 0;
  394. NEXT_ARG();
  395. G_filter.scopemask = -1;
  396. if (rtnl_rtscope_a2n(&scope, *argv)) {
  397. if (strcmp(*argv, "all") != 0) {
  398. invarg(*argv, "scope");
  399. }
  400. scope = RT_SCOPE_NOWHERE;
  401. G_filter.scopemask = 0;
  402. }
  403. G_filter.scope = scope;
  404. break;
  405. }
  406. case 2: /* up */
  407. G_filter.up = 1;
  408. break;
  409. case 3: /* label */
  410. NEXT_ARG();
  411. G_filter.label = *argv;
  412. break;
  413. case 4: /* dev */
  414. NEXT_ARG();
  415. default:
  416. if (filter_dev) {
  417. duparg2("dev", *argv);
  418. }
  419. filter_dev = *argv;
  420. }
  421. argv++;
  422. }
  423. xrtnl_open(&rth);
  424. xrtnl_wilddump_request(&rth, preferred_family, RTM_GETLINK);
  425. xrtnl_dump_filter(&rth, store_nlmsg, &linfo);
  426. if (filter_dev) {
  427. G_filter.ifindex = xll_name_to_index(filter_dev);
  428. }
  429. if (flush) {
  430. char flushb[4096-512];
  431. G_filter.flushb = flushb;
  432. G_filter.flushp = 0;
  433. G_filter.flushe = sizeof(flushb);
  434. G_filter.rth = &rth;
  435. for (;;) {
  436. xrtnl_wilddump_request(&rth, G_filter.family, RTM_GETADDR);
  437. G_filter.flushed = 0;
  438. xrtnl_dump_filter(&rth, print_addrinfo, NULL);
  439. if (G_filter.flushed == 0) {
  440. return 0;
  441. }
  442. if (flush_update() < 0) {
  443. return 1;
  444. }
  445. }
  446. }
  447. if (G_filter.family != AF_PACKET) {
  448. xrtnl_wilddump_request(&rth, G_filter.family, RTM_GETADDR);
  449. xrtnl_dump_filter(&rth, store_nlmsg, &ainfo);
  450. }
  451. if (G_filter.family && G_filter.family != AF_PACKET) {
  452. struct nlmsg_list **lp;
  453. lp = &linfo;
  454. if (G_filter.oneline)
  455. no_link = 1;
  456. while ((l = *lp) != NULL) {
  457. int ok = 0;
  458. struct ifinfomsg *ifi = NLMSG_DATA(&l->h);
  459. struct nlmsg_list *a;
  460. for (a = ainfo; a; a = a->next) {
  461. struct nlmsghdr *n = &a->h;
  462. struct ifaddrmsg *ifa = NLMSG_DATA(n);
  463. if (ifa->ifa_index != ifi->ifi_index
  464. || (G_filter.family && G_filter.family != ifa->ifa_family)
  465. ) {
  466. continue;
  467. }
  468. if ((G_filter.scope ^ ifa->ifa_scope) & G_filter.scopemask)
  469. continue;
  470. if ((G_filter.flags ^ ifa->ifa_flags) & G_filter.flagmask)
  471. continue;
  472. if (G_filter.pfx.family || G_filter.label) {
  473. struct rtattr *tb[IFA_MAX+1];
  474. memset(tb, 0, sizeof(tb));
  475. parse_rtattr(tb, IFA_MAX, IFA_RTA(ifa), IFA_PAYLOAD(n));
  476. if (!tb[IFA_LOCAL])
  477. tb[IFA_LOCAL] = tb[IFA_ADDRESS];
  478. if (G_filter.pfx.family && tb[IFA_LOCAL]) {
  479. inet_prefix dst;
  480. memset(&dst, 0, sizeof(dst));
  481. dst.family = ifa->ifa_family;
  482. memcpy(&dst.data, RTA_DATA(tb[IFA_LOCAL]), RTA_PAYLOAD(tb[IFA_LOCAL]));
  483. if (inet_addr_match(&dst, &G_filter.pfx, G_filter.pfx.bitlen))
  484. continue;
  485. }
  486. if (G_filter.label) {
  487. SPRINT_BUF(b1);
  488. const char *label;
  489. if (tb[IFA_LABEL])
  490. label = RTA_DATA(tb[IFA_LABEL]);
  491. else
  492. label = ll_idx_n2a(ifa->ifa_index, b1);
  493. if (fnmatch(G_filter.label, label, 0) != 0)
  494. continue;
  495. }
  496. }
  497. ok = 1;
  498. break;
  499. }
  500. if (!ok)
  501. *lp = l->next;
  502. else
  503. lp = &l->next;
  504. }
  505. }
  506. for (l = linfo; l; l = l->next) {
  507. if (no_link || print_linkinfo(&l->h) == 0) {
  508. struct ifinfomsg *ifi = NLMSG_DATA(&l->h);
  509. if (G_filter.family != AF_PACKET)
  510. print_selected_addrinfo(ifi->ifi_index, ainfo);
  511. }
  512. }
  513. return 0;
  514. }
  515. static int default_scope(inet_prefix *lcl)
  516. {
  517. if (lcl->family == AF_INET) {
  518. if (lcl->bytelen >= 1 && *(uint8_t*)&lcl->data == 127)
  519. return RT_SCOPE_HOST;
  520. }
  521. return 0;
  522. }
  523. /* Return value becomes exitcode. It's okay to not return at all */
  524. static int ipaddr_modify(int cmd, char **argv)
  525. {
  526. static const char option[] ALIGN1 =
  527. "peer\0""remote\0""broadcast\0""brd\0"
  528. "anycast\0""scope\0""dev\0""label\0""local\0";
  529. struct rtnl_handle rth;
  530. struct {
  531. struct nlmsghdr n;
  532. struct ifaddrmsg ifa;
  533. char buf[256];
  534. } req;
  535. char *d = NULL;
  536. char *l = NULL;
  537. inet_prefix lcl;
  538. inet_prefix peer;
  539. int local_len = 0;
  540. int peer_len = 0;
  541. int brd_len = 0;
  542. int any_len = 0;
  543. bool scoped = 0;
  544. memset(&req, 0, sizeof(req));
  545. req.n.nlmsg_len = NLMSG_LENGTH(sizeof(struct ifaddrmsg));
  546. req.n.nlmsg_flags = NLM_F_REQUEST;
  547. req.n.nlmsg_type = cmd;
  548. req.ifa.ifa_family = preferred_family;
  549. while (*argv) {
  550. const int option_num = index_in_strings(option, *argv);
  551. switch (option_num) {
  552. case 0: /* peer */
  553. case 1: /* remote */
  554. NEXT_ARG();
  555. if (peer_len) {
  556. duparg("peer", *argv);
  557. }
  558. get_prefix(&peer, *argv, req.ifa.ifa_family);
  559. peer_len = peer.bytelen;
  560. if (req.ifa.ifa_family == AF_UNSPEC) {
  561. req.ifa.ifa_family = peer.family;
  562. }
  563. addattr_l(&req.n, sizeof(req), IFA_ADDRESS, &peer.data, peer.bytelen);
  564. req.ifa.ifa_prefixlen = peer.bitlen;
  565. break;
  566. case 2: /* broadcast */
  567. case 3: /* brd */
  568. {
  569. inet_prefix addr;
  570. NEXT_ARG();
  571. if (brd_len) {
  572. duparg("broadcast", *argv);
  573. }
  574. if (LONE_CHAR(*argv, '+')) {
  575. brd_len = -1;
  576. } else if (LONE_DASH(*argv)) {
  577. brd_len = -2;
  578. } else {
  579. get_addr(&addr, *argv, req.ifa.ifa_family);
  580. if (req.ifa.ifa_family == AF_UNSPEC)
  581. req.ifa.ifa_family = addr.family;
  582. addattr_l(&req.n, sizeof(req), IFA_BROADCAST, &addr.data, addr.bytelen);
  583. brd_len = addr.bytelen;
  584. }
  585. break;
  586. }
  587. case 4: /* anycast */
  588. {
  589. inet_prefix addr;
  590. NEXT_ARG();
  591. if (any_len) {
  592. duparg("anycast", *argv);
  593. }
  594. get_addr(&addr, *argv, req.ifa.ifa_family);
  595. if (req.ifa.ifa_family == AF_UNSPEC) {
  596. req.ifa.ifa_family = addr.family;
  597. }
  598. addattr_l(&req.n, sizeof(req), IFA_ANYCAST, &addr.data, addr.bytelen);
  599. any_len = addr.bytelen;
  600. break;
  601. }
  602. case 5: /* scope */
  603. {
  604. uint32_t scope = 0;
  605. NEXT_ARG();
  606. if (rtnl_rtscope_a2n(&scope, *argv)) {
  607. invarg(*argv, "scope");
  608. }
  609. req.ifa.ifa_scope = scope;
  610. scoped = 1;
  611. break;
  612. }
  613. case 6: /* dev */
  614. NEXT_ARG();
  615. d = *argv;
  616. break;
  617. case 7: /* label */
  618. NEXT_ARG();
  619. l = *argv;
  620. addattr_l(&req.n, sizeof(req), IFA_LABEL, l, strlen(l)+1);
  621. break;
  622. case 8: /* local */
  623. NEXT_ARG();
  624. default:
  625. if (local_len) {
  626. duparg2("local", *argv);
  627. }
  628. get_prefix(&lcl, *argv, req.ifa.ifa_family);
  629. if (req.ifa.ifa_family == AF_UNSPEC) {
  630. req.ifa.ifa_family = lcl.family;
  631. }
  632. addattr_l(&req.n, sizeof(req), IFA_LOCAL, &lcl.data, lcl.bytelen);
  633. local_len = lcl.bytelen;
  634. }
  635. argv++;
  636. }
  637. if (d == NULL) {
  638. bb_error_msg(bb_msg_requires_arg, "\"dev\"");
  639. return -1;
  640. }
  641. if (l && strncmp(d, l, strlen(d)) != 0) {
  642. bb_error_msg_and_die("\"dev\" (%s) must match \"label\" (%s)", d, l);
  643. }
  644. if (peer_len == 0 && local_len && cmd != RTM_DELADDR) {
  645. peer = lcl;
  646. addattr_l(&req.n, sizeof(req), IFA_ADDRESS, &lcl.data, lcl.bytelen);
  647. }
  648. if (req.ifa.ifa_prefixlen == 0)
  649. req.ifa.ifa_prefixlen = lcl.bitlen;
  650. if (brd_len < 0 && cmd != RTM_DELADDR) {
  651. inet_prefix brd;
  652. int i;
  653. if (req.ifa.ifa_family != AF_INET) {
  654. bb_error_msg_and_die("broadcast can be set only for IPv4 addresses");
  655. }
  656. brd = peer;
  657. if (brd.bitlen <= 30) {
  658. for (i=31; i>=brd.bitlen; i--) {
  659. if (brd_len == -1)
  660. brd.data[0] |= htonl(1<<(31-i));
  661. else
  662. brd.data[0] &= ~htonl(1<<(31-i));
  663. }
  664. addattr_l(&req.n, sizeof(req), IFA_BROADCAST, &brd.data, brd.bytelen);
  665. brd_len = brd.bytelen;
  666. }
  667. }
  668. if (!scoped && cmd != RTM_DELADDR)
  669. req.ifa.ifa_scope = default_scope(&lcl);
  670. xrtnl_open(&rth);
  671. ll_init_map(&rth);
  672. req.ifa.ifa_index = xll_name_to_index(d);
  673. if (rtnl_talk(&rth, &req.n, 0, 0, NULL, NULL, NULL) < 0)
  674. return 2;
  675. return 0;
  676. }
  677. /* Return value becomes exitcode. It's okay to not return at all */
  678. int do_ipaddr(char **argv)
  679. {
  680. static const char commands[] ALIGN1 =
  681. "add\0""delete\0""list\0""show\0""lst\0""flush\0";
  682. int command_num = 2; /* default command is list */
  683. if (*argv) {
  684. command_num = index_in_substrings(commands, *argv);
  685. if (command_num < 0 || command_num > 5)
  686. bb_error_msg_and_die("unknown command %s", *argv);
  687. argv++;
  688. }
  689. if (command_num == 0) /* add */
  690. return ipaddr_modify(RTM_NEWADDR, argv);
  691. if (command_num == 1) /* delete */
  692. return ipaddr_modify(RTM_DELADDR, argv);
  693. if (command_num == 5) /* flush */
  694. return ipaddr_list_or_flush(argv, 1);
  695. /* 2 == list, 3 == show, 4 == lst */
  696. return ipaddr_list_or_flush(argv, 0);
  697. }