Lines Matching refs:names

143 if(current_names->used != 0 && current_names->names[current_names->used-1] == plus) {
150 if (current_names->used == VSIZEOF(current_names->names)) {
162 current_names->names[current_names->used++] = name;
176 * A string has been found to contain member names.
178 * Handle it pretty much as enter_name() does for simple names.
286 if (current_names->used == VSIZEOF(current_names->names)) {
305 current_names->names[current_names->used++] = name;
488 next = &target_list->names[i + 1];
491 &target_list->next->names[0] : NULL;
519 tail_target_group->name = target_list->names[i];
525 target_group->name = target_list->names[i];
589 (depes->names[0] == recursive_name)) {
591 depes->names[0] = NULL;
599 if (depes->names[i] != NULL) {
603 depstr.init(depes->names[i]);
612 name = depes->names[i];
617 (*dpp)->name = depes->names[i];
686 depes->names[0] = force;
837 if (depes->names[i] == not_auto) {
842 depes->names[i],
987 depe->name = nvp->names[i];
1203 depes->names[n]->ignore_error_mode = true;
1239 make_state = depes->names[0];
1250 if (depes->names[0] != current_make_version) {
1255 if (!IS_EQUAL(depes->names[0]->string_mb,
1267 depes->names[0]->string_mb);
1287 depes->names[n]->string_mb);
1289 depes->names[n]->no_parallel = true;
1290 depes->names[n]->parallel = false;
1310 depes->names[n]->string_mb);
1312 depes->names[n]->parallel = true;
1313 depes->names[n]->no_parallel = false;
1333 depes->names[n]->string_mb);
1335 depes->names[n]->no_parallel = true;
1336 depes->names[n]->parallel = false;
1337 depes->names[n]->localhost = true;
1360 depes->names[n]->string_mb);
1362 depes->names[n]->stat.is_precious = true;
1435 depes->names[n]->silent_mode = true;
1497 np = depes->names[n];
1513 (void) printf("%s ", depes->names[n]->string_mb);