Lines Matching refs:ptr2
81 _CvTrianAttr **ptr_p, **ptr_n, **ptr1, **ptr2; /* pointers to pointers of triangles */
112 ptr_p = ptr_n = ptr1 = ptr2 = NULL;
159 ptr2 = ptr_n;
170 ptr2 = ptr_n;
180 ptr2 = ptr_p;
241 ptr2[i_buf - 1] = NULL;
265 ptr2[i_buf - 1] = cur_adr;
294 ptr2[i_buf - 1] = cur_adr;
323 ptr2[i_buf] = ptr1[j];
325 ptr2[i_buf] = NULL;
327 ptr2[i_buf] = tree_end;
413 tree_one.next_v1 = ptr2[3];
414 tree_one.next_v2 = ptr2[0];
421 tree_two.next_v1 = ptr2[1];
422 tree_two.next_v2 = ptr2[2];
429 if( ptr2[3] != NULL )
430 ptr2[3]->prev_v = cur_adr;
431 if( ptr2[0] != NULL )
432 ptr2[0]->prev_v = cur_adr;
440 if( ptr2[1] != NULL )
441 ptr2[1]->prev_v = cur_adr;
442 if( ptr2[2] != NULL )
443 ptr2[2]->prev_v = cur_adr;
456 if( ptr2[1] != NULL )
457 ptr2[1]->prev_v = cur_adr;
458 if( ptr2[2] != NULL )
459 ptr2[2]->prev_v = cur_adr;
467 if( ptr2[3] != NULL )
468 ptr2[3]->prev_v = cur_adr;
469 if( ptr2[0] != NULL )
470 ptr2[0]->prev_v = cur_adr;
486 tree_one.next_v1 = ptr2[2];
487 tree_one.next_v2 = ptr2[3];
494 tree_two.next_v1 = ptr2[0];
495 tree_two.next_v2 = ptr2[1];
502 if( ptr2[2] != NULL )
503 ptr2[2]->prev_v = cur_adr;
504 if( ptr2[3] != NULL )
505 ptr2[3]->prev_v = cur_adr;
513 if( ptr2[0] != NULL )
514 ptr2[0]->prev_v = cur_adr;
515 if( ptr2[1] != NULL )
516 ptr2[1]->prev_v = cur_adr;
529 if( ptr2[0] != NULL )
530 ptr2[0]->prev_v = cur_adr;
531 if( ptr2[1] != NULL )
532 ptr2[1]->prev_v = cur_adr;
540 if( ptr2[2] != NULL )
541 ptr2[2]->prev_v = cur_adr;
542 if( ptr2[3] != NULL )
543 ptr2[3]->prev_v = cur_adr;
