static inline char *tparam_internal(const char *string, va_list ap) { #define NUM_VARS 26 int param[9]; int popcount; int variable[NUM_VARS]; static int sVariable[NUM_VARS]; char len; int number; int level; int x, y; int i; int varused = -1; register const char *cp; out_used = 0; if (string == NULL) return NULL; /* * Find the highest parameter-number referred to in the format string. * Use this value to limit the number of arguments copied from the * variable-length argument list. */ for (cp = string, popcount = number = 0; *cp != '\0'; cp++) { if (cp[0] == '%' && cp[1] != '\0') { switch (cp[1]) { case '%': cp++; break; case 'i': if (popcount < 2) popcount = 2; break; case 'p': cp++; if (cp[1] >= '1' && cp[1] <= '9') { int c = cp[1] - '0'; if (c > popcount) popcount = c; } break; case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': case 'd': case 'c': case 's': ++number; break; } } } if (number > 9) number = 9; for (i = 0; i < max(popcount, number); i++) { /* * FIXME: potential loss here if sizeof(int) != sizeof(char *). * A few caps (such as plab_norm) have string-valued parms. */ param[i] = va_arg(ap, int); } /* * This is a termcap compatibility hack. If there are no explicit pop * operations in the string, load the stack in such a way that * successive pops will grab successive parameters. That will make * the expansion of (for example) \E[%d;%dH work correctly in termcap * style, which means tparam() will expand termcap strings OK. */ stack_ptr = 0; if (popcount == 0) { popcount = number; for (i = number - 1; i >= 0; i--) npush(param[i]); } #ifdef TRACE if (_nc_tracing & TRACE_CALLS) { for (i = 0; i < popcount; i++) save_number(", %d", param[i]); _tracef(T_CALLED("%s(%s%s)"), tname, _nc_visbuf(string), out_buff); out_used = 0; } #endif /* TRACE */ while (*string) { if (*string != '%') save_char(*string); else { string++; switch (*string) { default: break; case '%': save_char('%'); break; case 'd': save_number("%d", npop()); break; case 'x': save_number("%x", npop()); break; case '0': string++; len = *string; if (len == '2' || len == '3') { ++string; if (*string == 'd') { if (len == '2') save_number("%02d", npop()); else save_number("%03d", npop()); } else if (*string == 'x') { if (len == '2') save_number("%02x", npop()); else save_number("%03x", npop()); } } break; case '2': string++; if (*string == 'd') { save_number("%2d", npop()); } else if (*string == 'x') { save_number("%2x", npop()); } break; case '3': string++; if (*string == 'd') { save_number("%3d", npop()); } else if (*string == 'x') { save_number("%3x", npop()); } break; case 'c': save_char(npop()); break; case 's': save_text(spop()); break; case 'p': string++; if (*string >= '1' && *string <= '9') npush(param[*string - '1']); break; case 'P': string++; if (islower(*string)) { i = (*string - 'a'); if (i >= 0 && i < NUM_VARS) { while (varused < i) variable[++varused] = 0; variable[i] = npop(); } } else { i = (*string - 'A'); if (i >= 0 && i < NUM_VARS) sVariable[i] = npop(); } break; case 'g': string++; if (islower(*string)) { i = (*string - 'a'); if (i >= 0 && i < NUM_VARS) { while (varused < i) variable[++varused] = 0; npush(variable[i]); } } else { i = (*string - 'A'); if (i >= 0 && i < NUM_VARS) npush(sVariable[i]); } break; case '\'': string++; npush(*string); string++; break; case L_BRACE: number = 0; string++; while (*string >= '0' && *string <= '9') { number = number * 10 + *string - '0'; string++; } npush(number); break; case '+': npush(npop() + npop()); break; case '-': y = npop(); x = npop(); npush(x - y); break; case '*': npush(npop() * npop()); break; case '/': y = npop(); x = npop(); npush(x / y); break; case 'm': y = npop(); x = npop(); npush(x % y); break; case 'A': npush(npop() && npop()); break; case 'O': npush(npop() || npop()); break; case '&': npush(npop() & npop()); break; case '|': npush(npop() | npop()); break; case '^': npush(npop() ^ npop()); break; case '=': y = npop(); x = npop(); npush(x == y); break; case '<': y = npop(); x = npop(); npush(x < y); break; case '>': y = npop(); x = npop(); npush(x > y); break; case '!': npush(! npop()); break; case '~': npush(~ npop()); break; case 'i': param[0]++; param[1]++; break; case '?': break; case 't': x = npop(); if (!x) { /* scan forward for %e or %; at level zero */ string++; level = 0; while (*string) { if (*string == '%') { string++; if (*string == '?') level++; else if (*string == ';') { if (level > 0) level--; else break; } else if (*string == 'e' && level == 0) break; } if (*string) string++; } } break; case 'e': /* scan forward for a %; at level zero */ string++; level = 0; while (*string) { if (*string == '%') { string++; if (*string == '?') level++; else if (*string == ';') { if (level > 0) level--; else break; } } if (*string) string++; } break; case ';': break; } /* endswitch (*string) */ } /* endelse (*string == '%') */ if (*string == '\0') break; string++; } /* endwhile (*string) */ if (out_buff == 0) out_buff = calloc(1,1); if (out_used == 0) *out_buff = '\0'; T((T_RETURN("%s"), _nc_visbuf(out_buff))); return(out_buff); }
void WeaponEditorDlg::DoDataExchange(CDataExchange* pDX) { CString str; CDialog::DoDataExchange(pDX); //{{AFX_DATA_MAP(WeaponEditorDlg) DDX_Control(pDX, IDC_SPIN4, m_spin4); DDX_Control(pDX, IDC_SPIN3, m_spin3); DDX_Control(pDX, IDC_SPIN2, m_spin2); DDX_Control(pDX, IDC_SPIN1, m_spin1); DDX_CBIndex(pDX, IDC_AI_CLASS, m_ai_class); DDX_CBIndex(pDX, IDC_GUN1, m_gun1); DDX_CBIndex(pDX, IDC_GUN2, m_gun2); DDX_CBIndex(pDX, IDC_GUN3, m_gun3); DDX_CBIndex(pDX, IDC_MISSILE1, m_missile1); DDX_CBIndex(pDX, IDC_MISSILE2, m_missile2); DDX_CBIndex(pDX, IDC_MISSILE3, m_missile3); DDX_CBIndex(pDX, IDC_MISSILE4, m_missile4); DDX_LBIndex(pDX, IDC_LIST, m_cur_item); //}}AFX_DATA_MAP if (pDX->m_bSaveAndValidate) { GetDlgItem(IDC_AMMO1)->GetWindowText(str); if (save_number((char *) (LPCSTR) str, &m_ammo1)) { if (m_missile1 <= 0) { m_ammo_max1 = 0; } else { m_ammo_max1 = (m_cur_item == 0) ? get_max_ammo_count_for_bank(m_ship_class, 0, m_missile1 + First_secondary_index - 1) : get_max_ammo_count_for_turret_bank(cur_weapon, 0, m_missile1 + First_secondary_index - 1); } if (m_ammo1 < 0) m_ammo1 = 0; if (m_ammo1 > m_ammo_max1) m_ammo1 = m_ammo_max1; } GetDlgItem(IDC_AMMO2)->GetWindowText(str); if (save_number((char *) (LPCSTR) str, &m_ammo2)) { if (m_missile2 <= 0) { m_ammo_max2 = 0; } else { m_ammo_max2 = (m_cur_item == 0) ? get_max_ammo_count_for_bank(m_ship_class, 1, m_missile2 + First_secondary_index - 1) : get_max_ammo_count_for_turret_bank(cur_weapon, 1, m_missile2 + First_secondary_index - 1); } if (m_ammo2 < 0) m_ammo2 = 0; if (m_ammo2 > m_ammo_max2) m_ammo2 = m_ammo_max2; } GetDlgItem(IDC_AMMO3)->GetWindowText(str); if (save_number((char *) (LPCSTR) str, &m_ammo3)) { if (m_missile3 <= 0) { m_ammo_max3 = 0; } else { m_ammo_max3 = (m_cur_item == 0) ? get_max_ammo_count_for_bank(m_ship_class, 2, m_missile3 + First_secondary_index - 1) : get_max_ammo_count_for_turret_bank(cur_weapon, 2, m_missile3 + First_secondary_index - 1); } if (m_ammo3 < 0) m_ammo3 = 0; if (m_ammo3 > m_ammo_max3) m_ammo3 = m_ammo_max3; } GetDlgItem(IDC_AMMO4)->GetWindowText(str); if (save_number((char *) (LPCSTR) str, &m_ammo4)) { if (m_missile4 <= 0) { m_ammo_max4 = 0; } else { m_ammo_max4 = (m_cur_item == 0) ? get_max_ammo_count_for_bank(m_ship_class, 3, m_missile4 + First_secondary_index - 1) : get_max_ammo_count_for_turret_bank(cur_weapon, 3, m_missile4 + First_secondary_index - 1); } if (m_ammo4 < 0) m_ammo4 = 0; if (m_ammo4 > m_ammo_max4) m_ammo4 = m_ammo_max4; } m_spin1.SetRange(0, (short) m_ammo_max1); m_spin2.SetRange(0, (short) m_ammo_max2); m_spin3.SetRange(0, (short) m_ammo_max3); m_spin4.SetRange(0, (short) m_ammo_max4); } else { if (m_ammo1 != BLANK_FIELD) DDX_Text(pDX, IDC_AMMO1, m_ammo1); else GetDlgItem(IDC_AMMO1)->SetWindowText(""); if (m_ammo2 != BLANK_FIELD) DDX_Text(pDX, IDC_AMMO2, m_ammo2); else GetDlgItem(IDC_AMMO2)->SetWindowText(""); if (m_ammo3 != BLANK_FIELD) DDX_Text(pDX, IDC_AMMO3, m_ammo3); else GetDlgItem(IDC_AMMO3)->SetWindowText(""); if (m_ammo4 != BLANK_FIELD) DDX_Text(pDX, IDC_AMMO4, m_ammo4); else GetDlgItem(IDC_AMMO4)->SetWindowText(""); } }
static inline char * tparam_internal(const char *string, int *dataptr) { #define NUM_VARS 26 char *p_is_s[9]; int param[9]; int lastpop; int popcount; int number; int len; int level; int x, y; int i; int len2; register const char *cp; static int len_fmt = MAX_FORMAT_LEN; static char dummy[] = ""; static char format[MAX_FORMAT_LEN]; static int dynamic_var[NUM_VARS]; static int static_vars[NUM_VARS]; out_used = 0; if (string == NULL) return NULL; if ((len2 = grub_strlen(string)) > len_fmt) { return NULL; } /* * Find the highest parameter-number referred to in the format string. * Use this value to limit the number of arguments copied from the * variable-length argument list. */ number = 0; lastpop = -1; popcount = 0; grub_memset(p_is_s, 0, sizeof(p_is_s)); /* * Analyze the string to see how many parameters we need from the varargs * list, and what their types are. We will only accept string parameters * if they appear as a %l or %s format following an explicit parameter * reference (e.g., %p2%s). All other parameters are numbers. * * 'number' counts coarsely the number of pop's we see in the string, and * 'popcount' shows the highest parameter number in the string. We would * like to simply use the latter count, but if we are reading termcap * strings, there may be cases that we cannot see the explicit parameter * numbers. */ for (cp = string; (cp - string) < (int) len2;) { if (*cp == '%') { cp++; cp = parse_format(cp, format, &len); switch (*cp) { default: break; case 'd': /* FALLTHRU */ case 'o': /* FALLTHRU */ case 'x': /* FALLTHRU */ case 'X': /* FALLTHRU */ case 'c': /* FALLTHRU */ number++; lastpop = -1; break; case 'l': case 's': if (lastpop > 0) p_is_s[lastpop - 1] = dummy; ++number; break; case 'p': cp++; i = (*cp - '0'); if (i >= 0 && i <= 9) { lastpop = i; if (lastpop > popcount) popcount = lastpop; } break; case 'P': case 'g': cp++; break; case '\'': cp += 2; lastpop = -1; break; case '{': cp++; while (*cp >= '0' && *cp <= '9') { cp++; } break; case '+': case '-': case '*': case '/': case 'm': case 'A': case 'O': case '&': case '|': case '^': case '=': case '<': case '>': case '!': case '~': lastpop = -1; number += 2; break; case 'i': lastpop = -1; if (popcount < 2) popcount = 2; break; } } if (*cp != '\0') cp++; } if (number > 9) number = 9; for (i = 0; i < max(popcount, number); i++) { /* * A few caps (such as plab_norm) have string-valued parms. * We'll have to assume that the caller knows the difference, since * a char* and an int may not be the same size on the stack. */ if (p_is_s[i] != 0) { p_is_s[i] = (char *)(*(dataptr++)); } else { param[i] = (int)(*(dataptr++)); } } /* * This is a termcap compatibility hack. If there are no explicit pop * operations in the string, load the stack in such a way that * successive pops will grab successive parameters. That will make * the expansion of (for example) \E[%d;%dH work correctly in termcap * style, which means tparam() will expand termcap strings OK. */ stack_ptr = 0; if (popcount == 0) { popcount = number; for (i = number - 1; i >= 0; i--) npush(param[i]); } while (*string) { /* skip delay timings */ if (*string == '$' && *(string + 1) == '<') { while( *string && *string != '>') string++; if ( *string == '>' ) string++; } else if ( *string == '%') { string++; string = parse_format(string, format, &len); switch (*string) { default: break; case '%': save_char('%'); break; case 'd': /* FALLTHRU */ case 'o': /* FALLTHRU */ case 'x': /* FALLTHRU */ case 'X': /* FALLTHRU */ case 'c': /* FALLTHRU */ save_number(format, npop(), len); break; case 'l': save_number("%d", strlen(spop()), 0); break; case 's': save_text(format, spop(), len); break; case 'p': string++; i = (*string - '1'); if (i >= 0 && i < 9) { if (p_is_s[i]) spush(p_is_s[i]); else npush(param[i]); } break; case 'P': string++; if (isUPPER(*string)) { i = (*string - 'A'); static_vars[i] = npop(); } else if (isLOWER(*string)) { i = (*string - 'a'); dynamic_var[i] = npop(); } break; case 'g': string++; if (isUPPER(*string)) { i = (*string - 'A'); npush(static_vars[i]); } else if (isLOWER(*string)) { i = (*string - 'a'); npush(dynamic_var[i]); } break; case '\'': string++; npush(*string); string++; break; case '{': number = 0; string++; while (*string >= '0' && *string <= '9') { number = number * 10 + *string - '0'; string++; } npush(number); break; case '+': npush(npop() + npop()); break; case '-': y = npop(); x = npop(); npush(x - y); break; case '*': npush(npop() * npop()); break; case '/': y = npop(); x = npop(); npush(y ? (x / y) : 0); break; case 'm': y = npop(); x = npop(); npush(y ? (x % y) : 0); break; case 'A': npush(npop() && npop()); break; case 'O': npush(npop() || npop()); break; case '&': npush(npop() & npop()); break; case '|': npush(npop() | npop()); break; case '^': npush(npop() ^ npop()); break; case '=': y = npop(); x = npop(); npush(x == y); break; case '<': y = npop(); x = npop(); npush(x < y); break; case '>': y = npop(); x = npop(); npush(x > y); break; case '!': npush(!npop()); break; case '~': npush(~npop()); break; case 'i': if (p_is_s[0] == 0) param[0]++; if (p_is_s[1] == 0) param[1]++; break; case '?': break; case 't': x = npop(); if (!x) { /* scan forward for %e or %; at level zero */ string++; level = 0; while (*string) { if (*string == '%') { string++; if (*string == '?') level++; else if (*string == ';') { if (level > 0) level--; else break; } else if (*string == 'e' && level == 0) break; } if (*string) string++; } } break; case 'e': /* scan forward for a %; at level zero */ string++; level = 0; while (*string) { if (*string == '%') { string++; if (*string == '?') level++; else if (*string == ';') { if (level > 0) level--; else break; } } if (*string) string++; } break; case ';': break; } /* endswitch (*string) */ } else { /* endelse (*string == '%') */ save_char(*string); } if (*string == '\0') break; string++; } /* endwhile (*string) */ get_space(1); out_buff[out_used] = '\0'; return (out_buff); }