Bugfix. Implement deep copy of uint64 list.

Each element here is dynamically allocated in some memory context. If we copy the list in another memctx we should allocate memory for new elements too.

Author: danolivo

hash.c

@@ -98,6 +98,29 @@ list_member_uint64(const List *list, uint64 datum)
 return false;
 }
 
+/*
+* Deep copy of uint64 list.
+* Each element here is dynamically allocated in some memory context.
+* If we copy the list in another memctx we should allocate memory for new
+* elements too.
+*/
+List *
+list_copy_uint64(List *list)
+{
+ListCell *lc;
+List *nlist = NIL;
+
+foreach(lc, list)
+{
+uint64 *val = palloc(sizeof(uint64));
+
+*val = *(uint64 *) lfirst(lc);
+nlist = lappend(nlist, (void *) val);
+}
+
+return nlist;
+}
+
 List *
 lappend_uint64(List *list, uint64 datum)
 {

hash.h

@@ -5,6 +5,7 @@
 
 extern uint64 get_query_hash(Query *parse, const char *query_text);
 extern bool list_member_uint64(const List *list, uint64 datum);
+extern List *list_copy_uint64(List *list);
 extern List *lappend_uint64(List *list, uint64 datum);
 extern List *ldelete_uint64(List *list, uint64 datum);
 extern int get_fss_for_object(List *relsigns, List *clauselist,

path_utils.c

@@ -578,7 +578,7 @@ AQOnodeCopy(struct ExtensibleNode *enew, const struct ExtensibleNode *eold)
 /* These lists couldn't contain AQO nodes. Use basic machinery */
 new->rels = palloc(sizeof(RelSortOut));
 new->rels->hrels = list_copy(old->rels->hrels);
-new->rels->signatures = list_copy(old->rels->signatures);
+new->rels->signatures = list_copy_uint64(old->rels->signatures);
 
 new->clauses = copyObject(old->clauses);
 new->grouping_exprs = copyObject(old->grouping_exprs);