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

  /src/sys/dev/dmover/
dmover_util.c 76 dmover_algdesc_lookup(const struct dmover_algdesc *dad, int ndad,
80 for (; ndad != 0; ndad--, dad++) {
81 if (name[0] == dad->dad_name[0] &&
82 strcmp(name, dad->dad_name) == 0)
83 return (dad);
  /src/tests/net/arp/
Makefile 8 .for name in arp dad
  /src/tests/net/ndp/
Makefile 8 .for name in dad ndp
  /src/external/cddl/osnet/dist/uts/common/zmod/
deflate.h 68 ush dad; /* father node in Huffman tree */ member in union:ct_data_s::__anon9109
75 #define Dad dl.dad
  /src/external/gpl3/binutils/dist/zlib/
deflate.h 78 ush dad; /* father node in Huffman tree */ member in union:ct_data_s::__anon10978
85 #define Dad dl.dad
  /src/external/gpl3/binutils.old/dist/zlib/
deflate.h 74 ush dad; /* father node in Huffman tree */ member in union:ct_data_s::__anon12425
81 #define Dad dl.dad
  /src/external/gpl3/gdb.old/dist/zlib/
deflate.h 74 ush dad; /* father node in Huffman tree */ member in union:ct_data_s::__anon22728
81 #define Dad dl.dad
  /src/external/gpl3/gdb/dist/zlib/
deflate.h 78 ush dad; /* father node in Huffman tree */ member in union:ct_data_s::__anon2114
85 #define Dad dl.dad
  /src/common/dist/zlib/
deflate.h 80 ush dad; /* father node in Huffman tree */ member in union:ct_data_s::__anon11
87 #define Dad dl.dad
  /src/external/mpl/bind/dist/bin/tests/system/
ifconfig.sh.in 115 [ "$aaaa" ] && ifconfig lo0 inet6 alias -dad $aaaa/64
  /src/external/bsd/dhcpcd/dist/src/
ipv6.c 106 /* Only add the LL address if we have a carrier, so DaD works. */
339 * if it does then treat it as a DAD failure.
354 uint32_t dad; local
357 dad = (uint32_t)*dad_counter;
363 &dad);
366 *dad_counter = (int)dad;
478 int dad; local
493 dad = 0;
495 &dad) == -1)
497 return dad;
    [all...]
  /src/sys/net/
zlib.c 342 ush dad; /* father node in Huffman tree */ member in union:ct_data_s::__anon8
349 #define Dad dl.dad
2578 * IN assertion: the fields freq and dad are set, heap[heap_max] and
2610 bits = tree[tree[n].Dad].Len + 1;
2613 /* We overwrite tree[n].Dad which is no longer needed */
2770 tree[n].Dad = tree[m].Dad = (ush)node;
2785 /* At this point, the fields freq and dad are set. We can now

Completed in 75 milliseconds