STRCOUNT
#define NUM_STRINGS(tp) STRCOUNT
#define for_each_ext_string(n,tp) for(n = STRCOUNT; (int) n < (int) NUM_STRINGS(tp); n++)
#define ExtStrname(tp,i,names) EXT_NAMES(tp, i, STRCOUNT, (i - (tp->num_Strings - tp->ext_Strings)) + (tp->ext_Numbers + tp->ext_Booleans), names)
result = ((p->Strings[STRCOUNT + which] != CANCELLED_STRING)
n - STRCOUNT + KEY_MAX);
if (_nc_tinfo_fkeys[n].offset < STRCOUNT) {
for (n = STRCOUNT; n < NUM_STRINGS(tp); ++n) {
tindex += STRCOUNT;
tp->num_Strings = STRCOUNT;
TYPE_MALLOC(char *, STRCOUNT, tp->Strings);
str_count, STRCOUNT, str_size));
|| str_count > STRCOUNT
TYPE_CALLOC(char *, max(STRCOUNT, str_count), ptr->Strings);
ptr->num_Strings = STRCOUNT;
ptr->num_Strings = UShort(STRCOUNT + ext_str_count);
ptr->Strings[i + STRCOUNT] = ptr->Strings[i + str_count];
if (VALID_STRING(ptr->Strings[i + STRCOUNT])) {
base += (int) (strlen(ptr->Strings[i + STRCOUNT]) + 1);
i + STRCOUNT,
_nc_visbuf(ptr->Strings[i + STRCOUNT])));
for (i = str_count; i < STRCOUNT; i++)
if (tp->Strings[STRCOUNT + i] != ABSENT_STRING)
last_str = STRCOUNT;
nextfree = compute_offsets(tp->Strings + STRCOUNT,
if (VALID_STRING(tp->Strings[i + STRCOUNT])) {
if (VALID_STRING(tp->Strings[i + STRCOUNT])) {
_nc_visbuf(tp->Strings[i + STRCOUNT])));
if (!WRITE_STRING(tp->Strings[i + STRCOUNT])) {
|| (NUM_STRINGS(term) != STRCOUNT)) {
for (n = STRCOUNT; n < NUM_STRINGS(term); ++n) {
|| (NUM_STRINGS(term) != STRCOUNT))
NUM_STRINGS(term) - STRCOUNT);
for (i = 0; i < STRCOUNT; i++) {
#define StrIndirect(j) ((j >= STRCOUNT) ? (j) : ((sortmode == S_NOSORT) ? j : str_indirect[j]))
for (n = STRCOUNT; n < NUM_STRINGS(tterm); n++) {
for (n = 0; n < STRCOUNT; n++) {
assert(SIZEOF(parametrized) == STRCOUNT);
for (j = STRCOUNT; j < NUM_STRINGS(tp); ++j) {
check_params(tp, name, a, (j >= STRCOUNT));