lib/libcurses/term_entry.h

64

#define NUM_BOOLEANS(tp) BOOLCOUNT

lib/libcurses/term_entry.h

77

#define for_each_ext_boolean(n,tp) for(n = BOOLCOUNT; (int) n < (int) NUM_BOOLEANS(tp); n++)

lib/libcurses/term_entry.h

82

#define ExtBoolname(tp,i,names) EXT_NAMES(tp, i, BOOLCOUNT, (i - (tp->num_Booleans - tp->ext_Booleans)), names)

lib/libcurses/tinfo/parse_entry.c

130

tindex += BOOLCOUNT;

lib/libcurses/tinfo/read_entry.c

235

tp->num_Booleans = BOOLCOUNT;

lib/libcurses/tinfo/read_entry.c

243

TYPE_MALLOC(NCURSES_SBOOL, BOOLCOUNT, tp->Booleans);

lib/libcurses/tinfo/read_entry.c

335

name_size, bool_count, BOOLCOUNT, num_count, NUMCOUNT,

lib/libcurses/tinfo/read_entry.c

341

|| bool_count > BOOLCOUNT

lib/libcurses/tinfo/read_entry.c

369

TYPE_CALLOC(NCURSES_SBOOL, max(BOOLCOUNT, bool_count), ptr->Booleans);

lib/libcurses/tinfo/read_entry.c

407

ptr->num_Booleans = BOOLCOUNT;

lib/libcurses/tinfo/read_entry.c

436

ptr->num_Booleans = UShort(BOOLCOUNT + ext_bool_count);

lib/libcurses/tinfo/read_entry.c

457

if (Read(ptr->Booleans + BOOLCOUNT, (unsigned)

lib/libcurses/tinfo/read_entry.c

565

for (i = bool_count; i < BOOLCOUNT; i++)

lib/libcurses/tinfo/write_entry.c

669

if (tp->Booleans[BOOLCOUNT + i] == TRUE)

lib/libcurses/tinfo/write_entry.c

747

last_bool = BOOLCOUNT;

lib/libcurses/tinfo/write_entry.c

895

&& Write(tp->Booleans + BOOLCOUNT, sizeof(char),

usr.bin/infocmp/infocmp.c

1404

if ((NUM_BOOLEANS(term) != BOOLCOUNT)

usr.bin/infocmp/infocmp.c

1409

for (n = BOOLCOUNT; n < NUM_BOOLEANS(term); ++n) {

usr.bin/infocmp/infocmp.c

1442

((NUM_BOOLEANS(term) != BOOLCOUNT)

usr.bin/infocmp/infocmp.c

1453

NUM_BOOLEANS(term) - BOOLCOUNT);

usr.bin/tic/dump_entry.c

103

#define BoolIndirect(j) ((j >= BOOLCOUNT) ? (j) : ((sortmode == S_NOSORT) ? j : bool_indirect[j]))