Home
last modified time | relevance | path

Searched refs:curn (Results 1 – 25 of 83) sorted by relevance

1234

/dports/x11/xlockmore/xlockmore-5.67/xlock/
H A Dvtlock_proc.c181 int curn = 0,names = 0; in find_x_proc() local
196 while ( curn < names ) { in find_x_proc()
204 curn++; in find_x_proc()
223 curn++; in find_x_proc()
232 curn++; in find_x_proc()
256 curn++; in find_x_proc()
300 int curn = 0; in scan_x_fds() local
308 while ( namelist[curn] ) { in scan_x_fds()
317 curn++; in scan_x_fds()
327 curn++; in scan_x_fds()
[all …]
/dports/audio/zmusic/ZMusic-1.1.8/thirdparty/opnmidi/chips/mamefm/
H A Dresampler.cpp99 int curn = static_cast<int>(n * rateRatio_); in interpolate() local
100 int k = curn - SINC_OFFSET_; in interpolate()
102 int end = curn + SINC_OFFSET_; in interpolate()
106 samp += static_cast<sample>(src[pan][k] * sincTable_[seg + SINC_OFFSET_ + (k - curn)]); in interpolate()
126 int curn = static_cast<int>(rcurn); in initSincTables() local
127 int k = curn - SINC_OFFSET_; in initSincTables()
129 int end = curn + SINC_OFFSET_; in initSincTables()
132 sincTable_[seg + SINC_OFFSET_ + (k - curn)] = sinc(F_PI_ * (rcurn - k)); in initSincTables()
/dports/databases/grass7/grass-7.8.6/lib/rst/interp_float/
H A Dsecpar2d.c55 curn = 0, /* profile curvature */ in IL_secpar_loop_2d() local
87 curn = 0.; in IL_secpar_loop_2d()
121 curn = in IL_secpar_loop_2d()
138 *c1min = *c1max = curn; in IL_secpar_loop_2d()
143 *c1min = amin1(*c1min, curn); in IL_secpar_loop_2d()
144 *c1max = amax1(*c1max, curn); in IL_secpar_loop_2d()
151 params->adxx[i] = (FCELL) curn; in IL_secpar_loop_2d()
/dports/graphics/graphviz/graphviz-2.44.1/cmd/gvpr/lib/
H A Dpath5 node_t n, curn;
13 curn = $;
21 if ($.head == curn) n = $.tail;
23 if (dist[n] == 0) dist[n] = dist[curn]+1;
/dports/math/py-yt/yt-4.0.1/yt/utilities/lib/
H A Ddistance_queue.pyx71 self.curn = 0
79 self.curn = 0
83 if self.curn == 0:
86 self.curn += 1
90 for i in range(self.curn - 1, -1, -1):
105 if self.curn < self.maxn:
106 self.curn += 1
142 if self.curn == self.maxn:
144 r2_trunc = self.neighbors[self.curn - 1].r2
170 rv = np.empty(self.curn, dtype="int64")
[all …]
/dports/math/p5-Math-Prime-Util/Math-Prime-Util-0.73/examples/
H A Dfibprime-serial.pl46 my ($curn, $a, $b) = @$fibstate;
47 die "fib_n only increases" if $n < $curn;
48 do { ($a, $b) = ($b, $a+$b); } for (1 .. $n-$curn);
H A Dfibprime-mce.pl54 my ($curn, $a, $b) = @$fibstate;
55 die "fib_n only increases" if $n < $curn;
56 do { ($a, $b) = ($b, $a+$b); } for (1 .. $n-$curn);
H A Dfibprime-threads.pl89 my ($curn, $a, $b) = @$fibstate;
90 die "fib_n only increases" if $n < $curn;
91 do { ($a, $b) = ($b, $a+$b); } for (1 .. $n-$curn);
/dports/databases/percona57-server/percona-server-5.7.36-39/rapid/plugin/group_replication/libmysqlgcs/src/bindings/xcom/xcom/
H A Dtask.c160 q->curn = 0; in task_queue_init()
183 if (q->curn) { in is_heap()
260 assert(q->curn); in task_queue_remove()
267 if (q->curn) { in task_queue_remove()
287 q->curn++; in task_queue_insert()
288 q->x[q->curn] = t; in task_queue_insert()
289 FIX_POS(q->curn); in task_queue_insert()
300 return q->curn < 1; in task_queue_empty()
322 q->x[q->curn] = 0; in task_queue_extractmin()
323 q->curn--; in task_queue_extractmin()
[all …]
/dports/databases/xtrabackup/percona-xtrabackup-2.4.21/rapid/plugin/group_replication/libmysqlgcs/src/bindings/xcom/xcom/
H A Dtask.c160 q->curn = 0; in task_queue_init()
183 if (q->curn) { in is_heap()
260 assert(q->curn); in task_queue_remove()
267 if (q->curn) { in task_queue_remove()
287 q->curn++; in task_queue_insert()
288 q->x[q->curn] = t; in task_queue_insert()
289 FIX_POS(q->curn); in task_queue_insert()
300 return q->curn < 1; in task_queue_empty()
322 q->x[q->curn] = 0; in task_queue_extractmin()
323 q->curn--; in task_queue_extractmin()
[all …]
/dports/databases/percona57-pam-for-mysql/percona-server-5.7.36-39/rapid/plugin/group_replication/libmysqlgcs/src/bindings/xcom/xcom/
H A Dtask.c160 q->curn = 0; in task_queue_init()
183 if (q->curn) { in is_heap()
260 assert(q->curn); in task_queue_remove()
267 if (q->curn) { in task_queue_remove()
287 q->curn++; in task_queue_insert()
288 q->x[q->curn] = t; in task_queue_insert()
289 FIX_POS(q->curn); in task_queue_insert()
300 return q->curn < 1; in task_queue_empty()
322 q->x[q->curn] = 0; in task_queue_extractmin()
323 q->curn--; in task_queue_extractmin()
[all …]
/dports/databases/mysqlwsrep57-server/mysql-wsrep-wsrep_5.7.35-25.27/rapid/plugin/group_replication/libmysqlgcs/src/bindings/xcom/xcom/
H A Dtask.c160 q->curn = 0; in task_queue_init()
183 if (q->curn) { in is_heap()
260 assert(q->curn); in task_queue_remove()
267 if (q->curn) { in task_queue_remove()
287 q->curn++; in task_queue_insert()
288 q->x[q->curn] = t; in task_queue_insert()
289 FIX_POS(q->curn); in task_queue_insert()
300 return q->curn < 1; in task_queue_empty()
322 q->x[q->curn] = 0; in task_queue_extractmin()
323 q->curn--; in task_queue_extractmin()
[all …]
/dports/databases/percona57-client/percona-server-5.7.36-39/rapid/plugin/group_replication/libmysqlgcs/src/bindings/xcom/xcom/
H A Dtask.c160 q->curn = 0; in task_queue_init()
183 if (q->curn) { in is_heap()
260 assert(q->curn); in task_queue_remove()
267 if (q->curn) { in task_queue_remove()
287 q->curn++; in task_queue_insert()
288 q->x[q->curn] = t; in task_queue_insert()
289 FIX_POS(q->curn); in task_queue_insert()
300 return q->curn < 1; in task_queue_empty()
322 q->x[q->curn] = 0; in task_queue_extractmin()
323 q->curn--; in task_queue_extractmin()
[all …]
/dports/databases/mysql57-client/mysql-5.7.36/rapid/plugin/group_replication/libmysqlgcs/src/bindings/xcom/xcom/
H A Dtask.c160 q->curn = 0; in task_queue_init()
183 if (q->curn) { in is_heap()
260 assert(q->curn); in task_queue_remove()
267 if (q->curn) { in task_queue_remove()
287 q->curn++; in task_queue_insert()
288 q->x[q->curn] = t; in task_queue_insert()
289 FIX_POS(q->curn); in task_queue_insert()
300 return q->curn < 1; in task_queue_empty()
322 q->x[q->curn] = 0; in task_queue_extractmin()
323 q->curn--; in task_queue_extractmin()
[all …]
/dports/databases/xtrabackup8/percona-xtrabackup-8.0.14/plugin/group_replication/libmysqlgcs/src/bindings/xcom/xcom/
H A Dtask.cc356 if (q->curn) { in is_heap()
433 assert(q->curn); in task_queue_remove()
440 if (q->curn && i <= q->curn) { in task_queue_remove()
455 q->curn++; in task_queue_insert()
456 q->x[q->curn] = t; in task_queue_insert()
457 FIX_POS(q->curn); in task_queue_insert()
467 return q->curn < 1; in task_queue_empty()
471 assert(q->curn >= 1); in task_queue_min()
482 q->x[q->curn] = 0; in task_queue_extractmin()
483 q->curn--; in task_queue_extractmin()
[all …]
/dports/emulators/qemu42/qemu-4.2.1/roms/openhackware/src/libfs/
H A Dhfs.c1261 hfs_bnode_t *curn; in hfs_rec_prev() local
1265 curn = cur->node; in hfs_rec_prev()
1267 curn = hfs_bnode_prev(curn); in hfs_rec_prev()
1268 if (curn == NULL) in hfs_rec_prev()
1278 hfs_bnode_t *curn; in hfs_rec_next() local
1282 curn = cur->node; in hfs_rec_next()
1284 curn = hfs_bnode_next(curn); in hfs_rec_next()
1300 hfs_bnode_t *curn; in hfs_rec_find() local
1322 for (curn = tree->root_node; curn != NULL;) { in hfs_rec_find()
1365 curn = hfs_bnode_get(curn->tree, cur->u.idxrec.uid); in hfs_rec_find()
[all …]
/dports/emulators/qemu-powernv/qemu-powernv-3.0.50/roms/openhackware/src/libfs/
H A Dhfs.c1261 hfs_bnode_t *curn; in hfs_rec_prev() local
1265 curn = cur->node; in hfs_rec_prev()
1267 curn = hfs_bnode_prev(curn); in hfs_rec_prev()
1268 if (curn == NULL) in hfs_rec_prev()
1278 hfs_bnode_t *curn; in hfs_rec_next() local
1282 curn = cur->node; in hfs_rec_next()
1284 curn = hfs_bnode_next(curn); in hfs_rec_next()
1300 hfs_bnode_t *curn; in hfs_rec_find() local
1322 for (curn = tree->root_node; curn != NULL;) { in hfs_rec_find()
1365 curn = hfs_bnode_get(curn->tree, cur->u.idxrec.uid); in hfs_rec_find()
[all …]
/dports/emulators/qemu-utils/qemu-4.2.1/roms/openhackware/src/libfs/
H A Dhfs.c1261 hfs_bnode_t *curn; in hfs_rec_prev() local
1265 curn = cur->node; in hfs_rec_prev()
1267 curn = hfs_bnode_prev(curn); in hfs_rec_prev()
1268 if (curn == NULL) in hfs_rec_prev()
1278 hfs_bnode_t *curn; in hfs_rec_next() local
1282 curn = cur->node; in hfs_rec_next()
1284 curn = hfs_bnode_next(curn); in hfs_rec_next()
1300 hfs_bnode_t *curn; in hfs_rec_find() local
1322 for (curn = tree->root_node; curn != NULL;) { in hfs_rec_find()
1365 curn = hfs_bnode_get(curn->tree, cur->u.idxrec.uid); in hfs_rec_find()
[all …]
/dports/textproc/R-cran-stringi/stringi/src/
H A Dstri_encoding_conversion.cpp276 R_len_t curn = LENGTH(curs); in stri_enc_toutf8() local
279 for (R_len_t j=0; j<curn; ++j) { in stri_enc_toutf8()
395 R_len_t curn = LENGTH(curs); in stri_enc_toascii() local
401 while (j<curn) { in stri_enc_toascii()
402 U8_NEXT(curs_tab, j, curn, c); in stri_enc_toascii()
417 for (R_len_t j=0; j<curn; ++j) { in stri_enc_toascii()
628 R_len_t curn = str_cont.get(i).length(); in stri_encode() local
631 … UnicodeString encs(curs, curn, uconv_from, status); // FROM -> UTF-16 [this is the slow part] in stri_encode()
/dports/multimedia/handbrake/HandBrake-1.4.2/libhb/
H A Dcomb_detect.c734 uint8_t *curn = &pv->mask_filtered->plane[pp].data[n * stride + 1]; in mask_dilate_thread() local
749 curn[xx-1] + curn[xx] + curn[xx+1]; in mask_dilate_thread()
755 curn += stride; in mask_dilate_thread()
836 uint8_t *curn = &pv->mask_temp->plane[pp].data[n * stride + 1]; in mask_erode_thread() local
851 curn[xx-1] + curn[xx] + curn[xx+1]; in mask_erode_thread()
857 curn += stride; in mask_erode_thread()
935 uint8_t *curn = &pv->mask->plane[pp].data[n * stride + 1]; in mask_filter_thread() local
947 v_count = curp[xx] & cur[xx] & curn[xx]; in mask_filter_thread()
960 curn += stride; in mask_filter_thread()
/dports/www/kf5-khtml/khtml-5.89.0/src/xml/
H A Ddom_nodeimpl.cpp478 if (curn && !evt->propagationStopped()) { in dispatchGenericEvent()
480 evt->setCurrentTarget(curn); in dispatchGenericEvent()
481 curn->handleLocalEvents(evt, true); in dispatchGenericEvent()
483 curn->handleLocalEvents(evt, false); in dispatchGenericEvent()
485 propagationSentinel = curn; in dispatchGenericEvent()
493 while (curn && !evt->propagationStopped()) { in dispatchGenericEvent()
495 propagationSentinel = curn; in dispatchGenericEvent()
497 evt->setCurrentTarget(curn); in dispatchGenericEvent()
498 curn->handleLocalEvents(evt, false); in dispatchGenericEvent()
508 curn = it.previous(); in dispatchGenericEvent()
[all …]
/dports/databases/grass7/grass-7.8.6/vector/v.vol.rst/
H A Duser3.c58 curn, curm, curg, dxy2, dxz2, dyz2; in secpar_loop() local
130 curn = in secpar_loop()
168 c1max = c1min = curn; in secpar_loop()
188 c1min = amin1(c1min, curn); in secpar_loop()
189 if (curn < 10.) in secpar_loop()
190 c1max = amax1(c1max, curn); in secpar_loop()
199 if (curn < 10.) in secpar_loop()
210 adxx[i] = curn; /* change of gradient */ in secpar_loop()
/dports/graphics/graphviz/graphviz-2.44.1/lib/gvpr/
H A Dgvpr.c599 Agnode_t *curn; in travDFS() local
616 curn = n; in travDFS()
626 cure = fns->nxtedge(state->curgraph, cure, curn); in travDFS()
628 cure = fns->fstedge(state->curgraph, curn); in travDFS()
647 curn = cure->node; in travDFS()
650 evalNode(state, prog, xprog, curn); in travDFS()
656 evalNode(state, prog, xprog, curn); in travDFS()
657 nd = nData(curn); in travDFS()
666 curn = entry->node; in travDFS()
/dports/editors/neovim/neovim-0.6.1/runtime/indent/
H A Dvhdl.vim47 let curn = v:lnum
48 let curs = getline(curn)
51 let prevn = prevnonblank(curn - 1)
79 let pn = curn - 1
85 let nn = nextnonblank(curn + 1)
214 let pn = prevnonblank(curn - 1)
/dports/editors/vim/vim-8.2.3745/runtime/indent/
H A Dvhdl.vim47 let curn = v:lnum
48 let curs = getline(curn)
51 let prevn = prevnonblank(curn - 1)
79 let pn = curn - 1
85 let nn = nextnonblank(curn + 1)
214 let pn = prevnonblank(curn - 1)

1234