From 2ff2da4ac7ac9ac13b595c3f1a046ff21d77df1b Mon Sep 17 00:00:00 2001
From: mar <mar>
Date: Wed, 13 Jun 1990 12:45:03 +0000
Subject: [PATCH] ID check was too slow; need larger MAXLISTDEPTH (should
 really be dynamic)

---
 server/qsupport.qc | 7 ++++++-
 1 file changed, 6 insertions(+), 1 deletion(-)

diff --git a/server/qsupport.qc b/server/qsupport.qc
index 1d2be1e5..5e363834 100644
--- a/server/qsupport.qc
+++ b/server/qsupport.qc
@@ -331,10 +331,15 @@ setup_ausr(q, argv, cl)
 ##  int nuid, rowcount;
 ##  char *mit_id;
 
+#ifdef notdef
+    /* this is currently disabled because we need an index on ID's
+     * before it can run in finite time.
+     */
     mit_id = argv[U_MITID];
 ##  retrieve (rowcount = any(u.#mit_id where u.#mit_id = mit_id))
     if (ingres_errno) return(mr_errcode);
     if (rowcount) return(MR_EXISTS);
+#endif notdef
 
     if (!strcmp(argv[1], UNIQUE_UID) || atoi(argv[1]) == -1) {
 	if (set_next_object_id("uid", "users"))
@@ -1806,7 +1811,7 @@ get_list_info(q, aargv, cl, action, actarg)
  * how many different ancestors a member is allowed to have.
  */
 
-#define MAXLISTDEPTH	100
+#define MAXLISTDEPTH	1024
 
 int add_member_to_list(q, argv, cl)
     struct query *q;
-- 
2.45.2