Home
last modified time | relevance | path

Searched refs:bmGs (Results 1 – 25 of 54) sorted by relevance

123

/dports/sysutils/pnscan/pnscan-1.14.1/
H A Dbm.c89 preBmGs(unsigned char *x, int m, int bmGs[]) in preBmGs() argument
101 bmGs[i] = m; in preBmGs()
107 if (bmGs[j] == m) in preBmGs()
108 bmGs[j] = m - 1 - i; in preBmGs()
111 bmGs[m - 1 - suff[i]] = m - 1 - i; in preBmGs()
130 bmp->bmGs = (int *) calloc(sizeof(int), m); in bm_init()
131 if (bmp->bmGs == NULL) in bm_init()
143 if (preBmGs(bmp->saved_x, m, bmp->bmGs) < 0) in bm_init()
155 if (bmp->bmGs) in bm_destroy()
156 free(bmp->bmGs); in bm_destroy()
[all …]
H A Dbm.h41 int *bmGs; member
/dports/security/suricata/suricata-6.0.4/src/
H A Dutil-spm-bm.c66 PreBmGsNocase(needle, needle_len, bm_ctx->bmGs); in BoyerMooreCtxToNocase()
192 bmGs[i] = m; in PreBmGs()
199 if (bmGs[j] == m) in PreBmGs()
200 bmGs[j] = m - 1 - i; in PreBmGs()
203 bmGs[m - 1 - suff[i]] = m - 1 - i; in PreBmGs()
267 bmGs[i] = m; in PreBmGsNocase()
273 if (bmGs[j] == m) { in PreBmGsNocase()
274 bmGs[j] = m - 1 - i; in PreBmGsNocase()
280 bmGs[m - 1 - suff[i]] = m - 1 - i; in PreBmGsNocase()
301 uint16_t *bmGs = bm_ctx->bmGs; in BoyerMoore() local
[all …]
H A Dutil-spm-bm.h37 uint16_t bmGs[]; // = SCMalloc(sizeof(int16_t)*(needlelen + 1)); member
/dports/biology/seqan1/seqan-1.3.1/lib/samtools/
H A Dkstring.c92 int i, *suff, *prep, *bmGs, *bmBc; in ksBM_prep() local
94 bmGs = prep; bmBc = prep + m; in ksBM_prep()
117 for (i = 0; i < m; ++i) bmGs[i] = m; in ksBM_prep()
121 if (bmGs[j] == m) in ksBM_prep()
122 bmGs[j] = m - 1 - i; in ksBM_prep()
124 bmGs[m - 1 - suff[i]] = m - 1 - i; in ksBM_prep()
132 int i, j, *prep = 0, *bmGs, *bmBc; in kmemmem() local
137 bmGs = prep; bmBc = prep + m; in kmemmem()
143 if (max < bmGs[i]) max = bmGs[i]; in kmemmem()
/dports/www/h2o-devel/h2o-dcc7134/deps/klib/
H A Dkstring.c117 int i, *suff, *prep, *bmGs, *bmBc; in ksBM_prep() local
119 bmGs = prep; bmBc = prep + m; in ksBM_prep()
142 for (i = 0; i < m; ++i) bmGs[i] = m; in ksBM_prep()
146 if (bmGs[j] == m) in ksBM_prep()
147 bmGs[j] = m - 1 - i; in ksBM_prep()
149 bmGs[m - 1 - suff[i]] = m - 1 - i; in ksBM_prep()
157 int i, j, *prep = 0, *bmGs, *bmBc; in kmemmem() local
162 bmGs = prep; bmBc = prep + m; in kmemmem()
168 if (max < bmGs[i]) max = bmGs[i]; in kmemmem()
/dports/biology/ugene/ugene-40.1/src/libs_3rdparty/samtools/src/samtools/
H A Dkstring.c100 int i, *suff, *prep, *bmGs, *bmBc; in ksBM_prep() local
102 bmGs = prep; bmBc = prep + m; in ksBM_prep()
125 for (i = 0; i < m; ++i) bmGs[i] = m; in ksBM_prep()
129 if (bmGs[j] == m) in ksBM_prep()
130 bmGs[j] = m - 1 - i; in ksBM_prep()
132 bmGs[m - 1 - suff[i]] = m - 1 - i; in ksBM_prep()
140 int i, j, *prep = 0, *bmGs, *bmBc; in kmemmem() local
145 bmGs = prep; bmBc = prep + m; in kmemmem()
151 if (max < bmGs[i]) max = bmGs[i]; in kmemmem()
/dports/biology/stringtie/stringtie-2.1.1/samtools-0.1.18/
H A Dkstring.c100 int i, *suff, *prep, *bmGs, *bmBc; in ksBM_prep() local
102 bmGs = prep; bmBc = prep + m; in ksBM_prep()
125 for (i = 0; i < m; ++i) bmGs[i] = m; in ksBM_prep()
129 if (bmGs[j] == m) in ksBM_prep()
130 bmGs[j] = m - 1 - i; in ksBM_prep()
132 bmGs[m - 1 - suff[i]] = m - 1 - i; in ksBM_prep()
140 int i, j, *prep = 0, *bmGs, *bmBc; in kmemmem() local
145 bmGs = prep; bmBc = prep + m; in kmemmem()
151 if (max < bmGs[i]) max = bmGs[i]; in kmemmem()
/dports/biology/vt/vt-0.57721/lib/htslib/
H A Dkstring.c283 int i, *suff, *prep, *bmGs, *bmBc; in ksBM_prep() local
285 bmGs = prep; bmBc = prep + m; in ksBM_prep()
308 for (i = 0; i < m; ++i) bmGs[i] = m; in ksBM_prep()
312 if (bmGs[j] == m) in ksBM_prep()
313 bmGs[j] = m - 1 - i; in ksBM_prep()
315 bmGs[m - 1 - suff[i]] = m - 1 - i; in ksBM_prep()
323 int i, j, *prep = 0, *bmGs, *bmBc; in kmemmem() local
328 bmGs = prep; bmBc = prep + m; in kmemmem()
334 if (max < bmGs[i]) max = bmGs[i]; in kmemmem()
/dports/biology/bedtools/bedtools2-2.30.0/src/utils/htslib/
H A Dkstring.c283 int i, *suff, *prep, *bmGs, *bmBc; in ksBM_prep() local
285 bmGs = prep; bmBc = prep + m; in ksBM_prep()
308 for (i = 0; i < m; ++i) bmGs[i] = m; in ksBM_prep()
312 if (bmGs[j] == m) in ksBM_prep()
313 bmGs[j] = m - 1 - i; in ksBM_prep()
315 bmGs[m - 1 - suff[i]] = m - 1 - i; in ksBM_prep()
323 int i, j, *prep = 0, *bmGs, *bmBc; in kmemmem() local
328 bmGs = prep; bmBc = prep + m; in kmemmem()
334 if (max < bmGs[i]) max = bmGs[i]; in kmemmem()
/dports/biology/stacks/stacks-2.4/htslib/
H A Dkstring.c281 int i, *suff, *prep, *bmGs, *bmBc; in ksBM_prep() local
283 bmGs = prep; bmBc = prep + m; in ksBM_prep()
306 for (i = 0; i < m; ++i) bmGs[i] = m; in ksBM_prep()
310 if (bmGs[j] == m) in ksBM_prep()
311 bmGs[j] = m - 1 - i; in ksBM_prep()
313 bmGs[m - 1 - suff[i]] = m - 1 - i; in ksBM_prep()
321 int i, j, *prep = 0, *bmGs, *bmBc; in kmemmem() local
326 bmGs = prep; bmBc = prep + m; in kmemmem()
332 if (max < bmGs[i]) max = bmGs[i]; in kmemmem()
/dports/biology/kallisto/kallisto-0.46.1/ext/htslib/
H A Dkstring.c280 int i, *suff, *prep, *bmGs, *bmBc; in ksBM_prep() local
282 bmGs = prep; bmBc = prep + m; in ksBM_prep()
305 for (i = 0; i < m; ++i) bmGs[i] = m; in ksBM_prep()
309 if (bmGs[j] == m) in ksBM_prep()
310 bmGs[j] = m - 1 - i; in ksBM_prep()
312 bmGs[m - 1 - suff[i]] = m - 1 - i; in ksBM_prep()
320 int i, j, *prep = 0, *bmGs, *bmBc; in kmemmem() local
325 bmGs = prep; bmBc = prep + m; in kmemmem()
331 if (max < bmGs[i]) max = bmGs[i]; in kmemmem()
/dports/biology/freebayes/freebayes-1.3.5/contrib/htslib/
H A Dkstring.c320 int i, *suff, *prep, *bmGs, *bmBc; in ksBM_prep() local
323 bmGs = prep; bmBc = prep + m; in ksBM_prep()
347 for (i = 0; i < m; ++i) bmGs[i] = m; in ksBM_prep()
351 if (bmGs[j] == m) in ksBM_prep()
352 bmGs[j] = m - 1 - i; in ksBM_prep()
354 bmGs[m - 1 - suff[i]] = m - 1 - i; in ksBM_prep()
362 int i, j, *prep = 0, *bmGs, *bmBc; in kmemmem() local
368 bmGs = prep; bmBc = prep + m; in kmemmem()
374 if (max < bmGs[i]) max = bmGs[i]; in kmemmem()
/dports/biology/py-pysam/pysam-0.18.0/htslib/
H A Dkstring.c329 int i, *suff, *prep, *bmGs, *bmBc; in ksBM_prep() local
332 bmGs = prep; bmBc = prep + m; in ksBM_prep()
356 for (i = 0; i < m; ++i) bmGs[i] = m; in ksBM_prep()
360 if (bmGs[j] == m) in ksBM_prep()
361 bmGs[j] = m - 1 - i; in ksBM_prep()
363 bmGs[m - 1 - suff[i]] = m - 1 - i; in ksBM_prep()
371 int i, j, *prep = 0, *bmGs, *bmBc; in kmemmem() local
377 bmGs = prep; bmBc = prep + m; in kmemmem()
383 if (max < bmGs[i]) max = bmGs[i]; in kmemmem()
/dports/biology/htslib/htslib-1.14/
H A Dkstring.c329 int i, *suff, *prep, *bmGs, *bmBc; in ksBM_prep() local
332 bmGs = prep; bmBc = prep + m; in ksBM_prep()
356 for (i = 0; i < m; ++i) bmGs[i] = m; in ksBM_prep()
360 if (bmGs[j] == m) in ksBM_prep()
361 bmGs[j] = m - 1 - i; in ksBM_prep()
363 bmGs[m - 1 - suff[i]] = m - 1 - i; in ksBM_prep()
371 int i, j, *prep = 0, *bmGs, *bmBc; in kmemmem() local
377 bmGs = prep; bmBc = prep + m; in kmemmem()
383 if (max < bmGs[i]) max = bmGs[i]; in kmemmem()
/dports/textproc/bsdgrep/grep-2.6.0-FreeBSD/regex/
H A Dtre-fastmatch.c149 gs = fg->bmGs[mismatch]; \
370 fg->bmGs = malloc(fg->wlen * sizeof(*fg->bmGs)); \
371 if (!fg->bmGs) \
374 fg->bmGs[0] = 1; \
376 _FILL_BMGS(fg->bmGs, fg->wpattern, fg->wlen, true); \
378 fg->bmGs); \
1006 free(fg->bmGs); in tre_free_fast()
H A Dfastmatch.h17 unsigned int *bmGs; member
/dports/databases/mysql55-client/mysql-5.5.62/sql/
H A Ditem_cmpfunc.cc4913 bmGs = suff + pattern_len + 1; in fix_fields()
4914 bmBc = bmGs + pattern_len + 1; in fix_fields()
5153 int *end = bmGs + pattern_len; in turboBM_compute_good_suffix_shifts()
5155 for (k = bmGs; k < end; k++) in turboBM_compute_good_suffix_shifts()
5168 int *tmp2 = bmGs + j; in turboBM_compute_good_suffix_shifts()
5178 tmp2 = bmGs + j; in turboBM_compute_good_suffix_shifts()
5183 tmp2 = bmGs + plm1; in turboBM_compute_good_suffix_shifts()
5255 shift = max(shift, bmGs[i]); in turboBM_matches()
5256 if (shift == bmGs[i]) in turboBM_matches()
5286 shift = max(shift, bmGs[i]); in turboBM_matches()
[all …]
/dports/databases/percona56-client/percona-server-5.6.51-91.0/sql/
H A Ditem_cmpfunc.cc5434 bmGs = suff + pattern_len + 1; in fix_fields()
5435 bmBc = bmGs + pattern_len + 1; in fix_fields()
5676 int *end = bmGs + pattern_len; in turboBM_compute_good_suffix_shifts()
5678 for (k = bmGs; k < end; k++) in turboBM_compute_good_suffix_shifts()
5691 int *tmp2 = bmGs + j; in turboBM_compute_good_suffix_shifts()
5701 tmp2 = bmGs + j; in turboBM_compute_good_suffix_shifts()
5706 tmp2 = bmGs + plm1; in turboBM_compute_good_suffix_shifts()
5778 shift = max(shift, bmGs[i]); in turboBM_matches()
5779 if (shift == bmGs[i]) in turboBM_matches()
5809 shift = max(shift, bmGs[i]); in turboBM_matches()
[all …]
/dports/databases/percona-pam-for-mysql/percona-server-5.6.51-91.0/sql/
H A Ditem_cmpfunc.cc5434 bmGs = suff + pattern_len + 1; in fix_fields()
5435 bmBc = bmGs + pattern_len + 1; in fix_fields()
5676 int *end = bmGs + pattern_len; in turboBM_compute_good_suffix_shifts()
5678 for (k = bmGs; k < end; k++) in turboBM_compute_good_suffix_shifts()
5691 int *tmp2 = bmGs + j; in turboBM_compute_good_suffix_shifts()
5701 tmp2 = bmGs + j; in turboBM_compute_good_suffix_shifts()
5706 tmp2 = bmGs + plm1; in turboBM_compute_good_suffix_shifts()
5778 shift = max(shift, bmGs[i]); in turboBM_matches()
5779 if (shift == bmGs[i]) in turboBM_matches()
5809 shift = max(shift, bmGs[i]); in turboBM_matches()
[all …]
/dports/databases/mysqlwsrep56-server/mysql-wsrep-wsrep_5.6.51-25.33/sql/
H A Ditem_cmpfunc.cc5434 bmGs = suff + pattern_len + 1; in fix_fields()
5435 bmBc = bmGs + pattern_len + 1; in fix_fields()
5676 int *end = bmGs + pattern_len; in turboBM_compute_good_suffix_shifts()
5678 for (k = bmGs; k < end; k++) in turboBM_compute_good_suffix_shifts()
5691 int *tmp2 = bmGs + j; in turboBM_compute_good_suffix_shifts()
5701 tmp2 = bmGs + j; in turboBM_compute_good_suffix_shifts()
5706 tmp2 = bmGs + plm1; in turboBM_compute_good_suffix_shifts()
5778 shift = max(shift, bmGs[i]); in turboBM_matches()
5779 if (shift == bmGs[i]) in turboBM_matches()
5809 shift = max(shift, bmGs[i]); in turboBM_matches()
[all …]
/dports/databases/percona56-server/percona-server-5.6.51-91.0/sql/
H A Ditem_cmpfunc.cc5434 bmGs = suff + pattern_len + 1; in fix_fields()
5435 bmBc = bmGs + pattern_len + 1; in fix_fields()
5676 int *end = bmGs + pattern_len; in turboBM_compute_good_suffix_shifts()
5678 for (k = bmGs; k < end; k++) in turboBM_compute_good_suffix_shifts()
5691 int *tmp2 = bmGs + j; in turboBM_compute_good_suffix_shifts()
5701 tmp2 = bmGs + j; in turboBM_compute_good_suffix_shifts()
5706 tmp2 = bmGs + plm1; in turboBM_compute_good_suffix_shifts()
5778 shift = max(shift, bmGs[i]); in turboBM_matches()
5779 if (shift == bmGs[i]) in turboBM_matches()
5809 shift = max(shift, bmGs[i]); in turboBM_matches()
[all …]
/dports/databases/mariadb103-server/mariadb-10.3.34/sql/
H A Ditem_cmpfunc.cc5462 bmGs = suff + pattern_len + 1; in fix_fields()
5463 bmBc = bmGs + pattern_len + 1; in fix_fields()
5915 int *end = bmGs + pattern_len; in turboBM_compute_good_suffix_shifts()
5917 for (k = bmGs; k < end; k++) in turboBM_compute_good_suffix_shifts()
5930 int *tmp2 = bmGs + j; in turboBM_compute_good_suffix_shifts()
5940 tmp2 = bmGs + j; in turboBM_compute_good_suffix_shifts()
5945 tmp2 = bmGs + plm1; in turboBM_compute_good_suffix_shifts()
6017 shift = MY_MAX(shift, bmGs[i]); in turboBM_matches()
6018 if (shift == bmGs[i]) in turboBM_matches()
6048 shift = MY_MAX(shift, bmGs[i]); in turboBM_matches()
[all …]
/dports/databases/mariadb103-client/mariadb-10.3.34/sql/
H A Ditem_cmpfunc.cc5462 bmGs = suff + pattern_len + 1; in fix_fields()
5463 bmBc = bmGs + pattern_len + 1; in fix_fields()
5915 int *end = bmGs + pattern_len; in turboBM_compute_good_suffix_shifts()
5917 for (k = bmGs; k < end; k++) in turboBM_compute_good_suffix_shifts()
5930 int *tmp2 = bmGs + j; in turboBM_compute_good_suffix_shifts()
5940 tmp2 = bmGs + j; in turboBM_compute_good_suffix_shifts()
5945 tmp2 = bmGs + plm1; in turboBM_compute_good_suffix_shifts()
6017 shift = MY_MAX(shift, bmGs[i]); in turboBM_matches()
6018 if (shift == bmGs[i]) in turboBM_matches()
6048 shift = MY_MAX(shift, bmGs[i]); in turboBM_matches()
[all …]
/dports/databases/mysql56-client/mysql-5.6.51/sql/
H A Ditem_cmpfunc.cc5434 bmGs = suff + pattern_len + 1; in fix_fields()
5435 bmBc = bmGs + pattern_len + 1; in fix_fields()
5676 int *end = bmGs + pattern_len; in turboBM_compute_good_suffix_shifts()
5678 for (k = bmGs; k < end; k++) in turboBM_compute_good_suffix_shifts()
5691 int *tmp2 = bmGs + j; in turboBM_compute_good_suffix_shifts()
5701 tmp2 = bmGs + j; in turboBM_compute_good_suffix_shifts()
5706 tmp2 = bmGs + plm1; in turboBM_compute_good_suffix_shifts()
5778 shift = max(shift, bmGs[i]); in turboBM_matches()
5779 if (shift == bmGs[i]) in turboBM_matches()
5809 shift = max(shift, bmGs[i]); in turboBM_matches()
[all …]

123