blob: 8a0db80771a302a2e998f31c1ad12f67f72a2b7c (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
|
implement Names;
include "sys.m";
include "names.m";
# return name rewritten to compress /+, eliminate ., and interpret ..
cleanname(name: string): string
{
if(name == nil)
return ".";
p := rooted := name[0]=='/';
if(name[0] == '#'){ # special
if(len name < 2)
return name;
p += 2; # character after # whatever it is, is the name (including /)
for(; p < len name; p++)
if(name[p] == '/')
break;
rooted = p;
}
dotdot := rooted;
#
# invariants:
# p points at beginning of path element we're considering.
# out records up to the last path element (no trailing slash unless root or #/).
# dotdot points in out just past the point where .. cannot backtrack
# any further (no slash).
#
out := name[0:rooted];
while(p < len name){
for(q := p; p < len name && name[p] != '/'; p++){
# skip
}
n := name[q:p]; # path element
p++;
case n {
"" or "." =>
; # null effect
".." =>
if(len out > dotdot){ # can backtrack
for(q = len out; --q > dotdot && out[q] != '/';)
;
out = out[:q];
}else if(!rooted){ # /.. is / but ./../ is ..
if(out != nil)
out += "/..";
else
out += "..";
dotdot = len out;
}
* =>
if(rooted > 1 || len out > rooted)
out[len out] = '/';
out += n;
}
}
if(out == nil)
return ".";
return out;
}
dirname(name: string): string
{
for(i := len name; --i >= 0;)
if(name[i] == '/')
break;
if(i < 0)
return nil;
d := name[0:i];
if(d != nil)
return d;
if(name[0] == '/')
return "/";
return nil;
}
basename(name: string, suffix: string): string
{
for(i := len name; --i >= 0;)
if(name[i] == '/')
break;
if(i >= 0)
name = name[i+1:];
if(suffix != nil){
o := len name - len suffix;
if(o >= 0 && name[o:] == suffix)
return name[0:o];
}
return name;
}
relative(name: string, root: string): string
{
if(root == nil || name == nil)
return name;
if(isprefix(root, name)){
name = name[len root:];
while(name != nil && name[0] == '/')
name = name[1:];
}
return name;
}
rooted(root: string, name: string): string
{
if(name == nil)
return root;
if(root == nil || name[0] == '/' || name[0] == '#')
return name;
if(root[len root-1] != '/' && name[0] != '/')
return root+"/"+name;
return root+name;
}
isprefix(a: string, b: string): int
{
la := len a;
while(la > 1 && a[la-1] == '/')
a = a[0:--la];
lb := len b;
if(la > lb)
return 0;
if(la == lb)
return a == b;
return a == b[0:la] && (b[la] == '/' || a == "/");
}
elements(name: string): list of string
{
sys := load Sys Sys->PATH;
(nil, fld) := sys->tokenize(name, "/");
if(name != nil && name[0] == '/')
fld = "/" :: fld;
return fld;
}
pathname(els: list of string): string
{
name: string;
sl := els != nil && hd els == "/";
for(; els != nil; els = tl els){
if(!sl)
name += "/";
name += hd els;
sl = 0;
}
return name;
}
|
