2 * Copyright (C) 2008 Linus Torvalds
10 #include "thread-utils.h"
11 #include "repository.h"
14 * Mostly randomly chosen maximum thread counts: we
15 * cap the parallelism to 20 threads, and we want
16 * to have at least 500 lstat's per thread for it to
17 * be worth starting a thread.
19 #define MAX_PARALLEL (20)
20 #define THREAD_COST (500)
22 struct progress_data {
24 struct progress *progress;
25 pthread_mutex_t mutex;
30 struct index_state *index;
31 struct pathspec pathspec;
32 struct progress_data *progress;
36 static void *preload_thread(void *_data)
39 struct thread_data *p = _data;
40 struct index_state *index = p->index;
41 struct cache_entry **cep = index->cache + p->offset;
42 struct cache_def cache = CACHE_DEF_INIT;
45 if (nr + p->offset > index->cache_nr)
46 nr = index->cache_nr - p->offset;
50 struct cache_entry *ce = *cep++;
55 if (S_ISGITLINK(ce->ce_mode))
59 if (ce_skip_worktree(ce))
61 if (ce->ce_flags & CE_FSMONITOR_VALID)
63 if (p->progress && !(nr & 31)) {
64 struct progress_data *pd = p->progress;
66 pthread_mutex_lock(&pd->mutex);
67 pd->n += last_nr - nr;
68 display_progress(pd->progress, pd->n);
69 pthread_mutex_unlock(&pd->mutex);
72 if (!ce_path_match(index, ce, &p->pathspec, NULL))
74 if (threaded_has_symlink_leading_path(&cache, ce->name, ce_namelen(ce)))
76 if (lstat(ce->name, &st))
78 if (ie_match_stat(index, ce, &st, CE_MATCH_RACY_IS_DIRTY|CE_MATCH_IGNORE_FSMONITOR))
81 mark_fsmonitor_valid(index, ce);
84 struct progress_data *pd = p->progress;
86 pthread_mutex_lock(&pd->mutex);
87 display_progress(pd->progress, pd->n + last_nr);
88 pthread_mutex_unlock(&pd->mutex);
90 cache_def_clear(&cache);
94 void preload_index(struct index_state *index,
95 const struct pathspec *pathspec,
96 unsigned int refresh_flags)
98 int threads, i, work, offset;
99 struct thread_data data[MAX_PARALLEL];
100 struct progress_data pd;
102 if (!HAVE_THREADS || !core_preload_index)
105 threads = index->cache_nr / THREAD_COST;
106 if ((index->cache_nr > 1) && (threads < 2) && git_env_bool("GIT_TEST_PRELOAD_INDEX", 0))
110 trace_performance_enter();
111 if (threads > MAX_PARALLEL)
112 threads = MAX_PARALLEL;
114 work = DIV_ROUND_UP(index->cache_nr, threads);
115 memset(&data, 0, sizeof(data));
117 memset(&pd, 0, sizeof(pd));
118 if (refresh_flags & REFRESH_PROGRESS && isatty(2)) {
119 pd.progress = start_delayed_progress(_("Refreshing index"), index->cache_nr);
120 pthread_mutex_init(&pd.mutex, NULL);
123 for (i = 0; i < threads; i++) {
124 struct thread_data *p = data+i;
129 copy_pathspec(&p->pathspec, pathspec);
135 err = pthread_create(&p->pthread, NULL, preload_thread, p);
138 die(_("unable to create threaded lstat: %s"), strerror(err));
140 for (i = 0; i < threads; i++) {
141 struct thread_data *p = data+i;
142 if (pthread_join(p->pthread, NULL))
143 die("unable to join threaded lstat");
145 stop_progress(&pd.progress);
147 trace_performance_leave("preload index");
150 int repo_read_index_preload(struct repository *repo,
151 const struct pathspec *pathspec,
152 unsigned int refresh_flags)
154 int retval = repo_read_index(repo);
156 preload_index(repo->index, pathspec, refresh_flags);