2 * Copyright (C) 2008 Linus Torvalds
9 static void preload_index(struct index_state
*index
,
10 const struct pathspec
*pathspec
)
19 * Mostly randomly chosen maximum thread counts: we
20 * cap the parallelism to 20 threads, and we want
21 * to have at least 500 lstat's per thread for it to
22 * be worth starting a thread.
24 #define MAX_PARALLEL (20)
25 #define THREAD_COST (500)
29 struct index_state
*index
;
30 struct pathspec pathspec
;
34 static void *preload_thread(void *_data
)
37 struct thread_data
*p
= _data
;
38 struct index_state
*index
= p
->index
;
39 struct cache_entry
**cep
= index
->cache
+ p
->offset
;
40 struct cache_def cache
;
42 memset(&cache
, 0, sizeof(cache
));
44 if (nr
+ p
->offset
> index
->cache_nr
)
45 nr
= index
->cache_nr
- p
->offset
;
48 struct cache_entry
*ce
= *cep
++;
53 if (S_ISGITLINK(ce
->ce_mode
))
57 if (!ce_path_match(ce
, &p
->pathspec
, NULL
))
59 if (threaded_has_symlink_leading_path(&cache
, ce
->name
, ce_namelen(ce
)))
61 if (lstat(ce
->name
, &st
))
63 if (ie_match_stat(index
, ce
, &st
, CE_MATCH_RACY_IS_DIRTY
))
70 static void preload_index(struct index_state
*index
,
71 const struct pathspec
*pathspec
)
73 int threads
, i
, work
, offset
;
74 struct thread_data data
[MAX_PARALLEL
];
76 if (!core_preload_index
)
79 threads
= index
->cache_nr
/ THREAD_COST
;
82 if (threads
> MAX_PARALLEL
)
83 threads
= MAX_PARALLEL
;
85 work
= DIV_ROUND_UP(index
->cache_nr
, threads
);
86 memset(&data
, 0, sizeof(data
));
87 for (i
= 0; i
< threads
; i
++) {
88 struct thread_data
*p
= data
+i
;
91 copy_pathspec(&p
->pathspec
, pathspec
);
95 if (pthread_create(&p
->pthread
, NULL
, preload_thread
, p
))
96 die("unable to create threaded lstat");
98 for (i
= 0; i
< threads
; i
++) {
99 struct thread_data
*p
= data
+i
;
100 if (pthread_join(p
->pthread
, NULL
))
101 die("unable to join threaded lstat");
106 int read_index_preload(struct index_state
*index
,
107 const struct pathspec
*pathspec
)
109 int retval
= read_index(index
);
111 preload_index(index
, pathspec
);