HomeSort by: relevance | last modified time | path
    Searched defs:Dad (Results 1 - 7 of 7) 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/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 25 milliseconds