59   c->right->nullable = -1;  in tre_add_tag_left()
92   c->left->nullable = -1;  in tre_add_tag_right()
1276 	  if (uni->left->nullable)  in tre_match_empty()
1278 	  else if (uni->right->nullable)  in tre_match_empty()
1287 	  assert(cat->left->nullable);  in tre_match_empty()
1288 	  assert(cat->right->nullable);  in tre_match_empty()
1297 	  if (iter->arg->nullable)  in tre_match_empty()
1348 		    node->nullable = 0;  in tre_compute_nfl()
1363 		    node->nullable = 1;  in tre_compute_nfl()
1375 		    node->nullable = 0;  in tre_compute_nfl()
1428 	    node->nullable = uni->left->nullable || uni->right->nullable;  in tre_compute_nfl()
1444 	    if (iter->min == 0 || iter->arg->nullable)  in tre_compute_nfl()
1445 	      node->nullable = 1;  in tre_compute_nfl()
1447 	      node->nullable = 0;  in tre_compute_nfl()
1459 	    node->nullable = cat->left->nullable && cat->right->nullable;  in tre_compute_nfl()
1462 	    if (cat->left->nullable)  in tre_compute_nfl()
1511 	    if (cat->right->nullable)  in tre_compute_nfl()
2041   if (TRE_MB_CUR_MAX == 1 && !tmp_ast_l->nullable)  in tre_compile()