90     CvNode2D *enter_x;  member
129                            int ssize, int dsize, CvNode2D * enter_x );
286                                       state.ssize, state.dsize, state.enter_x );  in cvCalcEMD2()
311         if( xp != state.enter_x && ci >= 0 && cj >= 0 )  in cvCalcEMD2()
577     state->enter_x = (state->end_x)++;  in icvInitEMD()
712               CvNode1D * u, CvNode1D * v, int ssize, int dsize, CvNode2D * enter_x )  in icvIsOptimal()  argument
739     enter_x->i = min_i;  in icvIsOptimal()
740     enter_x->j = min_j;  in icvIsOptimal()
755     CvNode2D *enter_x = state->enter_x;  in icvNewSolution()  local
759     i = enter_x->i;  in icvNewSolution()
760     j = enter_x->j;  in icvNewSolution()
762     enter_x->next[0] = state->rows_x[i];  in icvNewSolution()
763     enter_x->next[1] = state->cols_x[j];  in icvNewSolution()
764     enter_x->val = 0;  in icvNewSolution()
765     state->rows_x[i] = enter_x;  in icvNewSolution()
766     state->cols_x[j] = enter_x;  in icvNewSolution()
822     state->enter_x = leave_x;  in icvNewSolution()
838     CvNode2D *enter_x = state->enter_x, *_x = state->_x;  in icvFindLoop()  local
843     new_x = loop[0] = enter_x;  in icvFindLoop()
844     is_used[enter_x - _x] = 1;  in icvFindLoop()
860             while( new_x != 0 && is_used[new_x - _x] && new_x != enter_x )  in icvFindLoop()
862             if( new_x == enter_x )  in icvFindLoop()