mirror of
https://github.com/zigzap/zap.git
synced 2025-10-20 15:14:08 +00:00
added support for multi-file form upload
This commit is contained in:
parent
db9fd24f01
commit
661c230c0f
3 changed files with 148 additions and 74 deletions
|
@ -31,6 +31,7 @@ const Handler = struct {
|
|||
std.debug.print("\n", .{});
|
||||
std.log.info("Param `{s}` in owned list is {any}\n", .{ kv.key.str, v });
|
||||
switch (v) {
|
||||
// single-file upload
|
||||
zap.HttpParam.Hash_Binfile => |*file| {
|
||||
const filename = file.filename orelse "(no filename)";
|
||||
const mimetype = file.mimetype orelse "(no mimetype)";
|
||||
|
@ -40,6 +41,19 @@ const Handler = struct {
|
|||
std.log.debug(" mimetype: {s}\n", .{mimetype});
|
||||
std.log.debug(" contents: {any}\n", .{data});
|
||||
},
|
||||
// multi-file upload
|
||||
zap.HttpParam.Array_Binfile => |*files| {
|
||||
for (files.*.items) |file| {
|
||||
const filename = file.filename orelse "(no filename)";
|
||||
const mimetype = file.mimetype orelse "(no mimetype)";
|
||||
const data = file.data orelse "";
|
||||
|
||||
std.log.debug(" filename: `{s}`\n", .{filename});
|
||||
std.log.debug(" mimetype: {s}\n", .{mimetype});
|
||||
std.log.debug(" contents: {any}\n", .{data});
|
||||
files.*.deinit();
|
||||
}
|
||||
},
|
||||
else => {
|
||||
// might be a string param, we don't care
|
||||
// let's just get it as string
|
||||
|
|
17
src/fio.zig
17
src/fio.zig
|
@ -133,7 +133,22 @@ pub extern fn fiobj_hash_pop(hash: FIOBJ, key: [*c]FIOBJ) FIOBJ;
|
|||
pub extern fn fiobj_hash_count(hash: FIOBJ) usize;
|
||||
pub extern fn fiobj_hash_key_in_loop() FIOBJ;
|
||||
pub extern fn fiobj_hash_haskey(hash: FIOBJ, key: FIOBJ) c_int;
|
||||
pub extern fn fiobj_ary_new() FIOBJ;
|
||||
pub extern fn fiobj_ary_new2(capa: usize) FIOBJ;
|
||||
pub extern fn fiobj_ary_count(ary: FIOBJ) usize;
|
||||
pub extern fn fiobj_ary_capa(ary: FIOBJ) usize;
|
||||
pub extern fn fiobj_ary2ptr(ary: FIOBJ) [*c]FIOBJ;
|
||||
pub extern fn fiobj_ary_index(ary: FIOBJ, pos: i64) FIOBJ;
|
||||
pub extern fn fiobj_ary_set(ary: FIOBJ, obj: FIOBJ, pos: i64) void;
|
||||
pub extern fn fiobj_ary_push(ary: FIOBJ, obj: FIOBJ) void;
|
||||
pub extern fn fiobj_ary_pop(ary: FIOBJ) FIOBJ;
|
||||
pub extern fn fiobj_ary_unshift(ary: FIOBJ, obj: FIOBJ) void;
|
||||
pub extern fn fiobj_ary_shift(ary: FIOBJ) FIOBJ;
|
||||
pub extern fn fiobj_ary_replace(ary: FIOBJ, obj: FIOBJ, pos: i64) FIOBJ;
|
||||
pub extern fn fiobj_ary_find(ary: FIOBJ, data: FIOBJ) i64;
|
||||
pub extern fn fiobj_ary_remove(ary: FIOBJ, pos: i64) c_int;
|
||||
pub extern fn fiobj_ary_remove2(ary: FIOBJ, data: FIOBJ) c_int;
|
||||
pub extern fn fiobj_ary_compact(ary: FIOBJ) void;
|
||||
pub extern fn fiobj_float_new(num: f64) FIOBJ;
|
||||
pub extern fn fiobj_num_new_bignum(num: isize) FIOBJ;
|
||||
|
||||
|
@ -163,7 +178,6 @@ pub fn fiobj_true() callconv(.C) FIOBJ {
|
|||
pub fn fiobj_false() callconv(.C) FIOBJ {
|
||||
return @as(FIOBJ, @bitCast(@as(c_long, FIOBJ_T_FALSE)));
|
||||
}
|
||||
pub extern fn fiobj_ary_new2(capa: usize) FIOBJ;
|
||||
pub extern fn fiobj_str_new(str: [*c]const u8, len: usize) FIOBJ;
|
||||
pub extern fn fiobj_str_buf(capa: usize) FIOBJ;
|
||||
|
||||
|
@ -200,7 +214,6 @@ pub inline fn FIOBJECT2HEAD(o: anytype) [*c]fiobj_object_header_s {
|
|||
pub inline fn fiobj_ary_entry(a: anytype, p: anytype) @TypeOf(fiobj_ary_index(a, p)) {
|
||||
return fiobj_ary_index(a, p);
|
||||
}
|
||||
pub extern fn fiobj_ary_index(ary: FIOBJ, pos: i64) FIOBJ;
|
||||
pub const FIOBJ_T_NUMBER: c_int = 1;
|
||||
pub const FIOBJ_T_NULL: c_int = 6;
|
||||
pub const FIOBJ_T_TRUE: c_int = 22;
|
||||
|
|
77
src/zap.zig
77
src/zap.zig
|
@ -552,7 +552,7 @@ pub const HttpParamValueType = enum {
|
|||
String,
|
||||
Unsupported,
|
||||
Hash_Binfile,
|
||||
Unsupported_Array,
|
||||
Array_Binfile,
|
||||
};
|
||||
|
||||
pub const HttpParam = union(HttpParamValueType) {
|
||||
|
@ -566,7 +566,7 @@ pub const HttpParam = union(HttpParamValueType) {
|
|||
/// we assume hashes are because of file transmissions
|
||||
Hash_Binfile: HttpParamBinaryFile,
|
||||
/// value will always be null
|
||||
Unsupported_Array: ?void,
|
||||
Array_Binfile: std.ArrayList(HttpParamBinaryFile),
|
||||
};
|
||||
|
||||
pub const HttpParamKV = struct {
|
||||
|
@ -599,16 +599,7 @@ pub const HttpParamBinaryFile = struct {
|
|||
}
|
||||
};
|
||||
|
||||
pub fn Fiobj2HttpParam(o: fio.FIOBJ, a: std.mem.Allocator, dupe_string: bool) !?HttpParam {
|
||||
return switch (fio.fiobj_type(o)) {
|
||||
fio.FIOBJ_T_NULL => null,
|
||||
fio.FIOBJ_T_TRUE => .{ .Bool = true },
|
||||
fio.FIOBJ_T_FALSE => .{ .Bool = false },
|
||||
fio.FIOBJ_T_NUMBER => .{ .Int = fio.fiobj_obj2num(o) },
|
||||
fio.FIOBJ_T_FLOAT => .{ .Float = fio.fiobj_obj2float(o) },
|
||||
fio.FIOBJ_T_STRING => .{ .String = try util.fio2strAllocOrNot(o, a, dupe_string) },
|
||||
fio.FIOBJ_T_ARRAY => .{ .Unsupported_Array = null },
|
||||
fio.FIOBJ_T_HASH => {
|
||||
fn parseBinfilesFrom(a: std.mem.Allocator, o: fio.FIOBJ) !HttpParam {
|
||||
const key_name = fio.fiobj_str_new("name", 4);
|
||||
const key_data = fio.fiobj_str_new("data", 4);
|
||||
const key_type = fio.fiobj_str_new("type", 4);
|
||||
|
@ -661,12 +652,52 @@ pub fn Fiobj2HttpParam(o: fio.FIOBJ, a: std.mem.Allocator, dupe_string: bool) !?
|
|||
}
|
||||
},
|
||||
fio.FIOBJ_T_ARRAY => {
|
||||
std.log.warn("WARNING: HTTP param binary file as array object is not implemented\n", .{});
|
||||
return .{ .Unsupported = null };
|
||||
// OK, data is an array
|
||||
const len = fio.fiobj_ary_count(data);
|
||||
const fn_ary = fio.fiobj_hash_get(o, key_name);
|
||||
const mt_ary = fio.fiobj_hash_get(o, key_type);
|
||||
|
||||
if (fio.fiobj_ary_count(fn_ary) == len and fio.fiobj_ary_count(mt_ary) == len) {
|
||||
var i: isize = 0;
|
||||
var ret = std.ArrayList(HttpParamBinaryFile).init(a);
|
||||
while (i < len) : (i += 1) {
|
||||
const file_data_obj = fio.fiobj_ary_entry(data, i);
|
||||
const file_name_obj = fio.fiobj_ary_entry(fn_ary, i);
|
||||
const file_mimetype_obj = fio.fiobj_ary_entry(mt_ary, i);
|
||||
var has_error: bool = false;
|
||||
if (fio.is_invalid(file_data_obj) != 1) {
|
||||
std.log.debug("file data invalid in array", .{});
|
||||
has_error = true;
|
||||
}
|
||||
if (fio.is_invalid(file_name_obj) != 1) {
|
||||
std.log.debug("file name invalid in array", .{});
|
||||
has_error = true;
|
||||
}
|
||||
if (fio.is_invalid(file_mimetype_obj) != 1) {
|
||||
std.log.debug("file mimetype invalid in array", .{});
|
||||
has_error = true;
|
||||
}
|
||||
if (has_error) {
|
||||
return error.Invalid;
|
||||
}
|
||||
|
||||
const file_data = fio.fiobj_obj2cstr(file_data_obj);
|
||||
const file_name = fio.fiobj_obj2cstr(file_name_obj);
|
||||
const file_mimetype = fio.fiobj_obj2cstr(file_mimetype_obj);
|
||||
try ret.append(.{
|
||||
.data = file_data.data[0..file_data.len],
|
||||
.mimetype = file_mimetype.data[0..file_mimetype.len],
|
||||
.filename = file_name.data[0..file_name.len],
|
||||
});
|
||||
}
|
||||
return .{ .Array_Binfile = ret };
|
||||
} else {
|
||||
return error.ArrayLenMismatch;
|
||||
}
|
||||
},
|
||||
else => {
|
||||
// don't know what to do
|
||||
return .{ .Unsupported = null };
|
||||
return error.Unsupported;
|
||||
},
|
||||
}
|
||||
|
||||
|
@ -678,6 +709,22 @@ pub fn Fiobj2HttpParam(o: fio.FIOBJ, a: std.mem.Allocator, dupe_string: bool) !?
|
|||
} else {
|
||||
return .{ .Hash_Binfile = .{} };
|
||||
}
|
||||
}
|
||||
|
||||
pub fn Fiobj2HttpParam(o: fio.FIOBJ, a: std.mem.Allocator, dupe_string: bool) !?HttpParam {
|
||||
return switch (fio.fiobj_type(o)) {
|
||||
fio.FIOBJ_T_NULL => null,
|
||||
fio.FIOBJ_T_TRUE => .{ .Bool = true },
|
||||
fio.FIOBJ_T_FALSE => .{ .Bool = false },
|
||||
fio.FIOBJ_T_NUMBER => .{ .Int = fio.fiobj_obj2num(o) },
|
||||
fio.FIOBJ_T_FLOAT => .{ .Float = fio.fiobj_obj2float(o) },
|
||||
fio.FIOBJ_T_STRING => .{ .String = try util.fio2strAllocOrNot(o, a, dupe_string) },
|
||||
fio.FIOBJ_T_ARRAY => {
|
||||
return .{ .Unsupported = null };
|
||||
},
|
||||
fio.FIOBJ_T_HASH => {
|
||||
const file = try parseBinfilesFrom(a, o);
|
||||
return file;
|
||||
},
|
||||
else => .{ .Unsupported = null },
|
||||
};
|
||||
|
|
Loading…
Add table
Reference in a new issue