51356517a9
* fix compiler errors when using self-hosted * move parameters into builder struct * simplify code when using self hosted * fix stage2 error `cast discards const qualifier` * correctly return after finding method * fix position context tests on self hosted * remove unnecessary comptime in position context tests
130 lines
4.2 KiB
Zig
130 lines
4.2 KiB
Zig
const std = @import("std");
|
|
const builtin = @import("builtin");
|
|
|
|
// http://tools.ietf.org/html/rfc3986#section-2.2
|
|
const reserved_chars = &[_]u8{
|
|
'!', '#', '$', '%', '&', '\'',
|
|
'(', ')', '*', '+', ',', ':',
|
|
';', '=', '?', '@', '[', ']',
|
|
};
|
|
|
|
const reserved_escapes = blk: {
|
|
var escapes: [reserved_chars.len][3]u8 = [_][3]u8{[_]u8{undefined} ** 3} ** reserved_chars.len;
|
|
|
|
for (reserved_chars) |c, i| {
|
|
escapes[i][0] = '%';
|
|
_ = std.fmt.bufPrint(escapes[i][1..], "{X}", .{c}) catch unreachable;
|
|
}
|
|
break :blk &escapes;
|
|
};
|
|
|
|
/// Returns a URI from a path, caller owns the memory allocated with `allocator`
|
|
pub fn fromPath(allocator: std.mem.Allocator, path: []const u8) ![]const u8 {
|
|
if (path.len == 0) return "";
|
|
const prefix = if (builtin.os.tag == .windows) "file:///" else "file://";
|
|
|
|
var buf = std.ArrayListUnmanaged(u8){};
|
|
errdefer buf.deinit(allocator);
|
|
|
|
try buf.appendSlice(allocator, prefix);
|
|
|
|
for (path) |char| {
|
|
if (char == std.fs.path.sep) {
|
|
try buf.append(allocator, '/');
|
|
} else if (std.mem.indexOfScalar(u8, reserved_chars, char)) |reserved| {
|
|
try buf.appendSlice(allocator, &reserved_escapes[reserved]);
|
|
} else {
|
|
try buf.append(allocator, char);
|
|
}
|
|
}
|
|
|
|
// On windows, we need to lowercase the drive name.
|
|
if (builtin.os.tag == .windows) {
|
|
if (buf.items.len > prefix.len + 1 and
|
|
std.ascii.isAlpha(buf.items[prefix.len]) and
|
|
std.mem.startsWith(u8, buf.items[prefix.len + 1 ..], "%3A"))
|
|
{
|
|
buf.items[prefix.len] = std.ascii.toLower(buf.items[prefix.len]);
|
|
}
|
|
}
|
|
|
|
return buf.toOwnedSlice(allocator);
|
|
}
|
|
|
|
/// Move along `rel` from `base` with a single allocation.
|
|
/// `base` is a URI of a folder, `rel` is a raw relative path.
|
|
pub fn pathRelative(allocator: std.mem.Allocator, base: []const u8, rel: []const u8) error{ OutOfMemory, UriBadScheme }![]const u8 {
|
|
const max_size = base.len + rel.len * 3 + 1;
|
|
|
|
var result = try std.ArrayListUnmanaged(u8).initCapacity(allocator, max_size);
|
|
errdefer result.deinit(allocator);
|
|
|
|
result.appendSliceAssumeCapacity(base);
|
|
|
|
var it = std.mem.tokenize(u8, rel, "/");
|
|
while (it.next()) |component| {
|
|
if (std.mem.eql(u8, component, ".")) {
|
|
continue;
|
|
} else if (std.mem.eql(u8, component, "..")) {
|
|
while (true) {
|
|
const char = result.popOrNull() orelse return error.UriBadScheme;
|
|
if (char == '/') break;
|
|
}
|
|
} else {
|
|
result.appendAssumeCapacity('/');
|
|
for (component) |char| {
|
|
if (std.mem.indexOfScalar(u8, reserved_chars, char)) |reserved| {
|
|
const escape = &reserved_escapes[reserved];
|
|
result.appendSliceAssumeCapacity(escape);
|
|
} else {
|
|
result.appendAssumeCapacity(char);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
return result.toOwnedSlice(allocator);
|
|
}
|
|
|
|
// Original code: https://github.com/andersfr/zig-lsp/blob/master/uri.zig
|
|
fn parseHex(c: u8) !u8 {
|
|
return switch (c) {
|
|
'0'...'9' => c - '0',
|
|
'a'...'f' => c - 'a' + 10,
|
|
'A'...'F' => c - 'A' + 10,
|
|
else => return error.UriBadHexChar,
|
|
};
|
|
}
|
|
|
|
/// Caller should free memory
|
|
pub fn parse(allocator: std.mem.Allocator, str: []const u8) ![]u8 {
|
|
if (str.len < 7 or !std.mem.eql(u8, "file://", str[0..7])) return error.UriBadScheme;
|
|
|
|
const uri = try allocator.alloc(u8, str.len - (if (std.fs.path.sep == '\\') 8 else 7));
|
|
errdefer allocator.free(uri);
|
|
|
|
const path = if (std.fs.path.sep == '\\') str[8..] else str[7..];
|
|
|
|
var i: usize = 0;
|
|
var j: usize = 0;
|
|
while (j < path.len) : (i += 1) {
|
|
if (path[j] == '%') {
|
|
if (j + 2 >= path.len) return error.UriBadEscape;
|
|
const upper = try parseHex(path[j + 1]);
|
|
const lower = try parseHex(path[j + 2]);
|
|
uri[i] = (upper << 4) + lower;
|
|
j += 3;
|
|
} else {
|
|
uri[i] = if (path[j] == '/') std.fs.path.sep else path[j];
|
|
j += 1;
|
|
}
|
|
}
|
|
|
|
// Remove trailing separator
|
|
if (i > 0 and uri[i - 1] == std.fs.path.sep) {
|
|
i -= 1;
|
|
}
|
|
|
|
return allocator.shrink(uri, i);
|
|
}
|