|
libfossil
|
#include "internal.h"Go to the source code of this file.
Data Structures | |
| struct | fsl_vpath |
| A utility type for collecting "paths" between two checkin versions. More... | |
| struct | fsl_vpath_node |
| Holds information for a single node in a path of checkin versions. More... | |
Macros | |
| #define | fsl_vpath_empty_m {0,0,fsl_id_bag_empty_m,0,0,0,0} |
| An empty-initialize fsl_vpath object, intended for const-copy initialization. | |
Typedefs | |
| typedef struct fsl_vpath | fsl_vpath |
| typedef struct fsl_vpath_node | fsl_vpath_node |
Functions | |
| FSL_EXPORT int | fsl_compute_direct_ancestors (fsl_cx *const f, fsl_id_t rid) |
| Computes a list of direct (non-merge) ancestors of the given checkin RID and stores it in the TEMP table [ancestor], which it creates if needed or clears if it currently exists. | |
| FSL_EXPORT void | fsl_vpath_clear (fsl_vpath *path) |
| Frees all nodes in path (which must not be NULL) and resets all state in path. | |
| FSL_EXPORT fsl_vpath_node * | fsl_vpath_first (fsl_vpath *p) |
| Returns the first node in p's path. | |
| FSL_EXPORT fsl_vpath_node * | fsl_vpath_last (fsl_vpath *p) |
| Returns the last node in p's path. | |
| FSL_EXPORT int | fsl_vpath_length (fsl_vpath const *p) |
| Returns p's path length. | |
| FSL_EXPORT fsl_vpath_node * | fsl_vpath_midpoint (fsl_vpath *path) |
| Find the mid-point of the path. | |
| FSL_EXPORT fsl_vpath_node * | fsl_vpath_next (fsl_vpath_node *p) |
| Returns the next node p's path. | |
| FSL_EXPORT void | fsl_vpath_reverse (fsl_vpath *path) |
| Reconstructs path from path->pStart to path->pEnd, reversing its order by fiddling with the u->pTo fields. | |
| FSL_EXPORT int | fsl_vpath_shortest (fsl_cx *const f, fsl_vpath *const path, fsl_id_t iFrom, fsl_id_t iTo, bool directOnly, bool oneWayOnly) |
| Computes the shortest path from checkin versions iFrom to iTo (inclusive), storing the result state in path. | |
| FSL_EXPORT int | fsl_vpath_shortest_store_in_ancestor (fsl_cx *const f, fsl_id_t iFrom, fsl_id_t iTo, uint32_t *pSteps) |
| This variant of fsl_vpath_shortest() stores the shortest direct path from version iFrom to version iTo in the ANCESTOR temporary table using f's current repo db handle. | |
Variables | |
| FSL_EXPORT const fsl_vpath | fsl_vpath_empty |
| An empty-initialize fsl_vpath object, intended for copy initialization. | |
| #define fsl_vpath_empty_m {0,0,fsl_id_bag_empty_m,0,0,0,0} |
| FSL_EXPORT int fsl_compute_direct_ancestors | ( | fsl_cx *const | f, |
| fsl_id_t | rid ) |
Computes a list of direct (non-merge) ancestors of the given checkin RID and stores it in the TEMP table [ancestor], which it creates if needed or clears if it currently exists.
The [ancestor] schema is described in fsl_vpath_shortest_store_in_ancestor(). The [generation] value of the record corresponding to rid is 1, increasing by 1 for each generation back in the history.
Returns 0 on success, FSL_RC_NOT_A_REPO if f has no repo db opened, and any number of lower-level result codes if something goes wrong.
References FSL_EXPORT.
| FSL_EXPORT void fsl_vpath_clear | ( | fsl_vpath * | path | ) |
Frees all nodes in path (which must not be NULL) and resets all state in path.
Does not free path.
References FSL_EXPORT.
| FSL_EXPORT fsl_vpath_node * fsl_vpath_first | ( | fsl_vpath * | p | ) |
Returns the first node in p's path.
The returned node is owned by path may be invalidated by any APIs which manipulate path.
References FSL_EXPORT.
| FSL_EXPORT fsl_vpath_node * fsl_vpath_last | ( | fsl_vpath * | p | ) |
Returns the last node in p's path.
The returned node is owned by path may be invalidated by any APIs which manipulate path.
References FSL_EXPORT.
| FSL_EXPORT int fsl_vpath_length | ( | fsl_vpath const * | p | ) |
Returns p's path length.
References FSL_EXPORT.
| FSL_EXPORT fsl_vpath_node * fsl_vpath_midpoint | ( | fsl_vpath * | path | ) |
Find the mid-point of the path.
If the path contains fewer than 2 steps, returns 0. The returned node is owned by path and may be invalidated by any APIs which manipulate path.
References FSL_EXPORT.
| FSL_EXPORT fsl_vpath_node * fsl_vpath_next | ( | fsl_vpath_node * | p | ) |
Returns the next node p's path.
The returned node is owned by path may be invalidated by any APIs which manipulate path.
Intended to be used like this:
References FSL_EXPORT.
| FSL_EXPORT void fsl_vpath_reverse | ( | fsl_vpath * | path | ) |
Reconstructs path from path->pStart to path->pEnd, reversing its order by fiddling with the u->pTo fields.
Unfortunately does not reverse after the initial creation/reversal :/.
References FSL_EXPORT.
| FSL_EXPORT int fsl_vpath_shortest | ( | fsl_cx *const | f, |
| fsl_vpath *const | path, | ||
| fsl_id_t | iFrom, | ||
| fsl_id_t | iTo, | ||
| bool | directOnly, | ||
| bool | oneWayOnly ) |
Computes the shortest path from checkin versions iFrom to iTo (inclusive), storing the result state in path.
If path has state before this is called, it is cleared by this call.
iFrom and iTo must both be valid checkin version RIDs.
If directOnly is true, then use only the "primary" links from parent to child. In other words, ignore merges.
On success, returns 0 and path->pStart will point to the beginning of the path (the iFrom node). If pStart is 0 then no path could be found but 0 is still returned.
Elements of the path can be traversed like so:
On error, f's error state may be updated with a description of the problem.
References FSL_EXPORT.
| FSL_EXPORT int fsl_vpath_shortest_store_in_ancestor | ( | fsl_cx *const | f, |
| fsl_id_t | iFrom, | ||
| fsl_id_t | iTo, | ||
| uint32_t * | pSteps ) |
This variant of fsl_vpath_shortest() stores the shortest direct path from version iFrom to version iTo in the ANCESTOR temporary table using f's current repo db handle.
That table gets created, if needed, else cleared by this call.
The ANCESTOR temp table has the following interface:
Where [rid] is a checkin version RID and [generation] is the 1-based number of steps from iFrom, including iFrom (so iFrom's own generation is 1).
On error returns 0 and, if pSteps is not NULL, assigns *pSteps to the number of entries added to the ancestor table. On error, pSteps is never modifed, any number of various non-0 codes may be returned, and f's error state will, if possible (not an OOM), be updated to describe the problem.
This function's name is far too long and descriptive. We might want to consider something shorter.
Maintenance reminder: this impl swaps the 2nd and 3rd parameters compared to fossil(1)'s version!
References FSL_EXPORT.
| FSL_EXPORT const fsl_vpath fsl_vpath_empty |