1094 	      int *tags, int assertions, int *params)  in tre_set_union()  argument
1113       new_set[s1].assertions = set1[s1].assertions | assertions;  in tre_set_union()
1158       new_set[s1 + s2].assertions = set2[s2].assertions;  in tre_set_union()
1203 		int *assertions, int *params, int *num_tags_seen,  in tre_match_empty()  argument
1253 	      if (assertions != NULL)  in tre_match_empty()
1254 		*assertions |= lit->code_max;  in tre_match_empty()
1455 	    int num_tags, *tags, assertions, params_seen;  in tre_compute_nfl()  local
1477 		assertions = 0;  in tre_compute_nfl()
1492 					 &assertions, params, NULL, NULL);  in tre_compute_nfl()
1500 				tags, assertions, params);  in tre_compute_nfl()
1526 		assertions = 0;  in tre_compute_nfl()
1541 					 &assertions, params, NULL, NULL);  in tre_compute_nfl()
1549 				tags, assertions, params);  in tre_compute_nfl()
1629 	    trans->assertions = p1->assertions | p2->assertions  in tre_make_trans()
1634 		assert((trans->assertions & ASSERT_CHAR_CLASS) == 0);  in tre_make_trans()
1637 		trans->assertions |= ASSERT_BACKREF;  in tre_make_trans()
1750 	      if (trans->assertions)  in tre_make_trans()
1751 		DPRINT((", assert %d", trans->assertions));  in tre_make_trans()
1752 	      if (trans->assertions & ASSERT_BACKREF)  in tre_make_trans()
2108 	DPRINT((", assert %d", p->assertions));  in tre_compile()
2152       initial[i].assertions = p->assertions;  in tre_compile()