2019-03-02 21:46:04 +00:00
|
|
|
const std = @import("std.zig");
|
2018-04-09 04:52:45 +00:00
|
|
|
const builtin = @import("builtin");
|
2017-12-24 03:08:53 +00:00
|
|
|
const assert = std.debug.assert;
|
2018-09-13 20:34:33 +00:00
|
|
|
const net = @This();
|
2018-03-07 08:55:52 +00:00
|
|
|
const mem = std.mem;
|
2019-05-25 17:07:44 +00:00
|
|
|
const os = std.os;
|
2019-10-29 06:19:22 +00:00
|
|
|
const fs = std.fs;
|
2018-03-07 08:55:52 +00:00
|
|
|
|
2019-10-30 02:59:30 +00:00
|
|
|
test "" {
|
|
|
|
_ = @import("net/test.zig");
|
|
|
|
}
|
|
|
|
|
2018-11-13 13:08:37 +00:00
|
|
|
pub const TmpWinAddr = struct {
|
2018-04-09 04:52:45 +00:00
|
|
|
family: u8,
|
|
|
|
data: [14]u8,
|
|
|
|
};
|
|
|
|
|
|
|
|
pub const OsAddress = switch (builtin.os) {
|
2019-10-26 19:05:42 +00:00
|
|
|
.windows => TmpWinAddr,
|
2019-05-25 17:07:44 +00:00
|
|
|
else => os.sockaddr,
|
2018-04-09 04:52:45 +00:00
|
|
|
};
|
|
|
|
|
2019-10-26 19:05:42 +00:00
|
|
|
/// This data structure is a "view". The underlying data might have references
|
|
|
|
/// to owned memory which must live longer than this struct.
|
2018-11-13 13:08:37 +00:00
|
|
|
pub const Address = struct {
|
2018-04-09 04:52:45 +00:00
|
|
|
os_addr: OsAddress,
|
2018-03-07 08:55:52 +00:00
|
|
|
|
2019-10-30 02:59:30 +00:00
|
|
|
// TODO this crashed the compiler
|
|
|
|
//pub const localhost = initIp4(parseIp4("127.0.0.1") catch unreachable, 0);
|
|
|
|
|
2018-11-08 01:53:23 +00:00
|
|
|
pub fn initIp4(ip4: u32, _port: u16) Address {
|
2018-11-13 13:08:37 +00:00
|
|
|
return Address{
|
2019-05-25 17:07:44 +00:00
|
|
|
.os_addr = os.sockaddr{
|
|
|
|
.in = os.sockaddr_in{
|
|
|
|
.family = os.AF_INET,
|
2018-12-13 01:19:46 +00:00
|
|
|
.port = mem.nativeToBig(u16, _port),
|
2018-05-29 00:23:55 +00:00
|
|
|
.addr = ip4,
|
2019-06-09 23:24:24 +00:00
|
|
|
.zero = [_]u8{0} ** 8,
|
2018-05-29 00:23:55 +00:00
|
|
|
},
|
|
|
|
},
|
|
|
|
};
|
2016-05-13 16:23:03 +00:00
|
|
|
}
|
|
|
|
|
2019-10-26 19:05:42 +00:00
|
|
|
pub fn initIp6(ip6: Ip6Addr, _port: u16) Address {
|
2018-11-13 13:08:37 +00:00
|
|
|
return Address{
|
2019-05-25 17:07:44 +00:00
|
|
|
.os_addr = os.sockaddr{
|
|
|
|
.in6 = os.sockaddr_in6{
|
|
|
|
.family = os.AF_INET6,
|
2018-12-13 01:19:46 +00:00
|
|
|
.port = mem.nativeToBig(u16, _port),
|
2018-05-29 00:23:55 +00:00
|
|
|
.flowinfo = 0,
|
|
|
|
.addr = ip6.addr,
|
|
|
|
.scope_id = ip6.scope_id,
|
|
|
|
},
|
|
|
|
},
|
2018-03-07 08:55:52 +00:00
|
|
|
};
|
2016-05-13 16:23:03 +00:00
|
|
|
}
|
|
|
|
|
2018-11-08 01:53:23 +00:00
|
|
|
pub fn port(self: Address) u16 {
|
2018-12-13 01:19:46 +00:00
|
|
|
return mem.bigToNative(u16, self.os_addr.in.port);
|
2018-11-08 01:53:23 +00:00
|
|
|
}
|
|
|
|
|
2019-05-25 17:07:44 +00:00
|
|
|
pub fn initPosix(addr: os.sockaddr) Address {
|
2018-11-13 13:08:37 +00:00
|
|
|
return Address{ .os_addr = addr };
|
2018-04-09 00:08:40 +00:00
|
|
|
}
|
|
|
|
|
2019-10-26 19:05:42 +00:00
|
|
|
pub fn format(
|
|
|
|
self: Address,
|
|
|
|
comptime fmt: []const u8,
|
|
|
|
options: std.fmt.FormatOptions,
|
|
|
|
context: var,
|
|
|
|
comptime Errors: type,
|
|
|
|
output: fn (@typeOf(context), []const u8) Errors!void,
|
|
|
|
) !void {
|
2018-04-09 04:52:45 +00:00
|
|
|
switch (self.os_addr.in.family) {
|
2019-05-25 17:07:44 +00:00
|
|
|
os.AF_INET => {
|
2018-12-13 01:19:46 +00:00
|
|
|
const native_endian_port = mem.bigToNative(u16, self.os_addr.in.port);
|
2019-10-26 19:05:42 +00:00
|
|
|
const bytes = @ptrCast(*const [4]u8, &self.os_addr.in.addr);
|
|
|
|
try std.fmt.format(
|
|
|
|
context,
|
|
|
|
Errors,
|
|
|
|
output,
|
|
|
|
"{}.{}.{}.{}:{}",
|
|
|
|
bytes[0],
|
|
|
|
bytes[1],
|
|
|
|
bytes[2],
|
|
|
|
bytes[3],
|
|
|
|
native_endian_port,
|
|
|
|
);
|
2018-03-07 08:55:52 +00:00
|
|
|
},
|
2019-05-25 17:07:44 +00:00
|
|
|
os.AF_INET6 => {
|
2019-10-26 19:05:42 +00:00
|
|
|
const ZeroRun = struct {
|
|
|
|
index: usize,
|
|
|
|
count: usize,
|
|
|
|
};
|
2018-12-13 01:19:46 +00:00
|
|
|
const native_endian_port = mem.bigToNative(u16, self.os_addr.in6.port);
|
2019-10-27 00:00:55 +00:00
|
|
|
const big_endian_parts = @ptrCast(*align(1) const [8]u16, &self.os_addr.in6.addr);
|
2019-10-26 19:05:42 +00:00
|
|
|
const native_endian_parts = switch (builtin.endian) {
|
2019-10-27 00:00:55 +00:00
|
|
|
.Big => big_endian_parts.*,
|
2019-10-26 19:05:42 +00:00
|
|
|
.Little => blk: {
|
|
|
|
var buf: [8]u16 = undefined;
|
|
|
|
for (big_endian_parts) |part, i| {
|
|
|
|
buf[i] = mem.bigToNative(u16, part);
|
|
|
|
}
|
|
|
|
break :blk buf;
|
|
|
|
},
|
|
|
|
};
|
|
|
|
|
|
|
|
var longest_zero_run: ?ZeroRun = null;
|
|
|
|
var this_zero_run: ?ZeroRun = null;
|
|
|
|
for (native_endian_parts) |part, i| {
|
|
|
|
if (part == 0) {
|
|
|
|
if (this_zero_run) |*zr| {
|
|
|
|
zr.count += 1;
|
|
|
|
} else {
|
|
|
|
this_zero_run = ZeroRun{
|
|
|
|
.index = i,
|
|
|
|
.count = 1,
|
|
|
|
};
|
|
|
|
}
|
|
|
|
} else if (this_zero_run) |zr| {
|
|
|
|
if (longest_zero_run) |lzr| {
|
|
|
|
if (zr.count > lzr.count and zr.count > 1) {
|
|
|
|
longest_zero_run = zr;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
longest_zero_run = zr;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
try output(context, "[");
|
|
|
|
var i: usize = 0;
|
|
|
|
while (i < native_endian_parts.len) {
|
|
|
|
if (i != 0) try output(context, ":");
|
|
|
|
|
|
|
|
if (longest_zero_run) |lzr| {
|
|
|
|
if (lzr.index == i) {
|
|
|
|
i += lzr.count;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
const part = native_endian_parts[i];
|
|
|
|
try std.fmt.format(context, Errors, output, "{x}", part);
|
|
|
|
i += 1;
|
|
|
|
}
|
|
|
|
try std.fmt.format(context, Errors, output, "]:{}", native_endian_port);
|
2018-03-07 08:55:52 +00:00
|
|
|
},
|
2019-10-26 19:05:42 +00:00
|
|
|
else => return output(context, "(unrecognized address family)"),
|
2016-05-04 21:52:15 +00:00
|
|
|
}
|
|
|
|
}
|
2019-10-30 02:59:30 +00:00
|
|
|
|
|
|
|
fn getOsSockLen(self: Address) os.socklen_t {
|
|
|
|
switch (self.os_addr.un.family) {
|
|
|
|
os.AF_INET => return @sizeOf(os.sockaddr_in),
|
|
|
|
os.AF_INET6 => return @sizeOf(os.sockaddr_in6),
|
|
|
|
else => unreachable,
|
|
|
|
}
|
|
|
|
}
|
2016-12-19 00:40:26 +00:00
|
|
|
};
|
2016-05-04 21:52:15 +00:00
|
|
|
|
2018-03-07 08:55:52 +00:00
|
|
|
pub fn parseIp4(buf: []const u8) !u32 {
|
|
|
|
var result: u32 = undefined;
|
2018-06-18 21:25:29 +00:00
|
|
|
const out_ptr = @sliceToBytes((*[1]u32)(&result)[0..]);
|
2016-05-04 21:52:15 +00:00
|
|
|
|
2018-03-07 08:55:52 +00:00
|
|
|
var x: u8 = 0;
|
|
|
|
var index: u8 = 0;
|
|
|
|
var saw_any_digits = false;
|
|
|
|
for (buf) |c| {
|
|
|
|
if (c == '.') {
|
|
|
|
if (!saw_any_digits) {
|
|
|
|
return error.InvalidCharacter;
|
|
|
|
}
|
|
|
|
if (index == 3) {
|
|
|
|
return error.InvalidEnd;
|
|
|
|
}
|
|
|
|
out_ptr[index] = x;
|
|
|
|
index += 1;
|
|
|
|
x = 0;
|
|
|
|
saw_any_digits = false;
|
|
|
|
} else if (c >= '0' and c <= '9') {
|
|
|
|
saw_any_digits = true;
|
2019-10-27 00:00:55 +00:00
|
|
|
x = try std.math.mul(u8, x, 10);
|
|
|
|
x = try std.math.add(u8, x, c - '0');
|
2018-03-07 08:55:52 +00:00
|
|
|
} else {
|
|
|
|
return error.InvalidCharacter;
|
2018-05-10 04:29:49 +00:00
|
|
|
}
|
2016-05-04 21:52:15 +00:00
|
|
|
}
|
2018-03-07 08:55:52 +00:00
|
|
|
if (index == 3 and saw_any_digits) {
|
|
|
|
out_ptr[index] = x;
|
|
|
|
return result;
|
2016-05-04 21:52:15 +00:00
|
|
|
}
|
|
|
|
|
2018-03-07 08:55:52 +00:00
|
|
|
return error.Incomplete;
|
2016-05-10 22:00:59 +00:00
|
|
|
}
|
|
|
|
|
2018-11-13 13:08:37 +00:00
|
|
|
pub const Ip6Addr = struct {
|
2018-03-07 08:55:52 +00:00
|
|
|
scope_id: u32,
|
2019-10-27 00:00:55 +00:00
|
|
|
addr: [16]u8,
|
2018-03-07 08:55:52 +00:00
|
|
|
};
|
2016-05-10 22:00:59 +00:00
|
|
|
|
2018-03-07 08:55:52 +00:00
|
|
|
pub fn parseIp6(buf: []const u8) !Ip6Addr {
|
|
|
|
var result: Ip6Addr = undefined;
|
2016-05-10 22:00:59 +00:00
|
|
|
result.scope_id = 0;
|
2019-10-27 00:00:55 +00:00
|
|
|
const ip_slice = result.addr[0..];
|
2016-05-10 22:00:59 +00:00
|
|
|
|
|
|
|
var x: u16 = 0;
|
|
|
|
var saw_any_digits = false;
|
|
|
|
var index: u8 = 0;
|
|
|
|
var scope_id = false;
|
|
|
|
for (buf) |c| {
|
|
|
|
if (scope_id) {
|
2017-03-26 09:21:28 +00:00
|
|
|
if (c >= '0' and c <= '9') {
|
2016-05-10 22:00:59 +00:00
|
|
|
const digit = c - '0';
|
2016-08-17 05:42:50 +00:00
|
|
|
if (@mulWithOverflow(u32, result.scope_id, 10, &result.scope_id)) {
|
2016-05-10 22:00:59 +00:00
|
|
|
return error.Overflow;
|
|
|
|
}
|
2016-08-17 05:42:50 +00:00
|
|
|
if (@addWithOverflow(u32, result.scope_id, digit, &result.scope_id)) {
|
2016-05-10 22:00:59 +00:00
|
|
|
return error.Overflow;
|
|
|
|
}
|
|
|
|
} else {
|
2018-03-07 08:55:52 +00:00
|
|
|
return error.InvalidCharacter;
|
2016-05-10 22:00:59 +00:00
|
|
|
}
|
|
|
|
} else if (c == ':') {
|
|
|
|
if (!saw_any_digits) {
|
2018-03-07 08:55:52 +00:00
|
|
|
return error.InvalidCharacter;
|
2016-05-10 22:00:59 +00:00
|
|
|
}
|
|
|
|
if (index == 14) {
|
2018-03-07 08:55:52 +00:00
|
|
|
return error.InvalidEnd;
|
2016-05-10 22:00:59 +00:00
|
|
|
}
|
|
|
|
ip_slice[index] = @truncate(u8, x >> 8);
|
|
|
|
index += 1;
|
|
|
|
ip_slice[index] = @truncate(u8, x);
|
|
|
|
index += 1;
|
|
|
|
|
|
|
|
x = 0;
|
|
|
|
saw_any_digits = false;
|
|
|
|
} else if (c == '%') {
|
|
|
|
if (!saw_any_digits) {
|
2018-03-07 08:55:52 +00:00
|
|
|
return error.InvalidCharacter;
|
2016-05-10 22:00:59 +00:00
|
|
|
}
|
|
|
|
if (index == 14) {
|
|
|
|
ip_slice[index] = @truncate(u8, x >> 8);
|
|
|
|
index += 1;
|
|
|
|
ip_slice[index] = @truncate(u8, x);
|
|
|
|
index += 1;
|
|
|
|
}
|
|
|
|
scope_id = true;
|
|
|
|
saw_any_digits = false;
|
|
|
|
} else {
|
2018-03-07 08:55:52 +00:00
|
|
|
const digit = try std.fmt.charToDigit(c, 16);
|
2016-08-17 05:42:50 +00:00
|
|
|
if (@mulWithOverflow(u16, x, 16, &x)) {
|
2016-05-10 22:00:59 +00:00
|
|
|
return error.Overflow;
|
|
|
|
}
|
2016-08-17 05:42:50 +00:00
|
|
|
if (@addWithOverflow(u16, x, digit, &x)) {
|
2016-05-10 22:00:59 +00:00
|
|
|
return error.Overflow;
|
|
|
|
}
|
|
|
|
saw_any_digits = true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!saw_any_digits) {
|
|
|
|
return error.Incomplete;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (scope_id) {
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (index == 14) {
|
|
|
|
ip_slice[14] = @truncate(u8, x >> 8);
|
|
|
|
ip_slice[15] = @truncate(u8, x);
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
return error.Incomplete;
|
|
|
|
}
|
|
|
|
|
2019-10-29 06:19:22 +00:00
|
|
|
pub fn connectUnixSocket(path: []const u8) !fs.File {
|
2019-10-30 02:59:30 +00:00
|
|
|
const opt_non_block = if (std.io.mode == .evented) os.SOCK_NONBLOCK else 0;
|
2019-08-17 01:29:29 +00:00
|
|
|
const sockfd = try os.socket(
|
|
|
|
os.AF_UNIX,
|
|
|
|
os.SOCK_STREAM | os.SOCK_CLOEXEC | opt_non_block,
|
|
|
|
0,
|
|
|
|
);
|
|
|
|
errdefer os.close(sockfd);
|
|
|
|
|
|
|
|
var sock_addr = os.sockaddr{
|
|
|
|
.un = os.sockaddr_un{
|
|
|
|
.family = os.AF_UNIX,
|
|
|
|
.path = undefined,
|
|
|
|
},
|
|
|
|
};
|
|
|
|
|
|
|
|
if (path.len > @typeOf(sock_addr.un.path).len) return error.NameTooLong;
|
|
|
|
mem.copy(u8, sock_addr.un.path[0..], path);
|
|
|
|
const size = @intCast(u32, @sizeOf(os.sa_family_t) + path.len);
|
2019-10-30 02:59:30 +00:00
|
|
|
try os.connect(sockfd, &sock_addr, size);
|
2019-08-17 01:29:29 +00:00
|
|
|
|
2019-10-29 06:19:22 +00:00
|
|
|
return fs.File.openHandle(sockfd);
|
2019-08-17 01:29:29 +00:00
|
|
|
}
|
2019-10-26 19:05:42 +00:00
|
|
|
|
|
|
|
pub const AddressList = struct {
|
|
|
|
arena: std.heap.ArenaAllocator,
|
|
|
|
addrs: []Address,
|
2019-10-27 00:00:55 +00:00
|
|
|
canon_name: ?[]u8,
|
2019-10-26 19:05:42 +00:00
|
|
|
|
|
|
|
fn deinit(self: *AddressList) void {
|
|
|
|
// Here we copy the arena allocator into stack memory, because
|
|
|
|
// otherwise it would destroy itself while it was still working.
|
|
|
|
var arena = self.arena;
|
|
|
|
arena.deinit();
|
|
|
|
// self is destroyed
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2019-10-30 02:59:30 +00:00
|
|
|
/// All memory allocated with `allocator` will be freed before this function returns.
|
|
|
|
pub fn tcpConnectToHost(allocator: *mem.Allocator, name: []const u8, port: u16) !fs.File {
|
|
|
|
const list = getAddressList(allocator, name, port);
|
|
|
|
defer list.deinit();
|
|
|
|
|
|
|
|
const addrs = list.addrs.toSliceConst();
|
|
|
|
if (addrs.len == 0) return error.UnknownHostName;
|
|
|
|
|
|
|
|
return tcpConnectToAddress(addrs[0], port);
|
|
|
|
}
|
|
|
|
|
|
|
|
pub fn tcpConnectToAddress(address: Address) !fs.File {
|
|
|
|
const nonblock = if (std.io.is_async) os.SOCK_NONBLOCK else 0;
|
|
|
|
const sock_flags = os.SOCK_STREAM | os.SOCK_CLOEXEC | nonblock;
|
|
|
|
const sockfd = try os.socket(address.os_addr.un.family, sock_flags, os.IPPROTO_TCP);
|
|
|
|
errdefer os.close(sockfd);
|
|
|
|
try os.connect(sockfd, address.os_addr, address.getOsSockLen());
|
|
|
|
|
|
|
|
return fs.File{ .handle = sockfd };
|
|
|
|
}
|
|
|
|
|
2019-10-26 19:05:42 +00:00
|
|
|
/// Call `AddressList.deinit` on the result.
|
|
|
|
pub fn getAddressList(allocator: *mem.Allocator, name: []const u8, port: u16) !*AddressList {
|
2019-10-27 00:00:55 +00:00
|
|
|
const result = blk: {
|
|
|
|
var arena = std.heap.ArenaAllocator.init(allocator);
|
|
|
|
errdefer arena.deinit();
|
|
|
|
|
|
|
|
const result = try arena.allocator.create(AddressList);
|
|
|
|
result.* = AddressList{
|
|
|
|
.arena = arena,
|
|
|
|
.addrs = undefined,
|
|
|
|
.canon_name = null,
|
|
|
|
};
|
|
|
|
break :blk result;
|
|
|
|
};
|
|
|
|
const arena = &result.arena.allocator;
|
|
|
|
errdefer result.arena.deinit();
|
|
|
|
|
2019-10-26 19:05:42 +00:00
|
|
|
if (builtin.link_libc) {
|
2019-10-27 21:31:49 +00:00
|
|
|
const c = std.c;
|
2019-10-27 00:00:55 +00:00
|
|
|
const name_c = try std.cstr.addNullByte(allocator, name);
|
|
|
|
defer allocator.free(name_c);
|
|
|
|
|
|
|
|
const port_c = try std.fmt.allocPrint(allocator, "{}\x00", port);
|
|
|
|
defer allocator.free(port_c);
|
|
|
|
|
2019-10-26 19:05:42 +00:00
|
|
|
const hints = os.addrinfo{
|
2019-10-27 21:31:49 +00:00
|
|
|
.flags = c.AI_NUMERICSERV,
|
2019-10-29 20:10:14 +00:00
|
|
|
.family = os.AF_UNSPEC,
|
2019-10-26 19:05:42 +00:00
|
|
|
.socktype = os.SOCK_STREAM,
|
|
|
|
.protocol = os.IPPROTO_TCP,
|
|
|
|
.canonname = null,
|
|
|
|
.addr = null,
|
|
|
|
.addrlen = 0,
|
|
|
|
.next = null,
|
|
|
|
};
|
|
|
|
var res: *os.addrinfo = undefined;
|
|
|
|
switch (os.system.getaddrinfo(name_c.ptr, port_c.ptr, &hints, &res)) {
|
|
|
|
0 => {},
|
2019-10-27 21:31:49 +00:00
|
|
|
c.EAI_ADDRFAMILY => return error.HostLacksNetworkAddresses,
|
|
|
|
c.EAI_AGAIN => return error.TemporaryNameServerFailure,
|
|
|
|
c.EAI_BADFLAGS => unreachable, // Invalid hints
|
|
|
|
c.EAI_FAIL => return error.NameServerFailure,
|
|
|
|
c.EAI_FAMILY => return error.AddressFamilyNotSupported,
|
|
|
|
c.EAI_MEMORY => return error.OutOfMemory,
|
|
|
|
c.EAI_NODATA => return error.HostLacksNetworkAddresses,
|
2019-10-30 02:59:30 +00:00
|
|
|
c.EAI_NONAME => return error.UnknownHostName,
|
2019-10-27 21:31:49 +00:00
|
|
|
c.EAI_SERVICE => return error.ServiceUnavailable,
|
|
|
|
c.EAI_SOCKTYPE => unreachable, // Invalid socket type requested in hints
|
|
|
|
c.EAI_SYSTEM => switch (os.errno(-1)) {
|
2019-10-26 19:05:42 +00:00
|
|
|
else => |e| return os.unexpectedErrno(e),
|
|
|
|
},
|
|
|
|
else => unreachable,
|
|
|
|
}
|
|
|
|
defer os.system.freeaddrinfo(res);
|
|
|
|
|
|
|
|
const addr_count = blk: {
|
|
|
|
var count: usize = 0;
|
|
|
|
var it: ?*os.addrinfo = res;
|
|
|
|
while (it) |info| : (it = info.next) {
|
|
|
|
if (info.addr != null) {
|
|
|
|
count += 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
break :blk count;
|
|
|
|
};
|
|
|
|
result.addrs = try arena.alloc(Address, addr_count);
|
|
|
|
|
|
|
|
var it: ?*os.addrinfo = res;
|
|
|
|
var i: usize = 0;
|
|
|
|
while (it) |info| : (it = info.next) {
|
|
|
|
const addr = info.addr orelse continue;
|
2019-10-27 00:00:55 +00:00
|
|
|
result.addrs[i] = Address.initPosix(addr.*);
|
2019-10-26 19:05:42 +00:00
|
|
|
|
|
|
|
if (info.canonname) |n| {
|
2019-10-27 00:00:55 +00:00
|
|
|
if (result.canon_name == null) {
|
|
|
|
result.canon_name = try mem.dupe(arena, u8, mem.toSliceConst(u8, n));
|
|
|
|
}
|
2019-10-26 19:05:42 +00:00
|
|
|
}
|
|
|
|
i += 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
return result;
|
|
|
|
}
|
2019-10-27 00:00:55 +00:00
|
|
|
if (builtin.os == .linux) {
|
2019-10-29 06:19:22 +00:00
|
|
|
const flags = std.c.AI_NUMERICSERV;
|
2019-10-29 20:10:14 +00:00
|
|
|
const family = os.AF_UNSPEC;
|
2019-10-29 06:19:22 +00:00
|
|
|
var addrs = std.ArrayList(LookupAddr).init(allocator);
|
|
|
|
defer addrs.deinit();
|
2019-10-27 00:00:55 +00:00
|
|
|
|
2019-10-29 20:10:14 +00:00
|
|
|
var canon = std.Buffer.initNull(arena);
|
2019-10-29 06:19:22 +00:00
|
|
|
defer canon.deinit();
|
2019-10-27 00:00:55 +00:00
|
|
|
|
2019-10-29 06:19:22 +00:00
|
|
|
try linuxLookupName(&addrs, &canon, name, family, flags);
|
|
|
|
|
|
|
|
result.addrs = try arena.alloc(Address, addrs.len);
|
|
|
|
if (!canon.isNull()) {
|
|
|
|
result.canon_name = canon.toOwnedSlice();
|
2019-10-27 00:00:55 +00:00
|
|
|
}
|
|
|
|
|
2019-10-29 06:19:22 +00:00
|
|
|
for (addrs.toSliceConst()) |addr, i| {
|
|
|
|
const os_addr = if (addr.family == os.AF_INET6)
|
2019-10-27 00:00:55 +00:00
|
|
|
os.sockaddr{
|
|
|
|
.in6 = os.sockaddr_in6{
|
2019-10-29 06:19:22 +00:00
|
|
|
.family = addr.family,
|
2019-10-27 00:00:55 +00:00
|
|
|
.port = mem.nativeToBig(u16, port),
|
|
|
|
.flowinfo = 0,
|
2019-10-29 06:19:22 +00:00
|
|
|
.addr = addr.addr,
|
|
|
|
.scope_id = addr.scope_id,
|
2019-10-27 00:00:55 +00:00
|
|
|
},
|
|
|
|
}
|
|
|
|
else
|
|
|
|
os.sockaddr{
|
|
|
|
.in = os.sockaddr_in{
|
2019-10-29 06:19:22 +00:00
|
|
|
.family = addr.family,
|
2019-10-27 00:00:55 +00:00
|
|
|
.port = mem.nativeToBig(u16, port),
|
2019-10-29 06:19:22 +00:00
|
|
|
.addr = @ptrCast(*align(1) const u32, &addr.addr).*,
|
2019-10-27 00:00:55 +00:00
|
|
|
.zero = [8]u8{ 0, 0, 0, 0, 0, 0, 0, 0 },
|
|
|
|
},
|
|
|
|
};
|
|
|
|
result.addrs[i] = Address.initPosix(os_addr);
|
|
|
|
}
|
|
|
|
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
@compileError("std.net.getAddresses unimplemented for this OS");
|
|
|
|
}
|
|
|
|
|
|
|
|
const LookupAddr = struct {
|
|
|
|
family: os.sa_family_t,
|
|
|
|
scope_id: u32 = 0,
|
|
|
|
addr: [16]u8, // could be IPv4 or IPv6
|
|
|
|
sortkey: i32 = 0,
|
|
|
|
};
|
|
|
|
|
2019-10-29 20:10:14 +00:00
|
|
|
const DAS_USABLE = 0x40000000;
|
|
|
|
const DAS_MATCHINGSCOPE = 0x20000000;
|
|
|
|
const DAS_MATCHINGLABEL = 0x10000000;
|
|
|
|
const DAS_PREC_SHIFT = 20;
|
|
|
|
const DAS_SCOPE_SHIFT = 16;
|
|
|
|
const DAS_PREFIX_SHIFT = 8;
|
|
|
|
const DAS_ORDER_SHIFT = 0;
|
|
|
|
|
2019-10-27 00:00:55 +00:00
|
|
|
fn linuxLookupName(
|
2019-10-29 06:19:22 +00:00
|
|
|
addrs: *std.ArrayList(LookupAddr),
|
|
|
|
canon: *std.Buffer,
|
2019-10-27 00:00:55 +00:00
|
|
|
opt_name: ?[]const u8,
|
|
|
|
family: i32,
|
|
|
|
flags: u32,
|
2019-10-29 06:19:22 +00:00
|
|
|
) !void {
|
2019-10-27 00:00:55 +00:00
|
|
|
if (opt_name) |name| {
|
|
|
|
// reject empty name and check len so it fits into temp bufs
|
2019-10-29 06:19:22 +00:00
|
|
|
try canon.replaceContents(name);
|
|
|
|
try linuxLookupNameFromNumeric(addrs, name, family);
|
|
|
|
if (addrs.len == 0 and (flags & std.c.AI_NUMERICHOST) == 0) {
|
|
|
|
try linuxLookupNameFromHosts(addrs, canon, name, family);
|
|
|
|
if (addrs.len == 0) {
|
|
|
|
try linuxLookupNameFromDnsSearch(addrs, canon, name, family);
|
2019-10-27 21:31:49 +00:00
|
|
|
}
|
2019-10-27 00:00:55 +00:00
|
|
|
}
|
|
|
|
} else {
|
2019-10-29 06:19:22 +00:00
|
|
|
try canon.resize(0);
|
|
|
|
try linuxLookupNameFromNull(addrs, family, flags);
|
2019-10-27 00:00:55 +00:00
|
|
|
}
|
2019-10-30 02:59:30 +00:00
|
|
|
if (addrs.len == 0) return error.UnknownHostName;
|
2019-10-27 00:00:55 +00:00
|
|
|
|
|
|
|
// No further processing is needed if there are fewer than 2
|
|
|
|
// results or if there are only IPv4 results.
|
2019-10-29 06:19:22 +00:00
|
|
|
if (addrs.len == 1 or family == os.AF_INET) return;
|
2019-10-29 20:10:14 +00:00
|
|
|
const all_ip4 = for (addrs.toSliceConst()) |addr| {
|
|
|
|
if (addr.family != os.AF_INET) break false;
|
|
|
|
} else true;
|
|
|
|
if (all_ip4) return;
|
|
|
|
|
|
|
|
// The following implements a subset of RFC 3484/6724 destination
|
|
|
|
// address selection by generating a single 31-bit sort key for
|
|
|
|
// each address. Rules 3, 4, and 7 are omitted for having
|
|
|
|
// excessive runtime and code size cost and dubious benefit.
|
|
|
|
// So far the label/precedence table cannot be customized.
|
|
|
|
// This implementation is ported from musl libc.
|
|
|
|
// A more idiomatic "ziggy" implementation would be welcome.
|
|
|
|
for (addrs.toSlice()) |*addr, i| {
|
|
|
|
var key: i32 = 0;
|
|
|
|
var sa6: os.sockaddr_in6 = undefined;
|
|
|
|
@memset(@ptrCast([*]u8, &sa6), 0, @sizeOf(os.sockaddr_in6));
|
|
|
|
var da6 = os.sockaddr_in6{
|
|
|
|
.family = os.AF_INET6,
|
|
|
|
.scope_id = addr.scope_id,
|
|
|
|
.port = 65535,
|
|
|
|
.flowinfo = 0,
|
|
|
|
.addr = [1]u8{0} ** 16,
|
|
|
|
};
|
|
|
|
var sa4: os.sockaddr_in = undefined;
|
|
|
|
@memset(@ptrCast([*]u8, &sa4), 0, @sizeOf(os.sockaddr_in));
|
|
|
|
var da4 = os.sockaddr_in{
|
|
|
|
.family = os.AF_INET,
|
|
|
|
.port = 65535,
|
|
|
|
.addr = 0,
|
|
|
|
.zero = [1]u8{0} ** 8,
|
|
|
|
};
|
|
|
|
var sa: *os.sockaddr = undefined;
|
|
|
|
var da: *os.sockaddr = undefined;
|
|
|
|
var salen: os.socklen_t = undefined;
|
|
|
|
var dalen: os.socklen_t = undefined;
|
|
|
|
if (addr.family == os.AF_INET6) {
|
|
|
|
mem.copy(u8, &da6.addr, &addr.addr);
|
|
|
|
da = @ptrCast(*os.sockaddr, &da6);
|
|
|
|
dalen = @sizeOf(os.sockaddr_in6);
|
|
|
|
sa = @ptrCast(*os.sockaddr, &sa6);
|
|
|
|
salen = @sizeOf(os.sockaddr_in6);
|
|
|
|
} else {
|
|
|
|
mem.copy(u8, &sa6.addr, "\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xff\xff");
|
|
|
|
mem.copy(u8, &da6.addr, "\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xff\xff");
|
|
|
|
mem.copy(u8, da6.addr[12..], addr.addr[0..4]);
|
|
|
|
da4.addr = mem.readIntNative(u32, @ptrCast(*const [4]u8, &addr.addr));
|
|
|
|
da = @ptrCast(*os.sockaddr, &da4);
|
|
|
|
dalen = @sizeOf(os.sockaddr_in);
|
|
|
|
sa = @ptrCast(*os.sockaddr, &sa4);
|
|
|
|
salen = @sizeOf(os.sockaddr_in);
|
|
|
|
}
|
|
|
|
const dpolicy = policyOf(da6.addr);
|
|
|
|
const dscope: i32 = scopeOf(da6.addr);
|
|
|
|
const dlabel = dpolicy.label;
|
|
|
|
const dprec: i32 = dpolicy.prec;
|
|
|
|
const MAXADDRS = 3;
|
|
|
|
var prefixlen: i32 = 0;
|
|
|
|
if (os.socket(addr.family, os.SOCK_DGRAM | os.SOCK_CLOEXEC, os.IPPROTO_UDP)) |fd| syscalls: {
|
|
|
|
defer os.close(fd);
|
|
|
|
os.connect(fd, da, dalen) catch break :syscalls;
|
|
|
|
key |= DAS_USABLE;
|
|
|
|
os.getsockname(fd, sa, &salen) catch break :syscalls;
|
|
|
|
if (addr.family == os.AF_INET) {
|
|
|
|
// TODO sa6.addr[12..16] should return *[4]u8, making this cast unnecessary.
|
|
|
|
mem.writeIntNative(u32, @ptrCast(*[4]u8, &sa6.addr[12]), sa4.addr);
|
|
|
|
}
|
|
|
|
if (dscope == i32(scopeOf(sa6.addr))) key |= DAS_MATCHINGSCOPE;
|
|
|
|
if (dlabel == labelOf(sa6.addr)) key |= DAS_MATCHINGLABEL;
|
|
|
|
prefixlen = prefixMatch(sa6.addr, da6.addr);
|
|
|
|
} else |_| {}
|
|
|
|
key |= dprec << DAS_PREC_SHIFT;
|
|
|
|
key |= (15 - dscope) << DAS_SCOPE_SHIFT;
|
|
|
|
key |= prefixlen << DAS_PREFIX_SHIFT;
|
|
|
|
key |= (MAXADDRS - @intCast(i32, i)) << DAS_ORDER_SHIFT;
|
|
|
|
addr.sortkey = key;
|
|
|
|
}
|
|
|
|
std.sort.sort(LookupAddr, addrs.toSlice(), addrCmpLessThan);
|
|
|
|
}
|
|
|
|
|
|
|
|
const Policy = struct {
|
|
|
|
addr: [16]u8,
|
|
|
|
len: u8,
|
|
|
|
mask: u8,
|
|
|
|
prec: u8,
|
|
|
|
label: u8,
|
|
|
|
};
|
|
|
|
|
|
|
|
const defined_policies = [_]Policy{
|
|
|
|
Policy{
|
|
|
|
.addr = "\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x01",
|
|
|
|
.len = 15,
|
|
|
|
.mask = 0xff,
|
|
|
|
.prec = 50,
|
|
|
|
.label = 0,
|
|
|
|
},
|
|
|
|
Policy{
|
|
|
|
.addr = "\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xff\xff\x00\x00\x00\x00",
|
|
|
|
.len = 11,
|
|
|
|
.mask = 0xff,
|
|
|
|
.prec = 35,
|
|
|
|
.label = 4,
|
|
|
|
},
|
|
|
|
Policy{
|
|
|
|
.addr = "\x20\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00",
|
|
|
|
.len = 1,
|
|
|
|
.mask = 0xff,
|
|
|
|
.prec = 30,
|
|
|
|
.label = 2,
|
|
|
|
},
|
|
|
|
Policy{
|
|
|
|
.addr = "\x20\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00",
|
|
|
|
.len = 3,
|
|
|
|
.mask = 0xff,
|
|
|
|
.prec = 5,
|
|
|
|
.label = 5,
|
|
|
|
},
|
|
|
|
Policy{
|
|
|
|
.addr = "\xfc\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00",
|
|
|
|
.len = 0,
|
|
|
|
.mask = 0xfe,
|
|
|
|
.prec = 3,
|
|
|
|
.label = 13,
|
|
|
|
},
|
|
|
|
// These are deprecated and/or returned to the address
|
|
|
|
// pool, so despite the RFC, treating them as special
|
|
|
|
// is probably wrong.
|
|
|
|
// { "", 11, 0xff, 1, 3 },
|
|
|
|
// { "\xfe\xc0", 1, 0xc0, 1, 11 },
|
|
|
|
// { "\x3f\xfe", 1, 0xff, 1, 12 },
|
|
|
|
// Last rule must match all addresses to stop loop.
|
|
|
|
Policy{
|
|
|
|
.addr = "\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00",
|
|
|
|
.len = 0,
|
|
|
|
.mask = 0,
|
|
|
|
.prec = 40,
|
|
|
|
.label = 1,
|
|
|
|
},
|
|
|
|
};
|
|
|
|
|
|
|
|
fn policyOf(a: [16]u8) *const Policy {
|
|
|
|
for (defined_policies) |*policy| {
|
|
|
|
if (!mem.eql(u8, a[0..policy.len], policy.addr[0..policy.len])) continue;
|
|
|
|
if ((a[policy.len] & policy.mask) != policy.addr[policy.len]) continue;
|
|
|
|
return policy;
|
|
|
|
}
|
|
|
|
unreachable;
|
|
|
|
}
|
|
|
|
|
|
|
|
fn scopeOf(a: [16]u8) u8 {
|
|
|
|
if (IN6_IS_ADDR_MULTICAST(a)) return a[1] & 15;
|
|
|
|
if (IN6_IS_ADDR_LINKLOCAL(a)) return 2;
|
|
|
|
if (IN6_IS_ADDR_LOOPBACK(a)) return 2;
|
|
|
|
if (IN6_IS_ADDR_SITELOCAL(a)) return 5;
|
|
|
|
return 14;
|
|
|
|
}
|
|
|
|
|
|
|
|
fn prefixMatch(s: [16]u8, d: [16]u8) u8 {
|
|
|
|
// TODO: This FIXME inherited from porting from musl libc.
|
|
|
|
// I don't want this to go into zig std lib 1.0.0.
|
|
|
|
|
|
|
|
// FIXME: The common prefix length should be limited to no greater
|
|
|
|
// than the nominal length of the prefix portion of the source
|
|
|
|
// address. However the definition of the source prefix length is
|
|
|
|
// not clear and thus this limiting is not yet implemented.
|
|
|
|
var i: u8 = 0;
|
|
|
|
while (i < 128 and ((s[i / 8] ^ d[i / 8]) & (u8(128) >> @intCast(u3, i % 8))) == 0) : (i += 1) {}
|
|
|
|
return i;
|
|
|
|
}
|
|
|
|
|
|
|
|
fn labelOf(a: [16]u8) u8 {
|
|
|
|
return policyOf(a).label;
|
|
|
|
}
|
|
|
|
|
|
|
|
fn IN6_IS_ADDR_MULTICAST(a: [16]u8) bool {
|
|
|
|
return a[0] == 0xff;
|
|
|
|
}
|
|
|
|
|
|
|
|
fn IN6_IS_ADDR_LINKLOCAL(a: [16]u8) bool {
|
|
|
|
return a[0] == 0xfe and (a[1] & 0xc0) == 0x80;
|
|
|
|
}
|
|
|
|
|
|
|
|
fn IN6_IS_ADDR_LOOPBACK(a: [16]u8) bool {
|
|
|
|
return a[0] == 0 and a[1] == 0 and
|
|
|
|
a[2] == 0 and
|
|
|
|
a[12] == 0 and a[13] == 0 and
|
|
|
|
a[14] == 0 and a[15] == 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
fn IN6_IS_ADDR_SITELOCAL(a: [16]u8) bool {
|
|
|
|
return a[0] == 0xfe and (a[1] & 0xc0) == 0xc0;
|
|
|
|
}
|
2019-10-27 00:00:55 +00:00
|
|
|
|
2019-10-29 20:10:14 +00:00
|
|
|
// Parameters `b` and `a` swapped to make this descending.
|
|
|
|
fn addrCmpLessThan(b: LookupAddr, a: LookupAddr) bool {
|
|
|
|
return a.sortkey < b.sortkey;
|
2019-10-27 00:00:55 +00:00
|
|
|
}
|
|
|
|
|
2019-10-29 06:19:22 +00:00
|
|
|
fn linuxLookupNameFromNumericUnspec(addrs: *std.ArrayList(LookupAddr), name: []const u8) !void {
|
|
|
|
return linuxLookupNameFromNumeric(addrs, name, os.AF_UNSPEC) catch |err| switch (err) {
|
|
|
|
error.ExpectedIPv6ButFoundIPv4 => unreachable,
|
|
|
|
error.ExpectedIPv4ButFoundIPv6 => unreachable,
|
|
|
|
else => |e| return e,
|
|
|
|
};
|
|
|
|
}
|
|
|
|
|
|
|
|
fn linuxLookupNameFromNumeric(addrs: *std.ArrayList(LookupAddr), name: []const u8, family: i32) !void {
|
2019-10-27 00:00:55 +00:00
|
|
|
if (parseIp4(name)) |ip4| {
|
|
|
|
if (family == os.AF_INET6) return error.ExpectedIPv6ButFoundIPv4;
|
2019-10-29 06:19:22 +00:00
|
|
|
const item = try addrs.addOne();
|
2019-10-27 00:00:55 +00:00
|
|
|
// TODO [0..4] should return *[4]u8, making this pointer cast unnecessary
|
2019-10-29 06:19:22 +00:00
|
|
|
mem.writeIntNative(u32, @ptrCast(*[4]u8, &item.addr), ip4);
|
|
|
|
item.family = os.AF_INET;
|
|
|
|
item.scope_id = 0;
|
|
|
|
return;
|
2019-10-27 00:00:55 +00:00
|
|
|
} else |err| switch (err) {
|
|
|
|
error.Overflow,
|
|
|
|
error.InvalidEnd,
|
|
|
|
error.InvalidCharacter,
|
|
|
|
error.Incomplete,
|
|
|
|
=> {},
|
|
|
|
}
|
|
|
|
|
|
|
|
if (parseIp6(name)) |ip6| {
|
|
|
|
if (family == os.AF_INET) return error.ExpectedIPv4ButFoundIPv6;
|
2019-10-29 06:19:22 +00:00
|
|
|
const item = try addrs.addOne();
|
|
|
|
@memcpy(&item.addr, &ip6.addr, 16);
|
|
|
|
item.family = os.AF_INET6;
|
|
|
|
item.scope_id = ip6.scope_id;
|
|
|
|
return;
|
2019-10-27 00:00:55 +00:00
|
|
|
} else |err| switch (err) {
|
|
|
|
error.Overflow,
|
|
|
|
error.InvalidEnd,
|
|
|
|
error.InvalidCharacter,
|
|
|
|
error.Incomplete,
|
|
|
|
=> {},
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-10-29 06:19:22 +00:00
|
|
|
fn linuxLookupNameFromNull(addrs: *std.ArrayList(LookupAddr), family: i32, flags: u32) !void {
|
|
|
|
if ((flags & std.c.AI_PASSIVE) != 0) {
|
2019-10-27 00:00:55 +00:00
|
|
|
if (family != os.AF_INET6) {
|
2019-10-29 06:19:22 +00:00
|
|
|
(try addrs.addOne()).* = LookupAddr{
|
2019-10-27 00:00:55 +00:00
|
|
|
.family = os.AF_INET,
|
|
|
|
.addr = [1]u8{0} ** 16,
|
|
|
|
};
|
|
|
|
}
|
|
|
|
if (family != os.AF_INET) {
|
2019-10-29 06:19:22 +00:00
|
|
|
(try addrs.addOne()).* = LookupAddr{
|
2019-10-27 00:00:55 +00:00
|
|
|
.family = os.AF_INET6,
|
|
|
|
.addr = [1]u8{0} ** 16,
|
|
|
|
};
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if (family != os.AF_INET6) {
|
2019-10-29 06:19:22 +00:00
|
|
|
(try addrs.addOne()).* = LookupAddr{
|
2019-10-27 00:00:55 +00:00
|
|
|
.family = os.AF_INET,
|
|
|
|
.addr = [4]u8{ 127, 0, 0, 1 } ++ ([1]u8{0} ** 12),
|
|
|
|
};
|
|
|
|
}
|
|
|
|
if (family != os.AF_INET) {
|
2019-10-29 06:19:22 +00:00
|
|
|
(try addrs.addOne()).* = LookupAddr{
|
2019-10-27 00:00:55 +00:00
|
|
|
.family = os.AF_INET6,
|
|
|
|
.addr = ([1]u8{0} ** 15) ++ [1]u8{1},
|
|
|
|
};
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fn linuxLookupNameFromHosts(
|
2019-10-29 06:19:22 +00:00
|
|
|
addrs: *std.ArrayList(LookupAddr),
|
|
|
|
canon: *std.Buffer,
|
2019-10-27 00:00:55 +00:00
|
|
|
name: []const u8,
|
|
|
|
family: i32,
|
2019-10-29 06:19:22 +00:00
|
|
|
) !void {
|
|
|
|
const file = fs.File.openReadC(c"/etc/hosts") catch |err| switch (err) {
|
2019-10-27 00:00:55 +00:00
|
|
|
error.FileNotFound,
|
|
|
|
error.NotDir,
|
|
|
|
error.AccessDenied,
|
2019-10-29 06:19:22 +00:00
|
|
|
=> return,
|
2019-10-27 00:00:55 +00:00
|
|
|
else => |e| return e,
|
|
|
|
};
|
|
|
|
defer file.close();
|
|
|
|
|
2019-10-29 06:19:22 +00:00
|
|
|
const stream = &std.io.BufferedInStream(fs.File.ReadError).init(&file.inStream().stream).stream;
|
2019-10-27 00:00:55 +00:00
|
|
|
var line_buf: [512]u8 = undefined;
|
|
|
|
while (stream.readUntilDelimiterOrEof(&line_buf, '\n') catch |err| switch (err) {
|
|
|
|
error.StreamTooLong => blk: {
|
|
|
|
// Skip to the delimiter in the stream, to fix parsing
|
|
|
|
try stream.skipUntilDelimiterOrEof('\n');
|
|
|
|
// Use the truncated line. A truncated comment or hostname will be handled correctly.
|
|
|
|
break :blk line_buf[0..];
|
|
|
|
},
|
|
|
|
else => |e| return e,
|
|
|
|
}) |line| {
|
|
|
|
const no_comment_line = mem.separate(line, "#").next().?;
|
|
|
|
|
|
|
|
var line_it = mem.tokenize(no_comment_line, " \t");
|
|
|
|
const ip_text = line_it.next() orelse continue;
|
|
|
|
var first_name_text: ?[]const u8 = null;
|
|
|
|
while (line_it.next()) |name_text| {
|
|
|
|
if (first_name_text == null) first_name_text = name_text;
|
|
|
|
if (mem.eql(u8, name_text, name)) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
} else continue;
|
|
|
|
|
2019-10-29 06:19:22 +00:00
|
|
|
const prev_len = addrs.len;
|
|
|
|
linuxLookupNameFromNumeric(addrs, ip_text, family) catch |err| switch (err) {
|
2019-10-27 00:00:55 +00:00
|
|
|
error.ExpectedIPv6ButFoundIPv4 => continue,
|
|
|
|
error.ExpectedIPv4ButFoundIPv6 => continue,
|
2019-10-29 06:19:22 +00:00
|
|
|
error.OutOfMemory => |e| return e,
|
|
|
|
};
|
|
|
|
if (addrs.len > prev_len) {
|
|
|
|
// first name is canonical name
|
|
|
|
const name_text = first_name_text.?;
|
|
|
|
if (isValidHostName(name_text)) {
|
|
|
|
try canon.replaceContents(name_text);
|
|
|
|
}
|
2019-10-27 00:00:55 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
pub fn isValidHostName(hostname: []const u8) bool {
|
|
|
|
if (hostname.len >= 254) return false;
|
|
|
|
if (!std.unicode.utf8ValidateSlice(hostname)) return false;
|
|
|
|
for (hostname) |byte| {
|
|
|
|
if (byte >= 0x80 or byte == '.' or byte == '-' or std.ascii.isAlNum(byte)) {
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
2019-10-26 19:05:42 +00:00
|
|
|
}
|
2019-10-27 21:31:49 +00:00
|
|
|
|
|
|
|
fn linuxLookupNameFromDnsSearch(
|
2019-10-29 06:19:22 +00:00
|
|
|
addrs: *std.ArrayList(LookupAddr),
|
|
|
|
canon: *std.Buffer,
|
2019-10-27 21:31:49 +00:00
|
|
|
name: []const u8,
|
|
|
|
family: i32,
|
2019-10-29 06:19:22 +00:00
|
|
|
) !void {
|
|
|
|
var rc: ResolvConf = undefined;
|
|
|
|
try getResolvConf(addrs.allocator, &rc);
|
|
|
|
defer rc.deinit();
|
2019-10-27 21:31:49 +00:00
|
|
|
|
|
|
|
// Count dots, suppress search when >=ndots or name ends in
|
|
|
|
// a dot, which is an explicit request for global scope.
|
2019-10-29 06:19:22 +00:00
|
|
|
var dots: usize = 0;
|
|
|
|
for (name) |byte| {
|
|
|
|
if (byte == '.') dots += 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
const search = if (rc.search.isNull() or dots >= rc.ndots or mem.endsWith(u8, name, "."))
|
|
|
|
[_]u8{}
|
|
|
|
else
|
|
|
|
rc.search.toSliceConst();
|
|
|
|
|
|
|
|
var canon_name = name;
|
|
|
|
|
|
|
|
// Strip final dot for canon, fail if multiple trailing dots.
|
|
|
|
if (mem.endsWith(u8, canon_name, ".")) canon_name.len -= 1;
|
2019-10-30 02:59:30 +00:00
|
|
|
if (mem.endsWith(u8, canon_name, ".")) return error.UnknownHostName;
|
2019-10-29 06:19:22 +00:00
|
|
|
|
|
|
|
// Name with search domain appended is setup in canon[]. This both
|
|
|
|
// provides the desired default canonical name (if the requested
|
|
|
|
// name is not a CNAME record) and serves as a buffer for passing
|
|
|
|
// the full requested name to name_from_dns.
|
|
|
|
try canon.resize(canon_name.len);
|
|
|
|
mem.copy(u8, canon.toSlice(), canon_name);
|
|
|
|
try canon.appendByte('.');
|
|
|
|
|
|
|
|
var tok_it = mem.tokenize(search, " \t");
|
|
|
|
while (tok_it.next()) |tok| {
|
|
|
|
canon.shrink(canon_name.len + 1);
|
|
|
|
try canon.append(tok);
|
|
|
|
try linuxLookupNameFromDns(addrs, canon, canon.toSliceConst(), family, rc);
|
|
|
|
if (addrs.len != 0) return;
|
|
|
|
}
|
|
|
|
|
|
|
|
canon.shrink(canon_name.len);
|
|
|
|
return linuxLookupNameFromDns(addrs, canon, name, family, rc);
|
|
|
|
}
|
|
|
|
|
|
|
|
const dpc_ctx = struct {
|
|
|
|
addrs: *std.ArrayList(LookupAddr),
|
|
|
|
canon: *std.Buffer,
|
|
|
|
};
|
|
|
|
|
|
|
|
fn linuxLookupNameFromDns(
|
|
|
|
addrs: *std.ArrayList(LookupAddr),
|
|
|
|
canon: *std.Buffer,
|
|
|
|
name: []const u8,
|
|
|
|
family: i32,
|
|
|
|
rc: ResolvConf,
|
|
|
|
) !void {
|
|
|
|
var ctx = dpc_ctx{
|
|
|
|
.addrs = addrs,
|
|
|
|
.canon = canon,
|
|
|
|
};
|
|
|
|
const AfRr = struct {
|
|
|
|
af: i32,
|
|
|
|
rr: u8,
|
|
|
|
};
|
|
|
|
const afrrs = [_]AfRr{
|
|
|
|
AfRr{ .af = os.AF_INET6, .rr = os.RR_A },
|
|
|
|
AfRr{ .af = os.AF_INET, .rr = os.RR_AAAA },
|
|
|
|
};
|
|
|
|
var qbuf: [2][280]u8 = undefined;
|
|
|
|
var abuf: [2][512]u8 = undefined;
|
|
|
|
var qp: [2][]const u8 = undefined;
|
|
|
|
const apbuf = [2][]u8{ &abuf[0], &abuf[1] };
|
|
|
|
var nq: usize = 0;
|
|
|
|
|
|
|
|
for (afrrs) |afrr| {
|
|
|
|
if (family != afrr.af) {
|
|
|
|
const len = os.res_mkquery(0, name, 1, afrr.rr, [_]u8{}, null, &qbuf[nq]);
|
|
|
|
qp[nq] = qbuf[nq][0..len];
|
|
|
|
nq += 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
var ap = [2][]u8{ apbuf[0][0..0], apbuf[1][0..0] };
|
|
|
|
try resMSendRc(qp[0..nq], ap[0..nq], apbuf[0..nq], rc);
|
|
|
|
|
|
|
|
var i: usize = 0;
|
|
|
|
while (i < nq) : (i += 1) {
|
|
|
|
dnsParse(ap[i], ctx, dnsParseCallback) catch {};
|
|
|
|
}
|
|
|
|
|
|
|
|
if (addrs.len != 0) return;
|
|
|
|
if (ap[0].len < 4 or (ap[0][3] & 15) == 2) return error.TemporaryNameServerFailure;
|
2019-10-30 02:59:30 +00:00
|
|
|
if ((ap[0][3] & 15) == 0) return error.UnknownHostName;
|
2019-10-29 06:19:22 +00:00
|
|
|
if ((ap[0][3] & 15) == 3) return;
|
|
|
|
return error.NameServerFailure;
|
|
|
|
}
|
|
|
|
|
|
|
|
const ResolvConf = struct {
|
|
|
|
attempts: u32,
|
|
|
|
ndots: u32,
|
|
|
|
timeout: u32,
|
|
|
|
search: std.Buffer,
|
|
|
|
ns: std.ArrayList(LookupAddr),
|
|
|
|
|
|
|
|
fn deinit(rc: *ResolvConf) void {
|
|
|
|
rc.ns.deinit();
|
|
|
|
rc.search.deinit();
|
|
|
|
rc.* = undefined;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
/// Ignores lines longer than 512 bytes.
|
|
|
|
/// TODO: https://github.com/ziglang/zig/issues/2765 and https://github.com/ziglang/zig/issues/2761
|
|
|
|
fn getResolvConf(allocator: *mem.Allocator, rc: *ResolvConf) !void {
|
|
|
|
rc.* = ResolvConf{
|
|
|
|
.ns = std.ArrayList(LookupAddr).init(allocator),
|
|
|
|
.search = std.Buffer.initNull(allocator),
|
|
|
|
.ndots = 1,
|
|
|
|
.timeout = 5,
|
|
|
|
.attempts = 2,
|
|
|
|
};
|
|
|
|
errdefer rc.deinit();
|
|
|
|
|
|
|
|
const file = fs.File.openReadC(c"/etc/resolv.conf") catch |err| switch (err) {
|
|
|
|
error.FileNotFound,
|
|
|
|
error.NotDir,
|
|
|
|
error.AccessDenied,
|
|
|
|
=> return linuxLookupNameFromNumericUnspec(&rc.ns, "127.0.0.1"),
|
|
|
|
else => |e| return e,
|
|
|
|
};
|
|
|
|
defer file.close();
|
|
|
|
|
|
|
|
const stream = &std.io.BufferedInStream(fs.File.ReadError).init(&file.inStream().stream).stream;
|
|
|
|
var line_buf: [512]u8 = undefined;
|
|
|
|
while (stream.readUntilDelimiterOrEof(&line_buf, '\n') catch |err| switch (err) {
|
|
|
|
error.StreamTooLong => blk: {
|
|
|
|
// Skip to the delimiter in the stream, to fix parsing
|
|
|
|
try stream.skipUntilDelimiterOrEof('\n');
|
|
|
|
// Give an empty line to the while loop, which will be skipped.
|
|
|
|
break :blk line_buf[0..0];
|
|
|
|
},
|
|
|
|
else => |e| return e,
|
|
|
|
}) |line| {
|
|
|
|
const no_comment_line = mem.separate(line, "#").next().?;
|
|
|
|
var line_it = mem.tokenize(no_comment_line, " \t");
|
|
|
|
|
|
|
|
const token = line_it.next() orelse continue;
|
|
|
|
if (mem.eql(u8, token, "options")) {
|
|
|
|
while (line_it.next()) |sub_tok| {
|
|
|
|
var colon_it = mem.separate(sub_tok, ":");
|
|
|
|
const name = colon_it.next().?;
|
|
|
|
const value_txt = colon_it.next() orelse continue;
|
|
|
|
const value = std.fmt.parseInt(u8, value_txt, 10) catch |err| switch (err) {
|
|
|
|
error.Overflow => 255,
|
|
|
|
error.InvalidCharacter => continue,
|
|
|
|
};
|
|
|
|
if (mem.eql(u8, name, "ndots")) {
|
|
|
|
rc.ndots = std.math.min(value, 15);
|
|
|
|
} else if (mem.eql(u8, name, "attempts")) {
|
|
|
|
rc.attempts = std.math.min(value, 10);
|
|
|
|
} else if (mem.eql(u8, name, "timeout")) {
|
|
|
|
rc.timeout = std.math.min(value, 60);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} else if (mem.eql(u8, token, "nameserver")) {
|
|
|
|
const ip_txt = line_it.next() orelse continue;
|
|
|
|
try linuxLookupNameFromNumericUnspec(&rc.ns, ip_txt);
|
|
|
|
} else if (mem.eql(u8, token, "domain") or mem.eql(u8, token, "search")) {
|
|
|
|
try rc.search.replaceContents(line_it.rest());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (rc.ns.len == 0) {
|
|
|
|
return linuxLookupNameFromNumericUnspec(&rc.ns, "127.0.0.1");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fn eqlSockAddr(a: *const os.sockaddr, b: *const os.sockaddr, len: usize) bool {
|
|
|
|
const a_bytes = @ptrCast([*]const u8, a)[0..len];
|
|
|
|
const b_bytes = @ptrCast([*]const u8, b)[0..len];
|
|
|
|
return mem.eql(u8, a_bytes, b_bytes);
|
|
|
|
}
|
|
|
|
|
|
|
|
fn resMSendRc(
|
|
|
|
queries: []const []const u8,
|
|
|
|
answers: [][]u8,
|
|
|
|
answer_bufs: []const []u8,
|
|
|
|
rc: ResolvConf,
|
|
|
|
) !void {
|
|
|
|
const timeout = 1000 * rc.timeout;
|
|
|
|
const attempts = rc.attempts;
|
|
|
|
|
|
|
|
var sl: os.socklen_t = @sizeOf(os.sockaddr_in);
|
|
|
|
var family: os.sa_family_t = os.AF_INET;
|
|
|
|
|
|
|
|
var ns_list = std.ArrayList(os.sockaddr).init(rc.ns.allocator);
|
|
|
|
defer ns_list.deinit();
|
2019-10-27 21:31:49 +00:00
|
|
|
|
2019-10-29 06:19:22 +00:00
|
|
|
try ns_list.resize(rc.ns.len);
|
|
|
|
const ns = ns_list.toSlice();
|
|
|
|
|
|
|
|
for (rc.ns.toSliceConst()) |iplit, i| {
|
|
|
|
if (iplit.family == os.AF_INET) {
|
|
|
|
ns[i] = os.sockaddr{
|
|
|
|
.in = os.sockaddr_in{
|
|
|
|
.family = os.AF_INET,
|
|
|
|
.port = mem.nativeToBig(u16, 53),
|
|
|
|
.addr = mem.readIntNative(u32, @ptrCast(*const [4]u8, &iplit.addr)),
|
|
|
|
.zero = [8]u8{ 0, 0, 0, 0, 0, 0, 0, 0 },
|
|
|
|
},
|
|
|
|
};
|
|
|
|
} else {
|
|
|
|
ns[i] = os.sockaddr{
|
|
|
|
.in6 = os.sockaddr_in6{
|
|
|
|
.family = os.AF_INET6,
|
|
|
|
.port = mem.nativeToBig(u16, 53),
|
|
|
|
.flowinfo = 0,
|
|
|
|
.addr = iplit.addr,
|
|
|
|
.scope_id = iplit.scope_id,
|
|
|
|
},
|
|
|
|
};
|
|
|
|
sl = @sizeOf(os.sockaddr_in6);
|
|
|
|
family = os.AF_INET6;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Get local address and open/bind a socket
|
|
|
|
var sa: os.sockaddr = undefined;
|
|
|
|
@memset(@ptrCast([*]u8, &sa), 0, @sizeOf(os.sockaddr));
|
|
|
|
sa.in.family = family;
|
|
|
|
const flags = os.SOCK_DGRAM | os.SOCK_CLOEXEC | os.SOCK_NONBLOCK;
|
|
|
|
const fd = os.socket(family, flags, 0) catch |err| switch (err) {
|
|
|
|
error.AddressFamilyNotSupported => blk: {
|
|
|
|
// Handle case where system lacks IPv6 support
|
|
|
|
if (family == os.AF_INET6) {
|
|
|
|
family = os.AF_INET;
|
|
|
|
break :blk try os.socket(os.AF_INET, flags, 0);
|
|
|
|
}
|
|
|
|
return err;
|
|
|
|
},
|
|
|
|
else => |e| return e,
|
|
|
|
};
|
|
|
|
defer os.close(fd);
|
|
|
|
try os.bind(fd, &sa, sl);
|
|
|
|
|
|
|
|
// Past this point, there are no errors. Each individual query will
|
|
|
|
// yield either no reply (indicated by zero length) or an answer
|
|
|
|
// packet which is up to the caller to interpret.
|
|
|
|
|
|
|
|
// Convert any IPv4 addresses in a mixed environment to v4-mapped
|
|
|
|
// TODO
|
|
|
|
//if (family == AF_INET6) {
|
|
|
|
// setsockopt(fd, IPPROTO_IPV6, IPV6_V6ONLY, &(int){0}, sizeof 0);
|
|
|
|
// for (i=0; i<nns; i++) {
|
|
|
|
// if (ns[i].sin.sin_family != AF_INET) continue;
|
|
|
|
// memcpy(ns[i].sin6.sin6_addr.s6_addr+12,
|
|
|
|
// &ns[i].sin.sin_addr, 4);
|
|
|
|
// memcpy(ns[i].sin6.sin6_addr.s6_addr,
|
|
|
|
// "\0\0\0\0\0\0\0\0\0\0\xff\xff", 12);
|
|
|
|
// ns[i].sin6.sin6_family = AF_INET6;
|
|
|
|
// ns[i].sin6.sin6_flowinfo = 0;
|
|
|
|
// ns[i].sin6.sin6_scope_id = 0;
|
2019-10-27 21:31:49 +00:00
|
|
|
// }
|
|
|
|
//}
|
|
|
|
|
2019-10-29 06:19:22 +00:00
|
|
|
var pfd = [1]os.pollfd{os.pollfd{
|
|
|
|
.fd = fd,
|
|
|
|
.events = os.POLLIN,
|
|
|
|
.revents = undefined,
|
|
|
|
}};
|
|
|
|
const retry_interval = timeout / attempts;
|
|
|
|
var next: u32 = 0;
|
|
|
|
var t2: usize = std.time.milliTimestamp();
|
|
|
|
var t0 = t2;
|
|
|
|
var t1 = t2 - retry_interval;
|
|
|
|
|
|
|
|
var servfail_retry: usize = undefined;
|
|
|
|
|
|
|
|
outer: while (t2 - t0 < timeout) : (t2 = std.time.milliTimestamp()) {
|
|
|
|
if (t2 - t1 >= retry_interval) {
|
|
|
|
// Query all configured nameservers in parallel
|
|
|
|
var i: usize = 0;
|
|
|
|
while (i < queries.len) : (i += 1) {
|
|
|
|
if (answers[i].len == 0) {
|
|
|
|
var j: usize = 0;
|
|
|
|
while (j < ns.len) : (j += 1) {
|
|
|
|
_ = os.sendto(fd, queries[i], os.MSG_NOSIGNAL, &ns[j], sl) catch undefined;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
t1 = t2;
|
|
|
|
servfail_retry = 2 * queries.len;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Wait for a response, or until time to retry
|
|
|
|
const clamped_timeout = std.math.min(u31(std.math.maxInt(u31)), t1 + retry_interval - t2);
|
|
|
|
const nevents = os.poll(&pfd, clamped_timeout) catch 0;
|
|
|
|
if (nevents == 0) continue;
|
|
|
|
|
|
|
|
while (true) {
|
|
|
|
var sl_copy = sl;
|
|
|
|
const rlen = os.recvfrom(fd, answer_bufs[next], 0, &sa, &sl_copy) catch break;
|
|
|
|
|
|
|
|
// Ignore non-identifiable packets
|
|
|
|
if (rlen < 4) continue;
|
|
|
|
|
|
|
|
// Ignore replies from addresses we didn't send to
|
|
|
|
var j: usize = 0;
|
|
|
|
while (j < ns.len and !eqlSockAddr(&ns[j], &sa, sl)) : (j += 1) {}
|
|
|
|
if (j == ns.len) continue;
|
|
|
|
|
|
|
|
// Find which query this answer goes with, if any
|
|
|
|
var i: usize = next;
|
|
|
|
while (i < queries.len and (answer_bufs[next][0] != queries[i][0] or
|
|
|
|
answer_bufs[next][1] != queries[i][1])) : (i += 1)
|
|
|
|
{}
|
|
|
|
|
|
|
|
if (i == queries.len) continue;
|
|
|
|
if (answers[i].len != 0) continue;
|
|
|
|
|
|
|
|
// Only accept positive or negative responses;
|
|
|
|
// retry immediately on server failure, and ignore
|
|
|
|
// all other codes such as refusal.
|
|
|
|
switch (answer_bufs[next][3] & 15) {
|
|
|
|
0, 3 => {},
|
|
|
|
2 => if (servfail_retry != 0) {
|
|
|
|
servfail_retry -= 1;
|
|
|
|
_ = os.sendto(fd, queries[i], os.MSG_NOSIGNAL, &ns[j], sl) catch undefined;
|
|
|
|
},
|
|
|
|
else => continue,
|
|
|
|
}
|
|
|
|
|
|
|
|
// Store answer in the right slot, or update next
|
|
|
|
// available temp slot if it's already in place.
|
|
|
|
answers[i].len = rlen;
|
|
|
|
if (i == next) {
|
|
|
|
while (next < queries.len and answers[next].len != 0) : (next += 1) {}
|
|
|
|
} else {
|
|
|
|
mem.copy(u8, answer_bufs[i], answer_bufs[next][0..rlen]);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (next == queries.len) break :outer;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fn dnsParse(
|
|
|
|
r: []const u8,
|
|
|
|
ctx: var,
|
|
|
|
comptime callback: var,
|
|
|
|
) !void {
|
2019-10-29 20:10:14 +00:00
|
|
|
// This implementation is ported from musl libc.
|
|
|
|
// A more idiomatic "ziggy" implementation would be welcome.
|
2019-10-29 06:19:22 +00:00
|
|
|
if (r.len < 12) return error.InvalidDnsPacket;
|
|
|
|
if ((r[3] & 15) != 0) return;
|
|
|
|
var p = r.ptr + 12;
|
|
|
|
var qdcount = r[4] * usize(256) + r[5];
|
|
|
|
var ancount = r[6] * usize(256) + r[7];
|
|
|
|
if (qdcount + ancount > 64) return error.InvalidDnsPacket;
|
|
|
|
while (qdcount != 0) {
|
|
|
|
qdcount -= 1;
|
|
|
|
while (@ptrToInt(p) - @ptrToInt(r.ptr) < r.len and p[0] -% 1 < 127) p += 1;
|
|
|
|
if (p[0] > 193 or (p[0] == 193 and p[1] > 254) or @ptrToInt(p) > @ptrToInt(r.ptr) + r.len - 6)
|
|
|
|
return error.InvalidDnsPacket;
|
|
|
|
p += usize(5) + @boolToInt(p[0] != 0);
|
|
|
|
}
|
|
|
|
while (ancount != 0) {
|
|
|
|
ancount -= 1;
|
|
|
|
while (@ptrToInt(p) - @ptrToInt(r.ptr) < r.len and p[0] -% 1 < 127) p += 1;
|
|
|
|
if (p[0] > 193 or (p[0] == 193 and p[1] > 254) or @ptrToInt(p) > @ptrToInt(r.ptr) + r.len - 6)
|
|
|
|
return error.InvalidDnsPacket;
|
|
|
|
p += usize(1) + @boolToInt(p[0] != 0);
|
|
|
|
const len = p[8] * usize(256) + p[9];
|
|
|
|
if (@ptrToInt(p) + len > @ptrToInt(r.ptr) + r.len) return error.InvalidDnsPacket;
|
|
|
|
try callback(ctx, p[1], p[10 .. 10 + len], r);
|
|
|
|
p += 10 + len;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fn dnsParseCallback(ctx: dpc_ctx, rr: u8, data: []const u8, packet: []const u8) !void {
|
|
|
|
switch (rr) {
|
|
|
|
os.RR_A => {
|
|
|
|
if (data.len != 4) return error.InvalidDnsARecord;
|
|
|
|
const new_addr = try ctx.addrs.addOne();
|
|
|
|
new_addr.* = LookupAddr{
|
|
|
|
.family = os.AF_INET,
|
|
|
|
.addr = undefined,
|
|
|
|
};
|
|
|
|
mem.copy(u8, &new_addr.addr, data);
|
|
|
|
},
|
|
|
|
os.RR_AAAA => {
|
|
|
|
if (data.len != 16) return error.InvalidDnsAAAARecord;
|
|
|
|
const new_addr = try ctx.addrs.addOne();
|
|
|
|
new_addr.* = LookupAddr{
|
|
|
|
.family = os.AF_INET6,
|
|
|
|
.addr = undefined,
|
|
|
|
};
|
|
|
|
mem.copy(u8, &new_addr.addr, data);
|
|
|
|
},
|
|
|
|
os.RR_CNAME => {
|
2019-10-29 18:03:39 +00:00
|
|
|
var tmp: [256]u8 = undefined;
|
|
|
|
// Returns len of compressed name. strlen to get canon name.
|
|
|
|
_ = try os.dn_expand(packet, data, &tmp);
|
|
|
|
const canon_name = mem.toSliceConst(u8, &tmp);
|
|
|
|
if (isValidHostName(canon_name)) {
|
|
|
|
try ctx.canon.replaceContents(canon_name);
|
|
|
|
}
|
2019-10-29 06:19:22 +00:00
|
|
|
},
|
|
|
|
else => return,
|
|
|
|
}
|
2019-10-27 21:31:49 +00:00
|
|
|
}
|
2019-10-30 02:59:30 +00:00
|
|
|
|
|
|
|
/// This API only works when `std.io.mode` is `std.io.Mode.evented`.
|
|
|
|
/// This struct is immovable after calling `listen`.
|
|
|
|
pub const Server = struct {
|
|
|
|
/// This field is meant to be accessed directly.
|
|
|
|
/// Call `connections.get` to accept a connection.
|
|
|
|
connections: *ConnectionChannel,
|
|
|
|
|
|
|
|
/// Copied from `Options` on `init`.
|
|
|
|
kernel_backlog: u32,
|
|
|
|
|
|
|
|
/// `undefined` until `listen` returns successfully.
|
|
|
|
listen_address: Address,
|
|
|
|
|
|
|
|
sockfd: ?os.fd_t,
|
|
|
|
accept_frame: @Frame(acceptConnections),
|
|
|
|
|
|
|
|
pub const ConnectionChannel = std.event.Channel(AcceptError!fs.File);
|
|
|
|
|
|
|
|
pub const AcceptError = error{
|
|
|
|
ConnectionAborted,
|
|
|
|
|
|
|
|
/// The per-process limit on the number of open file descriptors has been reached.
|
|
|
|
ProcessFdQuotaExceeded,
|
|
|
|
|
|
|
|
/// The system-wide limit on the total number of open files has been reached.
|
|
|
|
SystemFdQuotaExceeded,
|
|
|
|
|
|
|
|
/// Not enough free memory. This often means that the memory allocation is limited
|
|
|
|
/// by the socket buffer limits, not by the system memory.
|
|
|
|
SystemResources,
|
|
|
|
|
|
|
|
ProtocolFailure,
|
|
|
|
|
|
|
|
/// Firewall rules forbid connection.
|
|
|
|
BlockedByFirewall,
|
|
|
|
} || os.UnexpectedError;
|
|
|
|
|
|
|
|
pub const Options = struct {
|
|
|
|
/// How many connections the kernel will accept on the application's behalf.
|
|
|
|
/// If more than this many connections pool in the kernel, clients will start
|
|
|
|
/// seeing "Connection refused".
|
|
|
|
kernel_backlog: u32 = 128,
|
|
|
|
|
|
|
|
/// How many connections this `Server` will accept from the kernel even before
|
|
|
|
/// they are requested from the `connections` channel.
|
|
|
|
eager_connections: usize = 16,
|
|
|
|
};
|
|
|
|
|
|
|
|
/// After this call succeeds, resources have been acquired and must
|
|
|
|
/// be released with `deinit`.
|
|
|
|
pub fn init(options: Options) !Server {
|
|
|
|
const loop = std.event.Loop.instance orelse
|
|
|
|
@compileError("std.net.Server only works in evented I/O mode");
|
|
|
|
return Server{
|
|
|
|
.connections = try ConnectionChannel.create(loop, options.eager_connections),
|
|
|
|
.sockfd = null,
|
|
|
|
.kernel_backlog = options.kernel_backlog,
|
|
|
|
.listen_address = undefined,
|
|
|
|
.accept_frame = undefined,
|
|
|
|
};
|
|
|
|
}
|
|
|
|
|
|
|
|
/// After calling this function, one must call `init` to do anything else with this `Server`.
|
|
|
|
pub fn deinit(self: *Server) void {
|
|
|
|
self.close();
|
|
|
|
self.connections.destroy();
|
|
|
|
self.* = undefined;
|
|
|
|
}
|
|
|
|
|
|
|
|
pub fn listen(self: *Server, address: Address) !void {
|
|
|
|
const sock_flags = os.SOCK_STREAM | os.SOCK_CLOEXEC | os.SOCK_NONBLOCK;
|
|
|
|
const sockfd = try os.socket(os.AF_INET, sock_flags, os.PROTO_tcp);
|
|
|
|
self.sockfd = sockfd;
|
|
|
|
errdefer {
|
|
|
|
os.close(sockfd);
|
|
|
|
self.sockfd = null;
|
|
|
|
}
|
|
|
|
|
|
|
|
var socklen = address.getOsSockLen();
|
|
|
|
try os.bind(sockfd, &address.os_addr, socklen);
|
|
|
|
try os.listen(sockfd, self.kernel_backlog);
|
|
|
|
try os.getsockname(sockfd, &self.listen_address.os_addr, &socklen);
|
|
|
|
|
|
|
|
// acceptConnections loops, calling os.accept().
|
|
|
|
self.accept_frame = async self.acceptConnections();
|
|
|
|
errdefer await self.accept_frame;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Stop listening. It is still necessary to call `deinit` after stopping listening.
|
|
|
|
/// Calling `deinit` will automatically call `close`. It is safe to call `close` when
|
|
|
|
/// not listening.
|
|
|
|
pub fn close(self: *Server) void {
|
|
|
|
if (self.sockfd) |fd| {
|
|
|
|
os.close(fd);
|
|
|
|
self.sockfd = null;
|
|
|
|
await self.accept_frame;
|
|
|
|
self.accept_frame = undefined;
|
|
|
|
self.listen_address = undefined;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fn acceptConnections(self: *Server) void {
|
|
|
|
const sockfd = self.sockfd.?;
|
|
|
|
const accept_flags = os.SOCK_NONBLOCK | os.SOCK_CLOEXEC;
|
|
|
|
while (true) {
|
|
|
|
var accepted_addr: Address = undefined;
|
|
|
|
var addr_len: os.socklen_t = @sizeOf(os.sockaddr);
|
|
|
|
const conn = if (os.accept4(sockfd, &accepted_addr.os_addr, &addr_len, accept_flags)) |fd|
|
|
|
|
fs.File.openHandle(fd)
|
|
|
|
else |err| switch (err) {
|
|
|
|
error.WouldBlock => unreachable, // we asserted earlier about non-blocking I/O mode
|
|
|
|
else => |e| e,
|
|
|
|
};
|
|
|
|
self.connections.put(conn);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
};
|