🌐 AI搜索 & 代理 主页
Google Git
Sign in
chromium / external / github.com / git / git / refs/tags/v2.4.1 / . / tree-walk.h
blob: ae7fb3a824a960c6c03efae799683cd7e18d402c [file] [log] [blame]
Junio C Hamano1b0c7172006-03-30 06:55:43[diff] [blame]1#ifndef TREE_WALK_H
2#define TREE_WALK_H
3
Junio C Hamano1b0c7172006-03-30 06:55:43[diff] [blame]4struct name_entry {
5 const unsigned char *sha1;
6 const char *path;
7 unsigned int mode;
Junio C Hamano1b0c7172006-03-30 06:55:43[diff] [blame]8};
9
Linus Torvalds4651ece2007-03-21 17:09:56[diff] [blame]10struct tree_desc {
11 const void *buffer;
12 struct name_entry entry;
13 unsigned int size;
14};
15
16static inline const unsigned char *tree_entry_extract(struct tree_desc *desc, const char **pathp, unsigned int *modep)
17{
18 *pathp = desc->entry.path;
Kirill Smelkov7146e662014-02-06 11:36:31[diff] [blame]19 *modep = desc->entry.mode;
Linus Torvalds4651ece2007-03-21 17:09:56[diff] [blame]20 return desc->entry.sha1;
21}
22
Nguyễn Thái Ngọc Duy0de16332011-10-24 06:36:09[diff] [blame]23static inline int tree_entry_len(const struct name_entry *ne)
Linus Torvalds304de2d2007-03-18 03:06:24[diff] [blame]24{
Nguyễn Thái Ngọc Duy0de16332011-10-24 06:36:09[diff] [blame]25 return (const char *)ne->sha1 - ne->path - 1;
Linus Torvalds304de2d2007-03-18 03:06:24[diff] [blame]26}
27
Junio C Hamano1b0c7172006-03-30 06:55:43[diff] [blame]28void update_tree_entry(struct tree_desc *);
Linus Torvalds6fda5e52007-03-21 17:08:25[diff] [blame]29void init_tree_desc(struct tree_desc *desc, const void *buf, unsigned long size);
Junio C Hamano1b0c7172006-03-30 06:55:43[diff] [blame]30
Elijah Newren2244eab2010-08-25 02:53:11[diff] [blame]31/*
32 * Helper function that does both tree_entry_extract() and update_tree_entry()
33 * and returns true for success
34 */
Linus Torvalds4c068a92006-05-30 16:45:45[diff] [blame]35int tree_entry(struct tree_desc *, struct name_entry *);
36
Junio C Hamano1b0c7172006-03-30 06:55:43[diff] [blame]37void *fill_tree_descriptor(struct tree_desc *desc, const unsigned char *sha1);
38
Linus Torvalds40d934d2008-03-06 02:59:29[diff] [blame]39struct traverse_info;
Linus Torvalds91e4f032008-03-06 04:06:18[diff] [blame]40typedef int (*traverse_callback_t)(int n, unsigned long mask, unsigned long dirmask, struct name_entry *entry, struct traverse_info *);
Linus Torvalds5803c6f2008-03-06 03:44:06[diff] [blame]41int traverse_trees(int n, struct tree_desc *t, struct traverse_info *info);
Junio C Hamano1b0c7172006-03-30 06:55:43[diff] [blame]42
Linus Torvalds40d934d2008-03-06 02:59:29[diff] [blame]43struct traverse_info {
44 struct traverse_info *prev;
45 struct name_entry name;
46 int pathlen;
Junio C Hamano2842c0f2011-08-29 19:26:05[diff] [blame]47 struct pathspec *pathspec;
Linus Torvalds40d934d2008-03-06 02:59:29[diff] [blame]48
René Scharfe603d2492013-06-15 23:44:43[diff] [blame]49 unsigned long df_conflicts;
Linus Torvalds40d934d2008-03-06 02:59:29[diff] [blame]50 traverse_callback_t fn;
51 void *data;
Matthieu Moye6c111b2010-08-11 08:38:07[diff] [blame]52 int show_all_errors;
Linus Torvalds40d934d2008-03-06 02:59:29[diff] [blame]53};
Junio C Hamano1b0c7172006-03-30 06:55:43[diff] [blame]54
Junio C Hamano4dcff632006-04-19 21:05:47[diff] [blame]55int get_tree_entry(const unsigned char *, const char *, unsigned char *, unsigned *);
Linus Torvalds40d934d2008-03-06 02:59:29[diff] [blame]56extern char *make_traverse_path(char *path, const struct traverse_info *info, const struct name_entry *n);
57extern void setup_traverse_info(struct traverse_info *info, const char *base);
58
59static inline int traverse_path_len(const struct traverse_info *info, const struct name_entry *n)
60{
Nguyễn Thái Ngọc Duy0de16332011-10-24 06:36:09[diff] [blame]61 return info->pathlen + tree_entry_len(n);
Linus Torvalds40d934d2008-03-06 02:59:29[diff] [blame]62}
Junio C Hamano4dcff632006-04-19 21:05:47[diff] [blame]63
Nguyễn Thái Ngọc Duyd688cf02011-10-24 06:36:10[diff] [blame]64/* in general, positive means "kind of interesting" */
65enum interesting {
66 all_entries_not_interesting = -1, /* no, and no subsequent entries will be either */
67 entry_not_interesting = 0,
68 entry_interesting = 1,
69 all_entries_interesting = 2 /* yes, and all subsequent entries will be */
70};
71
72extern enum interesting tree_entry_interesting(const struct name_entry *,
73 struct strbuf *, int,
74 const struct pathspec *ps);
Nguyễn Thái Ngọc Duy2c389fc2010-12-15 15:02:40[diff] [blame]75
Junio C Hamano1b0c7172006-03-30 06:55:43[diff] [blame]76#endif