Made early preparations for implementation of hard link persistence

libisofs/util_rbtree.c

@@ -198,7 +198,16 @@ int iso_rbtree_insert(IsoRBTree *tree, void *data, void **item)
                 }
             }
 
-            comp = tree->compare(q->data, data);
+            /* ts A90424 : Maybe one can try again to introduce an id
+                           tuple which is not considered equal to itself
+                           by the compare test.
+                           The last attempt caused a loop here.
+            */
+            if (q->data == data) {
+                comp = 0;
+            } else {
+                comp = tree->compare(q->data, data);
+            }
 
             /* Stop if found */
             if (comp == 0) {