Lines Matching refs:m_clause

100       m_clause[i2] = m_clause[i];  in add_clause()
102 if (!m_clause[i]) in add_clause()
106 if ((m_clause[i] & new_clause) == m_clause[i]) in add_clause()
114 if (m_clause[i] < new_clause && insert_here < 0) in add_clause()
119 if ((m_clause[i] & new_clause) != new_clause) in add_clause()
161 m_clause[i2 + 1] = 0; in add_clause()
164 m_clause[i2] = m_clause[i2 - 1]; in add_clause()
167 m_clause[insert_here] = new_clause; in add_clause()
188 for (i = 0; m_clause[i] && m_clause[i] == p.m_clause[i]; i++)
194 for (; p.m_clause[i]; i++)
197 add_clause (NULL, p.m_clause[i]);
219 for (int i = 0; m_clause[i]; i++) in or_with()
220 for (int j = 0; p.m_clause[j]; j++) in or_with()
223 out.add_clause (conditions, m_clause[i] | p.m_clause[j]); in or_with()
244 for (i = 0; m_clause[i]; i++) in evaluate()
247 if (!(m_clause[i] & possible_truths)) in evaluate()
274 for (i = 0; m_clause[i]; i++) in probability()
277 if (!(m_clause[i] & possible_truths)) in probability()
286 if ((m_clause[i] & possible_truths) & (1 << i2)) in probability()
457 for (i = 0; m_clause[i]; i++) in dump()
461 dump_clause (f, conds, m_clause[i]); in dump()
484 for (j = 0; m_clause[j]; j++) in remap_after_duplication()
485 if (!(possible_truths & m_clause[j])) in remap_after_duplication()
488 out.add_clause (NULL, possible_truths & m_clause[j]); in remap_after_duplication()
521 for (i = 0; m_clause[i]; i++) in remap_after_inlining()
523 clause_t clause = m_clause[i]; in remap_after_inlining()
601 clause = m_clause[k++] = streamer_read_uhwi (ib); in stream_in()
607 m_clause[k++] = 0; in stream_in()
617 for (j = 0; m_clause[j]; j++) in stream_out()
620 streamer_write_uhwi (ob, m_clause[j]); in stream_out()