Home
last modified time | relevance | path

Searched refs:numrst (Results 1 – 2 of 2) sorted by relevance

/dports/games/jfsw/jfsw-c434002/jfbuild/src/
H A Dpolymost.c4037 int i, j, k, z, i0, i1, i2, i3, npoints, gap, numrst; in tessectrap() local
4102 numrst = 0; in tessectrap()
4117 for(i=numrst;i>0;i--) in tessectrap()
4122 numrst += 2; in tessectrap()
4144 if (i1 == i2) { for(i=0;i<numrst;i++) if (rst[i].i == i1) break; } in tessectrap()
4145 else { for(i=0;i<numrst;i++) if ((rst[i].i == i1) || (rst[i].i == i2)) break; } in tessectrap()
4158 numrst -= 2; for(;i<numrst;i++) rst[i] = rst[i+2]; in tessectrap()
/dports/games/NBlood/NBlood-a1689a4/source/build/src/
H A Dpolymost.cpp9390 int32_t i, j, k, z, i0, i1, i2, i3, npoints, gap, numrst; in tessectrap() local
9449 numrst = 0; in tessectrap()
9464 for (i=numrst; i>0; i--) in tessectrap()
9469 numrst += 2; in tessectrap()
9492 if (i1 == i2) { for (i=0; i<numrst; i++) if (rst[i].i == i1) break; } in tessectrap()
9493 else { for (i=0; i<numrst; i++) if ((rst[i].i == i1) || (rst[i].i == i2)) break; } in tessectrap()
9506 numrst -= 2; for (; i<numrst; i++) rst[i] = rst[i+2]; in tessectrap()