Home
last modified time | relevance | path

Searched refs:Dad (Results 1 - 10 of 10) sorted by relevance

/third_party/node/deps/zlib/
H A Ddeflate.h85 #define Dad dl.dad macro
H A Dtrees.c561 bits = tree[tree[n].Dad].Len + 1; in gen_bitlen()
564 /* We overwrite tree[n].Dad which is no longer needed */ in gen_bitlen()
682 tree[n].Dad = tree[m].Dad = (ush)node; in build_tree()
/third_party/node/deps/v8/third_party/zlib/
H A Ddeflate.h81 #define Dad dl.dad macro
H A Dtrees.c512 bits = tree[tree[n].Dad].Len + 1;
515 /* We overwrite tree[n].Dad which is no longer needed */
675 tree[n].Dad = tree[m].Dad = (ush)node;
/third_party/libwebsockets/win32port/zlib/
H A Ddeflate.h75 #define Dad dl.dad macro
H A Dtrees.c520 bits = tree[tree[n].Dad].Len + 1;
523 /* We overwrite tree[n].Dad which is no longer needed */
683 tree[n].Dad = tree[m].Dad = (ush)node;
/third_party/skia/third_party/externals/zlib/
H A Ddeflate.h81 #define Dad dl.dad macro
H A Dtrees.c512 bits = tree[tree[n].Dad].Len + 1;
515 /* We overwrite tree[n].Dad which is no longer needed */
675 tree[n].Dad = tree[m].Dad = (ush)node;
/third_party/zlib/
H A Ddeflate.h85 #define Dad dl.dad macro
H A Dtrees.c580 bits = tree[tree[n].Dad].Len + 1; in gen_bitlen()
583 /* We overwrite tree[n].Dad which is no longer needed */ in gen_bitlen()
702 tree[n].Dad = tree[m].Dad = (ush)node; in build_tree()

Completed in 13 milliseconds