From d94c726a586a05d4a4b16d06916aaa02296daadb Mon Sep 17 00:00:00 2001 From: John Crispin Date: Mon, 14 Aug 2017 14:21:26 +0200 Subject: [PATCH] import udevmand Signed-off-by: John Crispin --- CMakeLists.txt | 13 ++ COPYING | 502 +++++++++++++++++++++++++++++++++++++++++++++ blob.c | 69 +++++++ bridge.c | 189 +++++++++++++++++ dhcp.c | 139 +++++++++++++ ethers.c | 36 ++++ mac.c | 134 ++++++++++++ main.c | 33 +++ neigh.c | 172 ++++++++++++++++ netdev.c | 183 +++++++++++++++++ netifd.c | 106 ++++++++++ netlink.c | 113 ++++++++++ nl80211.c | 545 +++++++++++++++++++++++++++++++++++++++++++++++++ ubus.c | 236 +++++++++++++++++++++ udevmand.h | 171 ++++++++++++++++ 15 files changed, 2641 insertions(+) create mode 100644 CMakeLists.txt create mode 100644 COPYING create mode 100644 blob.c create mode 100644 bridge.c create mode 100644 dhcp.c create mode 100644 ethers.c create mode 100644 mac.c create mode 100644 main.c create mode 100644 neigh.c create mode 100644 netdev.c create mode 100644 netifd.c create mode 100644 netlink.c create mode 100644 nl80211.c create mode 100644 ubus.c create mode 100644 udevmand.h diff --git a/CMakeLists.txt b/CMakeLists.txt new file mode 100644 index 0000000..41a722f --- /dev/null +++ b/CMakeLists.txt @@ -0,0 +1,13 @@ +cmake_minimum_required(VERSION 2.6) + +PROJECT(udevmand C) +INCLUDE(GNUInstallDirs) +ADD_DEFINITIONS(-Os -ggdb -Wall -Werror --std=gnu99 -Wmissing-declarations) + +SET(CMAKE_SHARED_LIBRARY_LINK_C_FLAGS "") + +ADD_EXECUTABLE(udevmand main.c mac.c neigh.c ubus.c nl80211.c blob.c netlink.c bridge.c dhcp.c netifd.c ethers.c netdev.c) +TARGET_LINK_LIBRARIES(udevmand ubox ubus json-c blobmsg_json nl-tiny uci) +INSTALL(TARGETS udevmand + RUNTIME DESTINATION ${CMAKE_INSTALL_SBINDIR} +) diff --git a/COPYING b/COPYING new file mode 100644 index 0000000..4362b49 --- /dev/null +++ b/COPYING @@ -0,0 +1,502 @@ + GNU LESSER GENERAL PUBLIC LICENSE + Version 2.1, February 1999 + + Copyright (C) 1991, 1999 Free Software Foundation, Inc. + 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + +[This is the first released version of the Lesser GPL. It also counts + as the successor of the GNU Library Public License, version 2, hence + the version number 2.1.] + + Preamble + + The licenses for most software are designed to take away your +freedom to share and change it. By contrast, the GNU General Public +Licenses are intended to guarantee your freedom to share and change +free software--to make sure the software is free for all its users. + + This license, the Lesser General Public License, applies to some +specially designated software packages--typically libraries--of the +Free Software Foundation and other authors who decide to use it. You +can use it too, but we suggest you first think carefully about whether +this license or the ordinary General Public License is the better +strategy to use in any particular case, based on the explanations below. + + When we speak of free software, we are referring to freedom of use, +not price. Our General Public Licenses are designed to make sure that +you have the freedom to distribute copies of free software (and charge +for this service if you wish); that you receive source code or can get +it if you want it; that you can change the software and use pieces of +it in new free programs; and that you are informed that you can do +these things. + + To protect your rights, we need to make restrictions that forbid +distributors to deny you these rights or to ask you to surrender these +rights. These restrictions translate to certain responsibilities for +you if you distribute copies of the library or if you modify it. + + For example, if you distribute copies of the library, whether gratis +or for a fee, you must give the recipients all the rights that we gave +you. You must make sure that they, too, receive or can get the source +code. If you link other code with the library, you must provide +complete object files to the recipients, so that they can relink them +with the library after making changes to the library and recompiling +it. And you must show them these terms so they know their rights. + + We protect your rights with a two-step method: (1) we copyright the +library, and (2) we offer you this license, which gives you legal +permission to copy, distribute and/or modify the library. + + To protect each distributor, we want to make it very clear that +there is no warranty for the free library. Also, if the library is +modified by someone else and passed on, the recipients should know +that what they have is not the original version, so that the original +author's reputation will not be affected by problems that might be +introduced by others. + + Finally, software patents pose a constant threat to the existence of +any free program. We wish to make sure that a company cannot +effectively restrict the users of a free program by obtaining a +restrictive license from a patent holder. Therefore, we insist that +any patent license obtained for a version of the library must be +consistent with the full freedom of use specified in this license. + + Most GNU software, including some libraries, is covered by the +ordinary GNU General Public License. This license, the GNU Lesser +General Public License, applies to certain designated libraries, and +is quite different from the ordinary General Public License. We use +this license for certain libraries in order to permit linking those +libraries into non-free programs. + + When a program is linked with a library, whether statically or using +a shared library, the combination of the two is legally speaking a +combined work, a derivative of the original library. The ordinary +General Public License therefore permits such linking only if the +entire combination fits its criteria of freedom. The Lesser General +Public License permits more lax criteria for linking other code with +the library. + + We call this license the "Lesser" General Public License because it +does Less to protect the user's freedom than the ordinary General +Public License. It also provides other free software developers Less +of an advantage over competing non-free programs. These disadvantages +are the reason we use the ordinary General Public License for many +libraries. However, the Lesser license provides advantages in certain +special circumstances. + + For example, on rare occasions, there may be a special need to +encourage the widest possible use of a certain library, so that it becomes +a de-facto standard. To achieve this, non-free programs must be +allowed to use the library. A more frequent case is that a free +library does the same job as widely used non-free libraries. In this +case, there is little to gain by limiting the free library to free +software only, so we use the Lesser General Public License. + + In other cases, permission to use a particular library in non-free +programs enables a greater number of people to use a large body of +free software. For example, permission to use the GNU C Library in +non-free programs enables many more people to use the whole GNU +operating system, as well as its variant, the GNU/Linux operating +system. + + Although the Lesser General Public License is Less protective of the +users' freedom, it does ensure that the user of a program that is +linked with the Library has the freedom and the wherewithal to run +that program using a modified version of the Library. + + The precise terms and conditions for copying, distribution and +modification follow. Pay close attention to the difference between a +"work based on the library" and a "work that uses the library". The +former contains code derived from the library, whereas the latter must +be combined with the library in order to run. + + GNU LESSER GENERAL PUBLIC LICENSE + TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION + + 0. This License Agreement applies to any software library or other +program which contains a notice placed by the copyright holder or +other authorized party saying it may be distributed under the terms of +this Lesser General Public License (also called "this License"). +Each licensee is addressed as "you". + + A "library" means a collection of software functions and/or data +prepared so as to be conveniently linked with application programs +(which use some of those functions and data) to form executables. + + The "Library", below, refers to any such software library or work +which has been distributed under these terms. A "work based on the +Library" means either the Library or any derivative work under +copyright law: that is to say, a work containing the Library or a +portion of it, either verbatim or with modifications and/or translated +straightforwardly into another language. (Hereinafter, translation is +included without limitation in the term "modification".) + + "Source code" for a work means the preferred form of the work for +making modifications to it. For a library, complete source code means +all the source code for all modules it contains, plus any associated +interface definition files, plus the scripts used to control compilation +and installation of the library. + + Activities other than copying, distribution and modification are not +covered by this License; they are outside its scope. The act of +running a program using the Library is not restricted, and output from +such a program is covered only if its contents constitute a work based +on the Library (independent of the use of the Library in a tool for +writing it). Whether that is true depends on what the Library does +and what the program that uses the Library does. + + 1. You may copy and distribute verbatim copies of the Library's +complete source code as you receive it, in any medium, provided that +you conspicuously and appropriately publish on each copy an +appropriate copyright notice and disclaimer of warranty; keep intact +all the notices that refer to this License and to the absence of any +warranty; and distribute a copy of this License along with the +Library. + + You may charge a fee for the physical act of transferring a copy, +and you may at your option offer warranty protection in exchange for a +fee. + + 2. You may modify your copy or copies of the Library or any portion +of it, thus forming a work based on the Library, and copy and +distribute such modifications or work under the terms of Section 1 +above, provided that you also meet all of these conditions: + + a) The modified work must itself be a software library. + + b) You must cause the files modified to carry prominent notices + stating that you changed the files and the date of any change. + + c) You must cause the whole of the work to be licensed at no + charge to all third parties under the terms of this License. + + d) If a facility in the modified Library refers to a function or a + table of data to be supplied by an application program that uses + the facility, other than as an argument passed when the facility + is invoked, then you must make a good faith effort to ensure that, + in the event an application does not supply such function or + table, the facility still operates, and performs whatever part of + its purpose remains meaningful. + + (For example, a function in a library to compute square roots has + a purpose that is entirely well-defined independent of the + application. Therefore, Subsection 2d requires that any + application-supplied function or table used by this function must + be optional: if the application does not supply it, the square + root function must still compute square roots.) + +These requirements apply to the modified work as a whole. If +identifiable sections of that work are not derived from the Library, +and can be reasonably considered independent and separate works in +themselves, then this License, and its terms, do not apply to those +sections when you distribute them as separate works. But when you +distribute the same sections as part of a whole which is a work based +on the Library, the distribution of the whole must be on the terms of +this License, whose permissions for other licensees extend to the +entire whole, and thus to each and every part regardless of who wrote +it. + +Thus, it is not the intent of this section to claim rights or contest +your rights to work written entirely by you; rather, the intent is to +exercise the right to control the distribution of derivative or +collective works based on the Library. + +In addition, mere aggregation of another work not based on the Library +with the Library (or with a work based on the Library) on a volume of +a storage or distribution medium does not bring the other work under +the scope of this License. + + 3. You may opt to apply the terms of the ordinary GNU General Public +License instead of this License to a given copy of the Library. To do +this, you must alter all the notices that refer to this License, so +that they refer to the ordinary GNU General Public License, version 2, +instead of to this License. (If a newer version than version 2 of the +ordinary GNU General Public License has appeared, then you can specify +that version instead if you wish.) Do not make any other change in +these notices. + + Once this change is made in a given copy, it is irreversible for +that copy, so the ordinary GNU General Public License applies to all +subsequent copies and derivative works made from that copy. + + This option is useful when you wish to copy part of the code of +the Library into a program that is not a library. + + 4. You may copy and distribute the Library (or a portion or +derivative of it, under Section 2) in object code or executable form +under the terms of Sections 1 and 2 above provided that you accompany +it with the complete corresponding machine-readable source code, which +must be distributed under the terms of Sections 1 and 2 above on a +medium customarily used for software interchange. + + If distribution of object code is made by offering access to copy +from a designated place, then offering equivalent access to copy the +source code from the same place satisfies the requirement to +distribute the source code, even though third parties are not +compelled to copy the source along with the object code. + + 5. A program that contains no derivative of any portion of the +Library, but is designed to work with the Library by being compiled or +linked with it, is called a "work that uses the Library". Such a +work, in isolation, is not a derivative work of the Library, and +therefore falls outside the scope of this License. + + However, linking a "work that uses the Library" with the Library +creates an executable that is a derivative of the Library (because it +contains portions of the Library), rather than a "work that uses the +library". The executable is therefore covered by this License. +Section 6 states terms for distribution of such executables. + + When a "work that uses the Library" uses material from a header file +that is part of the Library, the object code for the work may be a +derivative work of the Library even though the source code is not. +Whether this is true is especially significant if the work can be +linked without the Library, or if the work is itself a library. The +threshold for this to be true is not precisely defined by law. + + If such an object file uses only numerical parameters, data +structure layouts and accessors, and small macros and small inline +functions (ten lines or less in length), then the use of the object +file is unrestricted, regardless of whether it is legally a derivative +work. (Executables containing this object code plus portions of the +Library will still fall under Section 6.) + + Otherwise, if the work is a derivative of the Library, you may +distribute the object code for the work under the terms of Section 6. +Any executables containing that work also fall under Section 6, +whether or not they are linked directly with the Library itself. + + 6. As an exception to the Sections above, you may also combine or +link a "work that uses the Library" with the Library to produce a +work containing portions of the Library, and distribute that work +under terms of your choice, provided that the terms permit +modification of the work for the customer's own use and reverse +engineering for debugging such modifications. + + You must give prominent notice with each copy of the work that the +Library is used in it and that the Library and its use are covered by +this License. You must supply a copy of this License. If the work +during execution displays copyright notices, you must include the +copyright notice for the Library among them, as well as a reference +directing the user to the copy of this License. Also, you must do one +of these things: + + a) Accompany the work with the complete corresponding + machine-readable source code for the Library including whatever + changes were used in the work (which must be distributed under + Sections 1 and 2 above); and, if the work is an executable linked + with the Library, with the complete machine-readable "work that + uses the Library", as object code and/or source code, so that the + user can modify the Library and then relink to produce a modified + executable containing the modified Library. (It is understood + that the user who changes the contents of definitions files in the + Library will not necessarily be able to recompile the application + to use the modified definitions.) + + b) Use a suitable shared library mechanism for linking with the + Library. A suitable mechanism is one that (1) uses at run time a + copy of the library already present on the user's computer system, + rather than copying library functions into the executable, and (2) + will operate properly with a modified version of the library, if + the user installs one, as long as the modified version is + interface-compatible with the version that the work was made with. + + c) Accompany the work with a written offer, valid for at + least three years, to give the same user the materials + specified in Subsection 6a, above, for a charge no more + than the cost of performing this distribution. + + d) If distribution of the work is made by offering access to copy + from a designated place, offer equivalent access to copy the above + specified materials from the same place. + + e) Verify that the user has already received a copy of these + materials or that you have already sent this user a copy. + + For an executable, the required form of the "work that uses the +Library" must include any data and utility programs needed for +reproducing the executable from it. However, as a special exception, +the materials to be distributed need not include anything that is +normally distributed (in either source or binary form) with the major +components (compiler, kernel, and so on) of the operating system on +which the executable runs, unless that component itself accompanies +the executable. + + It may happen that this requirement contradicts the license +restrictions of other proprietary libraries that do not normally +accompany the operating system. Such a contradiction means you cannot +use both them and the Library together in an executable that you +distribute. + + 7. You may place library facilities that are a work based on the +Library side-by-side in a single library together with other library +facilities not covered by this License, and distribute such a combined +library, provided that the separate distribution of the work based on +the Library and of the other library facilities is otherwise +permitted, and provided that you do these two things: + + a) Accompany the combined library with a copy of the same work + based on the Library, uncombined with any other library + facilities. This must be distributed under the terms of the + Sections above. + + b) Give prominent notice with the combined library of the fact + that part of it is a work based on the Library, and explaining + where to find the accompanying uncombined form of the same work. + + 8. You may not copy, modify, sublicense, link with, or distribute +the Library except as expressly provided under this License. Any +attempt otherwise to copy, modify, sublicense, link with, or +distribute the Library is void, and will automatically terminate your +rights under this License. However, parties who have received copies, +or rights, from you under this License will not have their licenses +terminated so long as such parties remain in full compliance. + + 9. You are not required to accept this License, since you have not +signed it. However, nothing else grants you permission to modify or +distribute the Library or its derivative works. These actions are +prohibited by law if you do not accept this License. Therefore, by +modifying or distributing the Library (or any work based on the +Library), you indicate your acceptance of this License to do so, and +all its terms and conditions for copying, distributing or modifying +the Library or works based on it. + + 10. Each time you redistribute the Library (or any work based on the +Library), the recipient automatically receives a license from the +original licensor to copy, distribute, link with or modify the Library +subject to these terms and conditions. You may not impose any further +restrictions on the recipients' exercise of the rights granted herein. +You are not responsible for enforcing compliance by third parties with +this License. + + 11. If, as a consequence of a court judgment or allegation of patent +infringement or for any other reason (not limited to patent issues), +conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot +distribute so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you +may not distribute the Library at all. For example, if a patent +license would not permit royalty-free redistribution of the Library by +all those who receive copies directly or indirectly through you, then +the only way you could satisfy both it and this License would be to +refrain entirely from distribution of the Library. + +If any portion of this section is held invalid or unenforceable under any +particular circumstance, the balance of the section is intended to apply, +and the section as a whole is intended to apply in other circumstances. + +It is not the purpose of this section to induce you to infringe any +patents or other property right claims or to contest validity of any +such claims; this section has the sole purpose of protecting the +integrity of the free software distribution system which is +implemented by public license practices. Many people have made +generous contributions to the wide range of software distributed +through that system in reliance on consistent application of that +system; it is up to the author/donor to decide if he or she is willing +to distribute software through any other system and a licensee cannot +impose that choice. + +This section is intended to make thoroughly clear what is believed to +be a consequence of the rest of this License. + + 12. If the distribution and/or use of the Library is restricted in +certain countries either by patents or by copyrighted interfaces, the +original copyright holder who places the Library under this License may add +an explicit geographical distribution limitation excluding those countries, +so that distribution is permitted only in or among countries not thus +excluded. In such case, this License incorporates the limitation as if +written in the body of this License. + + 13. The Free Software Foundation may publish revised and/or new +versions of the Lesser General Public License from time to time. +Such new versions will be similar in spirit to the present version, +but may differ in detail to address new problems or concerns. + +Each version is given a distinguishing version number. If the Library +specifies a version number of this License which applies to it and +"any later version", you have the option of following the terms and +conditions either of that version or of any later version published by +the Free Software Foundation. If the Library does not specify a +license version number, you may choose any version ever published by +the Free Software Foundation. + + 14. If you wish to incorporate parts of the Library into other free +programs whose distribution conditions are incompatible with these, +write to the author to ask for permission. For software which is +copyrighted by the Free Software Foundation, write to the Free +Software Foundation; we sometimes make exceptions for this. Our +decision will be guided by the two goals of preserving the free status +of all derivatives of our free software and of promoting the sharing +and reuse of software generally. + + NO WARRANTY + + 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO +WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. +EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR +OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY +KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE +IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE +LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME +THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + + 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN +WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY +AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU +FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR +CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE +LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING +RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A +FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF +SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH +DAMAGES. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Libraries + + If you develop a new library, and you want it to be of the greatest +possible use to the public, we recommend making it free software that +everyone can redistribute and change. You can do so by permitting +redistribution under these terms (or, alternatively, under the terms of the +ordinary General Public License). + + To apply these terms, attach the following notices to the library. It is +safest to attach them to the start of each source file to most effectively +convey the exclusion of warranty; and each file should have at least the +"copyright" line and a pointer to where the full notice is found. + + + Copyright (C) + + This library is free software; you can redistribute it and/or + modify it under the terms of the GNU Lesser General Public + License as published by the Free Software Foundation; either + version 2.1 of the License, or (at your option) any later version. + + This library is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + Lesser General Public License for more details. + + You should have received a copy of the GNU Lesser General Public + License along with this library; if not, write to the Free Software + Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA + +Also add information on how to contact you by electronic and paper mail. + +You should also get your employer (if you work as a programmer) or your +school, if any, to sign a "copyright disclaimer" for the library, if +necessary. Here is a sample; alter the names: + + Yoyodyne, Inc., hereby disclaims all copyright interest in the + library `Frob' (a library for tweaking knobs) written by James Random Hacker. + + , 1 April 1990 + Ty Coon, President of Vice + +That's all there is to it! diff --git a/blob.c b/blob.c new file mode 100644 index 0000000..12ada9c --- /dev/null +++ b/blob.c @@ -0,0 +1,69 @@ +/* + * Copyright (C) 2017 John Crispin + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of the GNU Lesser General Public License version 2.1 + * as published by the Free Software Foundation + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + */ + +#include "udevmand.h" + +struct blob_buf b = { 0 }; + +static char *iftype_string[NUM_NL80211_IFTYPES] = { + [NL80211_IFTYPE_STATION] = "station", + [NL80211_IFTYPE_AP] = "ap", + [NL80211_IFTYPE_MONITOR] = "monitor", + [NL80211_IFTYPE_ADHOC] = "adhoc", +}; + +void blobmsg_add_iface(struct blob_buf *bbuf, char *name, int index) +{ + static char _ifname[IF_NAMESIZE]; + char *ifname = if_indextoname(index, _ifname); + + if (!ifname) + return; + blobmsg_add_string(&b, name, ifname); +} + +void blobmsg_add_iftype(struct blob_buf *bbuf, const char *name, const uint32_t iftype) +{ + if (iftype_string[iftype]) + blobmsg_add_string(&b, name, iftype_string[iftype]); + else + blobmsg_add_u32(&b, name, iftype); +} + +void blobmsg_add_ipv4(struct blob_buf *bbuf, const char *name, const uint8_t* addr) +{ + char ip[16]; + + snprintf(ip, sizeof(ip), "%d.%d.%d.%d", addr[0], addr[1], addr[2], addr[3]); + blobmsg_add_string(&b, name, ip); +} + +void blobmsg_add_ipv6(struct blob_buf *bbuf, const char *name, const uint8_t* _addr) +{ + const uint16_t* addr = (const uint16_t*) _addr; + char ip[40]; + + snprintf(ip, sizeof(ip), "%x:%x:%x:%x:%x:%x:%x:%x", + ntohs(addr[0]), ntohs(addr[1]), ntohs(addr[2]), ntohs(addr[3]), + ntohs(addr[4]), ntohs(addr[5]), ntohs(addr[6]), ntohs(addr[7])); + blobmsg_add_string(&b, name, ip); +} + +void blobmsg_add_mac(struct blob_buf *bbuf, const char *name, const uint8_t* addr) +{ + char mac[18]; + + snprintf(mac, sizeof(mac), "%02x:%02x:%02x:%02x:%02x:%02x", + addr[0], addr[1], addr[2], addr[3], addr[4], addr[5]); + blobmsg_add_string(&b, name, mac); +} diff --git a/bridge.c b/bridge.c new file mode 100644 index 0000000..e00ffd7 --- /dev/null +++ b/bridge.c @@ -0,0 +1,189 @@ +/* + * Copyright (C) 2020 John Crispin + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of the GNU Lesser General Public License version 2.1 + * as published by the Free Software Foundation + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + */ + +#include "udevmand.h" + +#include + +#define BR_MAX_ENTRY 2048 + +static struct uloop_timeout bridge_timer; +static struct vlist_tree bridge_mac; +static LIST_HEAD(bridge_if); + +struct bridge_if { + struct list_head list; + + char name[IF_NAMESIZE]; + unsigned int port_no; +}; + +static void +bridge_read_mac(const char *bridge) +{ + FILE *fd; + int i, cnt; + struct __fdb_entry fe[BR_MAX_ENTRY]; + char path[PATH_MAX]; + + snprintf(path, PATH_MAX, "/sys/class/net/%s/brforward", bridge); + fd = fopen(path, "r"); + if (!fd) + return; + + cnt = fread(fe, sizeof(struct __fdb_entry), BR_MAX_ENTRY, fd); + fclose(fd); + + for (i = 0; i < cnt; i++) { + struct bridge_mac *b = malloc(sizeof(*b)); + struct bridge_if *brif; + + if (!b) + continue; + strncpy(b->bridge, bridge, IF_NAMESIZE); + strncpy(b->ifname, bridge, IF_NAMESIZE); + list_for_each_entry(brif, &bridge_if, list) + if (fe[i].port_no == brif->port_no) + strncpy(b->ifname, brif->name, IF_NAMESIZE); + memcpy(b->addr, fe[i].mac_addr, ETH_ALEN); + b->port_no = fe[i].port_no; + vlist_add(&bridge_mac, &b->vlist, (void *) b); + } +} + +void +bridge_dump_if(const char *bridge) +{ + char path[PATH_MAX]; + void *c = NULL; + glob_t gl; + int i; + + snprintf(path, PATH_MAX, "/sys/class/net/%s/brif/*", bridge); + if (glob(path, GLOB_MARK | GLOB_ONLYDIR | GLOB_NOSORT, NULL, &gl)) + return; + + for (i = 0; i < gl.gl_pathc; i++) { + if (!c) + c = blobmsg_open_array(&b, "bridge"); + + blobmsg_add_string(&b, NULL, basename(gl.gl_pathv[i])); + } + if (c) + blobmsg_close_array(&b, c); +} + +static void +bridge_read_if(const char *bridge) +{ + struct bridge_if *brif; + char path[PATH_MAX]; + glob_t gl; + int i; + + snprintf(path, PATH_MAX, "/sys/class/net/%s/brif/*", bridge); + if (glob(path, GLOB_MARK | GLOB_ONLYDIR | GLOB_NOSORT, NULL, &gl)) + return; + + for (i = 0; i < gl.gl_pathc; i++) { + unsigned int port_no; + FILE *fd; + int ret; + + snprintf(path, PATH_MAX, "/sys/class/net/%s/brif/%s/port_no", bridge, basename(gl.gl_pathv[i])); + fd = fopen(path, "r"); + if (!fd) + continue; + ret = fscanf(fd, "0x%x", &port_no); + fclose(fd); + if (ret != 1) + continue; + brif = malloc(sizeof(*brif)); + if (!brif) + return; + strcpy(brif->name, basename(gl.gl_pathv[i])); + brif->port_no = port_no; + list_add(&brif->list, &bridge_if); + + } + globfree(&gl); + +} + +static void bridge_tout(struct uloop_timeout *t) +{ + struct bridge_if *brif, *tmp; + glob_t gl; + + int i; + + if (glob("/sys/class/net/*", GLOB_MARK | GLOB_ONLYDIR | GLOB_NOSORT, NULL, &gl)) + return; + + list_for_each_entry_safe(brif, tmp, &bridge_if, list) { + list_del(&brif->list); + free(brif); + } + + for (i = 0; i < gl.gl_pathc; i++) + bridge_read_if(basename(gl.gl_pathv[i])); + vlist_update(&bridge_mac); + for (i = 0; i < gl.gl_pathc; i++) + bridge_read_mac(basename(gl.gl_pathv[i])); + vlist_flush(&bridge_mac); + globfree(&gl); + + uloop_timeout_set(&bridge_timer, 1000); +} + +static int bridge_cmp(const void *k1, const void *k2, void *ptr) +{ + const struct bridge_mac *b1 = (const struct bridge_mac *)k1; + const struct bridge_mac *b2 = (const struct bridge_mac *)k2; + + return memcmp(b1->addr, b2->addr, ETH_ALEN); +} + +static void bridge_update(struct vlist_tree *tree, struct vlist_node *node_new, struct vlist_node *node_old) +{ + struct bridge_mac *b1, *b2; + + b1 = container_of(node_old, struct bridge_mac, vlist); + b2 = container_of(node_new, struct bridge_mac, vlist); + + if (!!b1 != !!b2) { + struct bridge_mac *_b = b1 ? b1 : b2; + + ULOG_INFO("%s fdb %s:%d "MAC_FMT"\n", b1 ? "del" : "new", _b->ifname, _b->port_no, MAC_VAR(_b->addr)); + } + + if (b1) { + list_del(&b1->mac); + free(b1); + } + + if (b2) { + struct mac *mac = NULL; + + mac = mac_find(b2->addr); + mac_update(mac, b2->bridge); + list_add(&b2->mac, &mac->bridge_mac); + } +} + +void bridge_init(void) +{ + bridge_timer.cb = bridge_tout; + uloop_timeout_set(&bridge_timer, 1000); + vlist_init(&bridge_mac, bridge_cmp, bridge_update); +} diff --git a/dhcp.c b/dhcp.c new file mode 100644 index 0000000..829b2ac --- /dev/null +++ b/dhcp.c @@ -0,0 +1,139 @@ +#include "udevmand.h" + +enum { + DHCP_MAC, + DHCP_IP, + DHCP_NAME, + DHCP_IFACE, + __DHCP_MAX +}; + +static const struct blobmsg_policy dhcp_policy[__DHCP_MAX] = { + [DHCP_MAC] = { .name = "mac", .type = BLOBMSG_TYPE_STRING }, + [DHCP_IP] = { .name = "ip", .type = BLOBMSG_TYPE_STRING }, + [DHCP_NAME] = { .name = "name", .type = BLOBMSG_TYPE_STRING }, + [DHCP_IFACE] = { .name = "interface", .type = BLOBMSG_TYPE_STRING }, +}; + +static struct avl_tree dhcpv4_tree = AVL_TREE_INIT(dhcpv4_tree, avl_mac_cmp, false, NULL); + +static void +dhcpv4_add(uint8_t *addr, uint8_t *ip, char *name, char *iface) +{ + struct dhcpv4 *dhcpv4; + struct mac *mac; + + mac = mac_find(addr); + + dhcpv4 = avl_find_element(&dhcpv4_tree, addr, dhcpv4, avl); + if (dhcpv4) { + list_del(&dhcpv4->mac); + avl_delete(&dhcpv4_tree, &dhcpv4->avl); + free(dhcpv4); + } + + dhcpv4 = malloc(sizeof(*dhcpv4) + (name ? strlen(name) + 1 : 1)); + if (!dhcpv4) + return; + if (iface) + strncpy(dhcpv4->iface, iface, sizeof(dhcpv4->iface)); + else + *dhcpv4->iface = '\0'; + if (name) + strcpy(dhcpv4->name, name); + else + *dhcpv4->name = '\0'; + memcpy(dhcpv4->ip, ip, 4); + memcpy(dhcpv4->addr, addr, ETH_ALEN); + dhcpv4->avl.key = dhcpv4->addr; + + avl_insert(&dhcpv4_tree, &dhcpv4->avl); + list_add(&dhcpv4->mac, &mac->dhcpv4); + mac_update(mac, dhcpv4->iface); + ULOG_INFO("new dhcpv4 " MAC_FMT "/" IP_FMT " for %s\n", + MAC_VAR(dhcpv4->addr), IP_VAR(ip), + strlen(dhcpv4->name) ? dhcpv4->name : ""); +} + +void +dhcpv4_ack(struct blob_attr *msg) +{ + struct blob_attr *tb[__DHCP_MAX]; + uint8_t addr[ETH_ALEN], ip[4]; + char *name = NULL; + int ret; + + blobmsg_parse(dhcp_policy, __DHCP_MAX, tb, blob_data(msg), blob_len(msg)); + + if (!tb[DHCP_MAC] || !tb[DHCP_IP] || !tb[DHCP_IFACE]) + return; + + ret = sscanf(blobmsg_get_string(tb[DHCP_MAC]), "%02hhx:%02hhx:%02hhx:%02hhx:%02hhx:%02hhx", + &addr[0], &addr[1], &addr[2], &addr[3], &addr[4], &addr[5]); + if (ret != 6) + return; + + ret = sscanf(blobmsg_get_string(tb[DHCP_IP]), "%hhu.%hhu.%hhu.%hhu", + &ip[0], &ip[1], &ip[2], &ip[3]); + if (ret != 4) + return; + + if (tb[DHCP_NAME]) + name = blobmsg_get_string(tb[DHCP_NAME]); + + dhcpv4_add(addr, ip, name, blobmsg_get_string(tb[DHCP_IFACE])); +} + +void +dhcpv4_release(struct blob_attr *msg) +{ + struct blob_attr *tb[__DHCP_MAX]; + struct dhcpv4 *dhcpv4; + uint8_t addr[ETH_ALEN]; + int ret; + + blobmsg_parse(dhcp_policy, __DHCP_MAX, tb, blob_data(msg), blob_len(msg)); + + if (!tb[DHCP_MAC]) + return; + + ret = sscanf(blobmsg_get_string(tb[DHCP_MAC]), "%02hhx:%02hhx:%02hhx:%02hhx:%02hhx:%02hhx", + &addr[0], &addr[1], &addr[2], &addr[3], &addr[4], &addr[5]); + if (ret != 6) + return; + + dhcpv4 = avl_find_element(&dhcpv4_tree, addr, dhcpv4, avl); + if (!dhcpv4) + return; + ULOG_INFO("del dhcpv4 " MAC_FMT "\n", MAC_VAR(dhcpv4->addr)); + list_del(&dhcpv4->mac); + avl_delete(&dhcpv4_tree, &dhcpv4->avl); + free(dhcpv4); +} + +void +dhcp_init(void) +{ + FILE *fp = fopen("/tmp/dhcp.leases", "r"); + char line[1024]; + + if (!fp) + return; + + while (fgets(line, sizeof(line), fp)) { + uint8_t addr[ETH_ALEN], ip[4]; + char hostname[256 + 1]; + long int timestamp; + int ret; + + ret = sscanf(line, "%ld %02hhx:%02hhx:%02hhx:%02hhx:%02hhx:%02hhx %hhu.%hhu.%hhu.%hhu %s", + ×tamp, + &addr[0], &addr[1], &addr[2], &addr[3], &addr[4], &addr[5], + &ip[0], &ip[1], &ip[2], &ip[3], + hostname); + if (ret != 12) + continue; + + dhcpv4_add(addr, ip, hostname, NULL); + } +} diff --git a/ethers.c b/ethers.c new file mode 100644 index 0000000..42d6439 --- /dev/null +++ b/ethers.c @@ -0,0 +1,36 @@ +#include "udevmand.h" + +void +ethers_init(void) +{ + char buf[512], *p; + int ret; + FILE *f; + + f = fopen("/etc/ethers", "r"); + + if (!f) + return; + + while (fgets(buf, sizeof(buf), f)) { + uint8_t addr[ETH_ALEN]; + struct mac *mac; + + p = strtok(buf, " \t\n"); + ret = sscanf(p, "%02hhx:%02hhx:%02hhx:%02hhx:%02hhx:%02hhx", + &addr[0], &addr[1], &addr[2], &addr[3], &addr[4], &addr[5]); + if (ret != 6) + continue; + + p = strtok(NULL, " \t\n"); + + if (!p) + continue; + mac = mac_find(addr); + mac->ethers = strdup(p); + ULOG_INFO("new ethers " MAC_FMT" %s\n", MAC_VAR(addr), p); + } + + fclose(f); +} + diff --git a/mac.c b/mac.c new file mode 100644 index 0000000..d6b5bd4 --- /dev/null +++ b/mac.c @@ -0,0 +1,134 @@ +#include "udevmand.h" + +int +avl_mac_cmp(const void *k1, const void *k2, void *ptr) +{ + return memcmp(k1, k2, ETH_ALEN); +} + +struct avl_tree mac_tree = AVL_TREE_INIT(mac_tree, avl_mac_cmp, false, NULL); + +struct mac* +mac_find(uint8_t *addr) +{ + struct mac *mac; + uint8_t *addr_buf; + + mac = avl_find_element(&mac_tree, addr, mac, avl); + + if (mac) + return mac; + + mac = calloc_a(sizeof(struct mac), &addr_buf, 6); + if (!mac) + return NULL; + mac->addr = memcpy(addr_buf, addr, ETH_ALEN); + mac->avl.key = mac->addr; + mac->ethers = NULL; + *mac->interface = '\0'; + INIT_LIST_HEAD(&mac->neigh4); + INIT_LIST_HEAD(&mac->neigh6); + INIT_LIST_HEAD(&mac->wifi); + INIT_LIST_HEAD(&mac->dhcpv4); + INIT_LIST_HEAD(&mac->bridge_mac); + + avl_insert(&mac_tree, &mac->avl); + ULOG_INFO("new mac "MAC_FMT"\n", MAC_VAR(mac->addr)); + + return mac; +} + +void +mac_update(struct mac *mac, char *iface) +{ + char *interface = interface_resolve(iface); + + if (iface && *iface) + strncpy(mac->interface, interface, sizeof(mac->interface)); + + clock_gettime(CLOCK_MONOTONIC, &mac->ts); +} + +void +mac_dump(struct mac *mac, int interface) +{ + struct timespec ts; + time_t last_seen; + char buf[18]; + void *c, *d; + + clock_gettime(CLOCK_MONOTONIC, &ts); + + last_seen = ts.tv_sec - mac->ts.tv_sec; + snprintf(buf, sizeof(buf), MAC_FMT, MAC_VAR(mac->addr)); + c = blobmsg_open_table(&b, buf); + if (interface && *mac->interface) + blobmsg_add_string(&b, "interface", mac->interface); + if (mac->ethers) + blobmsg_add_string(&b, "ethers", mac->ethers); + if (last_seen < 5 * 60) + blobmsg_add_u32(&b, "last_seen", last_seen); + else + blobmsg_add_u8(&b, "offline", 1); + if (!list_empty(&mac->neigh4)) { + struct neigh *neigh; + + d = blobmsg_open_array(&b, "ipv4"); + list_for_each_entry(neigh, &mac->neigh4, list) + blobmsg_add_ipv4(&b, NULL, neigh->ip); + blobmsg_close_array(&b, d); + } + + if (!list_empty(&mac->neigh6)) { + struct neigh *neigh; + + d = blobmsg_open_array(&b, "ipv6"); + list_for_each_entry(neigh, &mac->neigh6, list) + blobmsg_add_ipv6(&b, NULL, neigh->ip); + blobmsg_close_array(&b, d); + } + + if (!list_empty(&mac->wifi)) { + struct wifi_station *sta; + + sta = list_first_entry(&mac->wifi, struct wifi_station, mac); + blobmsg_add_field(&b, BLOBMSG_TYPE_TABLE, "wifi", + blobmsg_data(sta->info), blobmsg_data_len(sta->info)); + } + + if (!list_empty(&mac->dhcpv4)) { + struct dhcpv4 *dhcpv4; + + d = blobmsg_open_array(&b, "dhcpv4"); + list_for_each_entry(dhcpv4, &mac->dhcpv4, mac) { + blobmsg_add_ipv4(&b, NULL, dhcpv4->ip); + if (strlen(dhcpv4->name) > 0) + blobmsg_add_string(&b, NULL, dhcpv4->name); + break; + } + blobmsg_close_array(&b, d); + } + + if (!list_empty(&mac->bridge_mac)) { + struct bridge_mac *bridge_mac; + + d = blobmsg_open_array(&b, "fdb"); + list_for_each_entry(bridge_mac, &mac->bridge_mac, mac) + blobmsg_add_string(&b, NULL, bridge_mac->ifname); + blobmsg_close_array(&b, d); + } + + blobmsg_close_array(&b, c); +} + +int +mac_dump_all(void) +{ + struct mac *mac; + + blob_buf_init(&b, 0); + + avl_for_each_element(&mac_tree, mac, avl) + mac_dump(mac, 1); + return 0; +} diff --git a/main.c b/main.c new file mode 100644 index 0000000..2d54040 --- /dev/null +++ b/main.c @@ -0,0 +1,33 @@ +/* + * Copyright (C) 2020 John Crispin + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of the GNU Lesser General Public License version 2.1 + * as published by the Free Software Foundation + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + */ + +#include "udevmand.h" + +int main(int argc, char **argv) +{ + ulog_open(ULOG_STDIO | ULOG_SYSLOG, LOG_DAEMON, "udevmand"); + + uloop_init(); + ubus_init(); + ethers_init(); + neigh_init(); + bridge_init(); + nl80211_init(); + neigh_enum(); + dhcp_init(); + uloop_run(); + uloop_done(); + ubus_uninit(); + + return 0; +} diff --git a/neigh.c b/neigh.c new file mode 100644 index 0000000..efae75b --- /dev/null +++ b/neigh.c @@ -0,0 +1,172 @@ +/* + * Copyright (C) 2020 John Crispin + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of the GNU Lesser General Public License version 2.1 + * as published by the Free Software Foundation + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + */ + +#include "udevmand.h" + +static struct nl_socket rtnl_sock; + +static int +avl_ipv4_cmp(const void *k1, const void *k2, void *ptr) +{ + return memcmp(k1, k2, 4); +} + +static int +avl_ipv6_cmp(const void *k1, const void *k2, void *ptr) +{ + return memcmp(k1, k2, 16); +} + +static struct avl_tree ip4_tree = AVL_TREE_INIT(ip4_tree, avl_ipv4_cmp, false, NULL); +static struct avl_tree ip6_tree = AVL_TREE_INIT(ip6_tree, avl_ipv6_cmp, false, NULL); + +static void +neigh_del(struct neigh *neigh) +{ + struct avl_tree *ip_tree = &ip4_tree; + + if (neigh->ip_ver == 6) + ip_tree = &ip6_tree; + + uloop_timeout_cancel(&neigh->ageing); + list_del(&neigh->list); + avl_delete(ip_tree, &neigh->avl); + free(neigh); +} + +static void +neigh_ageing_cb(struct uloop_timeout *t) +{ + struct neigh *neigh = container_of(t, struct neigh, ageing); + + neigh_del(neigh); +} + +static void +neigh_handler(struct nlmsghdr *nh, int type) +{ + uint8_t *lladdr, *dummy[6] = { 0 }; + uint8_t set[6] = { 0xff, 0xff, 0xff, 0xff, 0xff, 0xff }; + uint8_t clear[6] = { }; + uint8_t mcast[2] = { 0x33, 0x33 }; + struct ndmsg *ndm = nlmsg_data(nh); + struct nlattr *nda[__NDA_MAX]; + uint8_t *mac_buf, *ip_buf; + struct avl_tree *ip_tree; + struct neigh *neigh; + struct mac *mac; + int ip_len, ip_ver, refresh = 0; + void *dst; + + nlmsg_parse(nh, sizeof(struct ndmsg), nda, NDA_MAX, NULL); + if (!nda[NDA_DST]) + return; + + dst = nla_data(nda[NDA_DST]); + lladdr = nda[NDA_LLADDR] ? nla_data(nda[NDA_LLADDR]) : dummy; + if (!memcmp(lladdr, set, 6) || !memcmp(lladdr, clear, 6) || !memcmp(lladdr, mcast, 2) || *lladdr == 0x1) + return; + + mac = mac_find(lladdr); + + switch (ndm->ndm_family) { + case AF_INET: + ip_len = ip_ver = 4; + ip_tree = &ip4_tree; + break; + + case AF_INET6: + ip_len = 16; + ip_ver = 6; + ip_tree = &ip6_tree; + break; + + default: + return; + } + + neigh = avl_find_element(ip_tree, dst, neigh, avl); + + if (neigh) { + if (!type) + ULOG_INFO("del ipv%d for "MAC_FMT" on %s\n", neigh->ip_ver, MAC_VAR(lladdr), neigh->ifname); + refresh = 1; + neigh_del(neigh); + } + + if (!type) + return; + + neigh = calloc_a(sizeof(struct neigh), + &ip_buf, ip_len, &mac_buf, 6); + if (!neigh) + return; + neigh->ip = memcpy(ip_buf, dst, ip_len); + neigh->iface = ndm->ndm_ifindex; + neigh->avl.key = neigh->ip; + neigh->ip_ver = ip_ver; + neigh->ageing.cb = neigh_ageing_cb; + uloop_timeout_set(&neigh->ageing, 24 * 60 * 60 * 1000); + if_indextoname(neigh->iface, neigh->ifname); + if (neigh->ip_ver == 4) + list_add(&neigh->list, &mac->neigh4); + else + list_add(&neigh->list, &mac->neigh6); + avl_insert(ip_tree, &neigh->avl); + mac_update(mac, neigh->ifname); + if (!refresh) + ULOG_INFO("new ipv%d for "MAC_FMT" on %s\n", neigh->ip_ver, MAC_VAR(lladdr), neigh->ifname); +} + +static int +neigh_netlink_cb(struct nl_msg *msg, void *arg) +{ + + struct nlmsghdr *nh = nlmsg_hdr(msg); + + + switch (nh->nlmsg_type) { + case RTM_NEWNEIGH: + neigh_handler(nh, 1); + break; + + case RTM_DELNEIGH: + neigh_handler(nh, 0); + break; + + default: + break; + } + return NL_OK; +} + +void +neigh_enum(void) +{ + struct rtgenmsg msg = { .rtgen_family = AF_UNSPEC }; + + nl_send_simple(rtnl_sock.sock, RTM_GETNEIGH, NLM_F_DUMP, &msg, sizeof(msg)); + nl_wait_for_ack(rtnl_sock.sock); +} + +int +neigh_init(void) +{ + ULOG_INFO("open neigh netlink socket\n"); + if (!nl_status_socket(&rtnl_sock, NETLINK_ROUTE, neigh_netlink_cb, NULL)) { + ULOG_ERR("failed to open rtnl socket\n"); + return -1; + } + + return 0; +} diff --git a/netdev.c b/netdev.c new file mode 100644 index 0000000..a9975b0 --- /dev/null +++ b/netdev.c @@ -0,0 +1,183 @@ +#include "udevmand.h" + +struct avl_tree iface_tree = AVL_TREE_INIT(iface_tree, avl_strcmp, false, NULL); + +struct iface_ip { + struct list_head list; + char ip[]; +}; + +struct iface { + struct avl_node avl; + char name[IF_NAMESIZE]; + struct rtnl_link_stats stats; + struct list_head ipv6, ipv4; + uint8_t addr[ETH_ALEN]; +}; + +static struct iface* +iface_find(char *name) +{ + struct iface *iface = avl_find_element(&iface_tree, name, iface, avl); + + if (iface) + return iface; + iface = malloc(sizeof(*iface)); + if (!iface) + return NULL; + memset(iface, 0, sizeof(*iface)); + iface->avl.key = strcpy(iface->name, name); + INIT_LIST_HEAD(&iface->ipv4); + INIT_LIST_HEAD(&iface->ipv6); + avl_insert(&iface_tree, &iface->avl); + return iface; +} + +static void +iface_get(void) +{ + int fd = socket(PF_INET, SOCK_DGRAM, IPPROTO_IP); + struct ifaddrs *ifaddr, *ifa; + int n; + + if (getifaddrs(&ifaddr) == -1) { + ULOG_ERR("failed to getifaddrs\n"); + return; + } + + for (ifa = ifaddr, n = 0; ifa != NULL; ifa = ifa->ifa_next, n++) { + char host[NI_MAXHOST]; + struct iface *iface; + int family, s; + + if (ifa->ifa_addr == NULL) + continue; + + if ((ifa->ifa_flags & IFF_UP) == 0) + continue; + + if (ifa->ifa_flags & IFF_LOOPBACK) + continue; + + family = ifa->ifa_addr->sa_family; + + iface = iface_find(ifa->ifa_name); + if (!iface) + continue; + + if (family == AF_INET || family == AF_INET6) { + struct iface_ip *ip; + + s = getnameinfo(ifa->ifa_addr, + (family == AF_INET) ? sizeof(struct sockaddr_in) : + sizeof(struct sockaddr_in6), + host, NI_MAXHOST, + NULL, 0, NI_NUMERICHOST); + if (s) + continue; + ip = malloc(sizeof(*ip) + strlen(host) + 1); + if (!ip) + continue; + strcpy(ip->ip, host); + if (family == AF_INET) + list_add(&ip->list, &iface->ipv4); + else + list_add(&ip->list, &iface->ipv6); + } else if (family == AF_PACKET && ifa->ifa_data != NULL) { + struct rtnl_link_stats *stats = ifa->ifa_data; + struct ifreq s; + + memcpy(&iface->stats, stats, sizeof(*stats)); + memset(iface->addr, 0, ETH_ALEN); + if (fd) { + strcpy(s.ifr_name, ifa->ifa_name); + if (!ioctl(fd, SIOCGIFHWADDR, &s)) + memcpy(iface->addr, s.ifr_addr.sa_data, ETH_ALEN); + } + } + } + + freeifaddrs(ifaddr); + if (fd) + close(fd); +} + +static void +iface_flush(void) +{ + struct iface *iface, *tmp; + + avl_for_each_element_safe(&iface_tree, iface, avl, tmp) { + struct iface_ip *ip, *tmp; + + list_for_each_entry_safe(ip, tmp, &iface->ipv4, list) { + list_del(&ip->list); + free(ip); + } + + list_for_each_entry_safe(ip, tmp, &iface->ipv6, list) { + list_del(&ip->list); + free(ip); + } + avl_delete(&iface_tree, &iface->avl); + free(iface); + } +} + +void +iface_dump(void) +{ + struct iface *iface; + + iface_get(); + + blob_buf_init(&b, 0); + avl_for_each_element(&iface_tree, iface, avl) { + struct wifi_iface *wif; + struct iface_ip *ip; + void *c, *d; + + c = blobmsg_open_table(&b, iface->name); + blobmsg_add_mac(&b, "hwaddr", iface->addr); + if (!list_empty(&iface->ipv4)) { + d = blobmsg_open_array(&b, "ipv4"); + list_for_each_entry(ip, &iface->ipv4, list) + blobmsg_add_string(&b, NULL, ip->ip); + blobmsg_close_array(&b, d); + } + + if (!list_empty(&iface->ipv4)) { + d = blobmsg_open_array(&b, "ipv6"); + list_for_each_entry(ip, &iface->ipv6, list) + blobmsg_add_string(&b, NULL, ip->ip); + blobmsg_close_array(&b, d); + } + + d = blobmsg_open_table(&b, "stats"); + blobmsg_add_u32(&b, "rx_packets", iface->stats.rx_packets); + blobmsg_add_u32(&b, "tx_packets", iface->stats.tx_packets); + blobmsg_add_u32(&b, "rx_bytes", iface->stats.rx_bytes); + blobmsg_add_u32(&b, "tx_bytes", iface->stats.tx_bytes); + blobmsg_add_u32(&b, "rx_errors", iface->stats.rx_errors); + blobmsg_add_u32(&b, "tx_errors", iface->stats.tx_errors); + blobmsg_add_u32(&b, "rx_dropped", iface->stats.rx_dropped); + blobmsg_add_u32(&b, "tx_dropped", iface->stats.tx_dropped); + blobmsg_add_u32(&b, "multicast", iface->stats.multicast); + blobmsg_add_u32(&b, "collisions", iface->stats.collisions); + blobmsg_close_table(&b, d); + + wif = wifi_get_interface(iface->name); + if (wif) { + static char buf[10]; + + blobmsg_add_field(&b, BLOBMSG_TYPE_TABLE, "wifi", + blobmsg_data(wif->info), blobmsg_data_len(wif->info)); + snprintf(buf, sizeof(buf), "%d", wif->noise); + blobmsg_add_string(&b, "noise", buf); + } + bridge_dump_if(iface->name); + blobmsg_close_table(&b, c); + } + + iface_flush(); +} diff --git a/netifd.c b/netifd.c new file mode 100644 index 0000000..2b4cf48 --- /dev/null +++ b/netifd.c @@ -0,0 +1,106 @@ +#include "udevmand.h" + +enum { + INTERFACE_DEVICE, + INTERFACE_IFACE, + __INTERFACE_MAX +}; + +static const struct blobmsg_policy interface_policy[__INTERFACE_MAX] = { + [INTERFACE_DEVICE] = { .name = "device", .type = BLOBMSG_TYPE_STRING }, + [INTERFACE_IFACE] = { .name = "interface", .type = BLOBMSG_TYPE_STRING }, +}; + +static struct avl_tree interface_tree = AVL_TREE_INIT(interface_tree, avl_strcmp, false, NULL); + +void +interface_update(struct blob_attr *msg, int raw) +{ + struct blob_attr *tb[__INTERFACE_MAX]; + struct interface *interface; + char *device, *iface, *device_buf, *iface_buf; + + if (raw) + blobmsg_parse(interface_policy, __INTERFACE_MAX, tb, blob_data(msg), blob_len(msg)); + else + blobmsg_parse(interface_policy, __INTERFACE_MAX, tb, blobmsg_data(msg), blobmsg_data_len(msg)); + + if (!tb[INTERFACE_DEVICE] || !tb[INTERFACE_IFACE]) + return; + + iface = blobmsg_get_string(tb[INTERFACE_IFACE]); + device = blobmsg_get_string(tb[INTERFACE_DEVICE]); + + interface = avl_find_element(&interface_tree, iface, interface, avl); + if (interface) { + avl_delete(&interface_tree, &interface->avl); + free(interface); + } + + interface = calloc_a(sizeof(struct neigh), + &iface_buf, strlen(iface) + 1, + &device_buf, strlen(device) + 1); + if (!interface) + return; + interface->iface = strcpy(iface_buf, iface); + interface->device = strcpy(device_buf, device); + interface->avl.key = interface->iface; + + avl_insert(&interface_tree, &interface->avl); + + ULOG_INFO("new interface %s:%s\n", iface, device); +} + +void +interface_down(struct blob_attr *msg) +{ + struct blob_attr *tb[__INTERFACE_MAX]; + struct interface *interface; + char *iface; + + blobmsg_parse(interface_policy, __INTERFACE_MAX, tb, blob_data(msg), blob_len(msg)); + + if (!tb[INTERFACE_IFACE]) + return; + + iface = blobmsg_get_string(tb[INTERFACE_IFACE]); + + interface = avl_find_element(&interface_tree, iface, interface, avl); + if (!interface) + return; + + ULOG_INFO("del interface %s\n", interface->iface); + avl_delete(&interface_tree, &interface->avl); + free(interface); +} + +char* +interface_resolve(char *ifname) +{ + struct interface *interface; + + avl_for_each_element(&interface_tree, interface, avl) + if (!strcmp(interface->device, ifname)) + return interface->iface; + return ifname; +} + +int +interface_dump(void) +{ + struct interface *interface; + struct mac *mac; + + blob_buf_init(&b, 0); + + avl_for_each_element(&interface_tree, interface, avl) { + void *c; + + c = blobmsg_open_table(&b, interface->iface); + avl_for_each_element(&mac_tree, mac, avl) + if (!strcmp(interface->iface, mac->interface)) + mac_dump(mac, 0); + blobmsg_close_table(&b, c); + } + return 0; +} diff --git a/netlink.c b/netlink.c new file mode 100644 index 0000000..cbf4b02 --- /dev/null +++ b/netlink.c @@ -0,0 +1,113 @@ +/* + * Copyright (C) 2017 John Crispin + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of the GNU Lesser General Public License version 2.1 + * as published by the Free Software Foundation + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + */ + +#include "udevmand.h" + +static void +nl_handler_nl_status(struct uloop_fd *u, unsigned int statuss) +{ + struct nl_socket *ev = container_of(u, struct nl_socket, uloop); + int err; + socklen_t errlen = sizeof(err); + + if (!u->error) { + nl_recvmsgs_default(ev->sock); + return; + } + + if (getsockopt(u->fd, SOL_SOCKET, SO_ERROR, (void *)&err, &errlen)) + goto abort; + + switch(err) { + case ENOBUFS: + ev->bufsize *= 2; + if (nl_socket_set_buffer_size(ev->sock, ev->bufsize, 0)) + goto abort; + break; + + default: + goto abort; + } + u->error = false; + return; + +abort: + uloop_fd_delete(&ev->uloop); + return; +} + +static struct nl_sock * +nl_create_socket(int protocol, int groups) +{ + struct nl_sock *sock; + + sock = nl_socket_alloc(); + if (!sock) + return NULL; + + if (groups) + nl_join_groups(sock, groups); + + if (nl_connect(sock, protocol)) + return NULL; + + return sock; +} + +static bool +nl_raw_status_socket(struct nl_socket *ev, int protocol, int groups, + uloop_fd_handler cb, int flags) +{ + ev->sock = nl_create_socket(protocol, groups); + if (!ev->sock) + return false; + + ev->uloop.fd = nl_socket_get_fd(ev->sock); + ev->uloop.cb = cb; + if (uloop_fd_add(&ev->uloop, ULOOP_READ|flags)) + return false; + + return true; +} + +bool +nl_status_socket(struct nl_socket *ev, int protocol, + int (*cb)(struct nl_msg *msg, void *arg), void *priv) +{ + if (!nl_raw_status_socket(ev, protocol, 0, nl_handler_nl_status, ULOOP_ERROR_CB)) + return false; + + nl_socket_modify_cb(ev->sock, NL_CB_VALID, NL_CB_CUSTOM, cb, priv); + nl_socket_disable_seq_check(ev->sock); + ev->bufsize = 65535; + if (nl_socket_set_buffer_size(ev->sock, ev->bufsize, 0)) + return false; + + return true; +} + +int genl_send_and_recv(struct nl_socket *ev, struct nl_msg * msg) +{ + int ret = nl_send_auto_complete(ev->sock, msg); + + nlmsg_free(msg); + if (ret < 0) + return ret; + + nl_recvmsgs_default(ev->sock); + nl_wait_for_ack(ev->sock); + + return 0; +} + + diff --git a/nl80211.c b/nl80211.c new file mode 100644 index 0000000..85b165b --- /dev/null +++ b/nl80211.c @@ -0,0 +1,545 @@ +/* + * Copyright (C) 2017 John Crispin + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of the GNU Lesser General Public License version 2.1 + * as published by the Free Software Foundation + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + */ + +#include "udevmand.h" + +struct family_data { + const char *group; + int id; +}; + +static struct nl_socket nl80211_status; +static uint8_t nl80211_arg[4096]; + +static struct nlattr *sinfo[NL80211_STA_INFO_MAX + 1]; +static struct nlattr *rinfo[NL80211_RATE_INFO_MAX + 1]; + +static struct nla_policy stats_policy[NL80211_STA_INFO_MAX + 1] = { + [NL80211_STA_INFO_INACTIVE_TIME] = { .type = NLA_U32 }, + [NL80211_STA_INFO_RX_PACKETS] = { .type = NLA_U32 }, + [NL80211_STA_INFO_TX_PACKETS] = { .type = NLA_U32 }, + [NL80211_STA_INFO_RX_BITRATE] = { .type = NLA_NESTED }, + [NL80211_STA_INFO_TX_BITRATE] = { .type = NLA_NESTED }, + [NL80211_STA_INFO_SIGNAL] = { .type = NLA_U8 }, + [NL80211_STA_INFO_RX_BYTES] = { .type = NLA_U32 }, + [NL80211_STA_INFO_TX_BYTES] = { .type = NLA_U32 }, + [NL80211_STA_INFO_TX_RETRIES] = { .type = NLA_U32 }, + [NL80211_STA_INFO_TX_FAILED] = { .type = NLA_U32 }, + [NL80211_STA_INFO_T_OFFSET] = { .type = NLA_U64 }, + [NL80211_STA_INFO_STA_FLAGS] = + { .minlen = sizeof(struct nl80211_sta_flag_update) }, +}; + +static struct nla_policy rate_policy[NL80211_RATE_INFO_MAX + 1] = { + [NL80211_RATE_INFO_BITRATE] = { .type = NLA_U16 }, + [NL80211_RATE_INFO_MCS] = { .type = NLA_U8 }, + [NL80211_RATE_INFO_40_MHZ_WIDTH] = { .type = NLA_FLAG }, + [NL80211_RATE_INFO_SHORT_GI] = { .type = NLA_FLAG }, +}; + +static int +avl_addrcmp(const void *k1, const void *k2, void *ptr) +{ + return memcmp(k1, k2, 6); +} + +static struct avl_tree wif_tree = AVL_TREE_INIT(wif_tree, avl_strcmp, false, NULL); +static struct avl_tree sta_tree = AVL_TREE_INIT(sta_tree, avl_addrcmp, false, NULL); + +static int +nl80211_freq2channel(int freq) +{ + if (freq == 2484) + return 14; + else if (freq < 2484) + return (freq - 2407) / 5; + else if (freq >= 4910 && freq <= 4980) + return (freq - 4000) / 5; + else if(freq >= 56160 + 2160 * 1 && freq <= 56160 + 2160 * 6) + return (freq - 56160) / 2160; + else + return (freq - 5000) / 5; +} + +static void +nl80211_parse_rateinfo(struct nlattr **ri, char *table) +{ + int mhz = 0; + void *cookie = blobmsg_open_table(&b, table); + + if (ri[NL80211_RATE_INFO_BITRATE32]) + blobmsg_add_u32(&b, "bitrate", nla_get_u32(ri[NL80211_RATE_INFO_BITRATE32]) * 100); + else if (ri[NL80211_RATE_INFO_BITRATE]) + blobmsg_add_u16(&b, "bitrate", nla_get_u16(ri[NL80211_RATE_INFO_BITRATE]) * 100); + + if (ri[NL80211_RATE_INFO_VHT_MCS]) { + blobmsg_add_u8(&b, "vht", 1); + blobmsg_add_u8(&b, "mcs", nla_get_u8(ri[NL80211_RATE_INFO_VHT_MCS])); + + if (ri[NL80211_RATE_INFO_VHT_NSS]) + blobmsg_add_u8(&b, "nss", nla_get_u8(ri[NL80211_RATE_INFO_VHT_NSS])); + } else if (ri[NL80211_RATE_INFO_MCS]) { + blobmsg_add_u8(&b, "ht", 1); + blobmsg_add_u8(&b, "mcs", nla_get_u8(ri[NL80211_RATE_INFO_MCS])); + } + + if (ri[NL80211_RATE_INFO_5_MHZ_WIDTH]) + mhz = 5; + else if (ri[NL80211_RATE_INFO_10_MHZ_WIDTH]) + mhz = 10; + else if (ri[NL80211_RATE_INFO_40_MHZ_WIDTH]) + mhz = 40; + else if (ri[NL80211_RATE_INFO_80_MHZ_WIDTH]) + mhz = 80; + else if (ri[NL80211_RATE_INFO_80P80_MHZ_WIDTH] || + ri[NL80211_RATE_INFO_160_MHZ_WIDTH]) + mhz = 160; + else + mhz = 20; + blobmsg_add_u32(&b, "mhz", mhz); + + if (ri[NL80211_RATE_INFO_SHORT_GI]) + blobmsg_add_u8(&b, "short_gi", 1); + blobmsg_close_table(&b, cookie); +} + +static void +nl80211_to_blob(struct nlattr **tb, char *ifname) +{ + memset(sinfo, 0, sizeof(sinfo)); + memset(rinfo, 0, sizeof(rinfo)); + + blob_buf_init(&b, 0); + + if (tb[NL80211_ATTR_IFINDEX]) { + int idx = nla_get_u32(tb[NL80211_ATTR_IFINDEX]); + if (ifname) + if_indextoname(idx, ifname); + } else if (tb[NL80211_ATTR_IFNAME]) { + if (ifname) + ifname = nla_get_string(tb[NL80211_ATTR_IFNAME]); + } + + if (tb[NL80211_ATTR_WIPHY]) + blobmsg_add_u32(&b, "phy", nla_get_u32(tb[NL80211_ATTR_WIPHY])); + + if (tb[NL80211_ATTR_SSID]) + blobmsg_add_string(&b, "ssid", nla_get_string(tb[NL80211_ATTR_SSID])); + + if (tb[NL80211_ATTR_IFTYPE]) + blobmsg_add_iftype(&b, "iftype", nla_get_u32(tb[NL80211_ATTR_IFTYPE])); + + if (tb[NL80211_ATTR_WIPHY_TX_POWER_LEVEL]) + blobmsg_add_u32(&b, "txpower", nla_get_u32(tb[NL80211_ATTR_WIPHY_TX_POWER_LEVEL]) / 100); + + if (tb[NL80211_ATTR_WIPHY_FREQ]) { + blobmsg_add_u32(&b, "frequency", nla_get_u32(tb[NL80211_ATTR_WIPHY_FREQ])); + blobmsg_add_u32(&b, "channel", nl80211_freq2channel(nla_get_u32(tb[NL80211_ATTR_WIPHY_FREQ]))); + } + if (tb[NL80211_ATTR_CENTER_FREQ1]) + blobmsg_add_u32(&b, "center_freq1", nla_get_u32(tb[NL80211_ATTR_CENTER_FREQ1])); + + if (tb[NL80211_ATTR_CENTER_FREQ2]) + blobmsg_add_u32(&b, "center_freq2", nla_get_u32(tb[NL80211_ATTR_CENTER_FREQ2])); + + if (tb[NL80211_ATTR_CHANNEL_WIDTH]) + switch(nla_get_u32(tb[NL80211_ATTR_CHANNEL_WIDTH])) { + case NL80211_CHAN_WIDTH_20: + blobmsg_add_string(&b, "channel_width", "20"); + break; + case NL80211_CHAN_WIDTH_40: + blobmsg_add_string(&b, "channel_width", "40"); + break; + case NL80211_CHAN_WIDTH_80: + blobmsg_add_string(&b, "channel_width", "80"); + break; + case NL80211_CHAN_WIDTH_80P80: + blobmsg_add_string(&b, "channel_width", "80p80"); + break; + case NL80211_CHAN_WIDTH_160: + blobmsg_add_string(&b, "channel_width", "160"); + break; + } + + if (tb[NL80211_ATTR_WIPHY_CHANNEL_TYPE]) + blobmsg_add_u32(&b, "channel_type", nla_get_u32(tb[NL80211_ATTR_WIPHY_CHANNEL_TYPE])); + + if (tb[NL80211_ATTR_STA_INFO] != NULL && + !nla_parse_nested(sinfo, NL80211_STA_INFO_MAX, + tb[NL80211_ATTR_STA_INFO], stats_policy)) + { + if (sinfo[NL80211_STA_INFO_SIGNAL]) + blobmsg_add_u32(&b, "signal", (signed char)nla_get_u8(sinfo[NL80211_STA_INFO_SIGNAL])); + if (sinfo[NL80211_STA_INFO_INACTIVE_TIME]) + blobmsg_add_u32(&b, "inactive", nla_get_u32(sinfo[NL80211_STA_INFO_INACTIVE_TIME])); + if (sinfo[NL80211_STA_INFO_RX_PACKETS]) + blobmsg_add_u32(&b, "rx_pkt", nla_get_u32(sinfo[NL80211_STA_INFO_RX_PACKETS])); + if (sinfo[NL80211_STA_INFO_TX_PACKETS]) + blobmsg_add_u32(&b, "tx_pkt", nla_get_u32(sinfo[NL80211_STA_INFO_TX_PACKETS])); + if (sinfo[NL80211_STA_INFO_RX_BITRATE] && + !nla_parse_nested(rinfo, NL80211_RATE_INFO_MAX, sinfo[NL80211_STA_INFO_RX_BITRATE], + rate_policy)) + nl80211_parse_rateinfo(rinfo, "rx_rate"); + if (sinfo[NL80211_STA_INFO_TX_BITRATE] && + !nla_parse_nested(rinfo, NL80211_RATE_INFO_MAX, sinfo[NL80211_STA_INFO_TX_BITRATE], + rate_policy)) + nl80211_parse_rateinfo(rinfo, "tx_rate"); + if (sinfo[NL80211_STA_INFO_RX_BYTES]) + blobmsg_add_u32(&b, "rx_bytes", nla_get_u32(sinfo[NL80211_STA_INFO_RX_BYTES])); + if (sinfo[NL80211_STA_INFO_TX_BYTES]) + blobmsg_add_u32(&b, "tx_bytes", nla_get_u32(sinfo[NL80211_STA_INFO_TX_BYTES])); + if (sinfo[NL80211_STA_INFO_TX_RETRIES]) + blobmsg_add_u32(&b, "tx_retries", nla_get_u32(sinfo[NL80211_STA_INFO_TX_RETRIES])); + if (sinfo[NL80211_STA_INFO_TX_FAILED]) + blobmsg_add_u32(&b, "tx_failed", nla_get_u32(sinfo[NL80211_STA_INFO_TX_FAILED])); + if (sinfo[NL80211_STA_INFO_T_OFFSET]) + blobmsg_add_u32(&b, "tx_offset", nla_get_u32(sinfo[NL80211_STA_INFO_T_OFFSET])); + } + + if (tb[NL80211_ATTR_REG_ALPHA2]) + blobmsg_add_string(&b, "country", nla_get_string(tb[NL80211_ATTR_REG_ALPHA2])); + + if (tb[NL80211_ATTR_DFS_REGION]) + blobmsg_add_u16(&b, "dfs-region", nla_get_u8(tb[NL80211_ATTR_DFS_REGION])); +} + +static void +nl80211_list_wif(void) +{ + struct nl_msg *msg; + + msg = nlmsg_alloc(); + if (!msg) + return; + + if (!genlmsg_put(msg, 0, 0, genl_ctrl_resolve(nl80211_status.sock, "nl80211"), + 0, NLM_F_DUMP, NL80211_CMD_GET_INTERFACE, 0)) { + nlmsg_free(msg); + return; + } + + genl_send_and_recv(&nl80211_status, msg); +} + +static void +nl80211_assoc_list(struct uloop_timeout *t) +{ + struct wifi_iface *wif = container_of(t, struct wifi_iface, assoc); + struct nl_msg *msg; + int idx = if_nametoindex(wif->ifname); + + msg = nlmsg_alloc(); + if (!msg) + goto out; + + if (!genlmsg_put(msg, 0, 0, genl_ctrl_resolve(nl80211_status.sock, "nl80211"), + 0, NLM_F_DUMP, NL80211_CMD_GET_STATION, 0) || + nla_put_u32(msg, NL80211_ATTR_IFINDEX, idx)) { + nlmsg_free(msg); + goto out; + } + + genl_send_and_recv(&nl80211_status, msg); + + msg = nlmsg_alloc(); + if (!msg) + goto out; + + if (!genlmsg_put(msg, 0, 0, genl_ctrl_resolve(nl80211_status.sock, "nl80211"), + 0, NLM_F_DUMP, NL80211_CMD_GET_SURVEY, 0) || + nla_put_u32(msg, NL80211_ATTR_IFINDEX, idx)) { + nlmsg_free(msg); + goto out; + } + + genl_send_and_recv(&nl80211_status, msg); + +out: + uloop_timeout_set(t, 30 * 1000); +} + +static void +nl80211_add_station(struct nlattr **tb, char *ifname) +{ + struct wifi_station *sta; + struct mac *mac; + uint8_t *addr; + + if (tb[NL80211_ATTR_MAC] == NULL) + return; + + nl80211_to_blob(tb, ifname); + addr = nla_data(tb[NL80211_ATTR_MAC]); + + mac = mac_find(addr); + sta = avl_find_element(&sta_tree, addr, sta, avl); + if (!sta) { + struct wifi_iface *wif; + + wif = avl_find_element(&wif_tree, ifname, wif, avl); + if (!wif) + return; + sta = malloc(sizeof(*sta)); + if (!sta) + return; + + memset(sta, 0, sizeof(*sta)); + memcpy(sta->addr, addr, 6); + sta->avl.key = sta->addr; + sta->wif = wif; + sta->info = NULL; + avl_insert(&sta_tree, &sta->avl); + list_add(&sta->mac, &mac->wifi); + list_add(&sta->iface, &wif->stas); + ULOG_INFO("new station %s "MAC_FMT"\n", ifname, MAC_VAR(sta->addr)); + } + if (sta->info) + free(sta->info); + sta->info = malloc(blob_pad_len(b.head)); + memcpy(sta->info, b.head, blob_pad_len(b.head)); +} + +static void +nl80211_del_station(struct wifi_station *sta, char *ifname) +{ + ULOG_INFO("del station %s "MAC_FMT"\n", ifname, MAC_VAR(sta->addr)); + list_del(&sta->mac); + list_del(&sta->iface); + avl_delete(&sta_tree, &sta->avl); + free(sta); +} + +static void +_nl80211_del_station(struct nlattr **tb, char *ifname) +{ + struct wifi_station *sta; + uint8_t *addr; + + if (tb[NL80211_ATTR_MAC] == NULL) + return; + + addr = nla_data(tb[NL80211_ATTR_MAC]); + sta = avl_find_element(&sta_tree, addr, sta, avl); + if (!sta) + return; + nl80211_del_station(sta, ifname); +} + +struct wifi_iface* +wifi_get_interface(char *ifname) +{ + struct wifi_iface *wif; + + return avl_find_element(&wif_tree, ifname, wif, avl); +} + +static void +nl80211_add_iface(struct nlattr **tb, char *ifname) +{ + struct wifi_iface *wif; + uint8_t *addr; + + if (tb[NL80211_ATTR_MAC] == NULL) + return; + + addr = nla_data(tb[NL80211_ATTR_MAC]); + wif = avl_find_element(&wif_tree, ifname, wif, avl); + if (!wif) { + wif = malloc(sizeof(*wif)); + if (!wif) + return; + + memset(wif, 0, sizeof(*wif)); + memcpy(wif->addr, addr, 6); + strncpy(wif->ifname, ifname, IF_NAMESIZE); + wif->avl.key = wif->ifname; + wif->assoc.cb = nl80211_assoc_list; + wif->info = NULL; + INIT_LIST_HEAD(&wif->stas); + nl80211_assoc_list(&wif->assoc); + avl_insert(&wif_tree, &wif->avl); + ULOG_INFO("new wifi %s "MAC_FMT"\n", wif->ifname, MAC_VAR(wif->addr)); + nl80211_to_blob(tb, NULL); + memcpy(wif->addr, addr, 6); + } + if (wif->info) + free(wif->info); + wif->info = malloc(blob_pad_len(b.head)); + memcpy(wif->info, b.head, blob_pad_len(b.head)); +} + +static void +nl80211_del_iface(struct nlattr **tb, char *ifname) +{ + struct wifi_station *sta, *tmp; + struct wifi_iface *wif; + + wif = avl_find_element(&wif_tree, ifname, wif, avl); + if (!wif) + return; + list_for_each_entry_safe(sta, tmp, &wif->stas, iface) + nl80211_del_station(sta, wif->ifname); + ULOG_INFO("del wifi %s "MAC_FMT"\n", wif->ifname, MAC_VAR(wif->addr)); + avl_delete(&wif_tree, &wif->avl); + uloop_timeout_cancel(&wif->assoc); + free(wif); +} + +static int +nl80211_get_noise_cb(struct nlattr **tb, char *ifname) +{ + struct nlattr *si[NL80211_SURVEY_INFO_MAX + 1]; + struct wifi_iface *wif; + + static struct nla_policy sp[NL80211_SURVEY_INFO_MAX + 1] = { + [NL80211_SURVEY_INFO_FREQUENCY] = { .type = NLA_U32 }, + [NL80211_SURVEY_INFO_NOISE] = { .type = NLA_U8 }, + }; + + wif = avl_find_element(&wif_tree, ifname, wif, avl); + if (!wif) + return NL_SKIP; + + if (!tb[NL80211_ATTR_SURVEY_INFO]) + return NL_SKIP; + + if (nla_parse_nested(si, NL80211_SURVEY_INFO_MAX, + tb[NL80211_ATTR_SURVEY_INFO], sp)) + return NL_SKIP; + + if (!si[NL80211_SURVEY_INFO_NOISE]) + return NL_SKIP; + + wif->noise = 0; + if (si[NL80211_SURVEY_INFO_IN_USE]) + wif->noise = (int8_t)nla_get_u8(si[NL80211_SURVEY_INFO_NOISE]); + + return NL_SKIP; +} +static int +nl80211_mcast_grp(struct nlattr **tb, struct family_data *res) +{ + struct nlattr *mcgrp; + int i; + + nla_for_each_nested(mcgrp, tb[CTRL_ATTR_MCAST_GROUPS], i) { + struct nlattr *tb2[CTRL_ATTR_MCAST_GRP_MAX + 1]; + + nla_parse(tb2, CTRL_ATTR_MCAST_GRP_MAX, nla_data(mcgrp), + nla_len(mcgrp), NULL); + + if (!tb2[CTRL_ATTR_MCAST_GRP_NAME] || + !tb2[CTRL_ATTR_MCAST_GRP_ID] || + strncmp(nla_data(tb2[CTRL_ATTR_MCAST_GRP_NAME]), res->group, nla_len(tb2[CTRL_ATTR_MCAST_GRP_NAME])) != 0) + continue; + res->id = nla_get_u32(tb2[CTRL_ATTR_MCAST_GRP_ID]); + break; + } + + return NL_SKIP; +} + +static int +cb_nl80211_status(struct nl_msg *msg, void *arg) +{ + struct genlmsghdr *gnlh = nlmsg_data(nlmsg_hdr(msg)); + struct nlattr *tb[NL80211_ATTR_MAX + 1]; + char ifname[IFNAMSIZ] = {}; + int ifidx = -1; + + nla_parse(tb, NL80211_ATTR_MAX, genlmsg_attrdata(gnlh, 0), + genlmsg_attrlen(gnlh, 0), NULL); + + if (tb[CTRL_ATTR_MCAST_GROUPS]) { + return nl80211_mcast_grp(tb, arg); + + } else if (tb[NL80211_ATTR_IFINDEX]) { + ifidx = nla_get_u32(tb[NL80211_ATTR_IFINDEX]); + if_indextoname(ifidx, ifname); + + } else if (tb[NL80211_ATTR_IFNAME]) { + strncpy(ifname, nla_get_string(tb[NL80211_ATTR_IFNAME]), IFNAMSIZ); + + } else + return 0; + + switch (gnlh->cmd) { + case NL80211_CMD_NEW_STATION: + nl80211_add_station(tb, ifname); + break; + case NL80211_CMD_DEL_STATION: + _nl80211_del_station(tb, ifname); + break; + case NL80211_CMD_NEW_INTERFACE: + nl80211_add_iface(tb, ifname); + break; + case NL80211_CMD_DEL_INTERFACE: + nl80211_del_iface(tb, ifname); + break; + case NL80211_CMD_NEW_SURVEY_RESULTS: + nl80211_get_noise_cb(tb, ifname); + break; + default: + break; + } + + return 0; +} + +static int +genl_get_multicast_id(struct nl_socket *ev, + const char *family, const char *group) +{ + struct nl_msg *msg; + struct family_data *genl_res = (struct family_data *) &nl80211_arg; + genl_res->group = group; + genl_res->id = -ENOENT; + + msg = nlmsg_alloc(); + if (!msg) + return -ENOMEM; + if (!genlmsg_put(msg, 0, 0, genl_ctrl_resolve(ev->sock, "nlctrl"), + 0, 0, CTRL_CMD_GETFAMILY, 0) || + nla_put_string(msg, CTRL_ATTR_FAMILY_NAME, family)) { + nlmsg_free(msg); + return -1; + } + + genl_send_and_recv(ev, msg); + + return genl_res->id; +} + +int nl80211_init(void) +{ + int id; + + if (!nl_status_socket(&nl80211_status, NETLINK_GENERIC, cb_nl80211_status, &nl80211_arg)) + return -1; + + id = genl_get_multicast_id(&nl80211_status, "nl80211", "config"); + if (id >= 0) + nl_socket_add_membership(nl80211_status.sock, id); + + id = genl_get_multicast_id(&nl80211_status, "nl80211", "mlme"); + if (id >= 0) + nl_socket_add_membership(nl80211_status.sock, id); + + id = genl_get_multicast_id(&nl80211_status, "nl80211", "vendor"); + if (id >= 0) + nl_socket_add_membership(nl80211_status.sock, id); + + nl80211_list_wif(); + + return 0; +} diff --git a/ubus.c b/ubus.c new file mode 100644 index 0000000..32fef08 --- /dev/null +++ b/ubus.c @@ -0,0 +1,236 @@ +/* + * Copyright (C) 2020 John Crispin + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of the GNU Lesser General Public License version 2.1 + * as published by the Free Software Foundation + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + */ + +#include "udevmand.h" + +static struct ubus_auto_conn conn; +static struct ubus_subscriber subscriber; + +enum { + EVENT_ID, + EVENT_PATH, + __EVENT_MAX +}; + +static const struct blobmsg_policy status_policy[__EVENT_MAX] = { + [EVENT_ID] = { .name = "id", .type = BLOBMSG_TYPE_INT32 }, + [EVENT_PATH] = { .name = "path", .type = BLOBMSG_TYPE_STRING }, +}; + +static const struct ubus_watch_list { + const char *path; + int wildcard; +} ubus_watch_list[] = { + { + .path = "service", + }, { + .path = "dnsmasq", + }, { + .path = "network.interface", + }, { + .path = "network.status", + }, +}; + +static int +ubus_mac_cb(struct ubus_context *ctx, struct ubus_object *obj, + struct ubus_request_data *req, const char *method, + struct blob_attr *msg) +{ + if (!mac_dump_all()) + ubus_send_reply(ctx, req, b.head); + return UBUS_STATUS_OK; +} + +static int +ubus_interface_cb(struct ubus_context *ctx, struct ubus_object *obj, + struct ubus_request_data *req, const char *method, + struct blob_attr *msg) +{ + if (!interface_dump()) + ubus_send_reply(ctx, req, b.head); + return UBUS_STATUS_OK; +} + +static int +ubus_port_cb(struct ubus_context *ctx, struct ubus_object *obj, + struct ubus_request_data *req, const char *method, + struct blob_attr *msg) +{ + iface_dump(); + ubus_send_reply(ctx, req, b.head); + + return UBUS_STATUS_OK; +} + +static const struct ubus_method topology_methods[] = { + UBUS_METHOD_NOARG("interface", ubus_interface_cb), + UBUS_METHOD_NOARG("mac", ubus_mac_cb), + UBUS_METHOD_NOARG("port", ubus_port_cb), +}; + +static struct ubus_object_type ubus_object_type = + UBUS_OBJECT_TYPE("topology", topology_methods); + +static struct ubus_object ubus_object = { + .name = "topology", + .type = &ubus_object_type, + .methods = topology_methods, + .n_methods = ARRAY_SIZE(topology_methods), +}; + +static int +ubus_watch_match(const char *path) +{ + int i; + + for (i = 0; i < ARRAY_SIZE(ubus_watch_list); i++) { + int len = strlen(ubus_watch_list[i].path); + + if (ubus_watch_list[i].wildcard && strncmp(path, ubus_watch_list[i].path, len)) + continue; + if (!ubus_watch_list[i].wildcard && strcmp(path, ubus_watch_list[i].path)) + continue; + return 0; + } + return -1; +} + +enum { + INTERFACE, + __INTERFACE_MAX, +}; + +static const struct blobmsg_policy interface_policy[__INTERFACE_MAX] = { + [INTERFACE] = { .name = "interface", .type = BLOBMSG_TYPE_ARRAY }, +}; + +static void +ubus_netifd_dump_cb(struct ubus_request *req, + int type, struct blob_attr *msg) +{ + struct blob_attr *tb[__INTERFACE_MAX]; + struct blob_attr *iter; + int rem; + + blobmsg_parse(interface_policy, __INTERFACE_MAX, tb, blob_data(msg), blob_len(msg)); + if (!tb[INTERFACE]) + return; + blobmsg_for_each_attr(iter, tb[INTERFACE], rem) + interface_update(iter, 0); +} + +static int +ubus_notify_cb(struct ubus_context *ctx, struct ubus_object *obj, + struct ubus_request_data *req, const char *method, + struct blob_attr *msg) +{ + if (0) { + char *str; + + str = blobmsg_format_json(msg, true); + ULOG_INFO("Received ubus notify '%s': %s\n", method, str); + free(str); + } + + if (!strcmp(method, "dhcp.ack")) + dhcpv4_ack(msg); + + else if (!strcmp(method, "dhcp.release")) + dhcpv4_release(msg); + + else if (!strcmp(method, "interface.update")) + interface_update(msg, 1); + + else if (!strcmp(method, "interface.down")) + interface_down(msg); + + return 0; +} + +static void +ubus_event_handler_cb(struct ubus_context *ctx, struct ubus_event_handler *ev, + const char *type, struct blob_attr *msg) +{ + struct blob_attr *tb[__EVENT_MAX]; + const char *path; + uint32_t id; + + if (strcmp("ubus.object.add", type)) + return; + + if (0) { + char *str; + + str = blobmsg_format_json(msg, true); + ULOG_INFO("Received ubus notify '%s': %s\n", type, str); + free(str); + } + + blobmsg_parse(status_policy, __EVENT_MAX, tb, blob_data(msg), blob_len(msg)); + + if (!tb[EVENT_ID] || !tb[EVENT_PATH]) + return; + + path = blobmsg_get_string(tb[EVENT_PATH]); + id = blobmsg_get_u32(tb[EVENT_ID]); + + if (!ubus_watch_match(path) && !ubus_subscribe(ctx, &subscriber, id)) + ULOG_INFO("Subscribe to %s (%u)\n", path, id); +} + +static struct ubus_event_handler ubus_event_handler = { .cb = ubus_event_handler_cb }; + +static void +receive_list_result(struct ubus_context *ctx, struct ubus_object_data *obj, + void *priv) +{ + char *path = strdup(obj->path); + + if (!ubus_watch_match(path) && !ubus_subscribe(ctx, &subscriber, obj->id)) + ULOG_INFO("Subscribe to %s (%u)\n", path, obj->id); + free(path); +} + +static void +ubus_connect_handler(struct ubus_context *ctx) +{ + uint32_t netifd; + + ubus_add_object(ctx, &ubus_object); + + ubus_register_event_handler(ctx, &ubus_event_handler, "ubus.object.add"); + ubus_register_event_handler(ctx, &ubus_event_handler, "ubus.object.remove"); + + subscriber.cb = ubus_notify_cb; + if (ubus_register_subscriber(ctx, &subscriber)) + ULOG_ERR("failed to register ubus subscriber\n"); + + ubus_lookup(ctx, NULL, receive_list_result, NULL); + + if (!ubus_lookup_id(ctx, "network.interface", &netifd)) + ubus_invoke(ctx, netifd, "dump", NULL, ubus_netifd_dump_cb, NULL, 5000); +} + +void +ubus_init(void) +{ + conn.cb = ubus_connect_handler; + ubus_auto_connect(&conn); +} + +void +ubus_uninit(void) +{ + ubus_auto_shutdown(&conn); +} diff --git a/udevmand.h b/udevmand.h new file mode 100644 index 0000000..58b6462 --- /dev/null +++ b/udevmand.h @@ -0,0 +1,171 @@ +#define _GNU_SOURCE + +#include +#include +#include +#include +#include +#include +#include + +#include + +#include +#include + +#include +#include +#include +#include +#include +#include + +#include +#include +#include +#include +#include + +#include +#include +#include +#include +#include +#include +#include + +#include + +#define MAC_FMT "%02x:%02x:%02x:%02x:%02x:%02x" +#define MAC_VAR(x) x[0], x[1], x[2], x[3], x[4], x[5] + +#define IP_FMT "%d.%d.%d.%d" +#define IP_VAR(x) x[0], x[1], x[2], x[3] + +struct nl_socket { + struct uloop_fd uloop; + struct nl_sock *sock; + int bufsize; +}; + +struct mac { + uint8_t *addr; + struct avl_node avl; + char interface[64]; + char *ethers; + + struct timespec ts; + struct list_head neigh4; + struct list_head neigh6; + struct list_head wifi; + struct list_head dhcpv4; + struct list_head bridge_mac; +}; + +struct neigh { + struct avl_node avl; + struct list_head list; + + uint8_t *ip; + int ip_ver; + int iface; + char ifname[IF_NAMESIZE]; + + struct uloop_timeout ageing; +}; + +struct wifi_iface { + struct avl_node avl; + uint8_t addr[6]; + + struct blob_attr *info; + int noise; + + char ifname[IF_NAMESIZE]; + struct list_head stas; + struct uloop_timeout assoc; +}; + +struct wifi_station { + struct avl_node avl; + uint8_t addr[6]; + + struct blob_attr *info; + + struct wifi_iface *wif; + struct list_head mac; + struct list_head iface; +}; + +struct dhcpv4 { + struct avl_node avl; + struct list_head mac; + + uint8_t addr[ETH_ALEN]; + uint8_t ip[4]; + char iface[IF_NAMESIZE]; + char name[]; +}; + +struct interface { + struct avl_node avl; + + char *iface; + char *device; +}; + +struct bridge_mac { + struct vlist_node vlist; + struct list_head mac; + + char bridge[IF_NAMESIZE]; + char ifname[IF_NAMESIZE]; + uint8_t addr[ETH_ALEN]; + __u8 port_no; +}; + +extern int avl_mac_cmp(const void *k1, const void *k2, void *ptr); + +extern struct avl_tree mac_tree; +extern int mac_dump_all(void); +extern void mac_dump(struct mac *mac, int interface); +extern struct mac* mac_find(uint8_t *addr); +extern void mac_update(struct mac *mac, char *iface); + +extern int neigh_init(void); +extern void neigh_enum(void); + +extern bool nl_status_socket(struct nl_socket *ev, int protocol, + int (*cb)(struct nl_msg *msg, void *arg), void *priv); +extern int genl_send_and_recv(struct nl_socket *ev, struct nl_msg * msg); + +extern int nl80211_init(void); +extern void nl80211_enum(void); + +extern struct blob_buf b; +extern void blobmsg_add_iface(struct blob_buf *bbuf, char *name, int index); +extern void blobmsg_add_iftype(struct blob_buf *bbuf, const char *name, const uint32_t iftype); +extern void blobmsg_add_ipv4(struct blob_buf *bbuf, const char *name, const uint8_t* addr); +extern void blobmsg_add_ipv6(struct blob_buf *bbuf, const char *name, const uint8_t* addr); +extern void blobmsg_add_mac(struct blob_buf *bbuf, const char *name, const uint8_t* addr); + +extern void ubus_init(void); +extern void ubus_uninit(void); + +extern void bridge_init(void); +extern void bridge_dump_if(const char *bridge); + +extern void dhcpv4_ack(struct blob_attr *msg); +extern void dhcpv4_release(struct blob_attr *msg); +extern void dhcp_init(void); + +extern int interface_dump(void); +extern void interface_update(struct blob_attr *msg, int raw); +extern void interface_down(struct blob_attr *msg); +extern char *interface_resolve(char *device); + +extern void ethers_init(void); + +extern void iface_dump(void); + +extern struct wifi_iface *wifi_get_interface(char *name);