Initial path/ implementation.
This commit is contained in:
parent
0b765481da
commit
792ee026db
2 changed files with 210 additions and 0 deletions
33
include/ipfs/path/path.h
Normal file
33
include/ipfs/path/path.h
Normal file
|
@ -0,0 +1,33 @@
|
|||
#ifndef IPFS_PATH_H
|
||||
#define IPFS_PATH_H
|
||||
|
||||
char *ErrPath[] = {
|
||||
NULL,
|
||||
// ErrBadPath is returned when a given path is incorrectly formatted
|
||||
"invalid 'ipfs ref' path",
|
||||
// Paths after a protocol must contain at least one component
|
||||
"path must contain at least one component",
|
||||
"TODO: ErrCidDecode",
|
||||
NULL,
|
||||
"no link named %s under %s"
|
||||
};
|
||||
|
||||
enum {
|
||||
ErrBadPath = 1,
|
||||
ErrNoComponents,
|
||||
ErrCidDecode,
|
||||
ErrNoLink,
|
||||
ErrNoLinkFmt
|
||||
} PathErrs;
|
||||
|
||||
char* PathFromCid (char *c);
|
||||
char** Segments (char *p);
|
||||
int SegmentsLength (char **s);
|
||||
void FreeSegments (char ***s);
|
||||
int IsJustAKey (char *p);
|
||||
int PopLastSegment (char *p, char **str);
|
||||
char *PathFromSegments(char *prefix, char **seg);
|
||||
int ParseCidToPath (char *dst, char *txt);
|
||||
int ParsePath (char *dst, char *txt);
|
||||
int PathIsValid (char *p);
|
||||
#endif // IPFS_PATH_H
|
177
path/path.c
Normal file
177
path/path.c
Normal file
|
@ -0,0 +1,177 @@
|
|||
#include <string.h>
|
||||
#include <stdlib.h>
|
||||
#include <ipfs/path/path.h>
|
||||
|
||||
// FromCid safely converts a cid.Cid type to a Path type
|
||||
char* PathFromCid (char *c)
|
||||
{
|
||||
char *rpath;
|
||||
|
||||
rpath = malloc(strlen(c) + 7);
|
||||
if (!rpath) return NULL;
|
||||
strcpy(rpath, "/ipfs/");
|
||||
strcat(rpath, c);
|
||||
return rpath;
|
||||
}
|
||||
|
||||
char** Segments (char *p)
|
||||
{
|
||||
int slash_count, i;
|
||||
char *c, **rsegs, *rbuf;
|
||||
|
||||
if (*p == '/') p++; // Ignore leading slash
|
||||
|
||||
for (c = p , slash_count = 0 ; *c ; c++) {
|
||||
if (*c == '/') slash_count++;
|
||||
}
|
||||
|
||||
if (!slash_count) return NULL;
|
||||
|
||||
rbuf = malloc(strlen(p) + 1);
|
||||
if (!rbuf) return NULL;
|
||||
|
||||
rsegs = malloc(sizeof(char*) * (slash_count + 2)); // slashs splits plus NULL pointer termination
|
||||
if (!rsegs) {
|
||||
free(rbuf);
|
||||
return NULL;
|
||||
}
|
||||
|
||||
strcpy(rbuf, p); // keep original
|
||||
for (rsegs[0] = strtok(rbuf, "/"), i = 0 ; (rsegs[i] = strtok(NULL, "/")) ; i++);
|
||||
|
||||
return rsegs;
|
||||
}
|
||||
|
||||
// Count Segments
|
||||
int SegmentsLength (char **s)
|
||||
{
|
||||
int r = 0;
|
||||
|
||||
if (!s) return 0;
|
||||
while (s[r]) r++;
|
||||
|
||||
return r;
|
||||
}
|
||||
|
||||
// free memory allocated by Segments
|
||||
void FreeSegments (char ***s)
|
||||
{
|
||||
if (*s && **s) {
|
||||
free(**s); // free string buffer
|
||||
free(*s); // free array
|
||||
*s = NULL;
|
||||
}
|
||||
}
|
||||
|
||||
// IsJustAKey returns true if the path is of the form <key> or /ipfs/<key>.
|
||||
int IsJustAKey (char *p)
|
||||
{
|
||||
char **parts;
|
||||
int ret = 0;
|
||||
parts = Segments (p);
|
||||
if (parts) {
|
||||
if (SegmentsLength (parts) == 2 && strcmp (parts[0], "ipfs") == 0) ret++;
|
||||
FreeSegments(&parts);
|
||||
}
|
||||
return ret;
|
||||
}
|
||||
|
||||
// PopLastSegment returns a new Path without its final segment, and the final
|
||||
// segment, separately. If there is no more to pop (the path is just a key),
|
||||
// the original path is returned.
|
||||
int PopLastSegment (char *p, char **str)
|
||||
{
|
||||
if (IsJustAKey(p)) return 0;
|
||||
*str = strrchr(p, '/');
|
||||
if (!*str) return -1; // error
|
||||
**str = '\0';
|
||||
*str++;
|
||||
return 0;
|
||||
}
|
||||
|
||||
char *PathFromSegments(char *prefix, char **seg)
|
||||
{
|
||||
int retlen, i;
|
||||
char *ret;
|
||||
|
||||
if (!prefix || !seg) return NULL;
|
||||
|
||||
retlen = strlen(prefix);
|
||||
for (i = 0 ; seg[i] ; i++) {
|
||||
retlen += strlen(seg[i]) + 1;
|
||||
}
|
||||
|
||||
ret = malloc(retlen + 1);
|
||||
if (!ret) return NULL;
|
||||
|
||||
strcpy(ret, prefix);
|
||||
for (i = 0 ; seg[i] ; i++) {
|
||||
strcat(ret, "/");
|
||||
strcat(ret, seg[i]);
|
||||
}
|
||||
return ret;
|
||||
}
|
||||
|
||||
int ParseCidToPath (char *dst, char *txt)
|
||||
{
|
||||
char *c, *r;
|
||||
|
||||
if (!txt || txt[0] == '\0') return ErrNoComponents;
|
||||
|
||||
c = cidDecode(txt);
|
||||
|
||||
if (!c) {
|
||||
return ErrCidDecode;
|
||||
}
|
||||
|
||||
r = PathFromCid(c);
|
||||
free(c);
|
||||
|
||||
if (!r) {
|
||||
return ErrCidDecode;
|
||||
}
|
||||
strcpy (dst, r);
|
||||
free (r);
|
||||
return 0;
|
||||
}
|
||||
|
||||
int ParsePath (char *dst, char *txt)
|
||||
{
|
||||
int err, i;
|
||||
char *c;
|
||||
|
||||
if (!txt || txt[0] == '\0') return ErrNoComponents;
|
||||
|
||||
if (*txt != '/' || strchr (txt+1, '/') == NULL) {
|
||||
if (*txt == '/') {
|
||||
txt++;
|
||||
}
|
||||
err = ParseCidToPath (dst+6, txt);
|
||||
if (err == 0) {
|
||||
memcpy (dst, "/ipfs/", 6);
|
||||
return 0;
|
||||
}
|
||||
return err;
|
||||
}
|
||||
|
||||
c = txt;
|
||||
for (i = 0 ; (c = strchr(c, '/')) ; i++) c++;
|
||||
if (i < 3) return ErrBadPath;
|
||||
|
||||
if (strcmp (txt, "/ipfs/") == 0) {
|
||||
char buf[strlen(txt+5)];
|
||||
strcpy (buf, txt+6); // copy to temp buffer.
|
||||
c = strchr(buf, '/');
|
||||
if (c) *c = '\0';
|
||||
return ParseCidToPath(dst, buf);
|
||||
} else if (strcmp (txt, "/ipns/") != 0) {
|
||||
return ErrBadPath;
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
int PathIsValid (char *p)
|
||||
{
|
||||
char buf[4096];
|
||||
return ParsePath(buf, p);
|
||||
}
|
Loading…
Reference in a new issue