Lines Matching defs:cp
1477 int cp = swsData[i].firstLinkedPoint;
1478 while (cp >= 0) {
1479 pData[cp].askForWindingB = nEd;
1480 cp = pData[cp].nextLinkedPoint;
1579 int cp = swsData[numberOfEdges()-1].firstLinkedPoint;
1580 while (cp >= 0) {
1581 pData[cp].askForWindingB = i;
1582 cp = pData[cp].nextLinkedPoint;
2220 int cp = swsData[cc].firstLinkedPoint;
2221 while (cp >= 0) {
2222 pData[cp].askForWindingB = cb;
2223 cp = pData[cp].nextLinkedPoint;
2239 int cp = swsData[numberOfEdges() - 1].firstLinkedPoint;
2240 while (cp >= 0) {
2241 pData[cp].askForWindingB = cc;
2242 cp = pData[cp].nextLinkedPoint;
2290 int cp = swsData[cc].firstLinkedPoint;
2291 while (cp >= 0) {
2292 pData[cp].askForWindingB = cb;
2293 cp = pData[cp].nextLinkedPoint;
2309 int cp = swsData[numberOfEdges() - 1].firstLinkedPoint;
2310 while (cp >= 0) {
2311 pData[cp].askForWindingB = cc;
2312 cp = pData[cp].nextLinkedPoint;
3306 int cp = iS->swsData[iB].firstLinkedPoint;
3308 while (cp >= 0)
3310 pData[cp].askForWindingB = ne;
3311 cp = pData[cp].nextLinkedPoint;