Lines Matching defs:cur
296 register struct db_variable *cur;
303 for (cur = db_vars; cur < db_evars; cur++) {
304 if (cur->min_level > 0 || cur->max_level > 0) {
305 j = 3 * (cur->max_level - cur->min_level + 1) - 1;
306 if (cur->max_level > cur->min_level)
310 if ((l = strlen(cur->name) + j) >= len)
317 for (cur = db_vars; cur < db_evars; cur++)
319 strcmp(cur->name, new->name) < 0) &&
321 strcmp(cur->name, old->name) > 0))
322 new = cur;
412 struct db_variable *cur;
427 for (cur = db_vars; cur < db_evars; cur++)
428 if (db_cmp_variable_name(cur, db_tok_string, &aux_param))
430 if (cur == db_evars) {
431 for (cur = db_vars; cur < db_evars; cur++) {
432 for (q = cur->name, p = db_tok_string; *q && *p == *q; p++,q++)
437 if (cur == db_evars) {
442 for (i = 0; *p && *p != ':' && i < cur->max_level; i++, p = q)
447 (i > 0 && (aux_param.suffix[0] < cur->low ||
448 (cur->high >= 0 &&
449 aux_param.suffix[0] > cur->high)))) {
459 if (cur->hidden_level)
460 if (*cur->hidden_levelp >= cur->hidden_low &&
461 *cur->hidden_levelp <= cur->hidden_high) {
463 aux_param.hidden_level = h = *cur->hidden_levelp;
466 aux_param.hidden_level = h = cur->hidden_low;
468 for (k = aux_param.level > 0 ? aux_param.suffix[0] : cur->high;
475 if ((cur->min_level == 0 && !cur->hidden_level) || cur->high < 0)
478 if (cur->min_level > 0) {
481 aux_param.suffix[0] : cur->high; k > 9; k /= 10)
485 if (cur->hidden_level && hidden_level == 0) {
488 aux_param.hidden_level : cur->hidden_high; k > 9; k /= 10)
492 len = strlen(cur->name) + j;
493 i = low = aux_param.level > 0 ? aux_param.suffix[0] : cur->low;
496 db_printf(cur->name);
497 j = strlen(cur->name);
498 if (cur->high >= 0) {
499 if (cur->min_level > 0) {
505 if (cur->hidden_level && hidden_level == 0) {
525 if (cur->fcn) {
527 (*cur->fcn)(cur, (db_expr_t *)0, DB_VAR_SHOW, &aux_param);
529 db_printf("%#lln", (unsigned long long)*(cur->valuep + i));
530 db_find_xtrn_task_sym_and_offset(*(cur->valuep + i), &name,
533 offset != *(cur->valuep + i)) {
540 if (cur->high < 0)
542 if (aux_param.level > 0 || i++ == cur->high) {
543 if (!cur->hidden_level ||
545 h++ == cur->hidden_high)
557 struct db_variable *cur;
596 for (cur = db_vars; cur < db_evars; cur++) {
597 if ((cur->min_level == 0 && !cur->hidden_level) || cur->high < 0)
600 if (cur->min_level > 0) {
602 for (k = cur->high; k > 9; k /= 10)
606 if (cur->hidden_level &&
607 (*cur->hidden_levelp < cur->hidden_low ||
608 *cur->hidden_levelp > cur->hidden_high)) {
610 for (k = cur->hidden_high; k > 9; k /= 10)
614 if ((l = strlen(cur->name) + j) >= len)
622 for (cur = db_vars; cur < db_evars; cur++) {
623 i = cur->low;
624 if (cur->hidden_level) {
625 if (*cur->hidden_levelp >= cur->hidden_low &&
626 *cur->hidden_levelp <= cur->hidden_high) {
627 h = cur->hidden_low - 1;
628 aux_param.hidden_level = *cur->hidden_levelp;
630 h = cur->hidden_low;
631 aux_param.hidden_level = cur->hidden_low;
634 for (k = cur->high; k > 9; k /= 10)
639 if (cur != db_vars && cur->high >= 0 &&
640 (cur->min_level > 0 || cur->hidden_level))
644 db_printf(cur->name);
645 j = strlen(cur->name);
646 if (cur->high >= 0) {
647 if (cur->min_level > 0) {
653 if (cur->hidden_level && h >= cur->hidden_low) {
672 if (cur->fcn) {
674 (*cur->fcn)(cur, (db_expr_t *)0, DB_VAR_SHOW, &aux_param);
676 db_printf("%#lln", (unsigned long long)*(cur->valuep + i));
677 db_find_xtrn_task_sym_and_offset(*(cur->valuep + i), &name,
680 offset != *(cur->valuep + i)) {
687 if (cur->high < 0)
689 if (i++ == cur->high) {
690 if (!cur->hidden_level || h++ == cur->hidden_high)
693 i = cur->low;