]>
Commit | Line | Data |
---|---|---|
5751f490 DB |
1 | #ifndef REMOTE_H |
2 | #define REMOTE_H | |
3 | ||
28f5d176 | 4 | #include "parse-options.h" |
d0da003d | 5 | #include "hashmap.h" |
28f5d176 | 6 | |
89cf4c70 MV |
7 | enum { |
8 | REMOTE_CONFIG, | |
9 | REMOTE_REMOTES, | |
10 | REMOTE_BRANCHES | |
11 | }; | |
12 | ||
5751f490 | 13 | struct remote { |
d0da003d PR |
14 | struct hashmap_entry ent; /* must be first */ |
15 | ||
5751f490 | 16 | const char *name; |
89cf4c70 | 17 | int origin; |
5751f490 | 18 | |
c578f51d DB |
19 | const char *foreign_vcs; |
20 | ||
28b91f8a SP |
21 | const char **url; |
22 | int url_nr; | |
2d31347b | 23 | int url_alloc; |
5751f490 | 24 | |
20346234 MG |
25 | const char **pushurl; |
26 | int pushurl_nr; | |
27 | int pushurl_alloc; | |
28 | ||
5751f490 | 29 | const char **push_refspec; |
6b62816c | 30 | struct refspec *push; |
5751f490 | 31 | int push_refspec_nr; |
2d31347b | 32 | int push_refspec_alloc; |
5751f490 | 33 | |
5d46c9d4 DB |
34 | const char **fetch_refspec; |
35 | struct refspec *fetch; | |
36 | int fetch_refspec_nr; | |
2d31347b | 37 | int fetch_refspec_alloc; |
5d46c9d4 | 38 | |
d71ab174 DB |
39 | /* |
40 | * -1 to never fetch tags | |
41 | * 0 to auto-follow tags on heuristic (default) | |
42 | * 1 to always auto-follow tags | |
43 | * 2 to always fetch tags | |
44 | */ | |
45 | int fetch_tags; | |
211c8968 | 46 | int skip_default_update; |
84bb2dfd | 47 | int mirror; |
737c5a9c | 48 | int prune; |
d71ab174 | 49 | |
5751f490 | 50 | const char *receivepack; |
0012ba21 | 51 | const char *uploadpack; |
14c98218 SV |
52 | |
53 | /* | |
54 | * for curl remotes only | |
55 | */ | |
56 | char *http_proxy; | |
5751f490 DB |
57 | }; |
58 | ||
59 | struct remote *remote_get(const char *name); | |
f24f715e | 60 | struct remote *pushremote_get(const char *name); |
9a23ba33 | 61 | int remote_is_configured(const char *name); |
5751f490 | 62 | |
b42f6927 JS |
63 | typedef int each_remote_fn(struct remote *remote, void *priv); |
64 | int for_each_remote(each_remote_fn fn, void *priv); | |
65 | ||
28b91f8a | 66 | int remote_has_url(struct remote *remote, const char *url); |
5d46c9d4 | 67 | |
6b62816c DB |
68 | struct refspec { |
69 | unsigned force : 1; | |
70 | unsigned pattern : 1; | |
a83619d6 | 71 | unsigned matching : 1; |
6e7b66ee | 72 | unsigned exact_sha1 : 1; |
6b62816c | 73 | |
b42f6927 | 74 | char *src; |
6b62816c DB |
75 | char *dst; |
76 | }; | |
77 | ||
e0aaa29f DB |
78 | extern const struct refspec *tag_refspec; |
79 | ||
47a59185 JH |
80 | struct ref { |
81 | struct ref *next; | |
f4e54d02 | 82 | struct object_id old_oid; |
83 | struct object_id new_oid; | |
84 | struct object_id old_oid_expect; /* used by expect-old */ | |
47a59185 JH |
85 | char *symref; |
86 | unsigned int | |
87 | force:1, | |
88 | forced_update:1, | |
91048a95 JH |
89 | expect_old_sha1:1, |
90 | expect_old_no_trackback:1, | |
47a59185 JH |
91 | deletion:1, |
92 | matched:1; | |
93 | ||
94 | /* | |
95 | * Order is important here, as we write to FETCH_HEAD | |
96 | * in numeric order. And the default NOT_FOR_MERGE | |
97 | * should be 0, so that xcalloc'd structures get it | |
98 | * by default. | |
99 | */ | |
100 | enum { | |
101 | FETCH_HEAD_MERGE = -1, | |
102 | FETCH_HEAD_NOT_FOR_MERGE = 0, | |
103 | FETCH_HEAD_IGNORE = 1 | |
104 | } fetch_head_status; | |
105 | ||
106 | enum { | |
107 | REF_STATUS_NONE = 0, | |
108 | REF_STATUS_OK, | |
109 | REF_STATUS_REJECT_NONFASTFORWARD, | |
110 | REF_STATUS_REJECT_ALREADY_EXISTS, | |
111 | REF_STATUS_REJECT_NODELETE, | |
112 | REF_STATUS_REJECT_FETCH_FIRST, | |
113 | REF_STATUS_REJECT_NEEDS_FORCE, | |
631b5ef2 | 114 | REF_STATUS_REJECT_STALE, |
4820a33b | 115 | REF_STATUS_REJECT_SHALLOW, |
47a59185 JH |
116 | REF_STATUS_UPTODATE, |
117 | REF_STATUS_REMOTE_REJECT, | |
4ff17f10 RS |
118 | REF_STATUS_EXPECTING_REPORT, |
119 | REF_STATUS_ATOMIC_PUSH_FAILED | |
47a59185 JH |
120 | } status; |
121 | char *remote_status; | |
122 | struct ref *peer_ref; /* when renaming */ | |
123 | char name[FLEX_ARRAY]; /* more */ | |
124 | }; | |
125 | ||
126 | #define REF_NORMAL (1u << 0) | |
127 | #define REF_HEADS (1u << 1) | |
128 | #define REF_TAGS (1u << 2) | |
129 | ||
130 | extern struct ref *find_ref_by_name(const struct ref *list, const char *name); | |
131 | ||
59c69c0c | 132 | struct ref *alloc_ref(const char *name); |
59a57757 | 133 | struct ref *copy_ref(const struct ref *ref); |
4577370e | 134 | struct ref *copy_ref_list(const struct ref *ref); |
ed81c76b | 135 | void sort_ref_list(struct ref **, int (*cmp)(const void *, const void *)); |
ca02465b | 136 | extern int count_refspec_match(const char *, struct ref *refs, struct ref **matched_ref); |
ed81c76b | 137 | int ref_compare_name(const void *, const void *); |
4577370e DB |
138 | |
139 | int check_ref_type(const struct ref *ref, int flags); | |
140 | ||
dfd255dd DB |
141 | /* |
142 | * Frees the entire list and peers of elements. | |
143 | */ | |
144 | void free_refs(struct ref *ref); | |
145 | ||
13eb4626 | 146 | struct sha1_array; |
47a59185 JH |
147 | extern struct ref **get_remote_heads(int in, char *src_buf, size_t src_len, |
148 | struct ref **list, unsigned int flags, | |
b06dcd7d NTND |
149 | struct sha1_array *extra_have, |
150 | struct sha1_array *shallow); | |
47a59185 | 151 | |
be885d96 | 152 | int resolve_remote_symref(struct ref *ref, struct ref *list); |
6f3d57b6 | 153 | int ref_newer(const struct object_id *new_oid, const struct object_id *old_oid); |
be885d96 | 154 | |
2467a4fa | 155 | /* |
b9afe665 MH |
156 | * Remove and free all but the first of any entries in the input list |
157 | * that map the same remote reference to the same local reference. If | |
158 | * there are two entries that map different remote references to the | |
159 | * same local reference, emit an error message and die. Return a | |
160 | * pointer to the head of the resulting list. | |
2467a4fa | 161 | */ |
b9afe665 | 162 | struct ref *ref_remove_duplicates(struct ref *ref_map); |
2467a4fa | 163 | |
24b6177e | 164 | int valid_fetch_refspec(const char *refspec); |
46220ca1 | 165 | struct refspec *parse_fetch_refspec(int nr_refspec, const char **refspec); |
d71ab174 | 166 | |
72ff8943 DB |
167 | void free_refspec(int nr_refspec, struct refspec *refspec); |
168 | ||
ca02465b | 169 | extern int query_refspecs(struct refspec *specs, int nr, struct refspec *query); |
72ff8943 DB |
170 | char *apply_refspecs(struct refspec *refspecs, int nr_refspec, |
171 | const char *name); | |
172 | ||
ba928c13 | 173 | int check_push_refs(struct ref *src, int nr_refspec, const char **refspec); |
29753cdd JH |
174 | int match_push_refs(struct ref *src, struct ref **dst, |
175 | int nr_refspec, const char **refspec, int all); | |
20e8b465 TRC |
176 | void set_ref_status_for_push(struct ref *remote_refs, int send_mirror, |
177 | int force_update); | |
6b62816c | 178 | |
d71ab174 DB |
179 | /* |
180 | * Given a list of the remote refs and the specification of things to | |
181 | * fetch, makes a (separate) list of the refs to fetch and the local | |
182 | * refs to store into. | |
183 | * | |
184 | * *tail is the pointer to the tail pointer of the list of results | |
185 | * beforehand, and will be set to the tail pointer of the list of | |
186 | * results afterward. | |
9ad7c5ae JH |
187 | * |
188 | * missing_ok is usually false, but when we are adding branch.$name.merge | |
189 | * it is Ok if the branch is not at the remote anymore. | |
d71ab174 | 190 | */ |
4577370e | 191 | int get_fetch_map(const struct ref *remote_refs, const struct refspec *refspec, |
9ad7c5ae | 192 | struct ref ***tail, int missing_ok); |
d71ab174 | 193 | |
4577370e | 194 | struct ref *get_remote_ref(const struct ref *remote_refs, const char *name); |
d71ab174 | 195 | |
5d46c9d4 DB |
196 | /* |
197 | * For the given remote, reads the refspec's src and sets the other fields. | |
198 | */ | |
199 | int remote_find_tracking(struct remote *remote, struct refspec *refspec); | |
200 | ||
cf818348 DB |
201 | struct branch { |
202 | const char *name; | |
203 | const char *refname; | |
204 | ||
205 | const char *remote_name; | |
da66b274 | 206 | const char *pushremote_name; |
cf818348 DB |
207 | |
208 | const char **merge_name; | |
209 | struct refspec **merge; | |
210 | int merge_nr; | |
2d31347b | 211 | int merge_alloc; |
e291c75a JK |
212 | |
213 | const char *push_tracking_ref; | |
cf818348 DB |
214 | }; |
215 | ||
216 | struct branch *branch_get(const char *name); | |
f052154d | 217 | const char *remote_for_branch(struct branch *branch, int *explicit); |
da66b274 | 218 | const char *pushremote_for_branch(struct branch *branch, int *explicit); |
cf818348 DB |
219 | |
220 | int branch_has_merge_config(struct branch *branch); | |
85682c19 | 221 | int branch_merge_matches(struct branch *, int n, const char *); |
cf818348 | 222 | |
a9f9f8cc JK |
223 | /** |
224 | * Return the fully-qualified refname of the tracking branch for `branch`. | |
225 | * I.e., what "branch@{upstream}" would give you. Returns NULL if no | |
226 | * upstream is defined. | |
3a429d0a JK |
227 | * |
228 | * If `err` is not NULL and no upstream is defined, a more specific error | |
229 | * message is recorded there (if the function does not return NULL, then | |
230 | * `err` is not touched). | |
a9f9f8cc | 231 | */ |
3a429d0a | 232 | const char *branch_get_upstream(struct branch *branch, struct strbuf *err); |
a9f9f8cc | 233 | |
e291c75a JK |
234 | /** |
235 | * Return the tracking branch that corresponds to the ref we would push to | |
236 | * given a bare `git push` while `branch` is checked out. | |
237 | * | |
238 | * The return value and `err` conventions match those of `branch_get_upstream`. | |
239 | */ | |
240 | const char *branch_get_push(struct branch *branch, struct strbuf *err); | |
241 | ||
28b9d6e5 AW |
242 | /* Flags to match_refs. */ |
243 | enum match_refs_flags { | |
244 | MATCH_REFS_NONE = 0, | |
245 | MATCH_REFS_ALL = (1 << 0), | |
6ddba5e2 | 246 | MATCH_REFS_MIRROR = (1 << 1), |
c2aba155 JH |
247 | MATCH_REFS_PRUNE = (1 << 2), |
248 | MATCH_REFS_FOLLOW_TAGS = (1 << 3) | |
28b9d6e5 AW |
249 | }; |
250 | ||
6d21bf96 | 251 | /* Reporting of tracking info */ |
979cb245 JK |
252 | int stat_tracking_info(struct branch *branch, int *num_ours, int *num_theirs, |
253 | const char **upstream_name); | |
6d21bf96 JH |
254 | int format_tracking_info(struct branch *branch, struct strbuf *sb); |
255 | ||
454e2025 | 256 | struct ref *get_local_heads(void); |
8ef51733 | 257 | /* |
4229f1fa JS |
258 | * Find refs from a list which are likely to be pointed to by the given HEAD |
259 | * ref. If 'all' is false, returns the most likely ref; otherwise, returns a | |
260 | * list of all candidate refs. If no match is found (or 'head' is NULL), | |
261 | * returns NULL. All returns are newly allocated and should be freed. | |
8ef51733 | 262 | */ |
4229f1fa JS |
263 | struct ref *guess_remote_head(const struct ref *head, |
264 | const struct ref *refs, | |
265 | int all); | |
266 | ||
f2ef6075 | 267 | /* Return refs which no longer exist on remote */ |
ed43de6e | 268 | struct ref *get_stale_heads(struct refspec *refs, int ref_count, struct ref *fetch_map); |
f2ef6075 | 269 | |
28f5d176 JH |
270 | /* |
271 | * Compare-and-swap | |
272 | */ | |
273 | #define CAS_OPT_NAME "force-with-lease" | |
274 | ||
275 | struct push_cas_option { | |
276 | unsigned use_tracking_for_rest:1; | |
277 | struct push_cas { | |
278 | unsigned char expect[20]; | |
279 | unsigned use_tracking:1; | |
280 | char *refname; | |
281 | } *entry; | |
282 | int nr; | |
283 | int alloc; | |
284 | }; | |
285 | ||
286 | extern int parseopt_push_cas_option(const struct option *, const char *arg, int unset); | |
287 | extern int parse_push_cas_option(struct push_cas_option *, const char *arg, int unset); | |
28f5d176 | 288 | |
91048a95 JH |
289 | extern int is_empty_cas(const struct push_cas_option *); |
290 | void apply_push_cas(struct push_cas_option *, struct remote *, struct ref *); | |
291 | ||
5751f490 | 292 | #endif |