Searched refs:NUM_STRINGS (Results 1 - 7 of 7) sorted by relevance

/freebsd-10.2-release/contrib/top/
H A Dutils.c437 * NUM_STRINGS defines the number of strings in this array: we can tolerate
438 * up to NUM_STRINGS calls before we start overwriting old information.
439 * Keeping NUM_STRINGS a power of two will allow an intelligent optimizer
443 #define NUM_STRINGS 8 macro
450 static char retarray[NUM_STRINGS][16];
457 index = (index + 1) % NUM_STRINGS;
482 static char retarray[NUM_STRINGS][16];
489 index = (index + 1) % NUM_STRINGS;
/freebsd-10.2-release/contrib/ncurses/include/
H A Dterm_entry.h75 #define NUM_STRINGS(tp) (tp)->num_Strings macro
80 #define NUM_STRINGS(tp) STRCOUNT macro
88 #define for_each_string(n,tp) for(n = 0; n < NUM_STRINGS(tp); n++)
/freebsd-10.2-release/contrib/ncurses/ncurses/tinfo/
H A Dinit_keytry.c99 for (n = STRCOUNT; n < NUM_STRINGS(tp); ++n) {
H A Dalloc_ttype.c483 dst->Strings = typeMalloc(char *, NUM_STRINGS(dst));
/freebsd-10.2-release/contrib/ncurses/progs/
H A Dinfocmp.c261 for (i = 0; i < NUM_STRINGS(t1); i++)
1165 || (NUM_STRINGS(term) != STRCOUNT)) {
1176 for (n = STRCOUNT; n < NUM_STRINGS(term); ++n) {
1203 || (NUM_STRINGS(term) != STRCOUNT))
1209 (void) printf("\t\t%d,\t\t/* count total Strings */\n", NUM_STRINGS(term));
1216 NUM_STRINGS(term) - STRCOUNT);
H A Ddump_entry.c890 for (n = 0; n < NUM_STRINGS(tterm); ++n) {
903 for (n = 0; n < NUM_STRINGS(tterm); ++n) {
1066 for (n = STRCOUNT; n < NUM_STRINGS(tterm); n++) {
H A Dtic.c1406 for (j = 0; j < NUM_STRINGS(tp); j++) {

Completed in 127 milliseconds