Make code fits in 80 columns.

kernel_netlink.c

@@ -1294,7 +1294,8 @@ parse_addr_rta(struct ifaddrmsg *addr, int len, struct in6_addr *res)
                     memcpy(res->s6_addr, RTA_DATA(rta), 16);
                 break;
             default:
-                kdebugf("ifaddr: unexpected address family %d\n", addr->ifa_family);
+                kdebugf("ifaddr: unexpected address family %d\n",
+                        addr->ifa_family);
                 return -1;
                 break;
             }

kernel_socket.c

@@ -785,8 +785,8 @@ kernel_addresses(char *ifname, int ifindex, int ll,
             memcpy(routes[i].prefix, &sin6->sin6_addr, 16);
             if(ll)
                 /* This a perfect example of counter-productive optimisation :
-                   KAME encodes interface index onto bytes 2 and 3, so we have to
-                   reset those bytes to 0 before passing them to babeld. */
+                   KAME encodes interface index onto bytes 2 and 3, so we have
+                   to reset those bytes to 0 before passing them to babeld. */
                 memset(routes[i].prefix + 2, 0, 2);
             routes[i].plen = 128;
             routes[i].metric = 0;

route.h

@@ -91,8 +91,9 @@ int update_feasible(struct source *src,
                     unsigned short seqno, unsigned short refmetric);
 void change_smoothing_half_life(int half_life);
 int route_smoothed_metric(struct babel_route *route);
-struct babel_route *find_best_route(const unsigned char *prefix, unsigned char plen,
-                              int feasible, struct neighbour *exclude);
+struct babel_route *find_best_route(const unsigned char *prefix,
+                                    unsigned char plen,
+                                    int feasible, struct neighbour *exclude);
 struct babel_route *install_best_route(const unsigned char prefix[16],
                                  unsigned char plen);
 void update_neighbour_metric(struct neighbour *neigh, int changed);