2015-10-02 13:55:31 +02:00
|
|
|
#ifndef WORKTREE_H
|
|
|
|
#define WORKTREE_H
|
|
|
|
|
2015-10-08 19:01:03 +02:00
|
|
|
struct worktree {
|
|
|
|
char *path;
|
|
|
|
char *git_dir;
|
2015-10-08 19:01:04 +02:00
|
|
|
char *head_ref;
|
|
|
|
unsigned char head_sha1[20];
|
|
|
|
int is_detached;
|
|
|
|
int is_bare;
|
2015-10-08 19:01:03 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
/* Functions for acting on the information about worktrees. */
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Get the worktrees. The primary worktree will always be the first returned,
|
|
|
|
* and linked worktrees will be pointed to by 'next' in each subsequent
|
|
|
|
* worktree. No specific ordering is done on the linked worktrees.
|
|
|
|
*
|
|
|
|
* The caller is responsible for freeing the memory from the returned
|
|
|
|
* worktree(s).
|
|
|
|
*/
|
|
|
|
extern struct worktree **get_worktrees(void);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Free up the memory for worktree(s)
|
|
|
|
*/
|
|
|
|
extern void free_worktrees(struct worktree **);
|
|
|
|
|
2015-10-02 13:55:31 +02:00
|
|
|
/*
|
|
|
|
* Check if a per-worktree symref points to a ref in the main worktree
|
|
|
|
* or any linked worktree, and return the path to the exising worktree
|
|
|
|
* if it is. Returns NULL if there is no existing ref. The caller is
|
|
|
|
* responsible for freeing the returned path.
|
|
|
|
*/
|
|
|
|
extern char *find_shared_symref(const char *symref, const char *target);
|
|
|
|
|
|
|
|
#endif
|