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

  /src/common/dist/zlib/
deflate.h 80 ush dad; /* father node in Huffman tree */ member in union:ct_data_s::__anon48
87 #define Dad dl.dad
  /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/external/bsd/dhcpcd/dist/src/
ipv6.c 105 /* Only add the LL address if we have a carrier, so DaD works. */
341 * if it does then treat it as a DAD failure.
358 uint32_t dad; local
361 dad = (uint32_t)*dad_counter;
368 ifp->vlanid, &dad);
371 *dad_counter = (int)dad;
484 int dad; local
499 dad = 0;
501 prefix, prefix_len, ifp, &dad) == -1)
503 return dad;
    [all...]
  /src/sys/net/
zlib.c 342 ush dad; /* father node in Huffman tree */ member in union:ct_data_s::__anon7099
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 27 milliseconds