| /dports/databases/percona56-server/percona-server-5.6.51-91.0/storage/myisam/ |
| H A D | myisampack.c | 106 uint tree_number; member
1877 uint k,tree_number; in join_same_trees() local
1881 for (tree_number=0, i=huff_counts ; i < last_count ; i++) in join_same_trees()
1883 if (!i->tree->tree_number) in join_same_trees()
1885 i->tree->tree_number= ++tree_number; in join_same_trees()
1890 if (! j->tree->tree_number && ! j->tree_buff) in join_same_trees()
1914 trees, tree_number)); in join_same_trees()
1917 return tree_number; /* Return trees left */ in join_same_trees()
1939 if (huff_tree->tree_number > 0) in make_huff_decode_table()
2132 counts->tree->tree_number, counts->field_length); in write_field_info()
[all …]
|
| /dports/databases/percona56-client/percona-server-5.6.51-91.0/storage/myisam/ |
| H A D | myisampack.c | 106 uint tree_number; member
1877 uint k,tree_number; in join_same_trees() local
1881 for (tree_number=0, i=huff_counts ; i < last_count ; i++) in join_same_trees()
1883 if (!i->tree->tree_number) in join_same_trees()
1885 i->tree->tree_number= ++tree_number; in join_same_trees()
1890 if (! j->tree->tree_number && ! j->tree_buff) in join_same_trees()
1914 trees, tree_number)); in join_same_trees()
1917 return tree_number; /* Return trees left */ in join_same_trees()
1939 if (huff_tree->tree_number > 0) in make_huff_decode_table()
2132 counts->tree->tree_number, counts->field_length); in write_field_info()
[all …]
|
| /dports/databases/percona-pam-for-mysql/percona-server-5.6.51-91.0/storage/myisam/ |
| H A D | myisampack.c | 106 uint tree_number; member
1877 uint k,tree_number; in join_same_trees() local
1881 for (tree_number=0, i=huff_counts ; i < last_count ; i++) in join_same_trees()
1883 if (!i->tree->tree_number) in join_same_trees()
1885 i->tree->tree_number= ++tree_number; in join_same_trees()
1890 if (! j->tree->tree_number && ! j->tree_buff) in join_same_trees()
1914 trees, tree_number)); in join_same_trees()
1917 return tree_number; /* Return trees left */ in join_same_trees()
1939 if (huff_tree->tree_number > 0) in make_huff_decode_table()
2132 counts->tree->tree_number, counts->field_length); in write_field_info()
[all …]
|
| /dports/databases/mysqlwsrep56-server/mysql-wsrep-wsrep_5.6.51-25.33/storage/myisam/ |
| H A D | myisampack.c | 106 uint tree_number; member
1877 uint k,tree_number; in join_same_trees() local
1881 for (tree_number=0, i=huff_counts ; i < last_count ; i++) in join_same_trees()
1883 if (!i->tree->tree_number) in join_same_trees()
1885 i->tree->tree_number= ++tree_number; in join_same_trees()
1890 if (! j->tree->tree_number && ! j->tree_buff) in join_same_trees()
1914 trees, tree_number)); in join_same_trees()
1917 return tree_number; /* Return trees left */ in join_same_trees()
1939 if (huff_tree->tree_number > 0) in make_huff_decode_table()
2132 counts->tree->tree_number, counts->field_length); in write_field_info()
[all …]
|
| /dports/databases/mariadb103-client/mariadb-10.3.34/storage/myisam/ |
| H A D | myisampack.c | 99 uint tree_number; member
1867 uint k,tree_number; in join_same_trees() local
1871 for (tree_number=0, i=huff_counts ; i < last_count ; i++) in join_same_trees()
1873 if (!i->tree->tree_number) in join_same_trees()
1875 i->tree->tree_number= ++tree_number; in join_same_trees()
1880 if (! j->tree->tree_number && ! j->tree_buff) in join_same_trees()
1904 trees, tree_number)); in join_same_trees()
1907 return tree_number; /* Return trees left */ in join_same_trees()
1929 if (huff_tree->tree_number > 0) in make_huff_decode_table()
2122 counts->tree->tree_number, counts->field_length); in write_field_info()
[all …]
|
| /dports/databases/mariadb103-server/mariadb-10.3.34/storage/myisam/ |
| H A D | myisampack.c | 99 uint tree_number; member
1867 uint k,tree_number; in join_same_trees() local
1871 for (tree_number=0, i=huff_counts ; i < last_count ; i++) in join_same_trees()
1873 if (!i->tree->tree_number) in join_same_trees()
1875 i->tree->tree_number= ++tree_number; in join_same_trees()
1880 if (! j->tree->tree_number && ! j->tree_buff) in join_same_trees()
1904 trees, tree_number)); in join_same_trees()
1907 return tree_number; /* Return trees left */ in join_same_trees()
1929 if (huff_tree->tree_number > 0) in make_huff_decode_table()
2122 counts->tree->tree_number, counts->field_length); in write_field_info()
[all …]
|
| /dports/databases/mysql56-client/mysql-5.6.51/storage/myisam/ |
| H A D | myisampack.c | 106 uint tree_number; member
1877 uint k,tree_number; in join_same_trees() local
1881 for (tree_number=0, i=huff_counts ; i < last_count ; i++) in join_same_trees()
1883 if (!i->tree->tree_number) in join_same_trees()
1885 i->tree->tree_number= ++tree_number; in join_same_trees()
1890 if (! j->tree->tree_number && ! j->tree_buff) in join_same_trees()
1914 trees, tree_number)); in join_same_trees()
1917 return tree_number; /* Return trees left */ in join_same_trees()
1939 if (huff_tree->tree_number > 0) in make_huff_decode_table()
2132 counts->tree->tree_number, counts->field_length); in write_field_info()
[all …]
|
| /dports/databases/mysql55-client/mysql-5.5.62/storage/myisam/ |
| H A D | myisampack.c | 97 uint tree_number; member
1870 uint k,tree_number; in join_same_trees() local
1874 for (tree_number=0, i=huff_counts ; i < last_count ; i++) in join_same_trees()
1876 if (!i->tree->tree_number) in join_same_trees()
1878 i->tree->tree_number= ++tree_number; in join_same_trees()
1883 if (! j->tree->tree_number && ! j->tree_buff) in join_same_trees()
1907 trees, tree_number)); in join_same_trees()
1910 return tree_number; /* Return trees left */ in join_same_trees()
1932 if (huff_tree->tree_number > 0) in make_huff_decode_table()
2125 counts->tree->tree_number, counts->field_length); in write_field_info()
[all …]
|
| /dports/databases/xtrabackup8/percona-xtrabackup-8.0.14/storage/myisam/ |
| H A D | myisampack.cc | 115 uint tree_number; member
1700 uint k, tree_number; in join_same_trees() local
1704 for (tree_number = 0, i = huff_counts; i < last_count; i++) { in join_same_trees()
1705 if (!i->tree->tree_number) { in join_same_trees()
1706 i->tree->tree_number = ++tree_number; in join_same_trees()
1709 if (!j->tree->tree_number && !j->tree_buff) { in join_same_trees()
1732 return tree_number; /* Return trees left */ in join_same_trees()
1751 if (huff_tree->tree_number > 0) { in make_huff_decode_table()
1947 if (huff_tree[i].tree_number > 0 && huff_tree[i].elements > length) in write_huff_tree()
1964 if (huff_tree->tree_number == 0) continue; /* Deleted tree */ in write_huff_tree()
[all …]
|
| /dports/databases/xtrabackup/percona-xtrabackup-2.4.21/storage/myisam/ |
| H A D | myisampack.c | 106 uint tree_number; member
1896 uint k,tree_number; in join_same_trees() local
1900 for (tree_number=0, i=huff_counts ; i < last_count ; i++) in join_same_trees()
1902 if (!i->tree->tree_number) in join_same_trees()
1904 i->tree->tree_number= ++tree_number; in join_same_trees()
1909 if (! j->tree->tree_number && ! j->tree_buff) in join_same_trees()
1933 trees, tree_number)); in join_same_trees()
1936 return tree_number; /* Return trees left */ in join_same_trees()
1958 if (huff_tree->tree_number > 0) in make_huff_decode_table()
2152 counts->tree->tree_number, counts->field_length); in write_field_info()
[all …]
|
| /dports/databases/percona57-server/percona-server-5.7.36-39/storage/myisam/ |
| H A D | myisampack.c | 106 uint tree_number; member
1896 uint k,tree_number; in join_same_trees() local
1900 for (tree_number=0, i=huff_counts ; i < last_count ; i++) in join_same_trees()
1902 if (!i->tree->tree_number) in join_same_trees()
1904 i->tree->tree_number= ++tree_number; in join_same_trees()
1909 if (! j->tree->tree_number && ! j->tree_buff) in join_same_trees()
1933 trees, tree_number)); in join_same_trees()
1936 return tree_number; /* Return trees left */ in join_same_trees()
1958 if (huff_tree->tree_number > 0) in make_huff_decode_table()
2152 counts->tree->tree_number, counts->field_length); in write_field_info()
[all …]
|
| /dports/databases/percona57-pam-for-mysql/percona-server-5.7.36-39/storage/myisam/ |
| H A D | myisampack.c | 106 uint tree_number; member
1896 uint k,tree_number; in join_same_trees() local
1900 for (tree_number=0, i=huff_counts ; i < last_count ; i++) in join_same_trees()
1902 if (!i->tree->tree_number) in join_same_trees()
1904 i->tree->tree_number= ++tree_number; in join_same_trees()
1909 if (! j->tree->tree_number && ! j->tree_buff) in join_same_trees()
1933 trees, tree_number)); in join_same_trees()
1936 return tree_number; /* Return trees left */ in join_same_trees()
1958 if (huff_tree->tree_number > 0) in make_huff_decode_table()
2152 counts->tree->tree_number, counts->field_length); in write_field_info()
[all …]
|
| /dports/databases/mysqlwsrep57-server/mysql-wsrep-wsrep_5.7.35-25.27/storage/myisam/ |
| H A D | myisampack.c | 106 uint tree_number; member
1896 uint k,tree_number; in join_same_trees() local
1900 for (tree_number=0, i=huff_counts ; i < last_count ; i++) in join_same_trees()
1902 if (!i->tree->tree_number) in join_same_trees()
1904 i->tree->tree_number= ++tree_number; in join_same_trees()
1909 if (! j->tree->tree_number && ! j->tree_buff) in join_same_trees()
1933 trees, tree_number)); in join_same_trees()
1936 return tree_number; /* Return trees left */ in join_same_trees()
1958 if (huff_tree->tree_number > 0) in make_huff_decode_table()
2152 counts->tree->tree_number, counts->field_length); in write_field_info()
[all …]
|
| /dports/databases/percona57-client/percona-server-5.7.36-39/storage/myisam/ |
| H A D | myisampack.c | 106 uint tree_number; member
1896 uint k,tree_number; in join_same_trees() local
1900 for (tree_number=0, i=huff_counts ; i < last_count ; i++) in join_same_trees()
1902 if (!i->tree->tree_number) in join_same_trees()
1904 i->tree->tree_number= ++tree_number; in join_same_trees()
1909 if (! j->tree->tree_number && ! j->tree_buff) in join_same_trees()
1933 trees, tree_number)); in join_same_trees()
1936 return tree_number; /* Return trees left */ in join_same_trees()
1958 if (huff_tree->tree_number > 0) in make_huff_decode_table()
2152 counts->tree->tree_number, counts->field_length); in write_field_info()
[all …]
|
| /dports/databases/mysql57-client/mysql-5.7.36/storage/myisam/ |
| H A D | myisampack.c | 106 uint tree_number; member
1896 uint k,tree_number; in join_same_trees() local
1900 for (tree_number=0, i=huff_counts ; i < last_count ; i++) in join_same_trees()
1902 if (!i->tree->tree_number) in join_same_trees()
1904 i->tree->tree_number= ++tree_number; in join_same_trees()
1909 if (! j->tree->tree_number && ! j->tree_buff) in join_same_trees()
1933 trees, tree_number)); in join_same_trees()
1936 return tree_number; /* Return trees left */ in join_same_trees()
1958 if (huff_tree->tree_number > 0) in make_huff_decode_table()
2152 counts->tree->tree_number, counts->field_length); in write_field_info()
[all …]
|
| /dports/databases/mariadb105-client/mariadb-10.5.15/storage/maria/ |
| H A D | aria_pack.c | 104 uint tree_number; member
1944 uint k,tree_number; in join_same_trees() local
1948 for (tree_number=0, i=huff_counts ; i < last_count ; i++) in join_same_trees()
1950 if (!i->tree->tree_number) in join_same_trees()
1952 i->tree->tree_number= ++tree_number; in join_same_trees()
1957 if (! j->tree->tree_number && ! j->tree_buff) in join_same_trees()
1980 trees, tree_number)); in join_same_trees()
1983 return tree_number; /* Return trees left */ in join_same_trees()
2005 if (huff_tree->tree_number > 0) in make_huff_decode_table()
2198 counts->tree->tree_number, counts->field_length); in write_field_info()
[all …]
|
| /dports/databases/mariadb104-server/mariadb-10.4.24/storage/maria/ |
| H A D | maria_pack.c | 104 uint tree_number; member
1935 uint k,tree_number; in join_same_trees() local
1939 for (tree_number=0, i=huff_counts ; i < last_count ; i++) in join_same_trees()
1941 if (!i->tree->tree_number) in join_same_trees()
1943 i->tree->tree_number= ++tree_number; in join_same_trees()
1948 if (! j->tree->tree_number && ! j->tree_buff) in join_same_trees()
1971 trees, tree_number)); in join_same_trees()
1974 return tree_number; /* Return trees left */ in join_same_trees()
1996 if (huff_tree->tree_number > 0) in make_huff_decode_table()
2189 counts->tree->tree_number, counts->field_length); in write_field_info()
[all …]
|
| /dports/databases/mariadb104-server/mariadb-10.4.24/storage/myisam/ |
| H A D | myisampack.c | 99 uint tree_number; member
1867 uint k,tree_number; in join_same_trees() local
1871 for (tree_number=0, i=huff_counts ; i < last_count ; i++) in join_same_trees()
1873 if (!i->tree->tree_number) in join_same_trees()
1875 i->tree->tree_number= ++tree_number; in join_same_trees()
1880 if (! j->tree->tree_number && ! j->tree_buff) in join_same_trees()
1904 trees, tree_number)); in join_same_trees()
1907 return tree_number; /* Return trees left */ in join_same_trees()
1929 if (huff_tree->tree_number > 0) in make_huff_decode_table()
2122 counts->tree->tree_number, counts->field_length); in write_field_info()
[all …]
|
| /dports/databases/mariadb104-client/mariadb-10.4.24/storage/maria/ |
| H A D | maria_pack.c | 104 uint tree_number; member
1935 uint k,tree_number; in join_same_trees() local
1939 for (tree_number=0, i=huff_counts ; i < last_count ; i++) in join_same_trees()
1941 if (!i->tree->tree_number) in join_same_trees()
1943 i->tree->tree_number= ++tree_number; in join_same_trees()
1948 if (! j->tree->tree_number && ! j->tree_buff) in join_same_trees()
1971 trees, tree_number)); in join_same_trees()
1974 return tree_number; /* Return trees left */ in join_same_trees()
1996 if (huff_tree->tree_number > 0) in make_huff_decode_table()
2189 counts->tree->tree_number, counts->field_length); in write_field_info()
[all …]
|
| /dports/databases/mariadb104-client/mariadb-10.4.24/storage/myisam/ |
| H A D | myisampack.c | 99 uint tree_number; member
1867 uint k,tree_number; in join_same_trees() local
1871 for (tree_number=0, i=huff_counts ; i < last_count ; i++) in join_same_trees()
1873 if (!i->tree->tree_number) in join_same_trees()
1875 i->tree->tree_number= ++tree_number; in join_same_trees()
1880 if (! j->tree->tree_number && ! j->tree_buff) in join_same_trees()
1904 trees, tree_number)); in join_same_trees()
1907 return tree_number; /* Return trees left */ in join_same_trees()
1929 if (huff_tree->tree_number > 0) in make_huff_decode_table()
2122 counts->tree->tree_number, counts->field_length); in write_field_info()
[all …]
|
| /dports/databases/mariadb105-client/mariadb-10.5.15/storage/myisam/ |
| H A D | myisampack.c | 99 uint tree_number; member
1868 uint k,tree_number; in join_same_trees() local
1872 for (tree_number=0, i=huff_counts ; i < last_count ; i++) in join_same_trees()
1874 if (!i->tree->tree_number) in join_same_trees()
1876 i->tree->tree_number= ++tree_number; in join_same_trees()
1881 if (! j->tree->tree_number && ! j->tree_buff) in join_same_trees()
1905 trees, tree_number)); in join_same_trees()
1908 return tree_number; /* Return trees left */ in join_same_trees()
1930 if (huff_tree->tree_number > 0) in make_huff_decode_table()
2123 counts->tree->tree_number, counts->field_length); in write_field_info()
[all …]
|
| /dports/databases/mariadb103-server/mariadb-10.3.34/storage/maria/ |
| H A D | maria_pack.c | 99 uint tree_number; member
1839 uint k,tree_number; in join_same_trees() local
1843 for (tree_number=0, i=huff_counts ; i < last_count ; i++) in join_same_trees()
1845 if (!i->tree->tree_number) in join_same_trees()
1847 i->tree->tree_number= ++tree_number; in join_same_trees()
1852 if (! j->tree->tree_number && ! j->tree_buff) in join_same_trees()
1875 trees, tree_number)); in join_same_trees()
1878 return tree_number; /* Return trees left */ in join_same_trees()
1900 if (huff_tree->tree_number > 0) in make_huff_decode_table()
2093 counts->tree->tree_number, counts->field_length); in write_field_info()
[all …]
|
| /dports/databases/mariadb103-client/mariadb-10.3.34/storage/maria/ |
| H A D | maria_pack.c | 99 uint tree_number; member
1839 uint k,tree_number; in join_same_trees() local
1843 for (tree_number=0, i=huff_counts ; i < last_count ; i++) in join_same_trees()
1845 if (!i->tree->tree_number) in join_same_trees()
1847 i->tree->tree_number= ++tree_number; in join_same_trees()
1852 if (! j->tree->tree_number && ! j->tree_buff) in join_same_trees()
1875 trees, tree_number)); in join_same_trees()
1878 return tree_number; /* Return trees left */ in join_same_trees()
1900 if (huff_tree->tree_number > 0) in make_huff_decode_table()
2093 counts->tree->tree_number, counts->field_length); in write_field_info()
[all …]
|
| /dports/databases/mariadb105-server/mariadb-10.5.15/storage/myisam/ |
| H A D | myisampack.c | 99 uint tree_number; member
1868 uint k,tree_number; in join_same_trees() local
1872 for (tree_number=0, i=huff_counts ; i < last_count ; i++) in join_same_trees()
1874 if (!i->tree->tree_number) in join_same_trees()
1876 i->tree->tree_number= ++tree_number; in join_same_trees()
1881 if (! j->tree->tree_number && ! j->tree_buff) in join_same_trees()
1905 trees, tree_number)); in join_same_trees()
1908 return tree_number; /* Return trees left */ in join_same_trees()
1930 if (huff_tree->tree_number > 0) in make_huff_decode_table()
2123 counts->tree->tree_number, counts->field_length); in write_field_info()
[all …]
|
| /dports/databases/mariadb105-server/mariadb-10.5.15/storage/maria/ |
| H A D | aria_pack.c | 104 uint tree_number; member
1944 uint k,tree_number; in join_same_trees() local
1948 for (tree_number=0, i=huff_counts ; i < last_count ; i++) in join_same_trees()
1950 if (!i->tree->tree_number) in join_same_trees()
1952 i->tree->tree_number= ++tree_number; in join_same_trees()
1957 if (! j->tree->tree_number && ! j->tree_buff) in join_same_trees()
1980 trees, tree_number)); in join_same_trees()
1983 return tree_number; /* Return trees left */ in join_same_trees()
2005 if (huff_tree->tree_number > 0) in make_huff_decode_table()
2198 counts->tree->tree_number, counts->field_length); in write_field_info()
[all …]
|