HomeSort by: relevance | last modified time | path
    Searched refs:ND (Results 1 - 9 of 9) sorted by relevancy

  /src/usr.sbin/ndp/
ndp.c 805 struct in6_ndireq nd; local
812 (void)memset(&nd, 0, sizeof(nd));
813 (void)strlcpy(nd.ifname, ifname, sizeof(nd.ifname));
814 if (prog_ioctl(s, SIOCGIFINFO_IN6, &nd) < 0)
816 #define ND nd.ndi
817 newflags = ND.flags;
878 SETVALUE("basereachable", ND.basereachable)
    [all...]
  /src/games/backgammon/common_source/
fancy.c 66 static char *ND; /* forward cursor sequence */
73 static int lND; /* length of ND */
83 static char **tstr[] = {&BC, &CD, &CE, &CL, &CM, &HO, &MC, &ML, &ND, &UP};
462 /* CR, LF, and ND */
467 /* LF, ND */
480 /* CR, UP, and ND */
485 /* UP and ND */
520 tputs(ND, 1, addbuf);
529 tputs(ND, 1, addbuf);
537 tputs(ND, 1, addbuf)
    [all...]
  /src/sys/netinet6/
nd6.c 66 #include <net/nd.h>
91 /* preventing too many loops in ND option parsing */
92 int nd6_maxndopt = 10; /* max # of ND options allowed */
131 .nd_maxqueuelen = 1, /* max # of packets in unresolved ND entries */
170 struct nd_kifinfo *nd; local
172 nd = kmem_zalloc(sizeof(*nd), KM_SLEEP);
174 nd->chlim = IPV6_DEFHLIM;
175 nd->basereachable = REACHABLE_TIME;
176 nd->reachable = ND_COMPUTE_RTIME(nd->basereachable)
    [all...]
  /src/games/rogue/
zap.c 338 goto ND;
377 goto ND;
391 ND: for (i = 0; i < 10; i++) {
  /src/libexec/getty/
gettytab.h 101 #define ND gettynums[3].value
subr.c 539 f |= adelay(ND, nldelay);
  /src/games/warp/
term.c 158 ND = Tgetstr("nd"); /* non-destructive move cursor right */
209 if (!*ND) /* not defined? */
212 NDsize = comp_tc(cmbuffer,ND,1);
218 printf("ND");
term.h 250 * scaled by the number of lines (2nd argument), puts out the string (1st arg)
260 EXT char *ND INIT(NULL); /* non-destructive cursor right */
  /src/sys/external/bsd/compiler_rt/dist/lib/profile/
InstrProfData.inc 507 uint32_t ND = Closure->GetNumValueDataForSite(Record, ValueKind, S);
508 This->SiteCountArray[S] = ND;
511 DstVD += ND;

Completed in 23 milliseconds