├── src ├── final │ ├── namespace.h │ ├── fw.h │ ├── nl.h │ ├── namespace.c │ ├── nl.c │ ├── fw.c │ └── main.c ├── forward.c ├── masquerade.c ├── namespace.c ├── pair.c ├── refactor.c ├── link_address.c ├── pair_ns.c ├── ns_addr.c └── ns_gw.c ├── .gitignore ├── Makefile ├── README.md └── LICENSE /src/final/namespace.h: -------------------------------------------------------------------------------- 1 | #define NETNS_RUN_DIR "/run/netns" 2 | 3 | int netns_get_fd(const char *name); 4 | int new_ns(const char *name); 5 | -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | *.o 2 | src/*.o 3 | src/final/*.o 4 | 5 | pair 6 | link_address 7 | refactor 8 | namespace 9 | pair_ns 10 | ns_addr 11 | ns_gw 12 | ns_routes 13 | masquerade 14 | forward 15 | 16 | final 17 | -------------------------------------------------------------------------------- /src/final/fw.h: -------------------------------------------------------------------------------- 1 | struct _rule { 2 | char *table; 3 | char *entry; 4 | char *type; 5 | char *iface; 6 | char *oface; 7 | char *saddr; 8 | char *daddr; 9 | }; 10 | 11 | struct _addr_t { 12 | unsigned int addr; 13 | unsigned int mask; 14 | }; 15 | 16 | struct _addr_t * _init_addr(const char *ip); 17 | 18 | void _free_addr(struct _addr_t *addr); 19 | 20 | int _ipt_rule(struct _rule *rule); 21 | -------------------------------------------------------------------------------- /Makefile: -------------------------------------------------------------------------------- 1 | CFLAGS=-Wall -Wextra -g -Wsign-compare -Wfloat-equal -Wformat-security -pipe -std=gnu99 -pedantic 2 | LIBS=-lip4tc 3 | EXAMPLES=final 4 | 5 | all: $(EXAMPLES) 6 | 7 | 8 | final: src/final/main.o src/final/fw.o src/final/namespace.o src/final/nl.o 9 | $(CC) $(LIBS) -o $@ $^ 10 | 11 | src/final/%.o: src/final/%.c 12 | $(CC) $(CFLAGS) -fPIC -c -o $@ $< 13 | 14 | clean: 15 | rm -rf $(EXAMPLES) *.o src/*.o src/final/*.o 16 | -------------------------------------------------------------------------------- /src/final/nl.h: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | #ifndef VETH_INFO_PEER 5 | #define VETH_INFO_PEER 1 6 | #endif 7 | 8 | #define NLMSG_TAIL(nmsg) \ 9 | ((struct rtattr *) (((unsigned char *) (nmsg)) + NLMSG_ALIGN((nmsg)->nlmsg_len))) 10 | 11 | void _nlmsg_put(struct nlmsghdr *nlmsg, int type, void *data, size_t len); 12 | 13 | #define NLMSG_STRING(nl, attr, data) \ 14 | _nlmsg_put((nl), (attr), (data), (strlen((data)) + 1)) 15 | #define NLMSG_ATTR(nl, attr) \ 16 | _nlmsg_put((nl), (attr), (NULL), (0)) 17 | 18 | int _nlmsg_send(int fd, struct nlmsghdr *nlmsg); 19 | int _nlmsg_recieve(int fd); 20 | int _nl_socket_init(void); 21 | -------------------------------------------------------------------------------- /src/forward.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | int main(void) 8 | { 9 | struct xtc_handle *h = iptc_init("filter"); 10 | int result = 0; 11 | if (!h) { printf( "error condition %s\n", iptc_strerror(errno)); return -1;} 12 | 13 | unsigned int targetOffset = XT_ALIGN(sizeof(struct ipt_entry)); 14 | unsigned int totalLen = targetOffset + XT_ALIGN(sizeof(struct xt_standard_target)); 15 | 16 | struct ipt_entry* e = (struct ipt_entry *)calloc(1, totalLen); 17 | if (e == NULL) { 18 | printf("calloc failure :%s\n", strerror(errno)); 19 | return -1; 20 | } 21 | 22 | e->target_offset = targetOffset; 23 | e->next_offset = totalLen; 24 | 25 | strcpy(e->ip.outiface, "eth0"); 26 | strcpy(e->ip.iniface, "veth1"); 27 | 28 | struct xt_standard_target* target = (struct xt_standard_target *) e->elems; 29 | target->target.u.target_size = XT_ALIGN(sizeof(struct xt_standard_target)); 30 | strncpy(target->target.u.user.name, "ACCEPT", strlen("ACCEPT") + 1); 31 | target->target.u.user.revision = 0; 32 | target->verdict = -NF_ACCEPT - 1; 33 | 34 | if (iptc_append_entry("FORWARD", e, h) == 0) { 35 | printf("iptc_append_entry::Error insert/append entry: %s\n", iptc_strerror(errno)); 36 | result = -1; 37 | goto end; 38 | } 39 | if (iptc_commit(h) == 0) { 40 | printf("iptc_commit::Error commit: %s\n", iptc_strerror(errno)); 41 | result = -1; 42 | } 43 | 44 | end: 45 | free(e); 46 | iptc_free(h); 47 | return result; 48 | } 49 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # Netlink Examples 2 | 3 | Some low-level examples of the Linux Netlink interface. 4 | 5 | 1. __pair__ create a virtual ethernet pair 6 | 2. __link_address__ create a pair and add an address 7 | 3. __refactor__ rewrite link_address in a more concise manner 8 | 4. __namespace__ new network namespace, code courtesy iproute2 9 | 5. __pair_ns__ move the virtual peer into the network namespace 10 | 6. __ns_addr__ add an address to a virtual peer in a namespace 11 | 7. __ns_gw__ add a default route in the namespace and turn on the links 12 | 8. __masquerade__ a libiptc example to add a masquerade route 13 | 9. __forward__ a libiptc module to add forwarding rules 14 | 10. __final__ Combine it all into a single binary 15 | 16 | You're going to need a C compiler, GNU Make, and `iptables-devel` or `iptables-dev` 17 | in order to compile the final output. 18 | 19 | The goal of this project is to recreate the following script: 20 | 21 | ``` 22 | #!/bin/bash 23 | 24 | ip link add veth1 type veth peer name vpeer1 25 | 26 | ip link set vpeer1 netns ns1 27 | 28 | ip addr add 172.16.1.1/24 dev veth1 29 | ip link set veth1 up 30 | 31 | ip netns exec ns1 ip addr add 172.16.1.2/24 dev vpeer1 32 | ip netns exec ns1 ip link set vpeer1 up 33 | ip netns exec ns1 ip link set lo up 34 | 35 | ip netns exec ns1 ip route add default via 172.16.1.1 36 | echo 1 > /proc/sys/net/ipv4/ip_forward 37 | 38 | iptables -t nat -A POSTROUTING -s 172.16.1.0/255.255.255.0 -o eth0 -j MASQUERADE 39 | 40 | iptables -A FORWARD -i eth0 -o veth1 -j ACCEPT 41 | iptables -A FORWARD -o eth0 -i veth1 -j ACCEPT 42 | ``` 43 | 44 | ## Further reading 45 | 46 | I found the following list very helpful when putting together this project 47 | 48 | - https://blogs.igalia.com/dpino/2016/04/10/network-namespaces/ 49 | - https://github.com/theodor96/iptc-dev 50 | - https://github.com/kenshin54/crane 51 | - https://strace.io/ 52 | -------------------------------------------------------------------------------- /src/masquerade.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | 10 | int main() 11 | { 12 | struct xtc_handle *h = iptc_init("nat"); 13 | int result = 0; 14 | if (!h) { 15 | printf( "error condition %s\n", iptc_strerror(errno)); 16 | return -1; 17 | } 18 | 19 | unsigned int targetOffset = XT_ALIGN(sizeof(struct ipt_entry)); 20 | unsigned int totalLen = targetOffset + XT_ALIGN(sizeof(struct xt_entry_target)) 21 | + XT_ALIGN(sizeof(struct nf_nat_ipv4_multi_range_compat)); 22 | 23 | struct ipt_entry* e = (struct ipt_entry *)calloc(1, totalLen); 24 | if(e == NULL) { 25 | printf("calloc failure :%s\n", strerror(errno)); 26 | return -1; 27 | } 28 | 29 | e->target_offset = targetOffset; 30 | e->next_offset = totalLen; 31 | strncpy(e->ip.outiface, "eth0", strlen("eth0") + 1); 32 | unsigned int ip, mask; 33 | inet_pton (AF_INET, "172.16.1.0", &ip); 34 | inet_pton (AF_INET, "255.255.255.0", &mask); 35 | e->ip.src.s_addr = ip; 36 | e->ip.smsk.s_addr = mask; 37 | 38 | struct xt_entry_target* target = (struct xt_entry_target *) e->elems; 39 | target->u.target_size = XT_ALIGN(sizeof(struct xt_entry_target)) 40 | + XT_ALIGN(sizeof(struct nf_nat_ipv4_multi_range_compat)); 41 | 42 | strncpy(target->u.user.name, "MASQUERADE", strlen("MASQUERADE") + 1); 43 | target->u.user.revision = 0; 44 | struct nf_nat_ipv4_multi_range_compat* masquerade = (struct nf_nat_ipv4_multi_range_compat *) target->data; 45 | masquerade->rangesize = 1; 46 | 47 | if (!iptc_append_entry("POSTROUTING", e, h)) { 48 | printf("iptc_append_entry::Error insert/append entry: %s\n", iptc_strerror(errno)); 49 | result = -1; 50 | goto end; 51 | } 52 | if (!iptc_commit(h)) { 53 | printf("iptc_commit::Error commit: %s\n", iptc_strerror(errno)); 54 | result = -1; 55 | } 56 | 57 | end: 58 | free(e); 59 | iptc_free(h); 60 | return result; 61 | } 62 | -------------------------------------------------------------------------------- /src/final/namespace.c: -------------------------------------------------------------------------------- 1 | #define _GNU_SOURCE 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include 11 | #include 12 | 13 | #include "namespace.h" 14 | 15 | int netns_get_fd(const char *name) 16 | { 17 | char pathbuf[PATH_MAX]; 18 | const char *path, *ptr; 19 | 20 | path = name; 21 | ptr = strchr(name, '/'); 22 | if (!ptr) { 23 | snprintf(pathbuf, sizeof(pathbuf), "%s/%s", 24 | NETNS_RUN_DIR, name ); 25 | path = pathbuf; 26 | } 27 | return open(path, O_RDONLY); 28 | } 29 | 30 | int new_ns(const char *name) 31 | { 32 | char netns_path[PATH_MAX]; 33 | int fd; 34 | int made_netns_run_dir_mount = 0; 35 | 36 | snprintf(netns_path, sizeof(netns_path), "%s/%s", NETNS_RUN_DIR, name); 37 | 38 | if (mkdir(NETNS_RUN_DIR, S_IRWXU|S_IRGRP|S_IXGRP|S_IROTH|S_IXOTH)) { 39 | if (errno != EEXIST) { 40 | fprintf(stderr, "mkdir %s failed: %s\n", 41 | NETNS_RUN_DIR, strerror(errno)); 42 | return -1; 43 | } 44 | } 45 | 46 | while (mount("", NETNS_RUN_DIR, "none", MS_SHARED | MS_REC, NULL)) { 47 | if (errno != EINVAL || made_netns_run_dir_mount) { 48 | fprintf(stderr, "mount --make-shared %s failed: %s\n", 49 | NETNS_RUN_DIR, strerror(errno)); 50 | return -1; 51 | } 52 | 53 | if (mount(NETNS_RUN_DIR, NETNS_RUN_DIR, "none", MS_BIND | MS_REC, NULL)) { 54 | fprintf(stderr, "mount --bind %s %s failed: %s\n", 55 | NETNS_RUN_DIR, NETNS_RUN_DIR, strerror(errno)); 56 | return -1; 57 | } 58 | made_netns_run_dir_mount = 1; 59 | } 60 | 61 | fd = open(netns_path, O_RDONLY|O_CREAT|O_EXCL, 0); 62 | if (fd < 0) { 63 | fprintf(stderr, "Cannot create namespace file \"%s\": %s\n", 64 | netns_path, strerror(errno)); 65 | return -1; 66 | } 67 | close(fd); 68 | if (unshare(CLONE_NEWNET) < 0) { 69 | fprintf(stderr, "Failed to create a new network namespace \"%s\": %s\n", 70 | name, strerror(errno)); 71 | goto out_delete; 72 | } 73 | 74 | if (mount("/proc/self/ns/net", netns_path, "none", MS_BIND, NULL) < 0) { 75 | fprintf(stderr, "Bind /proc/self/ns/net -> %s failed: %s\n", 76 | netns_path, strerror(errno)); 77 | goto out_delete; 78 | } 79 | return 0; 80 | out_delete: 81 | return -1; 82 | } 83 | -------------------------------------------------------------------------------- /src/namespace.c: -------------------------------------------------------------------------------- 1 | #define _GNU_SOURCE 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | #include 16 | #include 17 | #include 18 | #include 19 | 20 | #define NETNS_RUN_DIR "/var/run/netns" 21 | 22 | 23 | static int create_netns_dir(void) 24 | { 25 | if (mkdir(NETNS_RUN_DIR, S_IRWXU|S_IRGRP|S_IXGRP|S_IROTH|S_IXOTH)) { 26 | if (errno != EEXIST) { 27 | fprintf(stderr, "mkdir %s failed: %s\n", 28 | NETNS_RUN_DIR, strerror(errno)); 29 | return -1; 30 | } 31 | } 32 | 33 | return 0; 34 | } 35 | 36 | int main(void) 37 | { 38 | char netns_path[PATH_MAX]; 39 | const char *name = "ns1"; 40 | int fd; 41 | int made_netns_run_dir_mount = 0; 42 | 43 | snprintf(netns_path, sizeof(netns_path), "%s/%s", NETNS_RUN_DIR, name); 44 | 45 | if (create_netns_dir()) 46 | return -1; 47 | 48 | while (mount("", NETNS_RUN_DIR, "none", MS_SHARED | MS_REC, NULL)) { 49 | if (errno != EINVAL || made_netns_run_dir_mount) { 50 | fprintf(stderr, "mount --make-shared %s failed: %s\n", 51 | NETNS_RUN_DIR, strerror(errno)); 52 | return -1; 53 | } 54 | 55 | if (mount(NETNS_RUN_DIR, NETNS_RUN_DIR, "none", MS_BIND | MS_REC, NULL)) { 56 | fprintf(stderr, "mount --bind %s %s failed: %s\n", 57 | NETNS_RUN_DIR, NETNS_RUN_DIR, strerror(errno)); 58 | return -1; 59 | } 60 | made_netns_run_dir_mount = 1; 61 | } 62 | 63 | fd = open(netns_path, O_RDONLY|O_CREAT|O_EXCL, 0); 64 | if (fd < 0) { 65 | fprintf(stderr, "Cannot create namespace file \"%s\": %s\n", 66 | netns_path, strerror(errno)); 67 | return -1; 68 | } 69 | close(fd); 70 | if (unshare(CLONE_NEWNET) < 0) { 71 | fprintf(stderr, "Failed to create a new network namespace \"%s\": %s\n", 72 | name, strerror(errno)); 73 | goto out_delete; 74 | } 75 | 76 | if (mount("/proc/self/ns/net", netns_path, "none", MS_BIND, NULL) < 0) { 77 | fprintf(stderr, "Bind /proc/self/ns/net -> %s failed: %s\n", 78 | netns_path, strerror(errno)); 79 | goto out_delete; 80 | } 81 | return 0; 82 | out_delete: 83 | return -1; 84 | } 85 | -------------------------------------------------------------------------------- /src/final/nl.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | 8 | #include 9 | #include 10 | #include 11 | 12 | #include "nl.h" 13 | 14 | void _nlmsg_put(struct nlmsghdr *nlmsg, int type, void *data, size_t len) 15 | { 16 | struct rtattr *rta; 17 | size_t rtalen = RTA_LENGTH(len); 18 | rta = NLMSG_TAIL(nlmsg); 19 | rta->rta_type = type; 20 | rta->rta_len = rtalen; 21 | if (data) 22 | memcpy(RTA_DATA(rta), data, len); 23 | nlmsg->nlmsg_len = NLMSG_ALIGN(nlmsg->nlmsg_len) + RTA_ALIGN(rtalen); 24 | } 25 | 26 | int _nlmsg_send(int fd, struct nlmsghdr *nlmsg) 27 | { 28 | struct sockaddr_nl *sa = malloc(sizeof(struct sockaddr_nl)); 29 | memset(sa, 0, sizeof(struct sockaddr_nl)); 30 | sa->nl_family = AF_NETLINK; 31 | 32 | struct iovec iov = { nlmsg, nlmsg->nlmsg_len }; 33 | struct msghdr msg = { sa, sizeof(*sa), &iov, 1, NULL, 0, 0 }; 34 | 35 | if (sendmsg(fd, &msg, 0) < 0) { 36 | fprintf(stderr, "failed to get socket: %s\n", strerror(errno)); 37 | return 1; 38 | } 39 | 40 | return 0; 41 | } 42 | int _nlmsg_recieve(int fd) 43 | { 44 | struct sockaddr_nl *sa = malloc(sizeof(struct sockaddr_nl)); 45 | memset(sa, 0, sizeof(struct sockaddr_nl)); 46 | sa->nl_family = AF_NETLINK; 47 | 48 | int len = 4096; 49 | char buf[len]; 50 | struct iovec iov = { buf, len }; 51 | struct msghdr msg = { sa, sizeof(*sa), &iov, 1, NULL, 0, 0 }; 52 | 53 | recvmsg(fd, &msg, 0); 54 | struct nlmsghdr *ret = (struct nlmsghdr*)buf; 55 | if (ret->nlmsg_type == NLMSG_ERROR) { 56 | struct nlmsgerr *err = (struct nlmsgerr*)NLMSG_DATA(ret); 57 | if (err->error < 0) { 58 | fprintf(stderr, "recieve error: %d\n", err->error); 59 | return 1; 60 | } 61 | } else { 62 | fprintf(stderr, "invalid recieve type\n"); 63 | return 1; 64 | } 65 | 66 | return 0; 67 | } 68 | 69 | int _nl_socket_init(void) 70 | { 71 | int fd = 0; 72 | if ((fd = socket(AF_NETLINK, SOCK_RAW, NETLINK_ROUTE)) < 0) { 73 | fprintf(stderr, "failed to get socket: %s\n", strerror(errno)); 74 | return 0; 75 | } 76 | 77 | int sndbuf = 32768; 78 | int rcvbuf = 32768; 79 | if (setsockopt(fd, SOL_SOCKET, SO_SNDBUF, 80 | &sndbuf, sizeof(sndbuf)) < 0) { 81 | fprintf(stderr, "failed to set send buffer: %s\n", strerror(errno)); 82 | return 0; 83 | } 84 | if (setsockopt(fd, SOL_SOCKET, SO_RCVBUF, 85 | &rcvbuf,sizeof(rcvbuf)) < 0) { 86 | fprintf(stderr, "failed to set recieve buffer: %s\n", strerror(errno)); 87 | return 0; 88 | } 89 | struct sockaddr_nl *sa = malloc(sizeof(struct sockaddr_nl)); 90 | memset(sa, 0, sizeof(struct sockaddr_nl)); 91 | sa->nl_family = AF_NETLINK; 92 | sa->nl_groups = 0; 93 | if (bind(fd, (struct sockaddr *) sa, sizeof(struct sockaddr)) < 0) { 94 | fprintf(stderr, "failed to bind socket: %s\n", strerror(errno)); 95 | return 0; 96 | } 97 | 98 | return fd; 99 | } 100 | 101 | -------------------------------------------------------------------------------- /src/final/fw.c: -------------------------------------------------------------------------------- 1 | 2 | #define _DEFAULT_SOURCE 1 3 | #include 4 | #include 5 | #include 6 | #include 7 | 8 | #include 9 | #include 10 | #include 11 | #include 12 | 13 | #include "fw.h" 14 | 15 | struct _addr_t * _init_addr(const char *ip) 16 | { 17 | struct _addr_t *addr = malloc(sizeof(struct _addr_t)); 18 | memset(addr, 0, sizeof(struct _addr_t)); 19 | 20 | char *readdr, *prefix, *ptr; 21 | 22 | ptr = strrchr(ip, '/'); 23 | prefix = strdup(ptr); prefix++; 24 | unsigned long mask = (0xFFFFFFFF << (32 - (unsigned int) atoi(prefix))) & 0xFFFFFFFF; 25 | 26 | readdr = strdup(ip); 27 | readdr[strlen(ip) - strlen(ptr)] = '\0'; 28 | unsigned int i; 29 | inet_pton(AF_INET, readdr, &i); 30 | addr->addr = i; 31 | addr->mask = htonl(mask); 32 | return addr; 33 | } 34 | 35 | void _free_addr(struct _addr_t *addr) 36 | { 37 | free(addr); 38 | } 39 | 40 | int _ipt_rule(struct _rule *rule) 41 | { 42 | if (!rule->table) 43 | return -1; 44 | if (!rule->type) 45 | return -1; 46 | if (!rule->entry) 47 | return -1; 48 | struct xtc_handle *h = iptc_init(rule->table); 49 | int result = 0; 50 | 51 | if (!h) { 52 | printf( "error condition %s\n", iptc_strerror(errno)); 53 | return -1; 54 | } 55 | 56 | unsigned int targetOffset = XT_ALIGN(sizeof(struct ipt_entry)); 57 | unsigned int totalLen = targetOffset + XT_ALIGN(sizeof(struct xt_standard_target)); 58 | 59 | if (strcmp(rule->type, "MASQUERADE") == 0) 60 | totalLen += XT_ALIGN(sizeof(struct nf_nat_ipv4_multi_range_compat)); 61 | 62 | struct ipt_entry* e = (struct ipt_entry *)calloc(1, totalLen); 63 | if (e == NULL) { 64 | printf("calloc failure :%s\n", strerror(errno)); 65 | return -1; 66 | } 67 | 68 | e->target_offset = targetOffset; 69 | e->next_offset = totalLen; 70 | 71 | if (rule->oface) 72 | strncpy(e->ip.outiface, rule->oface, strlen(rule->oface) + 1); 73 | if (rule->iface) 74 | strncpy(e->ip.iniface, rule->iface, strlen(rule->iface) + 1); 75 | 76 | if (rule->saddr) { 77 | struct _addr_t *addr = _init_addr(rule->saddr); 78 | e->ip.src.s_addr = addr->addr; 79 | e->ip.smsk.s_addr = addr->mask; 80 | _free_addr(addr); 81 | } 82 | if (rule->daddr) { 83 | struct _addr_t *addr = _init_addr(rule->daddr); 84 | e->ip.dst.s_addr = addr->addr; 85 | e->ip.dmsk.s_addr = addr->mask; 86 | _free_addr(addr); 87 | } 88 | 89 | if (strcmp(rule->type, "MASQUERADE") == 0) { 90 | struct xt_entry_target* target = (struct xt_entry_target *) e->elems; 91 | target->u.target_size = XT_ALIGN(sizeof(struct xt_entry_target)) 92 | + XT_ALIGN(sizeof(struct nf_nat_ipv4_multi_range_compat)); 93 | strncpy(target->u.user.name, rule->type, strlen(rule->type) + 1); 94 | target->u.user.revision = 0; 95 | struct nf_nat_ipv4_multi_range_compat* masquerade = (struct nf_nat_ipv4_multi_range_compat *) target->data; 96 | masquerade->rangesize = 1; 97 | } else { 98 | struct xt_standard_target* target = (struct xt_standard_target *) e->elems; 99 | target->target.u.target_size = XT_ALIGN(sizeof(struct xt_standard_target)); 100 | strncpy(target->target.u.user.name, rule->type, strlen(rule->type) + 1); 101 | target->target.u.user.revision = 0; 102 | target->verdict = -NF_ACCEPT - 1; 103 | } 104 | 105 | if (iptc_append_entry(rule->entry, e, h) == 0) { 106 | printf("iptc_append_entry::Error insert/append entry: %s\n", iptc_strerror(errno)); 107 | result = -1; 108 | goto end; 109 | } 110 | if (iptc_commit(h) == 0) { 111 | printf("iptc_commit::Error commit: %s\n", iptc_strerror(errno)); 112 | result = -1; 113 | } 114 | 115 | end: 116 | free(e); 117 | iptc_free(h); 118 | return result; 119 | } 120 | 121 | -------------------------------------------------------------------------------- /src/pair.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include 11 | 12 | #ifndef VETH_INFO_PEER 13 | #define VETH_INFO_PEER 1 14 | #endif 15 | 16 | #define NLMSG_TAIL(nmsg) \ 17 | ((struct rtattr *) (((void *) (nmsg)) + NLMSG_ALIGN((nmsg)->nlmsg_len))) 18 | 19 | int main(void) 20 | { 21 | int fd = 0; 22 | if ((fd = socket(AF_NETLINK, SOCK_RAW, NETLINK_ROUTE)) < 0) { 23 | fprintf(stderr, "failed to get socket: %s\n", strerror(errno)); 24 | exit(1); 25 | } 26 | 27 | struct sockaddr_nl *sa = malloc(sizeof(struct sockaddr_nl)); 28 | memset(sa, 0, sizeof(struct sockaddr_nl)); 29 | sa->nl_family = AF_NETLINK; 30 | 31 | struct nlmsghdr *nlmsg = malloc(4096); 32 | memset(nlmsg, 0, 4096); 33 | nlmsg->nlmsg_len = NLMSG_LENGTH(sizeof(struct ifinfomsg)); 34 | nlmsg->nlmsg_type = RTM_NEWLINK; 35 | nlmsg->nlmsg_flags = NLM_F_REQUEST|NLM_F_CREATE|NLM_F_EXCL|NLM_F_ACK; 36 | nlmsg->nlmsg_seq = time(NULL); 37 | 38 | struct ifinfomsg *ifmsg; 39 | ifmsg = (struct ifinfomsg *) NLMSG_DATA(nlmsg); 40 | ifmsg->ifi_family = AF_UNSPEC; 41 | 42 | struct rtattr *rta, *nest1, *nest2, *nest3; 43 | size_t rtalen; 44 | 45 | rta = NLMSG_TAIL(nlmsg); 46 | rtalen = RTA_LENGTH(strlen("veth1") + 1); 47 | rta->rta_type = IFLA_IFNAME; 48 | rta->rta_len = rtalen; 49 | memcpy(RTA_DATA(rta), "veth1", strlen("veth1") + 1); 50 | nlmsg->nlmsg_len = NLMSG_ALIGN(nlmsg->nlmsg_len) + RTA_ALIGN(rtalen); 51 | 52 | nest1 = NLMSG_TAIL(nlmsg); 53 | rta = NLMSG_TAIL(nlmsg); 54 | rtalen = RTA_LENGTH(0); 55 | rta->rta_type = IFLA_LINKINFO; 56 | rta->rta_len = rtalen; 57 | nlmsg->nlmsg_len = NLMSG_ALIGN(nlmsg->nlmsg_len) + RTA_ALIGN(rtalen); 58 | 59 | rta = NLMSG_TAIL(nlmsg); 60 | rtalen = RTA_LENGTH(strlen("veth") + 1); 61 | rta->rta_type = IFLA_INFO_KIND; 62 | rta->rta_len = rtalen; 63 | memcpy(RTA_DATA(rta), "veth", strlen("veth") + 1); 64 | nlmsg->nlmsg_len = NLMSG_ALIGN(nlmsg->nlmsg_len) + RTA_ALIGN(rtalen); 65 | 66 | nest2 = NLMSG_TAIL(nlmsg); 67 | rta = NLMSG_TAIL(nlmsg); 68 | rta->rta_type = IFLA_INFO_DATA; 69 | rtalen = RTA_LENGTH(0); 70 | rta->rta_len = rtalen; 71 | nlmsg->nlmsg_len = NLMSG_ALIGN(nlmsg->nlmsg_len) + RTA_ALIGN(rtalen); 72 | 73 | nest3 = NLMSG_TAIL(nlmsg); 74 | rta = NLMSG_TAIL(nlmsg); 75 | rta->rta_type = VETH_INFO_PEER; 76 | rtalen = RTA_LENGTH(0); 77 | rta->rta_len = rtalen; 78 | nlmsg->nlmsg_len = NLMSG_ALIGN(nlmsg->nlmsg_len) + RTA_ALIGN(rtalen); 79 | 80 | nlmsg->nlmsg_len += sizeof(struct ifinfomsg); 81 | 82 | rta = NLMSG_TAIL(nlmsg); 83 | rtalen = RTA_LENGTH(strlen("vpeer1") + 1); 84 | rta->rta_type = IFLA_IFNAME; 85 | rta->rta_len = rtalen; 86 | memcpy(RTA_DATA(rta), "vpeer1", strlen("vpeer1") + 1); 87 | nlmsg->nlmsg_len = NLMSG_ALIGN(nlmsg->nlmsg_len) + RTA_ALIGN(rtalen); 88 | 89 | nest3->rta_len = (void *)NLMSG_TAIL(nlmsg) - (void *)nest3; 90 | nest2->rta_len = (void *)NLMSG_TAIL(nlmsg) - (void *)nest2; 91 | nest1->rta_len = (void *)NLMSG_TAIL(nlmsg) - (void *)nest1; 92 | 93 | struct iovec iov = { nlmsg, nlmsg->nlmsg_len }; 94 | struct msghdr msg = { sa, sizeof(*sa), &iov, 1, NULL, 0, 0 }; 95 | 96 | if (sendmsg(fd, &msg, 0) < 0) { 97 | fprintf(stderr, "failed to get socket: %s\n", strerror(errno)); 98 | exit(1); 99 | } 100 | 101 | int len = 4096; 102 | char buf[len]; 103 | iov.iov_base = buf; 104 | iov.iov_len = len; 105 | 106 | memset(&msg, 0, sizeof(msg)); 107 | msg.msg_name = sa; 108 | msg.msg_namelen = sizeof(*sa); 109 | msg.msg_iov = &iov; 110 | msg.msg_iovlen = 1; 111 | 112 | recvmsg(fd, &msg, 0); 113 | close(fd); 114 | struct nlmsghdr *ret = (struct nlmsghdr*)buf; 115 | if (ret->nlmsg_type == NLMSG_ERROR) { 116 | struct nlmsgerr *err = (struct nlmsgerr*)NLMSG_DATA(ret); 117 | if (err->error < 0) { 118 | printf("error: %d\n, failed to create links\n", err->error); 119 | return 1; 120 | } 121 | } else { 122 | printf("failed to create links\n"); 123 | return 1; 124 | } 125 | 126 | return 0; 127 | } 128 | -------------------------------------------------------------------------------- /src/refactor.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include 11 | 12 | #ifndef VETH_INFO_PEER 13 | #define VETH_INFO_PEER 1 14 | #endif 15 | 16 | #define NLMSG_TAIL(nmsg) \ 17 | ((struct rtattr *) (((void *) (nmsg)) + NLMSG_ALIGN((nmsg)->nlmsg_len))) 18 | 19 | void _nlmsg_put(struct nlmsghdr *nlmsg, int type, void *data, size_t len) 20 | { 21 | struct rtattr *rta; 22 | size_t rtalen = RTA_LENGTH(len); 23 | rta = NLMSG_TAIL(nlmsg); 24 | rta->rta_type = type; 25 | rta->rta_len = rtalen; 26 | if (data) 27 | memcpy(RTA_DATA(rta), data, len); 28 | nlmsg->nlmsg_len = NLMSG_ALIGN(nlmsg->nlmsg_len) + RTA_ALIGN(rtalen); 29 | } 30 | 31 | #define NLMSG_STRING(nl, attr, data) \ 32 | _nlmsg_put((nl), (attr), (data), (strlen((data)) + 1)) 33 | #define NLMSG_ATTR(nl, attr) \ 34 | _nlmsg_put((nl), (attr), (NULL), (0)) 35 | 36 | int _nlmsg_send(int fd, struct nlmsghdr *nlmsg) 37 | { 38 | struct sockaddr_nl *sa = malloc(sizeof(struct sockaddr_nl)); 39 | memset(sa, 0, sizeof(struct sockaddr_nl)); 40 | sa->nl_family = AF_NETLINK; 41 | 42 | struct iovec iov = { nlmsg, nlmsg->nlmsg_len }; 43 | struct msghdr msg = { sa, sizeof(*sa), &iov, 1, NULL, 0, 0 }; 44 | 45 | if (sendmsg(fd, &msg, 0) < 0) { 46 | fprintf(stderr, "failed to get socket: %s\n", strerror(errno)); 47 | return 1; 48 | } 49 | 50 | return 0; 51 | } 52 | int _nlmsg_recieve(int fd) 53 | { 54 | struct sockaddr_nl *sa = malloc(sizeof(struct sockaddr_nl)); 55 | memset(sa, 0, sizeof(struct sockaddr_nl)); 56 | sa->nl_family = AF_NETLINK; 57 | 58 | int len = 4096; 59 | char buf[len]; 60 | struct iovec iov = { buf, len }; 61 | struct msghdr msg = { sa, sizeof(*sa), &iov, 1, NULL, 0, 0 }; 62 | 63 | recvmsg(fd, &msg, 0); 64 | struct nlmsghdr *ret = (struct nlmsghdr*)buf; 65 | if (ret->nlmsg_type == NLMSG_ERROR) { 66 | struct nlmsgerr *err = (struct nlmsgerr*)NLMSG_DATA(ret); 67 | if (err->error < 0) { 68 | fprintf(stderr, "recieve error: %d\n", err->error); 69 | return 1; 70 | } 71 | } else { 72 | fprintf(stderr, "invalid recieve type\n"); 73 | return 1; 74 | } 75 | 76 | return 0; 77 | } 78 | 79 | int main(void) 80 | { 81 | int fd = 0; 82 | if ((fd = socket(AF_NETLINK, SOCK_RAW, NETLINK_ROUTE)) < 0) { 83 | fprintf(stderr, "failed to get socket: %s\n", strerror(errno)); 84 | exit(1); 85 | } 86 | 87 | int sndbuf = 32768; 88 | int rcvbuf = 32768; 89 | if (setsockopt(fd, SOL_SOCKET, SO_SNDBUF, 90 | &sndbuf, sizeof(sndbuf)) < 0) { 91 | fprintf(stderr, "failed to set send buffer: %s\n", strerror(errno)); 92 | exit(1); 93 | } 94 | if (setsockopt(fd, SOL_SOCKET, SO_RCVBUF, 95 | &rcvbuf,sizeof(rcvbuf)) < 0) { 96 | fprintf(stderr, "failed to set recieve buffer: %s\n", strerror(errno)); 97 | exit(1); 98 | } 99 | struct sockaddr_nl *sa = malloc(sizeof(struct sockaddr_nl)); 100 | memset(sa, 0, sizeof(struct sockaddr_nl)); 101 | sa->nl_family = AF_NETLINK; 102 | sa->nl_groups = 0; 103 | if (bind(fd, (struct sockaddr *) sa, sizeof(struct sockaddr)) < 0) { 104 | fprintf(stderr, "failed to bind socket: %s\n", strerror(errno)); 105 | exit(1); 106 | } 107 | 108 | 109 | struct nlmsghdr *nlmsg = malloc(4096); 110 | memset(nlmsg, 0, 4096); 111 | nlmsg->nlmsg_len = NLMSG_LENGTH(sizeof(struct ifinfomsg)); 112 | nlmsg->nlmsg_type = RTM_NEWLINK; 113 | nlmsg->nlmsg_flags = NLM_F_REQUEST|NLM_F_CREATE|NLM_F_EXCL|NLM_F_ACK; 114 | nlmsg->nlmsg_seq = time(NULL); 115 | 116 | struct ifinfomsg *ifmsg; 117 | ifmsg = (struct ifinfomsg *) NLMSG_DATA(nlmsg); 118 | ifmsg->ifi_family = AF_UNSPEC; 119 | 120 | struct rtattr *nest1, *nest2, *nest3; 121 | 122 | NLMSG_STRING(nlmsg, IFLA_IFNAME, "veth1"); 123 | 124 | nest1 = NLMSG_TAIL(nlmsg); 125 | NLMSG_ATTR(nlmsg, IFLA_LINKINFO); 126 | 127 | NLMSG_STRING(nlmsg, IFLA_INFO_KIND, "veth"); 128 | 129 | nest2 = NLMSG_TAIL(nlmsg); 130 | NLMSG_ATTR(nlmsg, IFLA_INFO_DATA); 131 | 132 | nest3 = NLMSG_TAIL(nlmsg); 133 | NLMSG_ATTR(nlmsg, VETH_INFO_PEER); 134 | 135 | nlmsg->nlmsg_len += sizeof(struct ifinfomsg); 136 | 137 | NLMSG_STRING(nlmsg, IFLA_IFNAME, "vpeer1"); 138 | 139 | nest3->rta_len = (void *)NLMSG_TAIL(nlmsg) - (void *)nest3; 140 | nest2->rta_len = (void *)NLMSG_TAIL(nlmsg) - (void *)nest2; 141 | nest1->rta_len = (void *)NLMSG_TAIL(nlmsg) - (void *)nest1; 142 | 143 | if (_nlmsg_send(fd, nlmsg) != 0) 144 | exit(1); 145 | 146 | if (_nlmsg_recieve(fd) != 0) { 147 | close(fd); 148 | exit(1); 149 | } 150 | 151 | int addrlen = sizeof(struct in_addr); 152 | 153 | free(nlmsg); 154 | nlmsg = malloc(4096); 155 | memset(nlmsg, 0, 4096); 156 | nlmsg->nlmsg_len = NLMSG_LENGTH(sizeof(struct ifaddrmsg)); 157 | nlmsg->nlmsg_flags = NLM_F_ACK|NLM_F_REQUEST|NLM_F_CREATE|NLM_F_EXCL; 158 | nlmsg->nlmsg_type = RTM_NEWADDR; 159 | nlmsg->nlmsg_seq = time(NULL); 160 | 161 | struct ifaddrmsg *ifa; 162 | ifa = (struct ifaddrmsg *) NLMSG_DATA(nlmsg); 163 | ifa->ifa_prefixlen = atoi("24"); 164 | if (!(ifa->ifa_index = if_nametoindex("veth1"))) { 165 | printf("failed to get veth1 name: %s\n", strerror(errno)); 166 | return 1; 167 | } 168 | ifa->ifa_family = AF_INET; 169 | ifa->ifa_scope = 0; 170 | 171 | struct in_addr addr; 172 | struct in_addr bcast; 173 | 174 | if (inet_pton(AF_INET, "172.16.1.1", &addr) < 0) 175 | exit(1); 176 | if (inet_pton(AF_INET, "172.16.1.255", &bcast) < 0) 177 | exit(1); 178 | 179 | _nlmsg_put(nlmsg, IFA_LOCAL, &addr, addrlen); 180 | _nlmsg_put(nlmsg, IFA_ADDRESS, &addr, addrlen); 181 | _nlmsg_put(nlmsg, IFA_BROADCAST, &bcast, addrlen); 182 | 183 | if (_nlmsg_send(fd, nlmsg) != 0) 184 | exit(1); 185 | if (_nlmsg_recieve(fd) != 0) { 186 | close(fd); 187 | exit(1); 188 | } 189 | 190 | return 0; 191 | } 192 | -------------------------------------------------------------------------------- /src/link_address.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include 11 | 12 | #ifndef VETH_INFO_PEER 13 | #define VETH_INFO_PEER 1 14 | #endif 15 | 16 | #define NLMSG_TAIL(nmsg) \ 17 | ((struct rtattr *) (((void *) (nmsg)) + NLMSG_ALIGN((nmsg)->nlmsg_len))) 18 | 19 | int main(void) 20 | { 21 | int fd = 0; 22 | if ((fd = socket(AF_NETLINK, SOCK_RAW, NETLINK_ROUTE)) < 0) { 23 | fprintf(stderr, "failed to get socket: %s\n", strerror(errno)); 24 | exit(1); 25 | } 26 | 27 | struct sockaddr_nl *sa = malloc(sizeof(struct sockaddr_nl)); 28 | memset(sa, 0, sizeof(struct sockaddr_nl)); 29 | sa->nl_family = AF_NETLINK; 30 | 31 | struct nlmsghdr *nlmsg = malloc(4096); 32 | memset(nlmsg, 0, 4096); 33 | nlmsg->nlmsg_len = NLMSG_LENGTH(sizeof(struct ifinfomsg)); 34 | nlmsg->nlmsg_type = RTM_NEWLINK; 35 | nlmsg->nlmsg_flags = NLM_F_REQUEST|NLM_F_CREATE|NLM_F_EXCL|NLM_F_ACK; 36 | nlmsg->nlmsg_seq = time(NULL); 37 | 38 | struct ifinfomsg *ifmsg; 39 | ifmsg = (struct ifinfomsg *) NLMSG_DATA(nlmsg); 40 | ifmsg->ifi_family = AF_UNSPEC; 41 | 42 | struct rtattr *rta, *nest1, *nest2, *nest3; 43 | size_t rtalen; 44 | 45 | rta = NLMSG_TAIL(nlmsg); 46 | rtalen = RTA_LENGTH(strlen("veth1") + 1); 47 | rta->rta_type = IFLA_IFNAME; 48 | rta->rta_len = rtalen; 49 | memcpy(RTA_DATA(rta), "veth1", strlen("veth1") + 1); 50 | nlmsg->nlmsg_len = NLMSG_ALIGN(nlmsg->nlmsg_len) + RTA_ALIGN(rtalen); 51 | 52 | nest1 = NLMSG_TAIL(nlmsg); 53 | rta = NLMSG_TAIL(nlmsg); 54 | rtalen = RTA_LENGTH(0); 55 | rta->rta_type = IFLA_LINKINFO; 56 | rta->rta_len = rtalen; 57 | nlmsg->nlmsg_len = NLMSG_ALIGN(nlmsg->nlmsg_len) + RTA_ALIGN(rtalen); 58 | 59 | rta = NLMSG_TAIL(nlmsg); 60 | rtalen = RTA_LENGTH(strlen("veth") + 1); 61 | rta->rta_type = IFLA_INFO_KIND; 62 | rta->rta_len = rtalen; 63 | memcpy(RTA_DATA(rta), "veth", strlen("veth") + 1); 64 | nlmsg->nlmsg_len = NLMSG_ALIGN(nlmsg->nlmsg_len) + RTA_ALIGN(rtalen); 65 | 66 | nest2 = NLMSG_TAIL(nlmsg); 67 | rta = NLMSG_TAIL(nlmsg); 68 | rta->rta_type = IFLA_INFO_DATA; 69 | rtalen = RTA_LENGTH(0); 70 | rta->rta_len = rtalen; 71 | nlmsg->nlmsg_len = NLMSG_ALIGN(nlmsg->nlmsg_len) + RTA_ALIGN(rtalen); 72 | 73 | nest3 = NLMSG_TAIL(nlmsg); 74 | rta = NLMSG_TAIL(nlmsg); 75 | rta->rta_type = VETH_INFO_PEER; 76 | rtalen = RTA_LENGTH(0); 77 | rta->rta_len = rtalen; 78 | nlmsg->nlmsg_len = NLMSG_ALIGN(nlmsg->nlmsg_len) + RTA_ALIGN(rtalen); 79 | 80 | nlmsg->nlmsg_len += sizeof(struct ifinfomsg); 81 | 82 | rta = NLMSG_TAIL(nlmsg); 83 | rtalen = RTA_LENGTH(strlen("vpeer1") + 1); 84 | rta->rta_type = IFLA_IFNAME; 85 | rta->rta_len = rtalen; 86 | memcpy(RTA_DATA(rta), "vpeer1", strlen("vpeer1") + 1); 87 | nlmsg->nlmsg_len = NLMSG_ALIGN(nlmsg->nlmsg_len) + RTA_ALIGN(rtalen); 88 | 89 | nest3->rta_len = (void *)NLMSG_TAIL(nlmsg) - (void *)nest3; 90 | nest2->rta_len = (void *)NLMSG_TAIL(nlmsg) - (void *)nest2; 91 | nest1->rta_len = (void *)NLMSG_TAIL(nlmsg) - (void *)nest1; 92 | 93 | struct iovec iov = { nlmsg, nlmsg->nlmsg_len }; 94 | struct msghdr msg = { sa, sizeof(*sa), &iov, 1, NULL, 0, 0 }; 95 | 96 | if (sendmsg(fd, &msg, 0) < 0) { 97 | fprintf(stderr, "failed to get socket: %s\n", strerror(errno)); 98 | exit(1); 99 | } 100 | 101 | int len = 4096; 102 | char buf[len]; 103 | iov.iov_base = buf; 104 | iov.iov_len = len; 105 | 106 | memset(&msg, 0, sizeof(msg)); 107 | msg.msg_name = sa; 108 | msg.msg_namelen = sizeof(*sa); 109 | msg.msg_iov = &iov; 110 | msg.msg_iovlen = 1; 111 | 112 | recvmsg(fd, &msg, 0); 113 | // close(fd); 114 | struct nlmsghdr *ret = (struct nlmsghdr*)buf; 115 | if (ret->nlmsg_type == NLMSG_ERROR) { 116 | struct nlmsgerr *err = (struct nlmsgerr*)NLMSG_DATA(ret); 117 | if (err->error < 0) { 118 | printf("error: %d, failed to create links\n", err->error); 119 | return 1; 120 | } 121 | } else { 122 | printf("failed to create links\n"); 123 | return 1; 124 | } 125 | 126 | int addrlen = sizeof(struct in_addr); 127 | 128 | free(nlmsg); 129 | nlmsg = malloc(4096); 130 | memset(nlmsg, 0, 4096); 131 | nlmsg->nlmsg_len = NLMSG_LENGTH(sizeof(struct ifaddrmsg)); 132 | nlmsg->nlmsg_flags = NLM_F_ACK|NLM_F_REQUEST|NLM_F_CREATE|NLM_F_EXCL; 133 | nlmsg->nlmsg_type = RTM_NEWADDR; 134 | nlmsg->nlmsg_seq = time(NULL); 135 | 136 | struct ifaddrmsg *ifa; 137 | ifa = (struct ifaddrmsg *) NLMSG_DATA(nlmsg); 138 | ifa->ifa_prefixlen = atoi("24"); 139 | if (!(ifa->ifa_index = if_nametoindex("veth1"))) { 140 | printf("failed to get veth1 name: %s\n", strerror(errno)); 141 | return 1; 142 | } 143 | ifa->ifa_family = AF_INET; 144 | ifa->ifa_scope = 0; 145 | 146 | rtalen = RTA_LENGTH(addrlen); 147 | 148 | struct in_addr addr; 149 | struct in_addr bcast; 150 | 151 | if (inet_pton(AF_INET, "172.16.1.1", &addr) < 0) { 152 | return -1; 153 | } 154 | if (inet_pton(AF_INET, "172.16.1.255", &bcast) < 0) { 155 | return -1; 156 | } 157 | 158 | rta = NLMSG_TAIL(nlmsg); 159 | rta->rta_type = IFA_LOCAL; 160 | rta->rta_len = rtalen; 161 | memcpy(RTA_DATA(rta), &addr, addrlen); 162 | nlmsg->nlmsg_len = NLMSG_ALIGN(nlmsg->nlmsg_len) + RTA_ALIGN(rtalen); 163 | 164 | rta = NLMSG_TAIL(nlmsg); 165 | rta->rta_type = IFA_ADDRESS; 166 | rta->rta_len = rtalen; 167 | memcpy(RTA_DATA(rta), &addr, addrlen); 168 | nlmsg->nlmsg_len = NLMSG_ALIGN(nlmsg->nlmsg_len) + RTA_ALIGN(rtalen); 169 | 170 | rta = NLMSG_TAIL(nlmsg); 171 | rta->rta_type = IFA_BROADCAST; 172 | rta->rta_len = rtalen; 173 | memcpy(RTA_DATA(rta), &bcast, addrlen); 174 | nlmsg->nlmsg_len = NLMSG_ALIGN(nlmsg->nlmsg_len) + RTA_ALIGN(rtalen); 175 | 176 | iov.iov_base = nlmsg; 177 | iov.iov_len = nlmsg->nlmsg_len; 178 | 179 | memset(&msg, 0, sizeof(msg)); 180 | msg.msg_name = sa; 181 | msg.msg_namelen = sizeof(*sa); 182 | msg.msg_iov = &iov; 183 | msg.msg_iovlen = 1; 184 | 185 | if (sendmsg(fd, &msg, 0) < 0) { 186 | fprintf(stderr, "failed to get socket: %s\n", strerror(errno)); 187 | exit(1); 188 | } 189 | 190 | len = 4096; 191 | memset(buf, 0, len); 192 | iov.iov_base = buf; 193 | iov.iov_len = len; 194 | 195 | memset(&msg, 0, sizeof(msg)); 196 | msg.msg_name = sa; 197 | msg.msg_namelen = sizeof(*sa); 198 | msg.msg_iov = &iov; 199 | msg.msg_iovlen = 1; 200 | 201 | recvmsg(fd, &msg, 0); 202 | close(fd); 203 | ret = (struct nlmsghdr*)buf; 204 | if (ret->nlmsg_type == NLMSG_ERROR) { 205 | struct nlmsgerr *err = (struct nlmsgerr*)NLMSG_DATA(ret); 206 | if (err->error < 0) { 207 | printf("error: %d, failed to add address to veth1\n", err->error); 208 | return 1; 209 | } 210 | } else { 211 | printf("failed to create links\n"); 212 | return 1; 213 | } 214 | 215 | return 0; 216 | } 217 | -------------------------------------------------------------------------------- /src/pair_ns.c: -------------------------------------------------------------------------------- 1 | #define _GNU_SOURCE 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | #include 16 | #include 17 | #include 18 | #include 19 | 20 | #ifndef VETH_INFO_PEER 21 | #define VETH_INFO_PEER 1 22 | #endif 23 | 24 | #define NETNS_RUN_DIR "/run/netns" 25 | 26 | #define NLMSG_TAIL(nmsg) \ 27 | ((struct rtattr *) (((void *) (nmsg)) + NLMSG_ALIGN((nmsg)->nlmsg_len))) 28 | 29 | static void _nlmsg_put(struct nlmsghdr *nlmsg, int type, void *data, size_t len) 30 | { 31 | struct rtattr *rta; 32 | size_t rtalen = RTA_LENGTH(len); 33 | rta = NLMSG_TAIL(nlmsg); 34 | rta->rta_type = type; 35 | rta->rta_len = rtalen; 36 | if (data) 37 | memcpy(RTA_DATA(rta), data, len); 38 | nlmsg->nlmsg_len = NLMSG_ALIGN(nlmsg->nlmsg_len) + RTA_ALIGN(rtalen); 39 | } 40 | 41 | #define NLMSG_STRING(nl, attr, data) \ 42 | _nlmsg_put((nl), (attr), (data), (strlen((data)) + 1)) 43 | #define NLMSG_ATTR(nl, attr) \ 44 | _nlmsg_put((nl), (attr), (NULL), (0)) 45 | 46 | static int _nlmsg_send(int fd, struct nlmsghdr *nlmsg) 47 | { 48 | struct sockaddr_nl *sa = malloc(sizeof(struct sockaddr_nl)); 49 | memset(sa, 0, sizeof(struct sockaddr_nl)); 50 | sa->nl_family = AF_NETLINK; 51 | 52 | struct iovec iov = { nlmsg, nlmsg->nlmsg_len }; 53 | struct msghdr msg = { sa, sizeof(*sa), &iov, 1, NULL, 0, 0 }; 54 | 55 | if (sendmsg(fd, &msg, 0) < 0) { 56 | fprintf(stderr, "failed to get socket: %s\n", strerror(errno)); 57 | return 1; 58 | } 59 | 60 | return 0; 61 | } 62 | static int _nlmsg_recieve(int fd) 63 | { 64 | struct sockaddr_nl *sa = malloc(sizeof(struct sockaddr_nl)); 65 | memset(sa, 0, sizeof(struct sockaddr_nl)); 66 | sa->nl_family = AF_NETLINK; 67 | 68 | int len = 4096; 69 | char buf[len]; 70 | struct iovec iov = { buf, len }; 71 | struct msghdr msg = { sa, sizeof(*sa), &iov, 1, NULL, 0, 0 }; 72 | 73 | recvmsg(fd, &msg, 0); 74 | struct nlmsghdr *ret = (struct nlmsghdr*)buf; 75 | if (ret->nlmsg_type == NLMSG_ERROR) { 76 | struct nlmsgerr *err = (struct nlmsgerr*)NLMSG_DATA(ret); 77 | if (err->error < 0) { 78 | fprintf(stderr, "recieve error: %d\n", err->error); 79 | return 1; 80 | } 81 | } else { 82 | fprintf(stderr, "invalid recieve type\n"); 83 | return 1; 84 | } 85 | 86 | return 0; 87 | } 88 | 89 | static int create_netns_dir(void) 90 | { 91 | if (mkdir(NETNS_RUN_DIR, S_IRWXU|S_IRGRP|S_IXGRP|S_IROTH|S_IXOTH)) { 92 | if (errno != EEXIST) { 93 | fprintf(stderr, "mkdir %s failed: %s\n", 94 | NETNS_RUN_DIR, strerror(errno)); 95 | return -1; 96 | } 97 | } 98 | 99 | return 0; 100 | } 101 | 102 | int netns_get_fd(const char *name) 103 | { 104 | char pathbuf[PATH_MAX]; 105 | const char *path, *ptr; 106 | 107 | path = name; 108 | ptr = strchr(name, '/'); 109 | if (!ptr) { 110 | snprintf(pathbuf, sizeof(pathbuf), "%s/%s", 111 | NETNS_RUN_DIR, name ); 112 | path = pathbuf; 113 | } 114 | return open(path, O_RDONLY); 115 | } 116 | 117 | int new_ns(const char *name) 118 | { 119 | char netns_path[PATH_MAX]; 120 | int fd; 121 | int made_netns_run_dir_mount = 0; 122 | 123 | snprintf(netns_path, sizeof(netns_path), "%s/%s", NETNS_RUN_DIR, name); 124 | 125 | if (create_netns_dir()) 126 | return -1; 127 | 128 | while (mount("", NETNS_RUN_DIR, "none", MS_SHARED | MS_REC, NULL)) { 129 | if (errno != EINVAL || made_netns_run_dir_mount) { 130 | fprintf(stderr, "mount --make-shared %s failed: %s\n", 131 | NETNS_RUN_DIR, strerror(errno)); 132 | return -1; 133 | } 134 | 135 | if (mount(NETNS_RUN_DIR, NETNS_RUN_DIR, "none", MS_BIND | MS_REC, NULL)) { 136 | fprintf(stderr, "mount --bind %s %s failed: %s\n", 137 | NETNS_RUN_DIR, NETNS_RUN_DIR, strerror(errno)); 138 | return -1; 139 | } 140 | made_netns_run_dir_mount = 1; 141 | } 142 | 143 | fd = open(netns_path, O_RDONLY|O_CREAT|O_EXCL, 0); 144 | if (fd < 0) { 145 | fprintf(stderr, "Cannot create namespace file \"%s\": %s\n", 146 | netns_path, strerror(errno)); 147 | return -1; 148 | } 149 | close(fd); 150 | if (unshare(CLONE_NEWNET) < 0) { 151 | fprintf(stderr, "Failed to create a new network namespace \"%s\": %s\n", 152 | name, strerror(errno)); 153 | goto out_delete; 154 | } 155 | 156 | if (mount("/proc/self/ns/net", netns_path, "none", MS_BIND, NULL) < 0) { 157 | fprintf(stderr, "Bind /proc/self/ns/net -> %s failed: %s\n", 158 | netns_path, strerror(errno)); 159 | goto out_delete; 160 | } 161 | return 0; 162 | out_delete: 163 | return -1; 164 | } 165 | 166 | int main(void) 167 | { 168 | int fd = 0; 169 | if ((fd = socket(AF_NETLINK, SOCK_RAW, NETLINK_ROUTE)) < 0) { 170 | fprintf(stderr, "failed to get socket: %s\n", strerror(errno)); 171 | exit(1); 172 | } 173 | 174 | int sndbuf = 32768; 175 | int rcvbuf = 32768; 176 | if (setsockopt(fd, SOL_SOCKET, SO_SNDBUF, 177 | &sndbuf, sizeof(sndbuf)) < 0) { 178 | fprintf(stderr, "failed to set send buffer: %s\n", strerror(errno)); 179 | exit(1); 180 | } 181 | if (setsockopt(fd, SOL_SOCKET, SO_RCVBUF, 182 | &rcvbuf,sizeof(rcvbuf)) < 0) { 183 | fprintf(stderr, "failed to set recieve buffer: %s\n", strerror(errno)); 184 | exit(1); 185 | } 186 | struct sockaddr_nl *sa = malloc(sizeof(struct sockaddr_nl)); 187 | memset(sa, 0, sizeof(struct sockaddr_nl)); 188 | sa->nl_family = AF_NETLINK; 189 | sa->nl_groups = 0; 190 | if (bind(fd, (struct sockaddr *) sa, sizeof(struct sockaddr)) < 0) { 191 | fprintf(stderr, "failed to bind socket: %s\n", strerror(errno)); 192 | exit(1); 193 | } 194 | 195 | 196 | struct nlmsghdr *nlmsg = malloc(4096); 197 | memset(nlmsg, 0, 4096); 198 | nlmsg->nlmsg_len = NLMSG_LENGTH(sizeof(struct ifinfomsg)); 199 | nlmsg->nlmsg_type = RTM_NEWLINK; 200 | nlmsg->nlmsg_flags = NLM_F_REQUEST|NLM_F_CREATE|NLM_F_EXCL|NLM_F_ACK; 201 | nlmsg->nlmsg_seq = time(NULL); 202 | 203 | struct ifinfomsg *ifmsg; 204 | ifmsg = (struct ifinfomsg *) NLMSG_DATA(nlmsg); 205 | ifmsg->ifi_family = AF_UNSPEC; 206 | 207 | struct rtattr *nest1, *nest2, *nest3; 208 | 209 | NLMSG_STRING(nlmsg, IFLA_IFNAME, "veth1"); 210 | 211 | nest1 = NLMSG_TAIL(nlmsg); 212 | NLMSG_ATTR(nlmsg, IFLA_LINKINFO); 213 | 214 | NLMSG_STRING(nlmsg, IFLA_INFO_KIND, "veth"); 215 | 216 | nest2 = NLMSG_TAIL(nlmsg); 217 | NLMSG_ATTR(nlmsg, IFLA_INFO_DATA); 218 | 219 | nest3 = NLMSG_TAIL(nlmsg); 220 | NLMSG_ATTR(nlmsg, VETH_INFO_PEER); 221 | 222 | nlmsg->nlmsg_len += sizeof(struct ifinfomsg); 223 | 224 | NLMSG_STRING(nlmsg, IFLA_IFNAME, "vpeer1"); 225 | 226 | nest3->rta_len = (void *)NLMSG_TAIL(nlmsg) - (void *)nest3; 227 | nest2->rta_len = (void *)NLMSG_TAIL(nlmsg) - (void *)nest2; 228 | nest1->rta_len = (void *)NLMSG_TAIL(nlmsg) - (void *)nest1; 229 | 230 | if (_nlmsg_send(fd, nlmsg) != 0) 231 | exit(1); 232 | 233 | if (_nlmsg_recieve(fd) != 0) { 234 | close(fd); 235 | exit(1); 236 | } 237 | 238 | int addrlen = sizeof(struct in_addr); 239 | free(nlmsg); 240 | nlmsg = malloc(4096); 241 | memset(nlmsg, 0, 4096); 242 | nlmsg->nlmsg_len = NLMSG_LENGTH(sizeof(struct ifaddrmsg)); 243 | nlmsg->nlmsg_flags = NLM_F_ACK|NLM_F_REQUEST|NLM_F_CREATE|NLM_F_EXCL; 244 | nlmsg->nlmsg_type = RTM_NEWADDR; 245 | nlmsg->nlmsg_seq = time(NULL); 246 | 247 | struct ifaddrmsg *ifa; 248 | ifa = (struct ifaddrmsg *) NLMSG_DATA(nlmsg); 249 | ifa->ifa_prefixlen = atoi("24"); 250 | if (!(ifa->ifa_index = if_nametoindex("veth1"))) { 251 | printf("failed to get veth1 name: %s\n", strerror(errno)); 252 | return 1; 253 | } 254 | ifa->ifa_family = AF_INET; 255 | ifa->ifa_scope = 0; 256 | 257 | struct in_addr addr; 258 | struct in_addr bcast; 259 | 260 | if (inet_pton(AF_INET, "172.16.1.1", &addr) < 0) 261 | exit(1); 262 | if (inet_pton(AF_INET, "172.16.1.255", &bcast) < 0) 263 | exit(1); 264 | 265 | _nlmsg_put(nlmsg, IFA_LOCAL, &addr, addrlen); 266 | _nlmsg_put(nlmsg, IFA_ADDRESS, &addr, addrlen); 267 | _nlmsg_put(nlmsg, IFA_BROADCAST, &bcast, addrlen); 268 | 269 | if (_nlmsg_send(fd, nlmsg) != 0) 270 | exit(1); 271 | if (_nlmsg_recieve(fd) != 0) { 272 | close(fd); 273 | exit(1); 274 | } 275 | 276 | pid_t child; 277 | if ((child = fork()) == 0) { 278 | if (new_ns("ns1") != 0) 279 | exit(1); 280 | exit(0); 281 | } 282 | int rc; 283 | waitpid(child, &rc, 0); 284 | if (rc != 0) 285 | fprintf(stderr, "namespace not created correctly\n"); 286 | 287 | free(nlmsg); 288 | nlmsg = malloc(4096); 289 | memset(nlmsg, 0, 4096); 290 | nlmsg->nlmsg_len = NLMSG_LENGTH(sizeof(struct ifinfomsg)); 291 | nlmsg->nlmsg_type = RTM_NEWLINK; 292 | nlmsg->nlmsg_flags = NLM_F_REQUEST|NLM_F_ACK; 293 | nlmsg->nlmsg_seq = time(NULL); 294 | 295 | ifmsg = (struct ifinfomsg *) NLMSG_DATA(nlmsg); 296 | ifmsg->ifi_family = AF_UNSPEC; 297 | if (!(ifmsg->ifi_index = if_nametoindex("vpeer1"))) { 298 | fprintf(stderr, "failed to get vpeer1 name: %s\n", strerror(errno)); 299 | return 1; 300 | } 301 | int nsfd = netns_get_fd("ns1"); 302 | _nlmsg_put(nlmsg, IFLA_NET_NS_FD, &nsfd, sizeof(nsfd)); 303 | 304 | if (_nlmsg_send(fd, nlmsg) != 0) 305 | exit(1); 306 | if (_nlmsg_recieve(fd) != 0) { 307 | close(fd); 308 | exit(1); 309 | } 310 | 311 | 312 | return 0; 313 | } 314 | -------------------------------------------------------------------------------- /src/final/main.c: -------------------------------------------------------------------------------- 1 | #define _GNU_SOURCE 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include 11 | 12 | #include 13 | #include 14 | #include 15 | #include 16 | 17 | #include "fw.h" 18 | #include "nl.h" 19 | #include "namespace.h" 20 | 21 | int main(void) 22 | { 23 | int fd; 24 | if ((fd = _nl_socket_init()) == 0) 25 | exit(1); 26 | 27 | struct nlmsghdr *nlmsg = malloc(4096); 28 | memset(nlmsg, 0, 4096); 29 | nlmsg->nlmsg_len = NLMSG_LENGTH(sizeof(struct ifinfomsg)); 30 | nlmsg->nlmsg_type = RTM_NEWLINK; 31 | nlmsg->nlmsg_flags = NLM_F_REQUEST|NLM_F_CREATE|NLM_F_EXCL|NLM_F_ACK; 32 | nlmsg->nlmsg_seq = time(NULL); 33 | 34 | struct ifinfomsg *ifmsg; 35 | ifmsg = (struct ifinfomsg *) NLMSG_DATA(nlmsg); 36 | ifmsg->ifi_family = AF_UNSPEC; 37 | 38 | struct rtattr *nest1, *nest2, *nest3; 39 | 40 | NLMSG_STRING(nlmsg, IFLA_IFNAME, "veth1"); 41 | 42 | nest1 = NLMSG_TAIL(nlmsg); 43 | NLMSG_ATTR(nlmsg, IFLA_LINKINFO); 44 | 45 | NLMSG_STRING(nlmsg, IFLA_INFO_KIND, "veth"); 46 | 47 | nest2 = NLMSG_TAIL(nlmsg); 48 | NLMSG_ATTR(nlmsg, IFLA_INFO_DATA); 49 | 50 | nest3 = NLMSG_TAIL(nlmsg); 51 | NLMSG_ATTR(nlmsg, VETH_INFO_PEER); 52 | 53 | nlmsg->nlmsg_len += sizeof(struct ifinfomsg); 54 | 55 | NLMSG_STRING(nlmsg, IFLA_IFNAME, "vpeer1"); 56 | 57 | nest3->rta_len = (unsigned char *)NLMSG_TAIL(nlmsg) - (unsigned char *)nest3; 58 | nest2->rta_len = (unsigned char *)NLMSG_TAIL(nlmsg) - (unsigned char *)nest2; 59 | nest1->rta_len = (unsigned char *)NLMSG_TAIL(nlmsg) - (unsigned char *)nest1; 60 | 61 | if (_nlmsg_send(fd, nlmsg) != 0) 62 | exit(1); 63 | 64 | if (_nlmsg_recieve(fd) != 0) { 65 | close(fd); 66 | exit(1); 67 | } 68 | 69 | int addrlen = sizeof(struct in_addr); 70 | free(nlmsg); 71 | nlmsg = malloc(4096); 72 | memset(nlmsg, 0, 4096); 73 | nlmsg->nlmsg_len = NLMSG_LENGTH(sizeof(struct ifaddrmsg)); 74 | nlmsg->nlmsg_flags = NLM_F_ACK|NLM_F_REQUEST|NLM_F_CREATE|NLM_F_EXCL; 75 | nlmsg->nlmsg_type = RTM_NEWADDR; 76 | nlmsg->nlmsg_seq = time(NULL); 77 | 78 | struct ifaddrmsg *ifa; 79 | ifa = (struct ifaddrmsg *) NLMSG_DATA(nlmsg); 80 | ifa->ifa_prefixlen = atoi("24"); 81 | if (!(ifa->ifa_index = if_nametoindex("veth1"))) { 82 | printf("failed to get veth1 name: %s\n", strerror(errno)); 83 | return 1; 84 | } 85 | ifa->ifa_family = AF_INET; 86 | ifa->ifa_scope = 0; 87 | 88 | struct in_addr addr; 89 | struct in_addr bcast; 90 | 91 | if (inet_pton(AF_INET, "172.16.1.1", &addr) < 0) 92 | exit(1); 93 | if (inet_pton(AF_INET, "172.16.1.255", &bcast) < 0) 94 | exit(1); 95 | 96 | _nlmsg_put(nlmsg, IFA_LOCAL, &addr, addrlen); 97 | _nlmsg_put(nlmsg, IFA_ADDRESS, &addr, addrlen); 98 | _nlmsg_put(nlmsg, IFA_BROADCAST, &bcast, addrlen); 99 | 100 | if (_nlmsg_send(fd, nlmsg) != 0) 101 | exit(1); 102 | if (_nlmsg_recieve(fd) != 0) { 103 | close(fd); 104 | exit(1); 105 | } 106 | 107 | pid_t child; 108 | if ((child = fork()) == 0) { 109 | if (new_ns("ns1") != 0) 110 | exit(1); 111 | exit(0); 112 | } 113 | int rc; 114 | waitpid(child, &rc, 0); 115 | if (rc != 0) 116 | fprintf(stderr, "namespace not created correctly\n"); 117 | 118 | free(nlmsg); 119 | nlmsg = malloc(4096); 120 | memset(nlmsg, 0, 4096); 121 | nlmsg->nlmsg_len = NLMSG_LENGTH(sizeof(struct ifinfomsg)); 122 | nlmsg->nlmsg_type = RTM_NEWLINK; 123 | nlmsg->nlmsg_flags = NLM_F_REQUEST|NLM_F_ACK; 124 | nlmsg->nlmsg_seq = time(NULL); 125 | 126 | ifmsg = (struct ifinfomsg *) NLMSG_DATA(nlmsg); 127 | ifmsg->ifi_family = AF_UNSPEC; 128 | if (!(ifmsg->ifi_index = if_nametoindex("vpeer1"))) { 129 | fprintf(stderr, "failed to get vpeer1 name: %s\n", strerror(errno)); 130 | return 1; 131 | } 132 | int nsfd = netns_get_fd("ns1"); 133 | _nlmsg_put(nlmsg, IFLA_NET_NS_FD, &nsfd, sizeof(nsfd)); 134 | 135 | if (_nlmsg_send(fd, nlmsg) != 0) 136 | exit(1); 137 | if (_nlmsg_recieve(fd) != 0) { 138 | close(fd); 139 | exit(1); 140 | } 141 | 142 | free(nlmsg); 143 | nlmsg = malloc(4096); 144 | memset(nlmsg, 0, 4096); 145 | nlmsg->nlmsg_len = NLMSG_LENGTH(sizeof(struct ifinfomsg)); 146 | nlmsg->nlmsg_flags = NLM_F_ACK|NLM_F_REQUEST; 147 | nlmsg->nlmsg_type = RTM_NEWLINK; 148 | nlmsg->nlmsg_seq = time(NULL); 149 | 150 | ifmsg = (struct ifinfomsg *) NLMSG_DATA(nlmsg); 151 | ifmsg->ifi_family = AF_UNSPEC; 152 | ifmsg->ifi_change |= IFF_UP; 153 | ifmsg->ifi_flags |= IFF_UP; 154 | if (!(ifmsg->ifi_index = if_nametoindex("veth1"))) { 155 | printf("failed to get veth1 name: %s\n", strerror(errno)); 156 | return 1; 157 | } 158 | 159 | if (_nlmsg_send(fd, nlmsg) != 0) 160 | exit(1); 161 | if (_nlmsg_recieve(fd) != 0) { 162 | close(fd); 163 | exit(1); 164 | } 165 | 166 | if ((child = fork()) == 0) { 167 | setns(nsfd, CLONE_NEWNET); 168 | 169 | if ((fd = _nl_socket_init()) == 0) 170 | exit(1); 171 | 172 | free(nlmsg); 173 | nlmsg = malloc(4096); 174 | memset(nlmsg, 0, 4096); 175 | nlmsg->nlmsg_len = NLMSG_LENGTH(sizeof(struct ifaddrmsg)); 176 | nlmsg->nlmsg_flags = NLM_F_ACK|NLM_F_REQUEST|NLM_F_CREATE|NLM_F_EXCL; 177 | nlmsg->nlmsg_type = RTM_NEWADDR; 178 | nlmsg->nlmsg_seq = time(NULL); 179 | 180 | struct ifaddrmsg *ifa; 181 | ifa = (struct ifaddrmsg *) NLMSG_DATA(nlmsg); 182 | ifa->ifa_prefixlen = atoi("24"); 183 | if (!(ifa->ifa_index = if_nametoindex("vpeer1"))) { 184 | printf("failed to get veth1 name: %s\n", strerror(errno)); 185 | exit(1); 186 | } 187 | ifa->ifa_family = AF_INET; 188 | ifa->ifa_scope = 0; 189 | 190 | struct in_addr addr; 191 | struct in_addr bcast; 192 | 193 | if (inet_pton(AF_INET, "172.16.1.2", &addr) < 0) 194 | exit(1); 195 | if (inet_pton(AF_INET, "172.16.1.255", &bcast) < 0) 196 | exit(1); 197 | 198 | _nlmsg_put(nlmsg, IFA_LOCAL, &addr, addrlen); 199 | _nlmsg_put(nlmsg, IFA_ADDRESS, &addr, addrlen); 200 | _nlmsg_put(nlmsg, IFA_BROADCAST, &bcast, addrlen); 201 | 202 | if (_nlmsg_send(fd, nlmsg) != 0) 203 | exit(1); 204 | if (_nlmsg_recieve(fd) != 0) { 205 | close(fd); 206 | exit(1); 207 | } 208 | 209 | free(nlmsg); 210 | nlmsg = malloc(4096); 211 | memset(nlmsg, 0, 4096); 212 | nlmsg->nlmsg_len = NLMSG_LENGTH(sizeof(struct ifinfomsg)); 213 | nlmsg->nlmsg_flags = NLM_F_ACK|NLM_F_REQUEST; 214 | nlmsg->nlmsg_type = RTM_NEWLINK; 215 | nlmsg->nlmsg_seq = time(NULL); 216 | 217 | ifmsg = (struct ifinfomsg *) NLMSG_DATA(nlmsg); 218 | ifmsg->ifi_family = AF_UNSPEC; 219 | ifmsg->ifi_change |= IFF_UP; 220 | ifmsg->ifi_flags |= IFF_UP; 221 | if (!(ifmsg->ifi_index = if_nametoindex("vpeer1"))) { 222 | printf("failed to get veth1 name: %s\n", strerror(errno)); 223 | exit(1); 224 | } 225 | 226 | if (_nlmsg_send(fd, nlmsg) != 0) 227 | exit(1); 228 | if (_nlmsg_recieve(fd) != 0) { 229 | close(fd); 230 | exit(1); 231 | } 232 | 233 | free(nlmsg); 234 | nlmsg = malloc(4096); 235 | memset(nlmsg, 0, 4096); 236 | nlmsg->nlmsg_len = NLMSG_LENGTH(sizeof(struct ifinfomsg)); 237 | nlmsg->nlmsg_flags = NLM_F_ACK|NLM_F_REQUEST; 238 | nlmsg->nlmsg_type = RTM_NEWLINK; 239 | nlmsg->nlmsg_seq = time(NULL); 240 | 241 | ifmsg = (struct ifinfomsg *) NLMSG_DATA(nlmsg); 242 | ifmsg->ifi_family = AF_UNSPEC; 243 | ifmsg->ifi_change |= IFF_UP; 244 | ifmsg->ifi_flags |= IFF_UP; 245 | if (!(ifmsg->ifi_index = if_nametoindex("lo"))) { 246 | printf("failed to get veth1 name: %s\n", strerror(errno)); 247 | return 1; 248 | } 249 | 250 | if (_nlmsg_send(fd, nlmsg) != 0) 251 | exit(1); 252 | if (_nlmsg_recieve(fd) != 0) { 253 | close(fd); 254 | exit(1); 255 | } 256 | 257 | free(nlmsg); 258 | nlmsg = malloc(4096); 259 | memset(nlmsg, 0, 4096); 260 | nlmsg->nlmsg_len = NLMSG_LENGTH(sizeof(struct rtmsg)); 261 | nlmsg->nlmsg_flags = NLM_F_ACK|NLM_F_REQUEST|NLM_F_CREATE|NLM_F_EXCL; 262 | nlmsg->nlmsg_type = RTM_NEWROUTE; 263 | nlmsg->nlmsg_seq = time(NULL); 264 | 265 | struct rtmsg *rtm; 266 | rtm = (struct rtmsg *) NLMSG_DATA(nlmsg); 267 | 268 | rtm->rtm_family = AF_INET; 269 | rtm->rtm_table = RT_TABLE_MAIN; 270 | rtm->rtm_scope = RT_SCOPE_UNIVERSE; 271 | rtm->rtm_protocol = RTPROT_BOOT; 272 | rtm->rtm_type = RTN_UNICAST; 273 | rtm->rtm_dst_len = 0; 274 | 275 | if (inet_pton(AF_INET, "172.16.1.1", &addr) < 0) 276 | exit(1); 277 | 278 | _nlmsg_put(nlmsg, RTA_GATEWAY, &addr, addrlen); 279 | 280 | if (_nlmsg_send(fd, nlmsg) != 0) 281 | exit(1); 282 | if (_nlmsg_recieve(fd) != 0) { 283 | close(fd); 284 | exit(1); 285 | } 286 | close(fd); 287 | exit(0); 288 | } 289 | waitpid(child, &rc, 0); 290 | if (rc != 0) 291 | fprintf(stderr, "failed to run commands in child network namespace\n"); 292 | 293 | struct _rule *r = malloc(sizeof(struct _rule)); 294 | memset(r, 0, sizeof(struct _rule)); 295 | r->table = "nat"; 296 | r->entry = "POSTROUTING"; 297 | r->type = "MASQUERADE"; 298 | r->saddr = "172.16.1.0/24"; 299 | r->oface = "eth0"; 300 | _ipt_rule(r); 301 | 302 | r->saddr = 0; 303 | r->table = "filter"; 304 | r->entry = "FORWARD"; 305 | r->type = "ACCEPT"; 306 | r->oface = "eth0"; 307 | r->iface = "veth0"; 308 | _ipt_rule(r); 309 | 310 | r->oface = "veth0"; 311 | r->iface = "eth0"; 312 | _ipt_rule(r); 313 | 314 | return 0; 315 | } 316 | -------------------------------------------------------------------------------- /src/ns_addr.c: -------------------------------------------------------------------------------- 1 | #define _GNU_SOURCE 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | #include 16 | #include 17 | #include 18 | #include 19 | 20 | #ifndef VETH_INFO_PEER 21 | #define VETH_INFO_PEER 1 22 | #endif 23 | 24 | #define NETNS_RUN_DIR "/run/netns" 25 | 26 | #define NLMSG_TAIL(nmsg) \ 27 | ((struct rtattr *) (((void *) (nmsg)) + NLMSG_ALIGN((nmsg)->nlmsg_len))) 28 | 29 | static void _nlmsg_put(struct nlmsghdr *nlmsg, int type, void *data, size_t len) 30 | { 31 | struct rtattr *rta; 32 | size_t rtalen = RTA_LENGTH(len); 33 | rta = NLMSG_TAIL(nlmsg); 34 | rta->rta_type = type; 35 | rta->rta_len = rtalen; 36 | if (data) 37 | memcpy(RTA_DATA(rta), data, len); 38 | nlmsg->nlmsg_len = NLMSG_ALIGN(nlmsg->nlmsg_len) + RTA_ALIGN(rtalen); 39 | } 40 | 41 | #define NLMSG_STRING(nl, attr, data) \ 42 | _nlmsg_put((nl), (attr), (data), (strlen((data)) + 1)) 43 | #define NLMSG_ATTR(nl, attr) \ 44 | _nlmsg_put((nl), (attr), (NULL), (0)) 45 | 46 | static int _nlmsg_send(int fd, struct nlmsghdr *nlmsg) 47 | { 48 | struct sockaddr_nl *sa = malloc(sizeof(struct sockaddr_nl)); 49 | memset(sa, 0, sizeof(struct sockaddr_nl)); 50 | sa->nl_family = AF_NETLINK; 51 | 52 | struct iovec iov = { nlmsg, nlmsg->nlmsg_len }; 53 | struct msghdr msg = { sa, sizeof(*sa), &iov, 1, NULL, 0, 0 }; 54 | 55 | if (sendmsg(fd, &msg, 0) < 0) { 56 | fprintf(stderr, "failed to get socket: %s\n", strerror(errno)); 57 | return 1; 58 | } 59 | 60 | return 0; 61 | } 62 | static int _nlmsg_recieve(int fd) 63 | { 64 | struct sockaddr_nl *sa = malloc(sizeof(struct sockaddr_nl)); 65 | memset(sa, 0, sizeof(struct sockaddr_nl)); 66 | sa->nl_family = AF_NETLINK; 67 | 68 | int len = 4096; 69 | char buf[len]; 70 | struct iovec iov = { buf, len }; 71 | struct msghdr msg = { sa, sizeof(*sa), &iov, 1, NULL, 0, 0 }; 72 | 73 | recvmsg(fd, &msg, 0); 74 | struct nlmsghdr *ret = (struct nlmsghdr*)buf; 75 | if (ret->nlmsg_type == NLMSG_ERROR) { 76 | struct nlmsgerr *err = (struct nlmsgerr*)NLMSG_DATA(ret); 77 | if (err->error < 0) { 78 | fprintf(stderr, "recieve error: %d\n", err->error); 79 | return 1; 80 | } 81 | } else { 82 | fprintf(stderr, "invalid recieve type\n"); 83 | return 1; 84 | } 85 | 86 | return 0; 87 | } 88 | 89 | static int create_netns_dir(void) 90 | { 91 | if (mkdir(NETNS_RUN_DIR, S_IRWXU|S_IRGRP|S_IXGRP|S_IROTH|S_IXOTH)) { 92 | if (errno != EEXIST) { 93 | fprintf(stderr, "mkdir %s failed: %s\n", 94 | NETNS_RUN_DIR, strerror(errno)); 95 | return -1; 96 | } 97 | } 98 | 99 | return 0; 100 | } 101 | 102 | int netns_get_fd(const char *name) 103 | { 104 | char pathbuf[PATH_MAX]; 105 | const char *path, *ptr; 106 | 107 | path = name; 108 | ptr = strchr(name, '/'); 109 | if (!ptr) { 110 | snprintf(pathbuf, sizeof(pathbuf), "%s/%s", 111 | NETNS_RUN_DIR, name ); 112 | path = pathbuf; 113 | } 114 | return open(path, O_RDONLY); 115 | } 116 | 117 | int new_ns(const char *name) 118 | { 119 | char netns_path[PATH_MAX]; 120 | int fd; 121 | int made_netns_run_dir_mount = 0; 122 | 123 | snprintf(netns_path, sizeof(netns_path), "%s/%s", NETNS_RUN_DIR, name); 124 | 125 | if (create_netns_dir()) 126 | return -1; 127 | 128 | while (mount("", NETNS_RUN_DIR, "none", MS_SHARED | MS_REC, NULL)) { 129 | if (errno != EINVAL || made_netns_run_dir_mount) { 130 | fprintf(stderr, "mount --make-shared %s failed: %s\n", 131 | NETNS_RUN_DIR, strerror(errno)); 132 | return -1; 133 | } 134 | 135 | if (mount(NETNS_RUN_DIR, NETNS_RUN_DIR, "none", MS_BIND | MS_REC, NULL)) { 136 | fprintf(stderr, "mount --bind %s %s failed: %s\n", 137 | NETNS_RUN_DIR, NETNS_RUN_DIR, strerror(errno)); 138 | return -1; 139 | } 140 | made_netns_run_dir_mount = 1; 141 | } 142 | 143 | fd = open(netns_path, O_RDONLY|O_CREAT|O_EXCL, 0); 144 | if (fd < 0) { 145 | fprintf(stderr, "Cannot create namespace file \"%s\": %s\n", 146 | netns_path, strerror(errno)); 147 | return -1; 148 | } 149 | close(fd); 150 | if (unshare(CLONE_NEWNET) < 0) { 151 | fprintf(stderr, "Failed to create a new network namespace \"%s\": %s\n", 152 | name, strerror(errno)); 153 | goto out_delete; 154 | } 155 | 156 | if (mount("/proc/self/ns/net", netns_path, "none", MS_BIND, NULL) < 0) { 157 | fprintf(stderr, "Bind /proc/self/ns/net -> %s failed: %s\n", 158 | netns_path, strerror(errno)); 159 | goto out_delete; 160 | } 161 | return 0; 162 | out_delete: 163 | return -1; 164 | } 165 | 166 | int main(void) 167 | { 168 | int fd = 0; 169 | if ((fd = socket(AF_NETLINK, SOCK_RAW, NETLINK_ROUTE)) < 0) { 170 | fprintf(stderr, "failed to get socket: %s\n", strerror(errno)); 171 | exit(1); 172 | } 173 | 174 | int sndbuf = 32768; 175 | int rcvbuf = 32768; 176 | if (setsockopt(fd, SOL_SOCKET, SO_SNDBUF, 177 | &sndbuf, sizeof(sndbuf)) < 0) { 178 | fprintf(stderr, "failed to set send buffer: %s\n", strerror(errno)); 179 | exit(1); 180 | } 181 | if (setsockopt(fd, SOL_SOCKET, SO_RCVBUF, 182 | &rcvbuf,sizeof(rcvbuf)) < 0) { 183 | fprintf(stderr, "failed to set recieve buffer: %s\n", strerror(errno)); 184 | exit(1); 185 | } 186 | struct sockaddr_nl *sa = malloc(sizeof(struct sockaddr_nl)); 187 | memset(sa, 0, sizeof(struct sockaddr_nl)); 188 | sa->nl_family = AF_NETLINK; 189 | sa->nl_groups = 0; 190 | if (bind(fd, (struct sockaddr *) sa, sizeof(struct sockaddr)) < 0) { 191 | fprintf(stderr, "failed to bind socket: %s\n", strerror(errno)); 192 | exit(1); 193 | } 194 | 195 | struct nlmsghdr *nlmsg = malloc(4096); 196 | memset(nlmsg, 0, 4096); 197 | nlmsg->nlmsg_len = NLMSG_LENGTH(sizeof(struct ifinfomsg)); 198 | nlmsg->nlmsg_type = RTM_NEWLINK; 199 | nlmsg->nlmsg_flags = NLM_F_REQUEST|NLM_F_CREATE|NLM_F_EXCL|NLM_F_ACK; 200 | nlmsg->nlmsg_seq = time(NULL); 201 | 202 | struct ifinfomsg *ifmsg; 203 | ifmsg = (struct ifinfomsg *) NLMSG_DATA(nlmsg); 204 | ifmsg->ifi_family = AF_UNSPEC; 205 | 206 | struct rtattr *nest1, *nest2, *nest3; 207 | 208 | NLMSG_STRING(nlmsg, IFLA_IFNAME, "veth1"); 209 | 210 | nest1 = NLMSG_TAIL(nlmsg); 211 | NLMSG_ATTR(nlmsg, IFLA_LINKINFO); 212 | 213 | NLMSG_STRING(nlmsg, IFLA_INFO_KIND, "veth"); 214 | 215 | nest2 = NLMSG_TAIL(nlmsg); 216 | NLMSG_ATTR(nlmsg, IFLA_INFO_DATA); 217 | 218 | nest3 = NLMSG_TAIL(nlmsg); 219 | NLMSG_ATTR(nlmsg, VETH_INFO_PEER); 220 | 221 | nlmsg->nlmsg_len += sizeof(struct ifinfomsg); 222 | 223 | NLMSG_STRING(nlmsg, IFLA_IFNAME, "vpeer1"); 224 | 225 | nest3->rta_len = (void *)NLMSG_TAIL(nlmsg) - (void *)nest3; 226 | nest2->rta_len = (void *)NLMSG_TAIL(nlmsg) - (void *)nest2; 227 | nest1->rta_len = (void *)NLMSG_TAIL(nlmsg) - (void *)nest1; 228 | 229 | if (_nlmsg_send(fd, nlmsg) != 0) 230 | exit(1); 231 | 232 | if (_nlmsg_recieve(fd) != 0) { 233 | close(fd); 234 | exit(1); 235 | } 236 | 237 | int addrlen = sizeof(struct in_addr); 238 | free(nlmsg); 239 | nlmsg = malloc(4096); 240 | memset(nlmsg, 0, 4096); 241 | nlmsg->nlmsg_len = NLMSG_LENGTH(sizeof(struct ifaddrmsg)); 242 | nlmsg->nlmsg_flags = NLM_F_ACK|NLM_F_REQUEST|NLM_F_CREATE|NLM_F_EXCL; 243 | nlmsg->nlmsg_type = RTM_NEWADDR; 244 | nlmsg->nlmsg_seq = time(NULL); 245 | 246 | struct ifaddrmsg *ifa; 247 | ifa = (struct ifaddrmsg *) NLMSG_DATA(nlmsg); 248 | ifa->ifa_prefixlen = atoi("24"); 249 | if (!(ifa->ifa_index = if_nametoindex("veth1"))) { 250 | printf("failed to get veth1 name: %s\n", strerror(errno)); 251 | return 1; 252 | } 253 | ifa->ifa_family = AF_INET; 254 | ifa->ifa_scope = 0; 255 | 256 | struct in_addr addr; 257 | struct in_addr bcast; 258 | 259 | if (inet_pton(AF_INET, "172.16.1.1", &addr) < 0) 260 | exit(1); 261 | if (inet_pton(AF_INET, "172.16.1.255", &bcast) < 0) 262 | exit(1); 263 | 264 | _nlmsg_put(nlmsg, IFA_LOCAL, &addr, addrlen); 265 | _nlmsg_put(nlmsg, IFA_ADDRESS, &addr, addrlen); 266 | _nlmsg_put(nlmsg, IFA_BROADCAST, &bcast, addrlen); 267 | 268 | if (_nlmsg_send(fd, nlmsg) != 0) 269 | exit(1); 270 | if (_nlmsg_recieve(fd) != 0) { 271 | close(fd); 272 | exit(1); 273 | } 274 | 275 | pid_t child; 276 | if ((child = fork()) == 0) { 277 | if (new_ns("ns1") != 0) 278 | exit(1); 279 | exit(0); 280 | } 281 | int rc; 282 | waitpid(child, &rc, 0); 283 | if (rc != 0) 284 | fprintf(stderr, "namespace not created correctly\n"); 285 | 286 | free(nlmsg); 287 | nlmsg = malloc(4096); 288 | memset(nlmsg, 0, 4096); 289 | nlmsg->nlmsg_len = NLMSG_LENGTH(sizeof(struct ifinfomsg)); 290 | nlmsg->nlmsg_type = RTM_NEWLINK; 291 | nlmsg->nlmsg_flags = NLM_F_REQUEST|NLM_F_ACK; 292 | nlmsg->nlmsg_seq = time(NULL); 293 | 294 | ifmsg = (struct ifinfomsg *) NLMSG_DATA(nlmsg); 295 | ifmsg->ifi_family = AF_UNSPEC; 296 | if (!(ifmsg->ifi_index = if_nametoindex("vpeer1"))) { 297 | fprintf(stderr, "failed to get vpeer1 name: %s\n", strerror(errno)); 298 | return 1; 299 | } 300 | int nsfd = netns_get_fd("ns1"); 301 | _nlmsg_put(nlmsg, IFLA_NET_NS_FD, &nsfd, sizeof(nsfd)); 302 | 303 | if (_nlmsg_send(fd, nlmsg) != 0) 304 | exit(1); 305 | if (_nlmsg_recieve(fd) != 0) { 306 | close(fd); 307 | exit(1); 308 | } 309 | 310 | if ((child = fork()) == 0) { 311 | setns(nsfd, CLONE_NEWNET); 312 | 313 | if ((fd = socket(AF_NETLINK, SOCK_RAW, NETLINK_ROUTE)) < 0) { 314 | fprintf(stderr, "failed to get socket: %s\n", strerror(errno)); 315 | exit(1); 316 | } 317 | if (setsockopt(fd, SOL_SOCKET, SO_SNDBUF, 318 | &sndbuf, sizeof(sndbuf)) < 0) { 319 | fprintf(stderr, "failed to set send buffer: %s\n", strerror(errno)); 320 | exit(1); 321 | } 322 | if (setsockopt(fd, SOL_SOCKET, SO_RCVBUF, 323 | &rcvbuf,sizeof(rcvbuf)) < 0) { 324 | fprintf(stderr, "failed to set recieve buffer: %s\n", strerror(errno)); 325 | exit(1); 326 | } 327 | struct sockaddr_nl *sa = malloc(sizeof(struct sockaddr_nl)); 328 | memset(sa, 0, sizeof(struct sockaddr_nl)); 329 | sa->nl_family = AF_NETLINK; 330 | sa->nl_groups = 0; 331 | if (bind(fd, (struct sockaddr *) sa, sizeof(struct sockaddr)) < 0) { 332 | fprintf(stderr, "failed to bind socket: %s\n", strerror(errno)); 333 | exit(1); 334 | } 335 | 336 | 337 | free(nlmsg); 338 | nlmsg = malloc(4096); 339 | memset(nlmsg, 0, 4096); 340 | nlmsg->nlmsg_len = NLMSG_LENGTH(sizeof(struct ifaddrmsg)); 341 | nlmsg->nlmsg_flags = NLM_F_ACK|NLM_F_REQUEST|NLM_F_CREATE|NLM_F_EXCL; 342 | nlmsg->nlmsg_type = RTM_NEWADDR; 343 | nlmsg->nlmsg_seq = time(NULL); 344 | 345 | struct ifaddrmsg *ifa; 346 | ifa = (struct ifaddrmsg *) NLMSG_DATA(nlmsg); 347 | ifa->ifa_prefixlen = atoi("24"); 348 | if (!(ifa->ifa_index = if_nametoindex("vpeer1"))) { 349 | printf("failed to get veth1 name: %s\n", strerror(errno)); 350 | return 1; 351 | } 352 | ifa->ifa_family = AF_INET; 353 | ifa->ifa_scope = 0; 354 | 355 | struct in_addr addr; 356 | struct in_addr bcast; 357 | 358 | if (inet_pton(AF_INET, "172.16.1.2", &addr) < 0) 359 | exit(1); 360 | if (inet_pton(AF_INET, "172.16.1.255", &bcast) < 0) 361 | exit(1); 362 | 363 | _nlmsg_put(nlmsg, IFA_LOCAL, &addr, addrlen); 364 | _nlmsg_put(nlmsg, IFA_ADDRESS, &addr, addrlen); 365 | _nlmsg_put(nlmsg, IFA_BROADCAST, &bcast, addrlen); 366 | 367 | if (_nlmsg_send(fd, nlmsg) != 0) 368 | exit(1); 369 | if (_nlmsg_recieve(fd) != 0) { 370 | close(fd); 371 | exit(1); 372 | } 373 | close(fd); 374 | } 375 | waitpid(child, &rc, 0); 376 | if (rc != 0) 377 | fprintf(stderr, "failed to run commands in child network namespace\n"); 378 | 379 | return 0; 380 | } 381 | -------------------------------------------------------------------------------- /src/ns_gw.c: -------------------------------------------------------------------------------- 1 | #define _GNU_SOURCE 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | #include 16 | #include 17 | #include 18 | #include 19 | 20 | #ifndef VETH_INFO_PEER 21 | #define VETH_INFO_PEER 1 22 | #endif 23 | 24 | #define NETNS_RUN_DIR "/run/netns" 25 | 26 | #define NLMSG_TAIL(nmsg) \ 27 | ((struct rtattr *) (((void *) (nmsg)) + NLMSG_ALIGN((nmsg)->nlmsg_len))) 28 | 29 | static void _nlmsg_put(struct nlmsghdr *nlmsg, int type, void *data, size_t len) 30 | { 31 | struct rtattr *rta; 32 | size_t rtalen = RTA_LENGTH(len); 33 | rta = NLMSG_TAIL(nlmsg); 34 | rta->rta_type = type; 35 | rta->rta_len = rtalen; 36 | if (data) 37 | memcpy(RTA_DATA(rta), data, len); 38 | nlmsg->nlmsg_len = NLMSG_ALIGN(nlmsg->nlmsg_len) + RTA_ALIGN(rtalen); 39 | } 40 | 41 | #define NLMSG_STRING(nl, attr, data) \ 42 | _nlmsg_put((nl), (attr), (data), (strlen((data)) + 1)) 43 | #define NLMSG_ATTR(nl, attr) \ 44 | _nlmsg_put((nl), (attr), (NULL), (0)) 45 | 46 | static int _nlmsg_send(int fd, struct nlmsghdr *nlmsg) 47 | { 48 | struct sockaddr_nl *sa = malloc(sizeof(struct sockaddr_nl)); 49 | memset(sa, 0, sizeof(struct sockaddr_nl)); 50 | sa->nl_family = AF_NETLINK; 51 | 52 | struct iovec iov = { nlmsg, nlmsg->nlmsg_len }; 53 | struct msghdr msg = { sa, sizeof(*sa), &iov, 1, NULL, 0, 0 }; 54 | 55 | if (sendmsg(fd, &msg, 0) < 0) { 56 | fprintf(stderr, "failed to get socket: %s\n", strerror(errno)); 57 | return 1; 58 | } 59 | 60 | return 0; 61 | } 62 | static int _nlmsg_recieve(int fd) 63 | { 64 | struct sockaddr_nl *sa = malloc(sizeof(struct sockaddr_nl)); 65 | memset(sa, 0, sizeof(struct sockaddr_nl)); 66 | sa->nl_family = AF_NETLINK; 67 | 68 | int len = 4096; 69 | char buf[len]; 70 | struct iovec iov = { buf, len }; 71 | struct msghdr msg = { sa, sizeof(*sa), &iov, 1, NULL, 0, 0 }; 72 | 73 | recvmsg(fd, &msg, 0); 74 | struct nlmsghdr *ret = (struct nlmsghdr*)buf; 75 | if (ret->nlmsg_type == NLMSG_ERROR) { 76 | struct nlmsgerr *err = (struct nlmsgerr*)NLMSG_DATA(ret); 77 | if (err->error < 0) { 78 | fprintf(stderr, "recieve error: %d\n", err->error); 79 | return 1; 80 | } 81 | } else { 82 | fprintf(stderr, "invalid recieve type\n"); 83 | return 1; 84 | } 85 | 86 | return 0; 87 | } 88 | 89 | static int create_netns_dir(void) 90 | { 91 | if (mkdir(NETNS_RUN_DIR, S_IRWXU|S_IRGRP|S_IXGRP|S_IROTH|S_IXOTH)) { 92 | if (errno != EEXIST) { 93 | fprintf(stderr, "mkdir %s failed: %s\n", 94 | NETNS_RUN_DIR, strerror(errno)); 95 | return -1; 96 | } 97 | } 98 | 99 | return 0; 100 | } 101 | 102 | int netns_get_fd(const char *name) 103 | { 104 | char pathbuf[PATH_MAX]; 105 | const char *path, *ptr; 106 | 107 | path = name; 108 | ptr = strchr(name, '/'); 109 | if (!ptr) { 110 | snprintf(pathbuf, sizeof(pathbuf), "%s/%s", 111 | NETNS_RUN_DIR, name ); 112 | path = pathbuf; 113 | } 114 | return open(path, O_RDONLY); 115 | } 116 | 117 | int new_ns(const char *name) 118 | { 119 | char netns_path[PATH_MAX]; 120 | int fd; 121 | int made_netns_run_dir_mount = 0; 122 | 123 | snprintf(netns_path, sizeof(netns_path), "%s/%s", NETNS_RUN_DIR, name); 124 | 125 | if (create_netns_dir()) 126 | return -1; 127 | 128 | while (mount("", NETNS_RUN_DIR, "none", MS_SHARED | MS_REC, NULL)) { 129 | if (errno != EINVAL || made_netns_run_dir_mount) { 130 | fprintf(stderr, "mount --make-shared %s failed: %s\n", 131 | NETNS_RUN_DIR, strerror(errno)); 132 | return -1; 133 | } 134 | 135 | if (mount(NETNS_RUN_DIR, NETNS_RUN_DIR, "none", MS_BIND | MS_REC, NULL)) { 136 | fprintf(stderr, "mount --bind %s %s failed: %s\n", 137 | NETNS_RUN_DIR, NETNS_RUN_DIR, strerror(errno)); 138 | return -1; 139 | } 140 | made_netns_run_dir_mount = 1; 141 | } 142 | 143 | fd = open(netns_path, O_RDONLY|O_CREAT|O_EXCL, 0); 144 | if (fd < 0) { 145 | fprintf(stderr, "Cannot create namespace file \"%s\": %s\n", 146 | netns_path, strerror(errno)); 147 | return -1; 148 | } 149 | close(fd); 150 | if (unshare(CLONE_NEWNET) < 0) { 151 | fprintf(stderr, "Failed to create a new network namespace \"%s\": %s\n", 152 | name, strerror(errno)); 153 | goto out_delete; 154 | } 155 | 156 | if (mount("/proc/self/ns/net", netns_path, "none", MS_BIND, NULL) < 0) { 157 | fprintf(stderr, "Bind /proc/self/ns/net -> %s failed: %s\n", 158 | netns_path, strerror(errno)); 159 | goto out_delete; 160 | } 161 | return 0; 162 | out_delete: 163 | return -1; 164 | } 165 | 166 | int main(void) 167 | { 168 | int fd = 0; 169 | if ((fd = socket(AF_NETLINK, SOCK_RAW, NETLINK_ROUTE)) < 0) { 170 | fprintf(stderr, "failed to get socket: %s\n", strerror(errno)); 171 | exit(1); 172 | } 173 | 174 | int sndbuf = 32768; 175 | int rcvbuf = 32768; 176 | if (setsockopt(fd, SOL_SOCKET, SO_SNDBUF, 177 | &sndbuf, sizeof(sndbuf)) < 0) { 178 | fprintf(stderr, "failed to set send buffer: %s\n", strerror(errno)); 179 | exit(1); 180 | } 181 | if (setsockopt(fd, SOL_SOCKET, SO_RCVBUF, 182 | &rcvbuf,sizeof(rcvbuf)) < 0) { 183 | fprintf(stderr, "failed to set recieve buffer: %s\n", strerror(errno)); 184 | exit(1); 185 | } 186 | struct sockaddr_nl *sa = malloc(sizeof(struct sockaddr_nl)); 187 | memset(sa, 0, sizeof(struct sockaddr_nl)); 188 | sa->nl_family = AF_NETLINK; 189 | sa->nl_groups = 0; 190 | if (bind(fd, (struct sockaddr *) sa, sizeof(struct sockaddr)) < 0) { 191 | fprintf(stderr, "failed to bind socket: %s\n", strerror(errno)); 192 | exit(1); 193 | } 194 | 195 | struct nlmsghdr *nlmsg = malloc(4096); 196 | memset(nlmsg, 0, 4096); 197 | nlmsg->nlmsg_len = NLMSG_LENGTH(sizeof(struct ifinfomsg)); 198 | nlmsg->nlmsg_type = RTM_NEWLINK; 199 | nlmsg->nlmsg_flags = NLM_F_REQUEST|NLM_F_CREATE|NLM_F_EXCL|NLM_F_ACK; 200 | nlmsg->nlmsg_seq = time(NULL); 201 | 202 | struct ifinfomsg *ifmsg; 203 | ifmsg = (struct ifinfomsg *) NLMSG_DATA(nlmsg); 204 | ifmsg->ifi_family = AF_UNSPEC; 205 | 206 | struct rtattr *nest1, *nest2, *nest3; 207 | 208 | NLMSG_STRING(nlmsg, IFLA_IFNAME, "veth1"); 209 | 210 | nest1 = NLMSG_TAIL(nlmsg); 211 | NLMSG_ATTR(nlmsg, IFLA_LINKINFO); 212 | 213 | NLMSG_STRING(nlmsg, IFLA_INFO_KIND, "veth"); 214 | 215 | nest2 = NLMSG_TAIL(nlmsg); 216 | NLMSG_ATTR(nlmsg, IFLA_INFO_DATA); 217 | 218 | nest3 = NLMSG_TAIL(nlmsg); 219 | NLMSG_ATTR(nlmsg, VETH_INFO_PEER); 220 | 221 | nlmsg->nlmsg_len += sizeof(struct ifinfomsg); 222 | 223 | NLMSG_STRING(nlmsg, IFLA_IFNAME, "vpeer1"); 224 | 225 | nest3->rta_len = (void *)NLMSG_TAIL(nlmsg) - (void *)nest3; 226 | nest2->rta_len = (void *)NLMSG_TAIL(nlmsg) - (void *)nest2; 227 | nest1->rta_len = (void *)NLMSG_TAIL(nlmsg) - (void *)nest1; 228 | 229 | if (_nlmsg_send(fd, nlmsg) != 0) 230 | exit(1); 231 | 232 | if (_nlmsg_recieve(fd) != 0) { 233 | close(fd); 234 | exit(1); 235 | } 236 | 237 | int addrlen = sizeof(struct in_addr); 238 | free(nlmsg); 239 | nlmsg = malloc(4096); 240 | memset(nlmsg, 0, 4096); 241 | nlmsg->nlmsg_len = NLMSG_LENGTH(sizeof(struct ifaddrmsg)); 242 | nlmsg->nlmsg_flags = NLM_F_ACK|NLM_F_REQUEST|NLM_F_CREATE|NLM_F_EXCL; 243 | nlmsg->nlmsg_type = RTM_NEWADDR; 244 | nlmsg->nlmsg_seq = time(NULL); 245 | 246 | struct ifaddrmsg *ifa; 247 | ifa = (struct ifaddrmsg *) NLMSG_DATA(nlmsg); 248 | ifa->ifa_prefixlen = atoi("24"); 249 | if (!(ifa->ifa_index = if_nametoindex("veth1"))) { 250 | printf("failed to get veth1 name: %s\n", strerror(errno)); 251 | return 1; 252 | } 253 | ifa->ifa_family = AF_INET; 254 | ifa->ifa_scope = 0; 255 | 256 | struct in_addr addr; 257 | struct in_addr bcast; 258 | 259 | if (inet_pton(AF_INET, "172.16.1.1", &addr) < 0) 260 | exit(1); 261 | if (inet_pton(AF_INET, "172.16.1.255", &bcast) < 0) 262 | exit(1); 263 | 264 | _nlmsg_put(nlmsg, IFA_LOCAL, &addr, addrlen); 265 | _nlmsg_put(nlmsg, IFA_ADDRESS, &addr, addrlen); 266 | _nlmsg_put(nlmsg, IFA_BROADCAST, &bcast, addrlen); 267 | 268 | if (_nlmsg_send(fd, nlmsg) != 0) 269 | exit(1); 270 | if (_nlmsg_recieve(fd) != 0) { 271 | close(fd); 272 | exit(1); 273 | } 274 | 275 | pid_t child; 276 | if ((child = fork()) == 0) { 277 | if (new_ns("ns1") != 0) 278 | exit(1); 279 | exit(0); 280 | } 281 | int rc; 282 | waitpid(child, &rc, 0); 283 | if (rc != 0) 284 | fprintf(stderr, "namespace not created correctly\n"); 285 | 286 | free(nlmsg); 287 | nlmsg = malloc(4096); 288 | memset(nlmsg, 0, 4096); 289 | nlmsg->nlmsg_len = NLMSG_LENGTH(sizeof(struct ifinfomsg)); 290 | nlmsg->nlmsg_type = RTM_NEWLINK; 291 | nlmsg->nlmsg_flags = NLM_F_REQUEST|NLM_F_ACK; 292 | nlmsg->nlmsg_seq = time(NULL); 293 | 294 | ifmsg = (struct ifinfomsg *) NLMSG_DATA(nlmsg); 295 | ifmsg->ifi_family = AF_UNSPEC; 296 | if (!(ifmsg->ifi_index = if_nametoindex("vpeer1"))) { 297 | fprintf(stderr, "failed to get vpeer1 name: %s\n", strerror(errno)); 298 | return 1; 299 | } 300 | int nsfd = netns_get_fd("ns1"); 301 | _nlmsg_put(nlmsg, IFLA_NET_NS_FD, &nsfd, sizeof(nsfd)); 302 | 303 | if (_nlmsg_send(fd, nlmsg) != 0) 304 | exit(1); 305 | if (_nlmsg_recieve(fd) != 0) { 306 | close(fd); 307 | exit(1); 308 | } 309 | 310 | free(nlmsg); 311 | nlmsg = malloc(4096); 312 | memset(nlmsg, 0, 4096); 313 | nlmsg->nlmsg_len = NLMSG_LENGTH(sizeof(struct ifinfomsg)); 314 | nlmsg->nlmsg_flags = NLM_F_ACK|NLM_F_REQUEST; 315 | nlmsg->nlmsg_type = RTM_NEWLINK; 316 | nlmsg->nlmsg_seq = time(NULL); 317 | 318 | ifmsg = (struct ifinfomsg *) NLMSG_DATA(nlmsg); 319 | ifmsg->ifi_family = AF_UNSPEC; 320 | ifmsg->ifi_change |= IFF_UP; 321 | ifmsg->ifi_flags |= IFF_UP; 322 | if (!(ifmsg->ifi_index = if_nametoindex("veth1"))) { 323 | printf("failed to get veth1 name: %s\n", strerror(errno)); 324 | return 1; 325 | } 326 | 327 | if (_nlmsg_send(fd, nlmsg) != 0) 328 | exit(1); 329 | if (_nlmsg_recieve(fd) != 0) { 330 | close(fd); 331 | exit(1); 332 | } 333 | 334 | if ((child = fork()) == 0) { 335 | setns(nsfd, CLONE_NEWNET); 336 | 337 | if ((fd = socket(AF_NETLINK, SOCK_RAW, NETLINK_ROUTE)) < 0) { 338 | fprintf(stderr, "failed to get socket: %s\n", strerror(errno)); 339 | exit(1); 340 | } 341 | if (setsockopt(fd, SOL_SOCKET, SO_SNDBUF, 342 | &sndbuf, sizeof(sndbuf)) < 0) { 343 | fprintf(stderr, "failed to set send buffer: %s\n", strerror(errno)); 344 | exit(1); 345 | } 346 | if (setsockopt(fd, SOL_SOCKET, SO_RCVBUF, 347 | &rcvbuf,sizeof(rcvbuf)) < 0) { 348 | fprintf(stderr, "failed to set recieve buffer: %s\n", strerror(errno)); 349 | exit(1); 350 | } 351 | struct sockaddr_nl *sa = malloc(sizeof(struct sockaddr_nl)); 352 | memset(sa, 0, sizeof(struct sockaddr_nl)); 353 | sa->nl_family = AF_NETLINK; 354 | sa->nl_groups = 0; 355 | if (bind(fd, (struct sockaddr *) sa, sizeof(struct sockaddr)) < 0) { 356 | fprintf(stderr, "failed to bind socket: %s\n", strerror(errno)); 357 | exit(1); 358 | } 359 | 360 | 361 | free(nlmsg); 362 | nlmsg = malloc(4096); 363 | memset(nlmsg, 0, 4096); 364 | nlmsg->nlmsg_len = NLMSG_LENGTH(sizeof(struct ifaddrmsg)); 365 | nlmsg->nlmsg_flags = NLM_F_ACK|NLM_F_REQUEST|NLM_F_CREATE|NLM_F_EXCL; 366 | nlmsg->nlmsg_type = RTM_NEWADDR; 367 | nlmsg->nlmsg_seq = time(NULL); 368 | 369 | struct ifaddrmsg *ifa; 370 | ifa = (struct ifaddrmsg *) NLMSG_DATA(nlmsg); 371 | ifa->ifa_prefixlen = atoi("24"); 372 | if (!(ifa->ifa_index = if_nametoindex("vpeer1"))) { 373 | printf("failed to get veth1 name: %s\n", strerror(errno)); 374 | return 1; 375 | } 376 | ifa->ifa_family = AF_INET; 377 | ifa->ifa_scope = 0; 378 | 379 | struct in_addr addr; 380 | struct in_addr bcast; 381 | 382 | if (inet_pton(AF_INET, "172.16.1.2", &addr) < 0) 383 | exit(1); 384 | if (inet_pton(AF_INET, "172.16.1.255", &bcast) < 0) 385 | exit(1); 386 | 387 | _nlmsg_put(nlmsg, IFA_LOCAL, &addr, addrlen); 388 | _nlmsg_put(nlmsg, IFA_ADDRESS, &addr, addrlen); 389 | _nlmsg_put(nlmsg, IFA_BROADCAST, &bcast, addrlen); 390 | 391 | if (_nlmsg_send(fd, nlmsg) != 0) 392 | exit(1); 393 | if (_nlmsg_recieve(fd) != 0) { 394 | close(fd); 395 | exit(1); 396 | } 397 | 398 | free(nlmsg); 399 | nlmsg = malloc(4096); 400 | memset(nlmsg, 0, 4096); 401 | nlmsg->nlmsg_len = NLMSG_LENGTH(sizeof(struct ifinfomsg)); 402 | nlmsg->nlmsg_flags = NLM_F_ACK|NLM_F_REQUEST; 403 | nlmsg->nlmsg_type = RTM_NEWLINK; 404 | nlmsg->nlmsg_seq = time(NULL); 405 | 406 | ifmsg = (struct ifinfomsg *) NLMSG_DATA(nlmsg); 407 | ifmsg->ifi_family = AF_UNSPEC; 408 | ifmsg->ifi_change |= IFF_UP; 409 | ifmsg->ifi_flags |= IFF_UP; 410 | if (!(ifmsg->ifi_index = if_nametoindex("vpeer1"))) { 411 | printf("failed to get veth1 name: %s\n", strerror(errno)); 412 | return 1; 413 | } 414 | 415 | if (_nlmsg_send(fd, nlmsg) != 0) 416 | exit(1); 417 | if (_nlmsg_recieve(fd) != 0) { 418 | close(fd); 419 | exit(1); 420 | } 421 | 422 | free(nlmsg); 423 | nlmsg = malloc(4096); 424 | memset(nlmsg, 0, 4096); 425 | nlmsg->nlmsg_len = NLMSG_LENGTH(sizeof(struct ifinfomsg)); 426 | nlmsg->nlmsg_flags = NLM_F_ACK|NLM_F_REQUEST; 427 | nlmsg->nlmsg_type = RTM_NEWLINK; 428 | nlmsg->nlmsg_seq = time(NULL); 429 | 430 | ifmsg = (struct ifinfomsg *) NLMSG_DATA(nlmsg); 431 | ifmsg->ifi_family = AF_UNSPEC; 432 | ifmsg->ifi_change |= IFF_UP; 433 | ifmsg->ifi_flags |= IFF_UP; 434 | if (!(ifmsg->ifi_index = if_nametoindex("lo"))) { 435 | printf("failed to get veth1 name: %s\n", strerror(errno)); 436 | return 1; 437 | } 438 | 439 | if (_nlmsg_send(fd, nlmsg) != 0) 440 | exit(1); 441 | if (_nlmsg_recieve(fd) != 0) { 442 | close(fd); 443 | exit(1); 444 | } 445 | 446 | free(nlmsg); 447 | nlmsg = malloc(4096); 448 | memset(nlmsg, 0, 4096); 449 | nlmsg->nlmsg_len = NLMSG_LENGTH(sizeof(struct rtmsg)); 450 | nlmsg->nlmsg_flags = NLM_F_ACK|NLM_F_REQUEST|NLM_F_CREATE|NLM_F_EXCL; 451 | nlmsg->nlmsg_type = RTM_NEWROUTE; 452 | nlmsg->nlmsg_seq = time(NULL); 453 | 454 | struct rtmsg *rtm; 455 | rtm = (struct rtmsg *) NLMSG_DATA(nlmsg); 456 | 457 | rtm->rtm_family = AF_INET; 458 | rtm->rtm_table = RT_TABLE_MAIN; 459 | rtm->rtm_scope = RT_SCOPE_UNIVERSE; 460 | rtm->rtm_protocol = RTPROT_BOOT; 461 | rtm->rtm_type = RTN_UNICAST; 462 | rtm->rtm_dst_len = 0; 463 | 464 | if (inet_pton(AF_INET, "172.16.1.1", &addr) < 0) 465 | exit(1); 466 | 467 | _nlmsg_put(nlmsg, RTA_GATEWAY, &addr, addrlen); 468 | 469 | if (_nlmsg_send(fd, nlmsg) != 0) 470 | exit(1); 471 | if (_nlmsg_recieve(fd) != 0) { 472 | close(fd); 473 | exit(1); 474 | } 475 | close(fd); 476 | } 477 | waitpid(child, &rc, 0); 478 | if (rc != 0) 479 | fprintf(stderr, "failed to run commands in child network namespace\n"); 480 | 481 | return 0; 482 | } 483 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | {one line to give the program's name and a brief idea of what it does.} 635 | Copyright (C) {year} {name of author} 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | {project} Copyright (C) {year} {fullname} 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | --------------------------------------------------------------------------------