neighbor
setpwe3neighbor(const char *label, const char *neighbor)
error = getaddrinfo(neighbor, NULL, &hints, &res);
errx(1, "pweneighbor %s: %s", neighbor, gai_strerror(error));
if (req->neighbor.addr.aid != AID_UNSPEC &&
memcmp(&req->neighbor.addr, &ctl.remote_addr,
memcpy(&neighbor.addr, &res->peeraddr, sizeof(neighbor.addr));
strlcpy(neighbor.descr, res->peerdesc, sizeof(neighbor.descr));
neighbor.is_group = res->is_group;
strlcpy(neighbor.reason, res->reason, sizeof(neighbor.reason));
if (req->neighbor.addr.aid != AID_UNSPEC &&
memcmp(&req->neighbor.addr, &ctl.remote_addr,
ribreq.neighbor = neighbor;
neighbor.show_timers = (res->action == SHOW_NEIGHBOR_TIMERS);
&neighbor, sizeof(neighbor));
ribreq.neighbor = neighbor;
&neighbor, sizeof(neighbor));
&neighbor, sizeof(neighbor));
&neighbor, sizeof(neighbor));
&neighbor, sizeof(neighbor));
&neighbor, sizeof(neighbor));
ribreq.neighbor = neighbor;
if (output->neighbor == NULL)
output->neighbor(&p, res);
struct ctl_neighbor neighbor = { 0 };
void (*neighbor)(struct peer *, struct parse_result *);
.neighbor = show_neighbor,
.neighbor = json_neighbor,
.neighbor = ometric_neighbor_stats,
struct ctl_neighbor neighbor;
struct ctl_neighbor neighbor;
if (imsg_get_data(&imsg, &neighbor,
sizeof(neighbor)) == -1)
memset(&neighbor, 0, sizeof(neighbor));
if (!peer_matched(p, &neighbor))
if (!neighbor.show_timers) {
} else if (!neighbor.show_timers) {
if (imsg_get_data(&imsg, &neighbor,
sizeof(neighbor)) == -1) {
if (!peer_matched(p, &neighbor))
neighbor.reason[
sizeof(neighbor.reason) - 1] = '\0';
neighbor.reason);
neighbor.reason[
sizeof(neighbor.reason) - 1] = '\0';
neighbor.reason);
neighbor.reason);
if (peer_matched(p, &ribreq.neighbor))
neighbor : { curpeer = new_peer(); }
| groupopts_l neighbor '\n'
| grammar neighbor '\n'
if (!rde_match_peer(prefix_peer(p), &req->neighbor))
if (!rde_match_peer(peer, &req->neighbor))
peer = peer_match(&ctx->req.neighbor, ctx->peerid);
peer = peer_match(&req->neighbor, 0);
} while ((peer = peer_match(&req->neighbor,
struct mpage *neighbor = NULL;
if ((neighbor = btree_get_mpage(bt, NODEPGNO(node))) == NULL)
neighbor->parent_index = mp->parent_index + 1;
if ((neighbor = btree_get_mpage(bt, NODEPGNO(node))) == NULL)
neighbor->parent_index = mp->parent_index - 1;
si = NUMKEYS(neighbor) - 1;
neighbor->parent = parent;
neighbor->pgno, NUMKEYS(neighbor), (float)PAGEFILL(bt, neighbor) / 10);
if (PAGEFILL(bt, neighbor) >= FILL_THRESHOLD && NUMKEYS(neighbor) >= 2)
return btree_move_node(bt, neighbor, si, mp, di);
return btree_merge(bt, neighbor, mp);
return btree_merge(bt, mp, neighbor);
| grammar neighbor '\n'
neighbor : NEIGHBOR routerid {
u_int32_t neighbor;
GET_ADDR(neighbor);
neighbor = htonl(neighbor);
if (nb->addr == neighbor) {
nb->addr = neighbor;
n_node = find_node(neighbor, &routers);
ask(neighbor);
u_int32_t neighbor;
neighbor = *(u_int32_t*)p;
if (neighbor == 0)
neighbor = ifc_addr;
if (nb->addr == neighbor) {
struct neighbor *next;
nb->addr = neighbor;
n_node = find_node(neighbor, &routers);
ask(neighbor);
u_int32_t neighbor;
GET_ADDR(neighbor);
neighbor = htonl(neighbor);
printf("%s (%s) [%d/%d]\n", inet_fmt(neighbor, s1),
inet_name(neighbor), metric, thresh);
u_int32_t neighbor = *(u_int32_t*)p;
printf("%s (%s) [%d/%d", inet_fmt(neighbor, s1),
inet_name(neighbor), metric, thresh);
output->neighbor(nbr, 1);
output->neighbor(nbr, 0);
void (*neighbor)(struct ctl_nbr *, int);
.neighbor = show_neighbor,
u_char neighbor[4];
GET_ADDR(neighbor);
printf("\n\tneighbor %s", ipaddr_string(neighbor));
u_char laddr[4], neighbor[4];
GET_ADDR(neighbor);
ipaddr_string(neighbor), metric, thresh);
u_char laddr[4], neighbor[4];
GET_ADDR(neighbor);
printf("%s (%d/%d", ipaddr_string(neighbor),