372   tree rhs = TREE_OPERAND (t, 1);  in dnf_size_r()  local
374   std::pair<int, bool> p2 = dnf_size_r (rhs);  in dnf_size_r()
387 	  if (disjunction_p (rhs) || (conjunction_p (rhs) && d2))  in dnf_size_r()
397 	  if ((disjunction_p (rhs) && d1) || (conjunction_p (rhs) && d1 && d2))  in dnf_size_r()
400 	  if (disjunction_p (rhs)  in dnf_size_r()
401 	      || (conjunction_p (rhs) && d1 != d2)  in dnf_size_r()
402 	      || (atomic_p (rhs) && d1))  in dnf_size_r()
411 	  if (disjunction_p (rhs) || (conjunction_p (rhs) && d2))  in dnf_size_r()
429 	  if (disjunction_p (rhs) || (conjunction_p (rhs) && d2))  in dnf_size_r()
439 	  if ((disjunction_p (rhs) && d1) || (conjunction_p (rhs) && d1 && d2))  in dnf_size_r()
442 	  if (disjunction_p (rhs)  in dnf_size_r()
443 	      || (conjunction_p (rhs) && d1 != d2)  in dnf_size_r()
444 	      || (atomic_p (rhs) && d1))  in dnf_size_r()
453 	  if (disjunction_p (rhs) || (conjunction_p (rhs) && d2))  in dnf_size_r()
480   tree rhs = TREE_OPERAND (t, 1);  in cnf_size_r()  local
482   std::pair<int, bool> p2 = cnf_size_r (rhs);  in cnf_size_r()
496 	  if ((disjunction_p (rhs) && d1 && d2) || (conjunction_p (rhs) && d1))  in cnf_size_r()
499 	  if ((disjunction_p (rhs) && d1 != d2)  in cnf_size_r()
500 	      || conjunction_p (rhs)  in cnf_size_r()
501 	      || (atomic_p (rhs) && d1))  in cnf_size_r()
511 	  if ((disjunction_p (rhs) && d2) || conjunction_p (rhs))  in cnf_size_r()
520 	  if ((disjunction_p (rhs) && d2) || conjunction_p (rhs))  in cnf_size_r()
537 	  if ((disjunction_p (rhs) && d1 && d2) || (conjunction_p (rhs) && d1))  in cnf_size_r()
540 	  if ((disjunction_p (rhs) && d1 != d2)  in cnf_size_r()
541 	      || conjunction_p (rhs)  in cnf_size_r()
542 	      || (atomic_p (rhs) && d1))  in cnf_size_r()
552 	  if ((disjunction_p (rhs) && d2) || conjunction_p (rhs))  in cnf_size_r()
561 	  if ((disjunction_p (rhs) && d2) || conjunction_p (rhs))  in cnf_size_r()
789   tree rhs;  member
801     val = iterative_hash_constraint (e->rhs, val);  in hash()
809     if (!constraints_equivalent_p (e1->rhs, e2->rhs))  in equal()
855 subsumes_constraints_nonnull (tree lhs, tree rhs)  in subsumes_constraints_nonnull()  argument
859   if (bool *b = lookup_subsumption(lhs, rhs))  in subsumes_constraints_nonnull()
863   int n2 = cnf_size (rhs);  in subsumes_constraints_nonnull()
871 	diagnose_constraint_size (rhs);  in subsumes_constraints_nonnull()
881       result = derive_proofs (dnf, rhs, left);  in subsumes_constraints_nonnull()
885       formula cnf = decompose_consequents (rhs);  in subsumes_constraints_nonnull()
889   return save_subsumption (lhs, rhs, result);  in subsumes_constraints_nonnull()
896 subsumes (tree lhs, tree rhs)  in subsumes()  argument
898   if (lhs == rhs)  in subsumes()
902   if (!rhs || rhs == error_mark_node)  in subsumes()
904   return subsumes_constraints_nonnull (lhs, rhs);  in subsumes()