3
* Copyright (c) 1996-2003, Darren Hiebert <dhiebert at users dot sourceforge dot net>
5
* This source code is released for the public domain.
7
* This file defines the public interface for looking up tag entries in tag
10
* The functions defined in this interface are intended to provide tag file
11
* support to a software tool. The tag lookups provided are sufficiently fast
12
* enough to permit opening a sorted tag file, searching for a matching tag,
13
* then closing the tag file each time a tag is looked up (search times are
14
* on the order of hundreths of a second, even for huge tag files). This is
15
* the recommended use of this library for most tool applications. Adhering
16
* to this approach permits a user to regenerate a tag file at will without
17
* the tool needing to detect and resynchronize with changes to the tag file.
18
* Even for an unsorted 24MB tag file, tag searches take about one second.
31
/* Options for tagsSetSortType() */
33
TAG_UNSORTED, TAG_SORTED, TAG_FOLDSORTED
36
/* Options for tagsFind() */
37
#define TAG_FULLMATCH 0x0
38
#define TAG_PARTIALMATCH 0x1
40
#define TAG_OBSERVECASE 0x0
41
#define TAG_IGNORECASE 0x2
47
typedef enum { TagFailure = 0, TagSuccess = 1 } tagResult;
51
typedef struct sTagFile tagFile;
53
/* This structure contains information about the tag file. */
57
/* was the tag file successfully opened? */
60
/* errno value when 'opened' is false */
64
/* information about the structure of the tag file */
66
/* format of tag file (1 = original, 2 = extended) */
69
/* how is the tag file sorted? */
74
/* information about the program which created this tag file */
76
/* name of author of generating program (may be null) */
79
/* name of program (may be null) */
82
/* URL of distribution (may be null) */
85
/* program version (may be null) */
91
/* This structure contains information about an extension field for a tag.
92
* These exist at the end of the tag in the form "key:value").
96
/* the key of the extension field */
99
/* the value of the extension field (may be an empty string) */
104
/* This structure contains information about a specific tag. */
110
/* path of source file containing definition of tag */
113
/* address for locating tag in source file */
115
/* pattern for locating source line
116
* (may be NULL if not present) */
119
/* line number in source file of tag definition
120
* (may be zero if not known) */
121
unsigned long lineNumber;
124
/* kind of tag (may by name, character, or NULL if not known) */
127
/* is tag of file-limited scope? */
130
/* miscellaneous extension fields */
132
/* number of entries in `list' */
133
unsigned short count;
135
/* list of key value pairs */
136
tagExtensionField *list;
143
* FUNCTION PROTOTYPES
147
* This function must be called before calling other functions in this
148
* library. It is passed the path to the tag file to read and a (possibly
149
* null) pointer to a structure which, if not null, will be populated with
150
* information about the tag file. If successful, the function will return a
151
* handle which must be supplied to other calls to read information from the
152
* tag file, and info.status.opened will be set to true. If unsuccessful,
153
* info.status.opened will be set to false and info.status.error_number will
154
* be set to the errno value representing the system error preventing the tag
155
* file from being successfully opened.
157
extern tagFile *tagsOpen (const char *const filePath, tagFileInfo *const info);
160
* This function allows the client to override the normal automatic detection
161
* of how a tag file is sorted. Permissible values for `type' are
162
* TAG_UNSORTED, TAG_SORTED, TAG_FOLDSORTED. Tag files in the new extended
163
* format contain a key indicating whether or not they are sorted. However,
164
* tag files in the original format do not contain such a key even when
165
* sorted, preventing this library from taking advantage of fast binary
166
* lookups. If the client knows that such an unmarked tag file is indeed
167
* sorted (or not), it can override the automatic detection. Note that
168
* incorrect lookup results will result if a tag file is marked as sorted when
169
* it actually is not. The function will return TagSuccess if called on an
170
* open tag file or TagFailure if not.
172
extern tagResult tagsSetSortType (tagFile *const file, const sortType type);
175
* Reads the first tag in the file, if any. It is passed the handle to an
176
* opened tag file and a (possibly null) pointer to a structure which, if not
177
* null, will be populated with information about the first tag file entry.
178
* The function will return TagSuccess another tag entry is found, or
179
* TagFailure if not (i.e. it reached end of file).
181
extern tagResult tagsFirst (tagFile *const file, tagEntry *const entry);
184
* Step to the next tag in the file, if any. It is passed the handle to an
185
* opened tag file and a (possibly null) pointer to a structure which, if not
186
* null, will be populated with information about the next tag file entry. The
187
* function will return TagSuccess another tag entry is found, or TagFailure
188
* if not (i.e. it reached end of file). It will always read the first tag in
189
* the file immediately after calling tagsOpen().
191
extern tagResult tagsNext (tagFile *const file, tagEntry *const entry);
194
* Retrieve the value associated with the extension field for a specified key.
195
* It is passed a pointer to a structure already populated with values by a
196
* previous call to tagsNext(), tagsFind(), or tagsFindNext(), and a string
197
* containing the key of the desired extension field. If no such field of the
198
* specified key exists, the function will return null.
200
extern const char *tagsField (const tagEntry *const entry, const char *const key);
203
* Find the first tag matching `name'. The structure pointed to by `entry'
204
* will be populated with information about the tag file entry. If a tag file
205
* is sorted using the C locale, a binary search algorithm is used to search
206
* the tag file, resulting in very fast tag lookups, even in huge tag files.
207
* Various options controlling the matches can be combined by bit-wise or-ing
208
* certain values together. The available values are:
211
* Tags whose leading characters match `name' will qualify.
214
* Only tags whose full lengths match `name' will qualify.
217
* Matching will be performed in a case-insenstive manner. Note that
218
* this disables binary searches of the tag file.
221
* Matching will be performed in a case-senstive manner. Note that
222
* this enables binary searches of the tag file.
224
* The function will return TagSuccess if a tag matching the name is found, or
227
extern tagResult tagsFind (tagFile *const file, tagEntry *const entry, const char *const name, const int options);
230
* Find the next tag matching the name and options supplied to the most recent
231
* call to tagsFind() for the same tag file. The structure pointed to by
232
* `entry' will be populated with information about the tag file entry. The
233
* function will return TagSuccess if another tag matching the name is found,
234
* or TagFailure if not.
236
extern tagResult tagsFindNext (tagFile *const file, tagEntry *const entry);
239
* Call tagsTerminate() at completion of reading the tag file, which will
240
* close the file and free any internal memory allocated. The function will
241
* return TagFailure is no file is currently open, TagSuccess otherwise.
243
extern tagResult tagsClose (tagFile *const file);
251
/* vi:set tabstop=8 shiftwidth=4: */