/dports/databases/mariadb105-client/mariadb-10.5.15/mysys/ |
H A D | my_likely.c | 72 LIKELY_ENTRY **sort_ptr= 0; in end_my_likely() local 87 if (!(sort_ptr= (LIKELY_ENTRY**) in end_my_likely() 95 sort_ptr[i]= (LIKELY_ENTRY *) my_hash_element(&likely_hash, i); in end_my_likely() 97 my_qsort(sort_ptr, likely_hash.records, sizeof(LIKELY_ENTRY*), in end_my_likely() 102 LIKELY_ENTRY *entry= sort_ptr[i]; in end_my_likely() 111 free((void*) sort_ptr); in end_my_likely()
|
/dports/databases/mariadb104-server/mariadb-10.4.24/mysys/ |
H A D | my_likely.c | 73 LIKELY_ENTRY **sort_ptr= 0; in end_my_likely() local 88 if (!(sort_ptr= (LIKELY_ENTRY**) in end_my_likely() 96 sort_ptr[i]= (LIKELY_ENTRY *) my_hash_element(&likely_hash, i); in end_my_likely() 98 my_qsort(sort_ptr, likely_hash.records, sizeof(LIKELY_ENTRY*), in end_my_likely() 103 LIKELY_ENTRY *entry= sort_ptr[i]; in end_my_likely() 112 free((void*) sort_ptr); in end_my_likely()
|
/dports/databases/mariadb104-client/mariadb-10.4.24/mysys/ |
H A D | my_likely.c | 73 LIKELY_ENTRY **sort_ptr= 0; in end_my_likely() local 88 if (!(sort_ptr= (LIKELY_ENTRY**) in end_my_likely() 96 sort_ptr[i]= (LIKELY_ENTRY *) my_hash_element(&likely_hash, i); in end_my_likely() 98 my_qsort(sort_ptr, likely_hash.records, sizeof(LIKELY_ENTRY*), in end_my_likely() 103 LIKELY_ENTRY *entry= sort_ptr[i]; in end_my_likely() 112 free((void*) sort_ptr); in end_my_likely()
|
/dports/databases/mariadb103-server/mariadb-10.3.34/mysys/ |
H A D | my_likely.c | 73 LIKELY_ENTRY **sort_ptr= 0; in end_my_likely() local 88 if (!(sort_ptr= (LIKELY_ENTRY**) in end_my_likely() 96 sort_ptr[i]= (LIKELY_ENTRY *) my_hash_element(&likely_hash, i); in end_my_likely() 98 my_qsort(sort_ptr, likely_hash.records, sizeof(LIKELY_ENTRY*), in end_my_likely() 103 LIKELY_ENTRY *entry= sort_ptr[i]; in end_my_likely() 112 free((void*) sort_ptr); in end_my_likely()
|
/dports/databases/mariadb103-client/mariadb-10.3.34/mysys/ |
H A D | my_likely.c | 73 LIKELY_ENTRY **sort_ptr= 0; in end_my_likely() local 88 if (!(sort_ptr= (LIKELY_ENTRY**) in end_my_likely() 96 sort_ptr[i]= (LIKELY_ENTRY *) my_hash_element(&likely_hash, i); in end_my_likely() 98 my_qsort(sort_ptr, likely_hash.records, sizeof(LIKELY_ENTRY*), in end_my_likely() 103 LIKELY_ENTRY *entry= sort_ptr[i]; in end_my_likely() 112 free((void*) sort_ptr); in end_my_likely()
|
/dports/databases/mariadb105-server/mariadb-10.5.15/mysys/ |
H A D | my_likely.c | 72 LIKELY_ENTRY **sort_ptr= 0; in end_my_likely() local 87 if (!(sort_ptr= (LIKELY_ENTRY**) in end_my_likely() 95 sort_ptr[i]= (LIKELY_ENTRY *) my_hash_element(&likely_hash, i); in end_my_likely() 97 my_qsort(sort_ptr, likely_hash.records, sizeof(LIKELY_ENTRY*), in end_my_likely() 102 LIKELY_ENTRY *entry= sort_ptr[i]; in end_my_likely() 111 free((void*) sort_ptr); in end_my_likely()
|
/dports/print/tex-luatex/texlive-20150521-source/texk/web2c/omegafonts/ |
H A D | char_routines.c | 86 int label_ptr, sort_ptr; variable 708 while (label_table[sort_ptr].rr > r) { in adjust_labels() 709 label_table[sort_ptr+1] = label_table[sort_ptr]; in adjust_labels() 710 sort_ptr--; /* move the hole */ in adjust_labels() 712 label_table[sort_ptr+1].cc = c; in adjust_labels() 713 label_table[sort_ptr+1].rr = r; in adjust_labels() 731 while (label_table[sort_ptr-1].rr == label_table[sort_ptr].rr) { in adjust_labels() 732 sort_ptr--; in adjust_labels() 735 lk_offset++; sort_ptr--; in adjust_labels() 740 while (sort_ptr>0) { in adjust_labels() [all …]
|
H A D | ligkern_routines.c | 240 sort_ptr = 1; in print_ligkern_table() 268 while ((sort_ptr<=label_ptr) && (i==label_table[sort_ptr].rr)) { in print_ligkern_table() 269 print_label_command(label_table[sort_ptr].cc); in print_ligkern_table() 270 sort_ptr++; in print_ligkern_table() 567 for (sort_ptr = 1; sort_ptr <= lk_offset; sort_ptr++) { in output_ofm_ligkern() 580 for (sort_ptr = 1; sort_ptr <= lk_offset; sort_ptr++) { in output_ofm_ligkern()
|
/dports/print/tex-xetex/texlive-20150521-source/texk/web2c/omegafonts/ |
H A D | char_routines.c | 86 int label_ptr, sort_ptr; variable 708 while (label_table[sort_ptr].rr > r) { in adjust_labels() 709 label_table[sort_ptr+1] = label_table[sort_ptr]; in adjust_labels() 710 sort_ptr--; /* move the hole */ in adjust_labels() 712 label_table[sort_ptr+1].cc = c; in adjust_labels() 713 label_table[sort_ptr+1].rr = r; in adjust_labels() 731 while (label_table[sort_ptr-1].rr == label_table[sort_ptr].rr) { in adjust_labels() 732 sort_ptr--; in adjust_labels() 735 lk_offset++; sort_ptr--; in adjust_labels() 740 while (sort_ptr>0) { in adjust_labels() [all …]
|
H A D | ligkern_routines.c | 240 sort_ptr = 1; in print_ligkern_table() 268 while ((sort_ptr<=label_ptr) && (i==label_table[sort_ptr].rr)) { in print_ligkern_table() 269 print_label_command(label_table[sort_ptr].cc); in print_ligkern_table() 270 sort_ptr++; in print_ligkern_table() 567 for (sort_ptr = 1; sort_ptr <= lk_offset; sort_ptr++) { in output_ofm_ligkern() 580 for (sort_ptr = 1; sort_ptr <= lk_offset; sort_ptr++) { in output_ofm_ligkern()
|
/dports/devel/tex-synctex/texlive-20150521-source/texk/web2c/omegafonts/ |
H A D | char_routines.c | 86 int label_ptr, sort_ptr; variable 708 while (label_table[sort_ptr].rr > r) { in adjust_labels() 709 label_table[sort_ptr+1] = label_table[sort_ptr]; in adjust_labels() 710 sort_ptr--; /* move the hole */ in adjust_labels() 712 label_table[sort_ptr+1].cc = c; in adjust_labels() 713 label_table[sort_ptr+1].rr = r; in adjust_labels() 731 while (label_table[sort_ptr-1].rr == label_table[sort_ptr].rr) { in adjust_labels() 732 sort_ptr--; in adjust_labels() 735 lk_offset++; sort_ptr--; in adjust_labels() 740 while (sort_ptr>0) { in adjust_labels() [all …]
|
H A D | ligkern_routines.c | 240 sort_ptr = 1; in print_ligkern_table() 268 while ((sort_ptr<=label_ptr) && (i==label_table[sort_ptr].rr)) { in print_ligkern_table() 269 print_label_command(label_table[sort_ptr].cc); in print_ligkern_table() 270 sort_ptr++; in print_ligkern_table() 567 for (sort_ptr = 1; sort_ptr <= lk_offset; sort_ptr++) { in output_ofm_ligkern() 580 for (sort_ptr = 1; sort_ptr <= lk_offset; sort_ptr++) { in output_ofm_ligkern()
|
/dports/devel/tex-web2c/texlive-20150521-source/texk/web2c/omegafonts/ |
H A D | char_routines.c | 86 int label_ptr, sort_ptr; variable 708 while (label_table[sort_ptr].rr > r) { in adjust_labels() 709 label_table[sort_ptr+1] = label_table[sort_ptr]; in adjust_labels() 710 sort_ptr--; /* move the hole */ in adjust_labels() 712 label_table[sort_ptr+1].cc = c; in adjust_labels() 713 label_table[sort_ptr+1].rr = r; in adjust_labels() 731 while (label_table[sort_ptr-1].rr == label_table[sort_ptr].rr) { in adjust_labels() 732 sort_ptr--; in adjust_labels() 735 lk_offset++; sort_ptr--; in adjust_labels() 740 while (sort_ptr>0) { in adjust_labels() [all …]
|
H A D | ligkern_routines.c | 240 sort_ptr = 1; in print_ligkern_table() 268 while ((sort_ptr<=label_ptr) && (i==label_table[sort_ptr].rr)) { in print_ligkern_table() 269 print_label_command(label_table[sort_ptr].cc); in print_ligkern_table() 270 sort_ptr++; in print_ligkern_table() 567 for (sort_ptr = 1; sort_ptr <= lk_offset; sort_ptr++) { in output_ofm_ligkern() 580 for (sort_ptr = 1; sort_ptr <= lk_offset; sort_ptr++) { in output_ofm_ligkern()
|
/dports/japanese/tex-ptex/texlive-20150521-source/texk/web2c/omegafonts/ |
H A D | char_routines.c | 86 int label_ptr, sort_ptr; variable 708 while (label_table[sort_ptr].rr > r) { in adjust_labels() 709 label_table[sort_ptr+1] = label_table[sort_ptr]; in adjust_labels() 710 sort_ptr--; /* move the hole */ in adjust_labels() 712 label_table[sort_ptr+1].cc = c; in adjust_labels() 713 label_table[sort_ptr+1].rr = r; in adjust_labels() 731 while (label_table[sort_ptr-1].rr == label_table[sort_ptr].rr) { in adjust_labels() 732 sort_ptr--; in adjust_labels() 735 lk_offset++; sort_ptr--; in adjust_labels() 740 while (sort_ptr>0) { in adjust_labels() [all …]
|
H A D | ligkern_routines.c | 240 sort_ptr = 1; in print_ligkern_table() 268 while ((sort_ptr<=label_ptr) && (i==label_table[sort_ptr].rr)) { in print_ligkern_table() 269 print_label_command(label_table[sort_ptr].cc); in print_ligkern_table() 270 sort_ptr++; in print_ligkern_table() 567 for (sort_ptr = 1; sort_ptr <= lk_offset; sort_ptr++) { in output_ofm_ligkern() 580 for (sort_ptr = 1; sort_ptr <= lk_offset; sort_ptr++) { in output_ofm_ligkern()
|
/dports/print/tex-basic-engines/texlive-20150521-source/texk/web2c/omegafonts/ |
H A D | char_routines.c | 86 int label_ptr, sort_ptr; variable 708 while (label_table[sort_ptr].rr > r) { in adjust_labels() 709 label_table[sort_ptr+1] = label_table[sort_ptr]; in adjust_labels() 710 sort_ptr--; /* move the hole */ in adjust_labels() 712 label_table[sort_ptr+1].cc = c; in adjust_labels() 713 label_table[sort_ptr+1].rr = r; in adjust_labels() 731 while (label_table[sort_ptr-1].rr == label_table[sort_ptr].rr) { in adjust_labels() 732 sort_ptr--; in adjust_labels() 735 lk_offset++; sort_ptr--; in adjust_labels() 740 while (sort_ptr>0) { in adjust_labels() [all …]
|
H A D | ligkern_routines.c | 240 sort_ptr = 1; in print_ligkern_table() 268 while ((sort_ptr<=label_ptr) && (i==label_table[sort_ptr].rr)) { in print_ligkern_table() 269 print_label_command(label_table[sort_ptr].cc); in print_ligkern_table() 270 sort_ptr++; in print_ligkern_table() 567 for (sort_ptr = 1; sort_ptr <= lk_offset; sort_ptr++) { in output_ofm_ligkern() 580 for (sort_ptr = 1; sort_ptr <= lk_offset; sort_ptr++) { in output_ofm_ligkern()
|
/dports/print/tex-aleph/texlive-20150521-source/texk/web2c/omegafonts/ |
H A D | char_routines.c | 86 int label_ptr, sort_ptr; variable 708 while (label_table[sort_ptr].rr > r) { in adjust_labels() 709 label_table[sort_ptr+1] = label_table[sort_ptr]; in adjust_labels() 710 sort_ptr--; /* move the hole */ in adjust_labels() 712 label_table[sort_ptr+1].cc = c; in adjust_labels() 713 label_table[sort_ptr+1].rr = r; in adjust_labels() 731 while (label_table[sort_ptr-1].rr == label_table[sort_ptr].rr) { in adjust_labels() 732 sort_ptr--; in adjust_labels() 735 lk_offset++; sort_ptr--; in adjust_labels() 740 while (sort_ptr>0) { in adjust_labels() [all …]
|
H A D | ligkern_routines.c | 240 sort_ptr = 1; in print_ligkern_table() 268 while ((sort_ptr<=label_ptr) && (i==label_table[sort_ptr].rr)) { in print_ligkern_table() 269 print_label_command(label_table[sort_ptr].cc); in print_ligkern_table() 270 sort_ptr++; in print_ligkern_table() 567 for (sort_ptr = 1; sort_ptr <= lk_offset; sort_ptr++) { in output_ofm_ligkern() 580 for (sort_ptr = 1; sort_ptr <= lk_offset; sort_ptr++) { in output_ofm_ligkern()
|
/dports/mail/qmailadmin/qmailadmin-1.2.15/ |
H A D | util.c | 53 char *sort_ptr; variable 75 sort_ptr = sort_block[memindex++] = malloc(memleft); in sort_add_entry() 77 if (!sort_ptr) { return -1; } in sort_add_entry() 78 sort_list[sort_entry++] = sort_ptr; in sort_add_entry() 81 *sort_ptr++ = *entry++; in sort_add_entry() 84 *sort_ptr++ = 0; /* NULL terminator */ in sort_add_entry()
|
/dports/misc/py-mxnet/incubator-mxnet-1.9.0/src/operator/numpy/ |
H A D | np_percentile_op-inl.h | 227 DType* trans_ptr, *sort_ptr; in NumpyPercentileForward() 254 sort_ptr = reinterpret_cast<DType*>(workspace_curr_ptr + temp_data_size); in NumpyPercentileForward() 259 sort_ptr = reinterpret_cast<DType*>(workspace_curr_ptr + temp_data_size + idx_size); in NumpyPercentileForward() 265 TBlob a_sort = TBlob(sort_ptr, t_shape, xpu::kDevMask); in NumpyPercentileForward()
|
/dports/misc/mxnet/incubator-mxnet-1.9.0/src/operator/numpy/ |
H A D | np_percentile_op-inl.h | 227 DType* trans_ptr, *sort_ptr; in NumpyPercentileForward() 254 sort_ptr = reinterpret_cast<DType*>(workspace_curr_ptr + temp_data_size); in NumpyPercentileForward() 259 sort_ptr = reinterpret_cast<DType*>(workspace_curr_ptr + temp_data_size + idx_size); in NumpyPercentileForward() 265 TBlob a_sort = TBlob(sort_ptr, t_shape, xpu::kDevMask); in NumpyPercentileForward()
|
/dports/math/cppad/CppAD-20210000.8/bug/ |
H A D | vec_itr_speed.sh | 87 void sort_ptr(size_t size, size_t repeat) 139 double sort_ptr_sec = time_test(sort_ptr, time_min, test_size, repeat);
|
/dports/mail/vpopmail/vpopmail-5.4.33/ |
H A D | vlistlib.c | 72 unsigned char *sort_ptr; variable 103 sort_ptr = sort_block[memindex++] = malloc(memleft); in sort_add_entry() 106 if( !sort_ptr ) return -1; /* out of memory */ in sort_add_entry() 108 sort_list[sort_entry++] = sort_ptr; in sort_add_entry() 111 *sort_ptr++ = *entry++; in sort_add_entry() 115 *sort_ptr++ = 0; /* NULL terminator */ in sort_add_entry()
|