Lines Matching defs:loop
1006 // it contains spans of segments in test's loop but not including 'this'
1067 // This loop looks for adjacent spans which are near by
1229 // loop looking for a pair of angle parts that are too close to be sorted
1559 ptT list on B-segment adjacent to the B-end/A ptT loop (not in the loop, but
1561 coincident pair. If so, check for a new coincident span between B-end/A ptT loop
1562 and the adjacent ptT loop.
1610 // if the spans don't match, add the mssing pt to the segment and loop it in the opposite span
1861 // returns true if caller should loop again
2418 // for each coincident ptT in loop; see if its opposite in is also in the loop
2432 int loop = 0;
2438 for (int check = 1; check < loop - 1; ++check) {
2441 for (int inner = check + 1; inner < loop; ++inner) {
2444 SkDebugf("*** bad coincident end loop ***\n");
2449 ++loop;
2474 // spans pointing to the same pt-t loop at different loop elements
2603 int loop = 0;
2609 for (int check = 1; check < loop - 1; ++check) {
2612 for (int inner = check + 1; inner < loop; ++inner) {
2615 SkDebugf("*** bad coincident loop ***\n");
2620 ++loop;
2753 int loop = 0;
2756 for (int check = 1; check < loop - 1; ++check) {
2759 for (int inner = check + 1; inner < loop; ++inner) {
2763 SkDebugf("*** bad ptT loop ***\n");
2765 return loop;
2769 // there's nothing wrong with extremely large loop counts -- but this may appear to hang
2770 // by taking a very long time to figure out that no loop entry is a duplicate
2771 // -- and it's likely that a large loop count is indicative of a bug somewhere
2772 if (++loop > 1000) {
2773 SkDebugf("*** loop count exceeds 1000 ***\n");