Home
last modified time | relevance | path

Searched refs:ncur (Results 1 – 25 of 195) sorted by relevance

12345678

/dports/cad/jspice3/jspice3-2.5/src/bin/
H A Dproc2mod.c241 for(ncur=nlist;ncur;ncur=ncur->nnext) { in main()
246 ncur->nparms[0],ncur->nparms[1],ncur->nparms[2]); in main()
248 ncur->nparms[3],ncur->nparms[4],ncur->nparms[5]); in main()
250 ncur->nparms[6],ncur->nparms[7],ncur->nparms[8]); in main()
252 ncur->nparms[9],ncur->nparms[10],ncur->nparms[11]); in main()
254 ncur->nparms[12],ncur->nparms[13],ncur->nparms[14]); in main()
256 ncur->nparms[15],ncur->nparms[16],ncur->nparms[17]); in main()
258 ncur->nparms[18],ncur->nparms[19],ncur->nparms[20]); in main()
260 ncur->nparms[21],ncur->nparms[22],ncur->nparms[23]); in main()
262 ncur->nparms[24],ncur->nparms[25],ncur->nparms[26]); in main()
[all …]
/dports/cad/ngspice_rework/ngspice-35/src/
H A Dngproc2mod.c235 for(ncur=nlist;ncur;ncur=ncur->nnext) { in main()
240 ncur->nparms[0],ncur->nparms[1],ncur->nparms[2]); in main()
242 ncur->nparms[3],ncur->nparms[4],ncur->nparms[5]); in main()
244 ncur->nparms[6],ncur->nparms[7],ncur->nparms[8]); in main()
246 ncur->nparms[9],ncur->nparms[10],ncur->nparms[11]); in main()
248 ncur->nparms[12],ncur->nparms[13],ncur->nparms[14]); in main()
250 ncur->nparms[15],ncur->nparms[16],ncur->nparms[17]); in main()
252 ncur->nparms[18],ncur->nparms[19],ncur->nparms[20]); in main()
254 ncur->nparms[21],ncur->nparms[22],ncur->nparms[23]); in main()
256 ncur->nparms[24],ncur->nparms[25],ncur->nparms[26]); in main()
[all …]
/dports/sysutils/heirloom/heirloom-070715/csplit/
H A Dcsplit.c188 args[++ncur] = scalloc(1, sizeof *args[ncur]); in scan()
207 args[ncur]->a_re = smalloc(sizeof *args[ncur]->a_re); in scan()
229 if (ncur < 0 || args[ncur] == 0 || args[ncur]->a_rp) in scan()
326 ncur = 0; in match()
330 if (args[ncur]->a_re && args[ncur]->a_nx < 0) in match()
353 args[ncur]->a_no = args[ncur]->a_nx; in match()
368 if (args[ncur]->a_re && args[ncur]->a_nx >= 0) in match()
374 args[ncur]->a_no += args[ncur]->a_nx; in match()
382 if (args[ncur]->a_re && args[ncur]->a_nx < 0) in match()
391 return 1 + ((lineno==1&&ncur==0) || args[ncur]==0 || in match()
[all …]
/dports/devel/R-cran-randomForest/randomForest/src/
H A Drfsub.f65 ncur = 1
113 nodestart(ncur+1) = ndstart
120 classpop(j,ncur+1) = classpop(j,ncur+1) + win(nc)
125 classpop(j,ncur+2) = classpop(j,ncur+2) + win(nc)
130 nodestatus(ncur+1) = 2
131 nodestatus(ncur+2) = 2
132 if (nodepop(ncur+1).le.ndsize) nodestatus(ncur+1) = -1
133 if (nodepop(ncur+2).le.ndsize) nodestatus(ncur+2) = -1
142 if (classpop(j,ncur+1).eq.popt1) nodestatus(ncur+1) = -1
143 if (classpop(j,ncur+2).eq.popt2) nodestatus(ncur+2) = -1
[all …]
H A DclassTree.c62 ncur = 1; in classTree()
69 if (i > ncur - 1) break; in classTree()
101 nodePop[ncur+2] = ndend - ndendl; in classTree()
102 nodeStart[ncur+1] = ndstart; in classTree()
103 nodeStart[ncur+2] = ndendl + 1; in classTree()
118 if (nodePop[ncur + 1] <= ndsize) nodeStatus[ncur+1] = NODE_TERMINAL; in classTree()
119 if (nodePop[ncur + 2] <= ndsize) nodeStatus[ncur+2] = NODE_TERMINAL; in classTree()
133 treemap[i * 2] = ncur + 1; in classTree()
134 treemap[1 + i * 2] = ncur + 2; in classTree()
136 ncur += 2; in classTree()
[all …]
H A DregTree.c49 ncur = 0; in regTree()
66 if (k > ncur || ncur >= nrnodes - 2) break; in regTree()
109 nodepop[ncur + 2] = ndend - ndendl; in regTree()
110 nodestart[ncur + 1] = ndstart; in regTree()
111 nodestart[ncur + 2] = ndendl + 1; in regTree()
122 avnode[ncur+1] = av; in regTree()
123 nodestatus[ncur+1] = NODE_TOSPLIT; in regTree()
137 avnode[ncur + 2] = av; in regTree()
144 lDaughter[k] = ncur + 1 + 1; in regTree()
145 rDaughter[k] = ncur + 2 + 1; in regTree()
[all …]
/dports/math/scalapack/scalapack-2.1.0/PBLAS/SRC/PTOOLS/
H A DPB_CVMcontig.c219 md = mcurd; nd = ncur; FirstD = 1;
236 lcmt00 += low - ilow + qnb; ncur++;
244 lcmt00 += low - ilow + qnb; ncur++;
250 while( ( ncur < nblks ) && ( lcmt00 < low ) )
253 ncur++;
259 if( ncur >= nblks ) goto l_end;
265 lcmt = lcmt00; nbloc = nb; ncurd = ncur;
318 lcmt00 = lcmt; lcmt += qnb; ncur = ncurd++;
333 if( ncur == nblks-1 ) nbloc = lnbloc;
397 md = mcurd; nd = ncur; FirstD = 1;
[all …]
/dports/sysutils/multitail/multitail-6.5.0/
H A Ddiff.c16 diff -> bcur = (char **)myrealloc(diff -> bcur, sizeof(char *) * (diff -> ncur + 1)); in store_for_diff()
18 (diff -> bcur)[diff -> ncur] = mystrdup(string); in store_for_diff()
20 diff -> ncur++; in store_for_diff()
29 for(loop_cur=0; loop_cur < cur -> restart.diff.ncur; loop_cur++) in generate_diff()
61 cur -> restart.diff.nprev = cur -> restart.diff.ncur; in generate_diff()
63 cur -> restart.diff.ncur = 0; in generate_diff()
/dports/news/husky-fidoconf/husky-fidoconf-1.9.20191207/fastlst/aplibs/
H A Dfbd.cc68 ntot = ncur = 0; in FBD()
103 if (ncur % BLKSIZE == 0) { in Store()
107 ncur = 0; in Store()
109 FIDX *fidx = &idxcur->idx[ncur++]; in Store()
206 ncur = first % BLKSIZE; // in the current block in Build()
215 ncur = 0; in Build()
220 if (ncur == BLKSIZE) { in Build()
221 ncur = 0; in Build()
224 fidxp[i] = &id->idx[ncur++]; in Build()
/dports/news/husky/husky-1.9.20191207/fastlst/aplibs/
H A Dfbd.cc68 ntot = ncur = 0; in FBD()
103 if (ncur % BLKSIZE == 0) { in Store()
107 ncur = 0; in Store()
109 FIDX *fidx = &idxcur->idx[ncur++]; in Store()
206 ncur = first % BLKSIZE; // in the current block in Build()
215 ncur = 0; in Build()
220 if (ncur == BLKSIZE) { in Build()
221 ncur = 0; in Build()
224 fidxp[i] = &id->idx[ncur++]; in Build()
/dports/news/husky-smapi/husky-smapi-1.9.20191207,1/fastlst/aplibs/
H A Dfbd.cc68 ntot = ncur = 0; in FBD()
103 if (ncur % BLKSIZE == 0) { in Store()
107 ncur = 0; in Store()
109 FIDX *fidx = &idxcur->idx[ncur++]; in Store()
206 ncur = first % BLKSIZE; // in the current block in Build()
215 ncur = 0; in Build()
220 if (ncur == BLKSIZE) { in Build()
221 ncur = 0; in Build()
224 fidxp[i] = &id->idx[ncur++]; in Build()
/dports/news/husky-hpt/husky-hpt-1.9.20191207/fastlst/aplibs/
H A Dfbd.cc68 ntot = ncur = 0; in FBD()
103 if (ncur % BLKSIZE == 0) { in Store()
107 ncur = 0; in Store()
109 FIDX *fidx = &idxcur->idx[ncur++]; in Store()
206 ncur = first % BLKSIZE; // in the current block in Build()
215 ncur = 0; in Build()
220 if (ncur == BLKSIZE) { in Build()
221 ncur = 0; in Build()
224 fidxp[i] = &id->idx[ncur++]; in Build()
/dports/news/husky-sqpack/husky-sqpack-1.9.20191207/fastlst/aplibs/
H A Dfbd.cc68 ntot = ncur = 0; in FBD()
103 if (ncur % BLKSIZE == 0) { in Store()
107 ncur = 0; in Store()
109 FIDX *fidx = &idxcur->idx[ncur++]; in Store()
206 ncur = first % BLKSIZE; // in the current block in Build()
215 ncur = 0; in Build()
220 if (ncur == BLKSIZE) { in Build()
221 ncur = 0; in Build()
224 fidxp[i] = &id->idx[ncur++]; in Build()
/dports/news/husky-huskylib/husky-huskylib-1.9.20191207/fastlst/aplibs/
H A Dfbd.cc68 ntot = ncur = 0; in FBD()
103 if (ncur % BLKSIZE == 0) { in Store()
107 ncur = 0; in Store()
109 FIDX *fidx = &idxcur->idx[ncur++]; in Store()
206 ncur = first % BLKSIZE; // in the current block in Build()
215 ncur = 0; in Build()
220 if (ncur == BLKSIZE) { in Build()
221 ncur = 0; in Build()
224 fidxp[i] = &id->idx[ncur++]; in Build()
/dports/news/husky-htick/husky-htick-1.9.20191207/fastlst/aplibs/
H A Dfbd.cc68 ntot = ncur = 0; in FBD()
103 if (ncur % BLKSIZE == 0) { in Store()
107 ncur = 0; in Store()
109 FIDX *fidx = &idxcur->idx[ncur++]; in Store()
206 ncur = first % BLKSIZE; // in the current block in Build()
215 ncur = 0; in Build()
220 if (ncur == BLKSIZE) { in Build()
221 ncur = 0; in Build()
224 fidxp[i] = &id->idx[ncur++]; in Build()
/dports/news/husky-areafix/husky-areafix-1.9.20191207/fastlst/aplibs/
H A Dfbd.cc68 ntot = ncur = 0; in FBD()
103 if (ncur % BLKSIZE == 0) { in Store()
107 ncur = 0; in Store()
109 FIDX *fidx = &idxcur->idx[ncur++]; in Store()
206 ncur = first % BLKSIZE; // in the current block in Build()
215 ncur = 0; in Build()
220 if (ncur == BLKSIZE) { in Build()
221 ncur = 0; in Build()
224 fidxp[i] = &id->idx[ncur++]; in Build()
/dports/devel/codeblocks/codeblocks-20.03/src/plugins/contrib/FortranProject/
H A Dtab2space.cpp219 size_t ncur = 0; in EditorTab2Space() local
223 size_t ncur_old = ncur; in EditorTab2Space()
224 while (ncur < allText.size()) in EditorTab2Space()
226 if (allText.GetChar(ncur) == '\n' || ncur == (allText.size()-1)) in EditorTab2Space()
228 ncur++; in EditorTab2Space()
229 line = allText.Mid(ncur_old, ncur-ncur_old); in EditorTab2Space()
232 ncur++; in EditorTab2Space()
278 if (ncur >= allText.size()) in EditorTab2Space()
/dports/deskutils/treesheets/treesheets-1.0.2/lobster/src/lobster/
H A Doctree.h45 int ncur; in Set() local
49 ncur = (int)nodes.size(); in Set()
53 ncur = freelist.back(); in Set()
55 for (int i = 0; i < OCTREE_SUBDIV; i++) nodes[ncur + i] = oval; in Set()
56 nodes[ncur + OCTREE_SUBDIV] = parent; in Set()
58 nodes[ccur].SetNodeIdx(ncur); in Set()
59 cur = ncur; in Set()
/dports/multimedia/gstreamer1-plugins-gnonlin/gnonlin-1.4.0/gnl/
H A Dgnlghostpad.c50 guint64 ncur; in translate_incoming_seek() local
71 if (ncur > G_MAXINT64) in translate_incoming_seek()
74 GST_TIME_ARGS (ncur)); in translate_incoming_seek()
77 ncur = object->inpoint; in translate_incoming_seek()
80 ncur = cur; in translate_incoming_seek()
115 GST_TIME_ARGS (ncur), GST_TIME_ARGS (nstop)); in translate_incoming_seek()
143 guint64 ncur; in translate_outgoing_seek() local
164 if (ncur > G_MAXINT64) in translate_outgoing_seek()
167 GST_TIME_ARGS (ncur)); in translate_outgoing_seek()
170 ncur = object->start; in translate_outgoing_seek()
[all …]
/dports/multimedia/gstreamer1-editing-services/gstreamer-editing-services-1.16.2/plugins/nle/
H A Dnleghostpad.c59 guint64 ncur; in nle_object_translate_incoming_seek() local
80 if (ncur > G_MAXINT64) in nle_object_translate_incoming_seek()
83 GST_TIME_ARGS (ncur)); in nle_object_translate_incoming_seek()
86 ncur = object->inpoint; in nle_object_translate_incoming_seek()
89 ncur = cur; in nle_object_translate_incoming_seek()
124 GST_TIME_ARGS (ncur), GST_TIME_ARGS (nstop)); in nle_object_translate_incoming_seek()
151 guint64 ncur; in translate_outgoing_seek() local
172 if (ncur > G_MAXINT64) in translate_outgoing_seek()
175 GST_TIME_ARGS (ncur)); in translate_outgoing_seek()
178 ncur = object->start; in translate_outgoing_seek()
[all …]
/dports/benchmarks/sysbench/sysbench-1.0.20/src/
H A Dsb_histogram.c123 uint64_t nevents, ncur, nmax; in sb_histogram_get_pct_intermediate() local
169 ncur = 0; in sb_histogram_get_pct_intermediate()
172 ncur += array[i]; in sb_histogram_get_pct_intermediate()
173 if (ncur >= nmax) in sb_histogram_get_pct_intermediate()
228 uint64_t ncur, nmax; in get_pct_cumulative() local
232 ncur = 0; in get_pct_cumulative()
235 ncur += h->cumulative_array[i]; in get_pct_cumulative()
236 if (ncur >= nmax) in get_pct_cumulative()
/dports/audio/denemo/denemo-2.0.6/src/core/
H A Dkeymapio.c215 xmlNodePtr ncur; in parseCommands() local
218 for (ncur = cur->xmlChildrenNode; ncur; ncur = ncur->next) in parseCommands()
220 if ((0 == xmlStrcmp (ncur->name, COMMANDXML_TAG_ROW))) in parseCommands()
222 parseScripts (doc, ncur, menupath); in parseCommands()
228 for (ncur = cur->xmlChildrenNode; ncur; ncur = ncur->next) in parseCommands()
230 if ((0 == xmlStrcmp (ncur->name, COMMANDXML_TAG_ROW))) in parseCommands()
232 parseBindings (doc, ncur, the_keymap); in parseCommands()
236 parseCursors (doc, ncur); in parseCommands()
390 xmlNodePtr ncur; in load_xml_keybindings() local
391 for (ncur = cur->xmlChildrenNode; ncur != NULL; ncur = ncur->next) in load_xml_keybindings()
[all …]
/dports/multimedia/v4l_compat/linux-5.13-rc2/fs/xfs/libxfs/
H A Dxfs_inode_fork.h201 struct xfs_iext_cursor ncur = *cur; in xfs_iext_peek_next_extent() local
203 xfs_iext_next(ifp, &ncur); in xfs_iext_peek_next_extent()
204 return xfs_iext_get_extent(ifp, &ncur, gotp); in xfs_iext_peek_next_extent()
213 struct xfs_iext_cursor ncur = *cur; in xfs_iext_peek_prev_extent() local
215 xfs_iext_prev(ifp, &ncur); in xfs_iext_peek_prev_extent()
216 return xfs_iext_get_extent(ifp, &ncur, gotp); in xfs_iext_peek_prev_extent()
/dports/multimedia/v4l-utils/linux-5.13-rc2/fs/xfs/libxfs/
H A Dxfs_inode_fork.h201 struct xfs_iext_cursor ncur = *cur; in xfs_iext_peek_next_extent() local
203 xfs_iext_next(ifp, &ncur); in xfs_iext_peek_next_extent()
204 return xfs_iext_get_extent(ifp, &ncur, gotp); in xfs_iext_peek_next_extent()
213 struct xfs_iext_cursor ncur = *cur; in xfs_iext_peek_prev_extent() local
215 xfs_iext_prev(ifp, &ncur); in xfs_iext_peek_prev_extent()
216 return xfs_iext_get_extent(ifp, &ncur, gotp); in xfs_iext_peek_prev_extent()
/dports/multimedia/libv4l/linux-5.13-rc2/fs/xfs/libxfs/
H A Dxfs_inode_fork.h201 struct xfs_iext_cursor ncur = *cur; in xfs_iext_peek_next_extent() local
203 xfs_iext_next(ifp, &ncur); in xfs_iext_peek_next_extent()
204 return xfs_iext_get_extent(ifp, &ncur, gotp); in xfs_iext_peek_next_extent()
213 struct xfs_iext_cursor ncur = *cur; in xfs_iext_peek_prev_extent() local
215 xfs_iext_prev(ifp, &ncur); in xfs_iext_peek_prev_extent()
216 return xfs_iext_get_extent(ifp, &ncur, gotp); in xfs_iext_peek_prev_extent()

12345678