Searched refs:NUM_BOOLEANS (Results 1 – 5 of 5) sorted by relevance
57 #define NUM_BOOLEANS(tp) (tp)->num_Booleans macro62 #define NUM_BOOLEANS(tp) BOOLCOUNT70 #define for_each_boolean(n,tp) for(n = 0; n < NUM_BOOLEANS(tp); n++)75 #define for_each_ext_boolean(n,tp) for(n = BOOLCOUNT; (int) n < (int) NUM_BOOLEANS(tp); n++)
228 if (idx < NUM_BOOLEANS(&(entries[0].tterm))) { in use_predicate()232 if (idx < NUM_BOOLEANS(&(ep->tterm)) in use_predicate()337 for (i = 0; i < NUM_BOOLEANS(t1); i++) in entryeq()1519 if ((NUM_BOOLEANS(term) != BOOLCOUNT) in dump_initializers()1522 for (n = BOOLCOUNT; n < NUM_BOOLEANS(term); ++n) { in dump_initializers()1534 for (n = BOOLCOUNT; n < NUM_BOOLEANS(term); ++n) { in dump_initializers()1567 ((NUM_BOOLEANS(term) != BOOLCOUNT) in dump_termtype()1573 (void) printf("\t\t%d,\t\t/* count total Booleans */\n", NUM_BOOLEANS(term)); in dump_termtype()1578 NUM_BOOLEANS(term) - BOOLCOUNT); in dump_termtype()
313 for (i = 0; i < NUM_BOOLEANS(tp); i++) { in checksum_of()
548 TYPE_MALLOC(NCURSES_SBOOL, NUM_BOOLEANS(dst), dst->Booleans); in copy_termtype()553 NUM_BOOLEANS(dst) * sizeof(dst->Booleans[0])); in copy_termtype()
363 if (i >= NUM_BOOLEANS(to)) in _nc_merge_entry()