236   isl::union_map Written;  member in __anon226e1a350111::Knowledge
242     if (!Occupied && !Unused && !Known && !Written)  in checkConsistency()
247     assert(Written);  in checkConsistency()
257     assert(!Written.domain().is_subset(Universe).is_false());  in checkConsistency()
268             isl::union_map Known, isl::union_map Written)  in Knowledge()  argument
270         Known(std::move(Known)), Written(std::move(Written)) {  in Knowledge()
275   bool isUsable() const { return (Occupied || Unused) && Known && Written; }  in isUsable()
289       OS.indent(Indent) << "Written : " << Written << '\n';  in print()
308     Written = Written.unite(That.Written);  in learnFrom()
428         Existing.Written.intersect_domain(ProposedFixedDefs);  in isConflicting()
460     auto ProposedWrittenDomain = Proposed.Written.domain();  in isConflicting()
461     auto KnownIdentical = ExistingKnownDefs.intersect(Proposed.Written);  in isConflicting()
470             Proposed.Written.intersect_domain(Conflicting);  in isConflicting()
485     auto ExistingWrittenDomain = Existing.Written.domain();  in isConflicting()
487         Existing.Written.domain().intersect(Proposed.Written.domain());  in isConflicting()
488     auto ExistingKnownWritten = filterKnownValInst(Existing.Written);  in isConflicting()
489     auto ProposedKnownWritten = filterKnownValInst(Proposed.Written);  in isConflicting()
497             Existing.Written.intersect_domain(Conflicting);  in isConflicting()
499             Proposed.Written.intersect_domain(Conflicting);  in isConflicting()
923     auto Written = WrittenValue.apply_domain(WrittenTranslator);  in tryMapPHI()  local
924     simplify(Written);  in tryMapPHI()
940     Knowledge Proposed(Occupied, nullptr, EltLifetimeInst, Written);  in tryMapPHI()