Lines Matching defs:n_candidates
2156 int n_candidates;
2158 n_candidates = ada_lookup_symbol_list (exp->elts[pc + 2].name,
2164 if (n_candidates > 1)
2170 for (j = 0; j < n_candidates; j += 1)
2189 if (j < n_candidates)
2192 while (j < n_candidates)
2196 candidate_syms[j] = candidate_syms[n_candidates-1];
2197 candidate_blocks[j] = candidate_blocks[n_candidates-1];
2198 n_candidates -= 1;
2206 if (n_candidates == 0)
2209 else if (n_candidates == 1)
2212 && ! is_nonfunction (candidate_syms, n_candidates))
2215 n_candidates, NULL, 0,
2226 n_candidates, 1);
2258 int n_candidates;
2260 n_candidates = ada_lookup_symbol_list (exp->elts[pc + 5].name,
2265 if (n_candidates == 1)
2270 n_candidates, argvec, nargs-1,
2312 int n_candidates;
2314 n_candidates =
2320 n_candidates, argvec, nargs,
3830 int n_candidates;
3832 n_candidates = ada_lookup_symbol_list (name,
3836 if (n_candidates == 0)
3838 else if (n_candidates != 1)
3839 user_select_syms (candidate_syms, candidate_blocks, n_candidates, 1);