git/list[1] front-page[2] threads[3] people[4] search[5] about
 

[PATCH 25/30] sort_ref_dir(): take (ref_entry *) instead of (ref_dir *)

From
mhagger@alum.mit.edu <mhagger@alum.mit.edu>
Date
Apr 24, 2012, 22:45 UTC
Message-ID
<1335307536-26914-26-git-send-email-mhagger@alum.mit.edu>
In-Reply-To
<1335307536-26914-1-git-send-email-mhagger@alum.mit.edu>
From: Michael Haggerty <mhagger@alum.mit.edu>
Signed-off-by: Michael Haggerty <mhagger@alum.mit.edu>
---
 refs.c |   31 +++++++++++++++++--------------
 1 file changed, 17 insertions(+), 14 deletions(-)
diff --git a/refs.c b/refs.c
index 722545f..90bdd7c 100644
--- a/refs.c
+++ b/refs.c
@@ -247,7 +247,7 @@ static int ref_entry_cmp(const void *a, const void *b)
 	return strcmp(one->name, two->name);
 }
 
-static void sort_ref_dir(struct ref_dir *dir);
+static void sort_ref_dir(struct ref_entry *direntry);
 
 /*
  * Return the entry with the given refname from direntry
@@ -266,7 +266,7 @@ static struct ref_entry *search_ref_dir(struct ref_entry *direntry,
 	if (refname == NULL || !dir->nr)
 		return NULL;
 
-	sort_ref_dir(dir);
+	sort_ref_dir(direntry);
 
 	len = strlen(refname) + 1;
 	e = xmalloc(sizeof(struct ref_entry) + len);
@@ -386,14 +386,17 @@ static int is_dup_ref(const struct ref_entry *ref1, const struct ref_entry *ref2
 }
 
 /*
- * Sort the entries in dir non-recursively (if they are not already
- * sorted) and remove any duplicate entries.
+ * Sort the entries in direntry non-recursively (if they are not
+ * already sorted) and remove any duplicate entries.
  */
-static void sort_ref_dir(struct ref_dir *dir)
+static void sort_ref_dir(struct ref_entry *direntry)
 {
 	int i, j;
 	struct ref_entry *last = NULL;
+	struct ref_dir *dir;
 
+	assert(direntry->flag & REF_DIR);
+	dir = &direntry->u.subdir;
 	/*
 	 * This check also prevents passing a zero-length array to qsort(),
 	 * which is a problem on some platforms.
@@ -456,7 +459,7 @@ static int do_for_each_ref_in_dir(struct ref_entry *direntry, int offset,
 		struct ref_entry *entry = direntry->u.subdir.entries[i];
 		int retval;
 		if (entry->flag & REF_DIR) {
-			sort_ref_dir(&entry->u.subdir);
+			sort_ref_dir(entry);
 			retval = do_for_each_ref_in_dir(entry, 0,
 							base, fn, trim, flags, cb_data);
 		} else {
@@ -505,8 +508,8 @@ static int do_for_each_ref_in_dirs(struct ref_entry *direntry1,
 		if (cmp == 0) {
 			if ((e1->flag & REF_DIR) && (e2->flag & REF_DIR)) {
 				/* Both are directories; descend them in parallel. */
-				sort_ref_dir(&e1->u.subdir);
-				sort_ref_dir(&e2->u.subdir);
+				sort_ref_dir(e1);
+				sort_ref_dir(e2);
 				retval = do_for_each_ref_in_dirs(
 						e1, e2,
 						base, fn, trim, flags, cb_data);
@@ -531,7 +534,7 @@ static int do_for_each_ref_in_dirs(struct ref_entry *direntry1,
 				i2++;
 			}
 			if (e->flag & REF_DIR) {
-				sort_ref_dir(&e->u.subdir);
+				sort_ref_dir(e);
 				retval = do_for_each_ref_in_dir(
 						e, 0,
 						base, fn, trim, flags, cb_data);
@@ -601,7 +604,7 @@ static int is_refname_available(const char *refname, const char *oldrefname,
 	data.conflicting_refname = NULL;
 
 	assert(direntry->flag & REF_DIR);
-	sort_ref_dir(&direntry->u.subdir);
+	sort_ref_dir(direntry);
 
 	if (do_for_each_ref_in_dir(direntry, 0, "", name_conflict_fn,
 				   0, DO_FOR_EACH_INCLUDE_BROKEN,
@@ -1187,18 +1190,18 @@ static int do_for_each_ref(const char *submodule, const char *base, each_ref_fn
 	}
 
 	if (packed_direntry && loose_direntry) {
-		sort_ref_dir(&packed_direntry->u.subdir);
-		sort_ref_dir(&loose_direntry->u.subdir);
+		sort_ref_dir(packed_direntry);
+		sort_ref_dir(loose_direntry);
 		retval = do_for_each_ref_in_dirs(
 				packed_direntry, loose_direntry,
 				base, fn, trim, flags, cb_data);
 	} else if (packed_direntry) {
-		sort_ref_dir(&packed_direntry->u.subdir);
+		sort_ref_dir(packed_direntry);
 		retval = do_for_each_ref_in_dir(
 				packed_direntry, 0,
 				base, fn, trim, flags, cb_data);
 	} else if (loose_direntry) {
-		sort_ref_dir(&loose_direntry->u.subdir);
+		sort_ref_dir(loose_direntry);
 		retval = do_for_each_ref_in_dir(
 				loose_direntry, 0,
 				base, fn, trim, flags, cb_data);

-- 
1.7.10
Previous: mhagger@alum.mit.eduNext: mhagger@alum.mit.edu
Message 27 of 37 in “Read loose references lazily”
  1. 00/30 Read loose references lazilymhagger@alum.mit.edu, Apr 24, 2012
  2. 01/30 get_ref_dir(): return early if directory cannot be readmhagger@alum.mit.edu, Apr 24, 2012
  3. 02/30 get_ref_dir(): use a strbuf to hold refnamemhagger@alum.mit.edu, Apr 24, 2012
  4. 03/30 get_ref_dir(): rename "base" parameter to "dirname"mhagger@alum.mit.edu, Apr 24, 2012
  5. 04/30 get_ref_dir(): require that the dirname argument ends in '/'mhagger@alum.mit.edu, Apr 24, 2012
  6. 05/30 refs.c: extract function search_for_subdir()mhagger@alum.mit.edu, Apr 24, 2012
  7. 06/30 get_ref_dir(): take the containing directory as argumentmhagger@alum.mit.edu, Apr 24, 2012
  8. 07/30 do_for_each_reflog(): return early on errormhagger@alum.mit.edu, Apr 24, 2012
  9. 08/30 do_for_each_reflog(): use a strbuf to hold logfile namemhagger@alum.mit.edu, Apr 24, 2012
  10. 09/30 do_for_each_reflog(): reuse strbuf across recursive function callsmhagger@alum.mit.edu, Apr 24, 2012
  11. 10/30 refs: wrap top-level ref_dirs in ref_entriesmhagger@alum.mit.edu, Apr 24, 2012
  12. Michael HaggertyApr 26, 2012
  13. 11/30 get_packed_refs(): return (ref_entry *) instead of (ref_dir *)mhagger@alum.mit.edu, Apr 24, 2012
  14. 12/30 get_loose_refs(): return (ref_entry *) instead of (ref_dir *)mhagger@alum.mit.edu, Apr 24, 2012
  15. 13/30 is_refname_available(): take (ref_entry *) instead of (ref_dir *)mhagger@alum.mit.edu, Apr 24, 2012
  16. 14/30 find_ref(): take (ref_entry *) instead of (ref_dir *)mhagger@alum.mit.edu, Apr 24, 2012
  17. 15/30 read_packed_refs(): take (ref_entry *) instead of (ref_dir *)mhagger@alum.mit.edu, Apr 24, 2012
  18. 16/30 add_ref(): take (ref_entry *) instead of (ref_dir *)mhagger@alum.mit.edu, Apr 24, 2012
  19. 17/30 find_containing_direntry(): use (ref_entry *) instead of (ref_dir *)mhagger@alum.mit.edu, Apr 24, 2012
  20. 18/30 get_ref_dir(): take (ref_entry *) instead of (ref_dir *)mhagger@alum.mit.edu, Apr 24, 2012
  21. 19/30 get_ref_dir(): remove dirname argumentmhagger@alum.mit.edu, Apr 24, 2012
  22. 20/30 search_for_subdir(): take (ref_entry *) instead of (ref_dir *)mhagger@alum.mit.edu, Apr 24, 2012
  23. 21/30 search_ref_dir(): take (ref_entry *) instead of (ref_dir *)mhagger@alum.mit.edu, Apr 24, 2012
  24. 22/30 add_entry(): take (ref_entry *) instead of (ref_dir *)mhagger@alum.mit.edu, Apr 24, 2012
  25. 23/30 do_for_each_ref_in_dirs(): take (ref_entry *) instead of (ref_dir *)mhagger@alum.mit.edu, Apr 24, 2012
  26. 24/30 do_for_each_ref_in_dir(): take (ref_entry *) instead of (ref_dir *)mhagger@alum.mit.edu, Apr 24, 2012
  27. 25/30 sort_ref_dir(): take (ref_entry *) instead of (ref_dir *)mhagger@alum.mit.edu, Apr 24, 2012
  28. 26/30 struct ref_dir: store a reference to the enclosing ref_cachemhagger@alum.mit.edu, Apr 24, 2012
  29. 27/30 read_loose_refs(): rename function from get_ref_dir()mhagger@alum.mit.edu, Apr 24, 2012
  30. 28/30 read_loose_refs(): access ref_cache via the ref_dir fieldmhagger@alum.mit.edu, Apr 24, 2012
  31. 29/30 create_dir_entry(): allow the flag value to be passed as an argumentmhagger@alum.mit.edu, Apr 24, 2012
  32. Junio C HamanoApr 25, 2012
  33. Junio C HamanoApr 25, 2012
  34. Michael HaggertyApr 26, 2012
  35. 30/30 refs: read loose references lazilymhagger@alum.mit.edu, Apr 24, 2012
  36. Junio C HamanoApr 25, 2012
  37. Michael HaggertyApr 26, 2012

Read the whole thread, see it on lore, or plain text.

$ cat FOOTERMessages come from the public archive at lore.kernel.org/git, fetched every hour. The front page is chosen and written each morning by an AI editor and can be wrong; the threads themselves are the record. About and API. For agents: an MCP server at https://gitlist.dev/mcp, and any thread, story or person page as Markdown by adding .md to its URL (or sending Accept: text/markdown). Details in /llms.txt.