#include <async.h>#include <dns.h>#include <arpc.h>#include <aios.h>#include <chord_types.h>#include <chord_prot.h>#include <accordion_prot.h>#include <fingers_prot.h>#include <misc_utils.h>#include <id_utils.h>#include "rpclib.h"const char *usage = "Usage: nodeq [-m] [-r] host port vnode\n";int outstanding = 0;int errors = 0;bool do_reverse_lookup = false;bool do_accordion = false;struct node {  int i;  chord_node_ext y;  str hostname;  node (int i_, chord_node_ext n) : i (i_), y (n), hostname ("") {}};vec<ptr<node> > successors;vec<ptr<node> > predecessors;vec<ptr<node> > fingers;voidprintlist (str desc, vec<ptr<node> > &lst){  if (lst.size () == 0)    return;  aout << "=== " << desc << "\n";  for (size_t i = 0; i < lst.size (); i++) {    chord_node z = make_chord_node (lst[i]->y.n);    str h;    if (lst[i]->hostname.len () > 0)      h = lst[i]->hostname;    else      h = z.r.hostname;    aout << i << ".\t"	 << z.x << " "	 << h << " "	 << z.r.port << " "	 << z.vnode_num << " "	 << z.knownup << " "	 << z.age << " "	 << z. budget << " "	 << lst[i]->y.a_lat << " "	 << lst[i]->y.a_var << " "	 << lst[i]->y.nrpc << " "	 << z.coords[0] << " "	 << z.coords[1] << " "	 << z.coords[2] << " "	 << z.e	 << "\n";  }}voidfinish (){  printlist ("predecessors", predecessors);  printlist ("successors", successors);  printlist ("fingers", fingers);  exit (errors > 0);}voiddns_lookup_cb (ptr<node> nn, ptr<hostent> he, int err){  if (!err)    nn->hostname = he->h_name;    outstanding--;  if (outstanding == 0)    finish ();}voidprocessreslist_cb (str desc, vec<ptr<node> > *list,		   chord_nodelistextres *res, clnt_stat status){  outstanding--;  if (status) {    errors++;    warnx << "no " << desc << ": " << status << "\n";    if (outstanding == 0)      finish ();    return;  }  size_t sz = res->resok->nlist.size ();  vec<chord_node> zs;  for (size_t i = 0; i < sz; i++) {    ptr<node> nn = New refcounted<node> (i, res->resok->nlist[i]);    list->push_back (nn);        if (do_reverse_lookup) {      outstanding++;      struct in_addr ar;      ar.s_addr = htonl (res->resok->nlist[i].n.machine_order_ipv4_addr);      dns_hostbyaddr (ar, wrap (&dns_lookup_cb, nn));    }  }  delete res;    if (outstanding == 0)    finish ();}voidprint_successors (const chord_node &dst){  ptr<chordID> ga = New refcounted<chordID> (dst.x);  chord_nodelistextres *lst = New chord_nodelistextres ();  doRPC (dst, chord_program_1, CHORDPROC_GETSUCC_EXT,	 ga, lst,	 wrap (processreslist_cb, "successors", &successors, lst));  outstanding++;}voidprint_fingers (const chord_node &dst){  ptr<chordID> ga = New refcounted<chordID> (dst.x);  chord_nodelistextres *lst = New chord_nodelistextres ();  if (do_accordion)     doRPC (dst, accordion_program_1, ACCORDIONPROC_GETFINGERS_EXT,	 ga, lst,	 wrap (processreslist_cb, "fingers", &fingers, lst));  else     doRPC (dst, fingers_program_1, FINGERSPROC_GETFINGERS_EXT,	 ga, lst,	 wrap (processreslist_cb, "fingers", &fingers, lst));  outstanding++;}voidprint_predecessors (const chord_node &dst){  ptr<chordID> ga = New refcounted<chordID> (dst.x);  chord_nodelistextres *lst = New chord_nodelistextres ();  doRPC (dst, chord_program_1, CHORDPROC_GETPRED_EXT,	 ga, lst,	 wrap (processreslist_cb, "predecessors", &predecessors, lst));  outstanding++;}intmain (int argc, char *argv[]){  int ch;  while ((ch = getopt (argc, argv, "rm")) != -1)    switch (ch) {    case 'r':      do_reverse_lookup = true;      break;    case 'm':      do_accordion = true;      break;    default:      fatal << usage;      break;    }  argc -= optind;  argv += optind;    if (argc != 3)    fatal << usage;  chord_node dst;  if (inet_addr (argv[0]) == INADDR_NONE) {    // yep, this still blocks.    struct hostent *h = gethostbyname (argv[0]);    if (!h)      fatal << "Invalid address or hostname: " << argv[0] << "\n";    struct in_addr *ptr = (struct in_addr *) h->h_addr;    dst.r.hostname = inet_ntoa (*ptr);  } else {    dst.r.hostname = argv[0];  }  dst.r.port = atoi (argv[1]);  dst.vnode_num = atoi (argv[2]);  dst.x = make_chordID (dst.r.hostname, dst.r.port, dst.vnode_num);  print_predecessors (dst);  print_successors (dst);  print_fingers (dst);   amain ();}