svf-lib 1.0.992 → 1.0.993

package/SVF-linux/include/CUDD/mtr.h

@@ -123,7 +123,8 @@ typedef unsigned int   MtrHalfWord;
 typedef unsigned short MtrHalfWord;
 #endif
 
-typedef struct MtrNode {
+typedef struct MtrNode
+{
     MtrHalfWord flags;
     MtrHalfWord low;
     MtrHalfWord size;
@@ -166,9 +167,9 @@ extern MtrNode * Mtr_InitGroupTree (int lower, int size);
 extern MtrNode * Mtr_MakeGroup (MtrNode *root, unsigned int low, unsigned int high, unsigned int flags);
 extern MtrNode * Mtr_FindGroup (MtrNode *root, unsigned int low, unsigned int high);
 extern void Mtr_ReorderGroups(MtrNode *treenode, int *permutation);
-  
+
 extern void Mtr_PrintGroups (MtrNode *root, int silent);
-  extern int Mtr_PrintGroupedOrder(MtrNode * root, int *invperm, FILE *fp);
+extern int Mtr_PrintGroupedOrder(MtrNode * root, int *invperm, FILE *fp);
 
 /**AutomaticEnd***************************************************************/
 

package/SVF-linux/include/CUDD/st.h

@@ -50,14 +50,16 @@ extern "C" {
 /*---------------------------------------------------------------------------*/
 
 typedef struct st_table_entry st_table_entry;
-struct st_table_entry {
+struct st_table_entry
+{
     char *key;
     char *record;
     st_table_entry *next;
 };
 
 typedef struct st_table st_table;
-struct st_table {
+struct st_table
+{
     int (*compare)(const char *, const char *);
     int (*hash)(char *, int);
     int num_bins;
@@ -69,7 +71,8 @@ struct st_table {
 };
 
 typedef struct st_generator st_generator;
-struct st_generator {
+struct st_generator
+{
     st_table *table;
     st_table_entry *entry;
     int index;
@@ -201,7 +204,7 @@ typedef int (*ST_PFICPI)(char *, int);     /* type for hash function */
 /*---------------------------------------------------------------------------*/
 
 extern st_table *st_init_table_with_params (ST_PFICPCP, ST_PFICPI, int, int, double, int);
-extern st_table *st_init_table (ST_PFICPCP, ST_PFICPI); 
+extern st_table *st_init_table (ST_PFICPCP, ST_PFICPI);
 extern void st_free_table (st_table *);
 extern int st_lookup (st_table *, void *, void *);
 extern int st_lookup_int (st_table *, void *, int *);

package/SVF-linux/include/CUDD/util.h

@@ -109,15 +109,15 @@ extern int pclose();
 # include <stdlib.h>
 #else
 # ifndef _IBMR2
-    extern VOID_OR_INT abort(), exit();
+extern VOID_OR_INT abort(), exit();
 # endif
 # if !defined(MNEMOSYNE) && !defined(_IBMR2)
-    extern VOID_OR_INT free (void *);
-    extern VOID_OR_CHAR *malloc(), *realloc();
+extern VOID_OR_INT free (void *);
+extern VOID_OR_CHAR *malloc(), *realloc();
 # endif
-  extern char *getenv();
-  extern int system();
-  extern double atof();
+extern char *getenv();
+extern int system();
+extern double atof();
 #endif
 
 

package/SVF-linux/include/FastCluster/fastcluster.h

@@ -62,18 +62,19 @@ void cutree_cdist(int n, const int* merge, double* height, double cdist, int* la
 //   1 = invalid method
 //
 int hclust_fast(int n, double* distmat, int method, int* merge, double* height);
-enum hclust_fast_methods {
-  // single link with the minimum spanning tree algorithm (Rohlf, 1973)
-  HCLUST_METHOD_SINGLE = 0,
-  // complete link with the nearest-neighbor-chain algorithm (Murtagh, 1984)
-  HCLUST_METHOD_COMPLETE = 1,
-  // omplete link with the nearest-neighbor-chain algorithm (Murtagh, 1984)
-  HCLUST_METHOD_AVERAGE = 2,
-  // median link with the generic algorithm (Müllner, 2011)
-  HCLUST_METHOD_MEDIAN = 3,
-  // To indicate to try all methods and pick the best.
-  HCLUST_METHOD_SVF_BEST = 4
+enum hclust_fast_methods
+{
+    // single link with the minimum spanning tree algorithm (Rohlf, 1973)
+    HCLUST_METHOD_SINGLE = 0,
+    // complete link with the nearest-neighbor-chain algorithm (Murtagh, 1984)
+    HCLUST_METHOD_COMPLETE = 1,
+    // omplete link with the nearest-neighbor-chain algorithm (Murtagh, 1984)
+    HCLUST_METHOD_AVERAGE = 2,
+    // median link with the generic algorithm (Müllner, 2011)
+    HCLUST_METHOD_MEDIAN = 3,
+    // To indicate to try all methods and pick the best.
+    HCLUST_METHOD_SVF_BEST = 4
 };
-  
+
 
 #endif

package/SVF-linux/include/Graphs/CFLGraph.h

@@ -81,13 +81,16 @@ public:
     ~CFLGraph() override = default;
 
     /// Build graph by copying nodes and edges from any graph inherited from GenericGraph
-    template<class N, class E> 
-    void build(GenericGraph<N,E>* graph){
-        for(auto it = graph->begin(); it!= graph->end(); it++){
+    template<class N, class E>
+    void build(GenericGraph<N,E>* graph)
+    {
+        for(auto it = graph->begin(); it!= graph->end(); it++)
+        {
             CFLNode* node = new CFLNode((*it).first);
             addCFLNode((*it).first, node);
         }
-        for(auto it = graph->begin(); it!= graph->end(); it++){
+        for(auto it = graph->begin(); it!= graph->end(); it++)
+        {
             N* node = (*it).second;
             for(E* edge : node->getOutEdges())
             {
@@ -97,18 +100,21 @@ public:
     }
 
     /// Build Bidirectional graph by copying nodes and edges from any graph inherited from GenericGraph
-    template<class N, class E> 
-    void buildBigraph(GenericGraph<N,E>* graph){
-        for(auto it = graph->begin(); it!= graph->end(); it++){
+    template<class N, class E>
+    void buildBigraph(GenericGraph<N,E>* graph)
+    {
+        for(auto it = graph->begin(); it!= graph->end(); it++)
+        {
             CFLNode* node = new CFLNode((*it).first);
             addCFLNode((*it).first, node);
         }
-        for(auto it = graph->begin(); it!= graph->end(); it++){
+        for(auto it = graph->begin(); it!= graph->end(); it++)
+        {
             N* node = (*it).second;
             for(E* edge : node->getOutEdges())
             {
                 addCFLEdge(getGNode(edge->getSrcID()), getGNode(edge->getDstID()), edge->getEdgeKind());
-                std::string key = "";                
+                std::string key = "";
                 for (auto &i : this->label2SymMap)
                 {
                     if (i.second == edge->getEdgeKind())
@@ -134,7 +140,7 @@ public:
 
     /// Build graph from file
     void build(std::string filename);
-    
+
     /// Build graph from Dot
     void buildFromDot(std::string filename);
 

package/SVF-linux/include/Graphs/CHG.h

@@ -25,7 +25,7 @@
  *
  *  Created on: Apr 13, 2016
  *      Author: Xiaokang Fan
- * 
+ *
  * Created on: Aug 24, 2019
  *      Author: Mohamad Barbar
  */
@@ -207,7 +207,7 @@ private:
 typedef GenericGraph<CHNode,CHEdge> GenericCHGraphTy;
 class CHGraph: public CommonCHGraph, public GenericCHGraphTy
 {
-friend class CHGBuilder;
+    friend class CHGBuilder;
 
 public:
     typedef Set<const CHNode*> CHNodeSetTy;

package/SVF-linux/include/Graphs/ConsG.h

@@ -166,7 +166,8 @@ public:
             auto eit = LoadCGEdgeSet.find(&edge);
             return *eit;
         }
-        else{
+        else
+        {
             assert(false && "no other kind!");
             return nullptr;
         }

package/SVF-linux/include/Graphs/GenericGraph.h

@@ -157,8 +157,8 @@ public:
     /// Destructor
     virtual ~GenericNode()
     {
-      for (auto * edge : OutEdges)
-        delete edge;
+        for (auto * edge : OutEdges)
+            delete edge;
     }
 
     /// Get ID
@@ -354,7 +354,7 @@ public:
     void destroy()
     {
         for (auto &entry : IDToNodeMap)
-          delete entry.second;
+            delete entry.second;
     }
     /// Iterators
     //@{

package/SVF-linux/include/Graphs/ICFG.h

@@ -46,7 +46,7 @@ typedef GenericGraph<ICFGNode,ICFGEdge> GenericICFGTy;
 class ICFG : public GenericICFGTy
 {
 
-friend class ICFGBuilder;
+    friend class ICFGBuilder;
 
 public:
 
@@ -182,7 +182,7 @@ public:
     //@}
 
 private:
-	
+
     /// Get/Add IntraBlock ICFGNode
     inline IntraICFGNode* getIntraBlock(const Instruction* inst)
     {

package/SVF-linux/include/Graphs/ICFGEdge.h

@@ -134,16 +134,19 @@ public:
     }
     //@}
 
-    const Value* getCondition() const{
+    const Value* getCondition() const
+    {
         return conditionVar;
     }
 
-    s32_t getSuccessorCondValue() const{
+    s32_t getSuccessorCondValue() const
+    {
         assert(getCondition() && "this is not a conditional branch edge");
         return branchCondVal;
     }
 
-    void setBranchCondition(const Value* c, s32_t bVal){
+    void setBranchCondition(const Value* c, s32_t bVal)
+    {
         conditionVar = c;
         branchCondVal = bVal;
     }
@@ -166,7 +169,7 @@ class CallCFGEdge : public ICFGEdge
 {
 
 private:
-	const Instruction*  cs;
+    const Instruction*  cs;
     std::vector<const CallPE*> callPEs;
 public:
     /// Constructor
@@ -180,11 +183,13 @@ public:
         return cs;
     }
     /// Add call parameter edge to this CallCFGEdge
-    inline void addCallPE(const CallPE* callPE){
+    inline void addCallPE(const CallPE* callPE)
+    {
         callPEs.push_back(callPE);
     }
     /// Add get parameter edge to this CallCFGEdge
-    inline const std::vector<const CallPE*>& getCallPEs() const{
+    inline const std::vector<const CallPE*>& getCallPEs() const
+    {
         return callPEs;
     }
     /// Methods for support type inquiry through isa, cast, and dyn_cast:
@@ -212,7 +217,7 @@ class RetCFGEdge : public ICFGEdge
 {
 
 private:
-	const Instruction*  cs;
+    const Instruction*  cs;
     const RetPE* retPE;
 public:
     /// Constructor
@@ -226,12 +231,14 @@ public:
         return cs;
     }
     /// Add call parameter edge to this CallCFGEdge
-    inline void addRetPE(const RetPE* ret){
+    inline void addRetPE(const RetPE* ret)
+    {
         assert(retPE==nullptr && "we can only have one retPE for each RetCFGEdge");
         retPE = ret;
     }
     /// Add get parameter edge to this CallCFGEdge
-    inline const RetPE* getRetPE() const{
+    inline const RetPE* getRetPE() const
+    {
         return retPE;
     }
     /// Methods for support type inquiry through isa, cast, and dyn_cast:

package/SVF-linux/include/Graphs/ICFGNode.h

@@ -145,7 +145,7 @@ class GlobalICFGNode : public ICFGNode
 public:
     GlobalICFGNode(NodeID id) : ICFGNode(id, GlobalBlock)
     {
-    	bb = nullptr;
+        bb = nullptr;
     }
 
     /// Methods for support type inquiry through isa, cast, and dyn_cast:
@@ -385,7 +385,7 @@ public:
     /// Return callsite
     inline const RetICFGNode* getRetICFGNode() const
     {
-    	assert(ret && "RetICFGNode not set?");
+        assert(ret && "RetICFGNode not set?");
         return ret;
     }
 

package/SVF-linux/include/Graphs/IRGraph.h

@@ -21,7 +21,7 @@
 //===----------------------------------------------------------------------===//
 
 /*
- * IRGraph.h 
+ * IRGraph.h
  *
  *  Created on: Nov 1, 2013
  *      Author: Yulei Sui
@@ -81,17 +81,20 @@ protected:
     inline void mapValueToEdge(const Value *V, SVFStmt *edge)
     {
         auto inserted = valueToEdgeMap.emplace(V, SVFStmtSet{edge});
-        if (!inserted.second) {
+        if (!inserted.second)
+        {
             inserted.first->second.emplace(edge);
         }
     }
     /// get MemObj according to LLVM value
-    inline const MemObj* getMemObj(const Value* val) const{
+    inline const MemObj* getMemObj(const Value* val) const
+    {
         return symInfo->getObj(symInfo->getObjSym(val));
     }
-    
+
 public:
-    IRGraph(bool buildFromFile): fromFile(buildFromFile), nodeNumAfterPAGBuild(0), totalPTAPAGEdge(0){
+    IRGraph(bool buildFromFile): fromFile(buildFromFile), nodeNumAfterPAGBuild(0), totalPTAPAGEdge(0)
+    {
         symInfo = SymbolTableInfo::SymbolInfo();
         // insert dummy value if a correct value cannot be found
         valueToEdgeMap[nullptr] = SVFStmtSet();
@@ -108,7 +111,8 @@ public:
     inline const SVFStmtSet& getValueEdges(const Value *V)
     {
         auto it = valueToEdgeMap.find(V);
-        if (it == valueToEdgeMap.end()) {
+        if (it == valueToEdgeMap.end())
+        {
             //special empty set
             return valueToEdgeMap.at(nullptr);
         }

package/SVF-linux/include/Graphs/PTACallGraph.h

@@ -322,7 +322,7 @@ public:
         assert(it!=funToCallGraphNodeMap.end() && "call graph node not found!!");
         return it->second;
     }
-    
+
     //@}
 
     /// Add/Get CallSiteID

package/SVF-linux/include/Graphs/SVFG.h

@@ -251,7 +251,8 @@ public:
     }
 
     /// Return total SVFG node number
-    inline u32_t getSVFGNodeNum() const {
+    inline u32_t getSVFGNodeNum() const
+    {
         return nodeNum;
     }
 
@@ -428,8 +429,8 @@ protected:
     }
 
     /// Add memory SSA PHI SVFG node
-    inline void addIntraMSSAPHISVFGNode(ICFGNode* BlockICFGNode, const Map<u32_t,const MRVer*>::const_iterator opVerBegin, 
-    const  Map<u32_t,const MRVer*>::const_iterator opVerEnd, const MRVer* resVer, const NodeID nodeId)
+    inline void addIntraMSSAPHISVFGNode(ICFGNode* BlockICFGNode, const Map<u32_t,const MRVer*>::const_iterator opVerBegin,
+                                        const  Map<u32_t,const MRVer*>::const_iterator opVerEnd, const MRVer* resVer, const NodeID nodeId)
     {
         IntraMSSAPHISVFGNode* sNode = new IntraMSSAPHISVFGNode(nodeId, resVer);
         addSVFGNode(sNode, BlockICFGNode);

package/SVF-linux/include/Graphs/SVFGNode.h

@@ -94,7 +94,7 @@ class FormalINSVFGNode : public MRSVFGNode
 {
 private:
     const MRVer* ver;
-    const FunEntryICFGNode* funEntryNode; 
+    const FunEntryICFGNode* funEntryNode;
 
 public:
     /// Constructor
@@ -102,7 +102,7 @@ public:
     {
         cpts = resVer->getMR()->getPointsTo();
         ver = resVer;
-        funEntryNode = funEntry; 
+        funEntryNode = funEntry;
     }
     inline const MRVer* getMRVer() const
     {
@@ -139,7 +139,7 @@ class FormalOUTSVFGNode : public MRSVFGNode
 {
 private:
     const MRVer* ver;
-    const FunExitICFGNode* funExitNode; 
+    const FunExitICFGNode* funExitNode;
 
 public:
     /// Constructor
@@ -279,7 +279,7 @@ public:
     typedef Map<u32_t,const MRVer*> OPVers;
 
 protected:
-    const MRVer* ver; 
+    const MRVer* ver;
     OPVers opVers;
 
 public:
@@ -287,9 +287,9 @@ public:
     MSSAPHISVFGNode(NodeID id, const MRVer* resVer,VFGNodeK k = MPhi): MRSVFGNode(id, k)
     {
         cpts = resVer->getMR()->getPointsTo();
-        ver = resVer; 
+        ver = resVer;
     }
-      /// Ver
+    /// Ver
     inline const MRVer* getResVer() const
     {
         return ver;
@@ -473,8 +473,14 @@ public:
         : VFGNode(id, DummyVProp), object(object), version(version)
     { }
 
-    NodeID getObject(void) const { return object; }
-    Version getVersion(void) const { return version; }
+    NodeID getObject(void) const
+    {
+        return object;
+    }
+    Version getVersion(void) const
+    {
+        return version;
+    }
 
     /// Methods to support type inquiry through isa, cast, and dyn_cast:
     //@{

package/SVF-linux/include/Graphs/ThreadCallGraph.h

@@ -67,7 +67,8 @@ public:
     }
     //@}
 
-    virtual const std::string toString() const {
+    virtual const std::string toString() const
+    {
         std::string str;
         raw_string_ostream rawstr(str);
         rawstr << "ThreadForkEdge ";
@@ -106,7 +107,8 @@ public:
         return edge->getEdgeKind() == PTACallGraphEdge::TDJoinEdge;
     }
 
-    virtual const std::string toString() const {
+    virtual const std::string toString() const
+    {
         std::string str;
         raw_string_ostream rawstr(str);
         rawstr << "ThreadJoinEdge ";

package/SVF-linux/include/Graphs/VFG.h

@@ -281,28 +281,33 @@ public:
         return false;
     }
 
-	/// Return all the VFGNodes of a function
-	///@{
-	inline VFGNodeSet& getVFGNodes(const SVFFunction *fun) {
-		return funToVFGNodesMap[fun];
-	}
-	inline bool hasVFGNodes(const SVFFunction *fun) const {
-		return funToVFGNodesMap.find(fun) != funToVFGNodesMap.end();
-	}
-	inline bool VFGNodes(const SVFFunction *fun) const {
-		return funToVFGNodesMap.find(fun) != funToVFGNodesMap.end();
-	}
-	inline VFGNodeSet::const_iterator getVFGNodeBegin(const SVFFunction *fun) const {
-		FunToVFGNodesMapTy::const_iterator it = funToVFGNodesMap.find(fun);
-		assert(it != funToVFGNodesMap.end() && "this function does not have any VFGNode");
-		return it->second.begin();
-	}
-	inline VFGNodeSet::const_iterator getVFGNodeEnd(const SVFFunction *fun) const {
-		FunToVFGNodesMapTy::const_iterator it = funToVFGNodesMap.find(fun);
-		assert(it != funToVFGNodesMap.end() && "this function does not have any VFGNode");
-		return it->second.end();
-	}
-	///@}
+    /// Return all the VFGNodes of a function
+    ///@{
+    inline VFGNodeSet& getVFGNodes(const SVFFunction *fun)
+    {
+        return funToVFGNodesMap[fun];
+    }
+    inline bool hasVFGNodes(const SVFFunction *fun) const
+    {
+        return funToVFGNodesMap.find(fun) != funToVFGNodesMap.end();
+    }
+    inline bool VFGNodes(const SVFFunction *fun) const
+    {
+        return funToVFGNodesMap.find(fun) != funToVFGNodesMap.end();
+    }
+    inline VFGNodeSet::const_iterator getVFGNodeBegin(const SVFFunction *fun) const
+    {
+        FunToVFGNodesMapTy::const_iterator it = funToVFGNodesMap.find(fun);
+        assert(it != funToVFGNodesMap.end() && "this function does not have any VFGNode");
+        return it->second.begin();
+    }
+    inline VFGNodeSet::const_iterator getVFGNodeEnd(const SVFFunction *fun) const
+    {
+        FunToVFGNodesMapTy::const_iterator it = funToVFGNodesMap.find(fun);
+        assert(it != funToVFGNodesMap.end() && "this function does not have any VFGNode");
+        return it->second.end();
+    }
+    ///@}
     /// Add control-flow edges for top level pointers
     //@{
     VFGEdge* addIntraDirectVFEdge(NodeID srcId, NodeID dstId);
@@ -462,9 +467,9 @@ protected:
         icfgNode->addVFGNode(vfgNode);
 
         if(const SVFFunction* fun = icfgNode->getFun())
-        	funToVFGNodesMap[fun].insert(vfgNode);
+            funToVFGNodesMap[fun].insert(vfgNode);
         else
-        	globalVFGNodes.insert(vfgNode);
+            globalVFGNodes.insert(vfgNode);
     }
 
     /// Add a VFG node for program statement
@@ -545,20 +550,21 @@ protected:
     /// Otherwise, we need to handle formalRet using <PAGNodeID,CallSiteID> pair to find FormalRetVFG node same as handling actual parameters
     inline void addFormalRetVFGNode(const PAGNode* uniqueFunRet, const SVFFunction* fun, RetPESet& retPEs)
     {
-		FormalRetVFGNode *sNode = new FormalRetVFGNode(totalVFGNode++, uniqueFunRet, fun);
-		addVFGNode(sNode, pag->getICFG()->getFunExitICFGNode(fun));
-		for (RetPESet::const_iterator it = retPEs.begin(), eit = retPEs.end(); it != eit; ++it)
-			sNode->addRetPE(*it);
-
-		PAGNodeToFormalRetMap[uniqueFunRet] = sNode;
-		/// if this uniqueFunRet is a phi node, which means it will receive values from multiple return instructions of fun
-		/// we will set this phi node's def later
-		/// Ideally, every function uniqueFunRet should be a PhiNode (SVFIRBuilder.cpp), unless it does not have ret instruction
-		if (!pag->isPhiNode(uniqueFunRet)){
-			std::string warn = fun->getName();
-			SVFUtil::writeWrnMsg(warn + " does not have any ret instruction!");
-			setDef(uniqueFunRet, sNode);
-		}
+        FormalRetVFGNode *sNode = new FormalRetVFGNode(totalVFGNode++, uniqueFunRet, fun);
+        addVFGNode(sNode, pag->getICFG()->getFunExitICFGNode(fun));
+        for (RetPESet::const_iterator it = retPEs.begin(), eit = retPEs.end(); it != eit; ++it)
+            sNode->addRetPE(*it);
+
+        PAGNodeToFormalRetMap[uniqueFunRet] = sNode;
+        /// if this uniqueFunRet is a phi node, which means it will receive values from multiple return instructions of fun
+        /// we will set this phi node's def later
+        /// Ideally, every function uniqueFunRet should be a PhiNode (SVFIRBuilder.cpp), unless it does not have ret instruction
+        if (!pag->isPhiNode(uniqueFunRet))
+        {
+            std::string warn = fun->getName();
+            SVFUtil::writeWrnMsg(warn + " does not have any ret instruction!");
+            setDef(uniqueFunRet, sNode);
+        }
     }
     /// Add a callsite Receive VFG node
     inline void addActualRetVFGNode(const PAGNode* ret,const CallICFGNode* cs)
@@ -619,7 +625,7 @@ protected:
         setDef(edge->getRes(),sNode);
         PAGNodeToUnaryOPVFGNodeMap[edge->getRes()] = sNode;
     }
-    /// Add a BranchVFGNode 
+    /// Add a BranchVFGNode
     inline void addBranchVFGNode(const BranchStmt* edge)
     {
         BranchVFGNode* sNode = new BranchVFGNode(totalVFGNode++, edge);

package/SVF-linux/include/Graphs/VFGNode.h

@@ -563,18 +563,22 @@ public:
     //@}
 
     /// Return the branch statement
-    const BranchStmt* getBranchStmt() const{
+    const BranchStmt* getBranchStmt() const
+    {
         return brstmt;
     }
     /// Successors of this branch statement
     ///@{
-    u32_t getNumSuccessors() const{
+    u32_t getNumSuccessors() const
+    {
         return brstmt->getNumSuccessors();
     }
-    const BranchStmt::SuccAndCondPairVec& getSuccessors() const{
+    const BranchStmt::SuccAndCondPairVec& getSuccessors() const
+    {
         return brstmt->getSuccessors();
     }
-    const ICFGNode* getSuccessor (u32_t i) const{
+    const ICFGNode* getSuccessor (u32_t i) const
+    {
         return brstmt->getSuccessor(i);
     }
     ///@}

package/SVF-linux/include/MSSA/MemSSA.h

@@ -343,7 +343,7 @@ public:
     inline bool hasCHI(const PAGEdge* inst) const
     {
         if (const StoreStmt* store = SVFUtil::dyn_cast<StoreStmt>(
-                                       inst))
+                                         inst))
         {
             assert(0 != store2ChiSetMap.count(store)
                    && "not associated with mem region!");