/* vim: set expandtab ts=4 sw=4: */ /* * You may redistribute this program and/or modify it under the terms of * the GNU General Public License as published by the Free Software Foundation, * either version 3 of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . */ #include "admin/Admin.h" #include "benc/List.h" #include "subnode/ReachabilityCollector.h" #include "subnode/ReachabilityCollector_admin.h" #include "util/AddrTools.h" #include "util/Identity.h" #include "benc/Dict.h" struct Context { struct Admin* admin; struct Allocator* alloc; struct ReachabilityCollector* rc; Identity }; static List* numList(void* buf, uint32_t numberSz, struct Allocator* alloc) { List* l = List_new(alloc); for (int i = 0; i < LinkState_SLOTS; i++) { int64_t num; if (numberSz == 2) { num = ((uint16_t*)buf)[i]; } else if (numberSz == 4) { num = ((uint32_t*)buf)[i]; } else { Assert_failure("unexpected number size"); } List_addInt(l, num, alloc); } return l; } #define NODES_PER_PAGE 8 static void getPeerInfo(Dict* args, void* vcontext, String* txid, struct Allocator* requestAlloc) { struct Context* ctx = Identity_check((struct Context*) vcontext); int page = 0; int64_t* pageP = Dict_getIntC(args, "page"); if (pageP && *pageP > 0) { page = *pageP; } List* peerList = List_new(requestAlloc); for (int i = page * NODES_PER_PAGE, j = 0; j < NODES_PER_PAGE; i++, j++) { struct ReachabilityCollector_PeerInfo* pi = ReachabilityCollector_getPeerInfo(ctx->rc, i); if (!pi) { break; } Dict* pid = Dict_new(requestAlloc); Dict_putStringC(pid, "addr", Address_toStringKey(&pi->addr, requestAlloc), requestAlloc); uint8_t rpath[20]; AddrTools_printPath(rpath, pi->pathThemToUs); Dict_putStringC( pid, "pathThemToUs", String_newBinary(rpath, 19, requestAlloc), requestAlloc); Dict_putIntC(pid, "querying", pi->isQuerying, requestAlloc); Dict_putListC( pid, "lagSlots", numList(pi->linkState.lagSlots, 2, requestAlloc), requestAlloc); Dict_putListC( pid, "dropSlots", numList(pi->linkState.dropSlots, 2, requestAlloc), requestAlloc); Dict_putListC( pid, "kbRecvSlots", numList(pi->linkState.kbRecvSlots, 4, requestAlloc), requestAlloc); Dict_putIntC( pid, "samples", pi->linkState.samples, requestAlloc); List_addDict(peerList, pid, requestAlloc); } Dict* out = Dict_new(requestAlloc); Dict_putListC(out, "peers", peerList, requestAlloc); Dict_putStringCC(out, "error", "none", requestAlloc); Admin_sendMessage(out, txid, ctx->admin); } void ReachabilityCollector_admin_register(struct ReachabilityCollector* rc, struct Admin* admin, struct Allocator* alloc) { struct Context* ctx = Allocator_clone(alloc, (&(struct Context) { .admin = admin, .alloc = alloc, .rc = rc })); Identity_set(ctx); Admin_registerFunction("ReachabilityCollector_getPeerInfo", getPeerInfo, ctx, true, ((struct Admin_FunctionArg[]) { { .name = "page", .required = true, .type = "Int" } }), admin); }