2020-12-05 19:26:32 +08:00
|
|
|
// Copyright (c) 2004-2013 Sergey Lyubka
|
2022-02-23 02:13:06 +08:00
|
|
|
// Copyright (c) 2013-2022 Cesanta Software Limited
|
2020-12-05 19:26:32 +08:00
|
|
|
// All rights reserved
|
|
|
|
//
|
|
|
|
// This software is dual-licensed: you can redistribute it and/or modify
|
|
|
|
// it under the terms of the GNU General Public License version 2 as
|
|
|
|
// published by the Free Software Foundation. For the terms of this
|
2021-10-20 17:04:49 +08:00
|
|
|
// license, see http://www.gnu.org/licenses/
|
2020-12-05 19:26:32 +08:00
|
|
|
//
|
|
|
|
// You are free to use this software under the terms of the GNU General
|
|
|
|
// Public License, but WITHOUT ANY WARRANTY; without even the implied
|
|
|
|
// warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
|
|
|
|
// See the GNU General Public License for more details.
|
|
|
|
//
|
|
|
|
// Alternatively, you can license this software under a commercial
|
2021-10-20 17:04:49 +08:00
|
|
|
// license, as set out in https://www.mongoose.ws/licensing/
|
2022-02-23 02:13:06 +08:00
|
|
|
//
|
|
|
|
// SPDX-License-Identifier: GPL-2.0 or commercial
|
2019-03-19 20:59:13 +08:00
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
#include "mongoose.h"
|
2017-03-24 02:39:57 +08:00
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
#ifdef MG_ENABLE_LINES
|
|
|
|
#line 1 "src/base64.c"
|
2014-02-20 00:38:53 +08:00
|
|
|
#endif
|
2021-10-22 20:58:51 +08:00
|
|
|
|
2015-09-08 19:49:03 +08:00
|
|
|
#include <string.h>
|
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
static int mg_b64idx(int c) {
|
|
|
|
if (c < 26) {
|
|
|
|
return c + 'A';
|
|
|
|
} else if (c < 52) {
|
|
|
|
return c - 26 + 'a';
|
|
|
|
} else if (c < 62) {
|
|
|
|
return c - 52 + '0';
|
2015-11-01 00:26:19 +08:00
|
|
|
} else {
|
2020-12-05 19:26:32 +08:00
|
|
|
return c == 62 ? '+' : '/';
|
2015-11-01 00:26:19 +08:00
|
|
|
}
|
2015-09-08 19:49:03 +08:00
|
|
|
}
|
2014-05-13 06:22:57 +08:00
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
static int mg_b64rev(int c) {
|
|
|
|
if (c >= 'A' && c <= 'Z') {
|
|
|
|
return c - 'A';
|
|
|
|
} else if (c >= 'a' && c <= 'z') {
|
|
|
|
return c + 26 - 'a';
|
|
|
|
} else if (c >= '0' && c <= '9') {
|
|
|
|
return c + 52 - '0';
|
|
|
|
} else if (c == '+') {
|
|
|
|
return 62;
|
|
|
|
} else if (c == '/') {
|
|
|
|
return 63;
|
|
|
|
} else if (c == '=') {
|
|
|
|
return 64;
|
|
|
|
} else {
|
|
|
|
return -1;
|
2014-10-09 16:26:45 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
int mg_base64_update(unsigned char ch, char *to, int n) {
|
2021-05-29 01:45:35 +08:00
|
|
|
int rem = (n & 3) % 3;
|
2020-12-05 19:26:32 +08:00
|
|
|
if (rem == 0) {
|
2021-05-29 01:30:42 +08:00
|
|
|
to[n] = (char) mg_b64idx(ch >> 2);
|
|
|
|
to[++n] = (char) ((ch & 3) << 4);
|
2020-12-05 19:26:32 +08:00
|
|
|
} else if (rem == 1) {
|
2021-05-29 01:30:42 +08:00
|
|
|
to[n] = (char) mg_b64idx(to[n] | (ch >> 4));
|
|
|
|
to[++n] = (char) ((ch & 15) << 2);
|
2020-12-05 19:26:32 +08:00
|
|
|
} else {
|
2021-05-29 01:30:42 +08:00
|
|
|
to[n] = (char) mg_b64idx(to[n] | (ch >> 6));
|
|
|
|
to[++n] = (char) mg_b64idx(ch & 63);
|
2020-12-05 19:26:32 +08:00
|
|
|
n++;
|
|
|
|
}
|
|
|
|
return n;
|
2015-11-01 00:26:19 +08:00
|
|
|
}
|
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
int mg_base64_final(char *to, int n) {
|
|
|
|
int saved = n;
|
|
|
|
// printf("---[%.*s]\n", n, to);
|
|
|
|
if (n & 3) n = mg_base64_update(0, to, n);
|
|
|
|
if ((saved & 3) == 2) n--;
|
|
|
|
// printf(" %d[%.*s]\n", n, n, to);
|
|
|
|
while (n & 3) to[n++] = '=';
|
|
|
|
to[n] = '\0';
|
|
|
|
return n;
|
2014-02-20 00:38:53 +08:00
|
|
|
}
|
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
int mg_base64_encode(const unsigned char *p, int n, char *to) {
|
|
|
|
int i, len = 0;
|
|
|
|
for (i = 0; i < n; i++) len = mg_base64_update(p[i], to, len);
|
|
|
|
len = mg_base64_final(to, len);
|
|
|
|
return len;
|
2014-02-20 00:38:53 +08:00
|
|
|
}
|
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
int mg_base64_decode(const char *src, int n, char *dst) {
|
|
|
|
const char *end = src + n;
|
|
|
|
int len = 0;
|
|
|
|
while (src + 3 < end) {
|
|
|
|
int a = mg_b64rev(src[0]), b = mg_b64rev(src[1]), c = mg_b64rev(src[2]),
|
|
|
|
d = mg_b64rev(src[3]);
|
|
|
|
if (a == 64 || a < 0 || b == 64 || b < 0 || c < 0 || d < 0) return 0;
|
2021-05-29 01:30:42 +08:00
|
|
|
dst[len++] = (char) ((a << 2) | (b >> 4));
|
2020-12-05 19:26:32 +08:00
|
|
|
if (src[2] != '=') {
|
2021-05-29 01:30:42 +08:00
|
|
|
dst[len++] = (char) ((b << 4) | (c >> 2));
|
|
|
|
if (src[3] != '=') dst[len++] = (char) ((c << 6) | d);
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
|
|
|
src += 4;
|
|
|
|
}
|
|
|
|
dst[len] = '\0';
|
|
|
|
return len;
|
2014-09-10 01:07:55 +08:00
|
|
|
}
|
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
#ifdef MG_ENABLE_LINES
|
|
|
|
#line 1 "src/dns.c"
|
2017-11-24 18:21:45 +08:00
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2019-01-26 12:37:17 +08:00
|
|
|
|
2017-11-24 18:21:45 +08:00
|
|
|
|
2022-01-07 23:48:09 +08:00
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
struct dns_data {
|
|
|
|
struct dns_data *next;
|
|
|
|
struct mg_connection *c;
|
2022-04-07 20:50:25 +08:00
|
|
|
uint64_t expire;
|
2020-12-05 19:26:32 +08:00
|
|
|
uint16_t txnid;
|
|
|
|
};
|
2017-11-24 18:21:45 +08:00
|
|
|
|
2020-12-22 17:44:59 +08:00
|
|
|
static void mg_sendnsreq(struct mg_connection *, struct mg_str *, int,
|
|
|
|
struct mg_dns *, bool);
|
|
|
|
|
2022-04-12 21:14:55 +08:00
|
|
|
static void mg_dns_free(struct mg_connection *c, struct dns_data *d) {
|
|
|
|
LIST_DELETE(struct dns_data,
|
|
|
|
(struct dns_data **) &c->mgr->active_dns_requests, d);
|
2020-12-05 19:26:32 +08:00
|
|
|
free(d);
|
|
|
|
}
|
2017-11-24 18:21:45 +08:00
|
|
|
|
2020-12-22 17:44:59 +08:00
|
|
|
void mg_resolve_cancel(struct mg_connection *c) {
|
2022-04-12 21:14:55 +08:00
|
|
|
struct dns_data *tmp, *d = (struct dns_data *) c->mgr->active_dns_requests;
|
|
|
|
for (; d != NULL; d = tmp) {
|
2020-12-05 19:26:32 +08:00
|
|
|
tmp = d->next;
|
2022-04-12 21:14:55 +08:00
|
|
|
if (d->c == c) mg_dns_free(c, d);
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
|
|
|
}
|
2017-11-24 18:21:45 +08:00
|
|
|
|
2020-12-28 13:25:29 +08:00
|
|
|
static size_t mg_dns_parse_name_depth(const uint8_t *s, size_t len, size_t ofs,
|
2022-03-22 00:29:27 +08:00
|
|
|
char *to, size_t tolen, size_t j,
|
|
|
|
int depth) {
|
|
|
|
size_t i = 0;
|
|
|
|
if (tolen > 0 && depth == 0) to[0] = '\0';
|
2020-12-12 01:35:58 +08:00
|
|
|
if (depth > 5) return 0;
|
2022-03-22 00:29:27 +08:00
|
|
|
// MG_INFO(("ofs %lx %x %x", (unsigned long) ofs, s[ofs], s[ofs + 1]));
|
2020-12-28 13:25:29 +08:00
|
|
|
while (ofs + i + 1 < len) {
|
|
|
|
size_t n = s[ofs + i];
|
|
|
|
if (n == 0) {
|
2020-12-05 19:26:32 +08:00
|
|
|
i++;
|
|
|
|
break;
|
|
|
|
}
|
2020-12-28 13:25:29 +08:00
|
|
|
if (n & 0xc0) {
|
|
|
|
size_t ptr = (((n & 0x3f) << 8) | s[ofs + i + 1]); // 12 is hdr len
|
2022-03-22 00:29:27 +08:00
|
|
|
// MG_INFO(("PTR %lx", (unsigned long) ptr));
|
2020-12-28 13:25:29 +08:00
|
|
|
if (ptr + 1 < len && (s[ptr] & 0xc0) == 0 &&
|
2022-03-22 00:29:27 +08:00
|
|
|
mg_dns_parse_name_depth(s, len, ptr, to, tolen, j, depth + 1) == 0)
|
2020-12-28 13:25:29 +08:00
|
|
|
return 0;
|
|
|
|
i += 2;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (ofs + i + n + 1 >= len) return 0;
|
|
|
|
if (j > 0) {
|
|
|
|
if (j < tolen) to[j] = '.';
|
|
|
|
j++;
|
|
|
|
}
|
|
|
|
if (j + n < tolen) memcpy(&to[j], &s[ofs + i + 1], n);
|
2020-12-05 19:26:32 +08:00
|
|
|
j += n;
|
|
|
|
i += n + 1;
|
2020-12-28 13:25:29 +08:00
|
|
|
if (j < tolen) to[j] = '\0'; // Zero-terminate this chunk
|
2022-03-22 00:29:27 +08:00
|
|
|
// MG_INFO(("--> [%s]", to));
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
2020-12-18 03:14:17 +08:00
|
|
|
if (tolen > 0) to[tolen - 1] = '\0'; // Make sure make sure it is nul-term
|
2020-12-05 19:26:32 +08:00
|
|
|
return i;
|
|
|
|
}
|
2017-12-17 00:21:51 +08:00
|
|
|
|
2021-10-23 02:41:26 +08:00
|
|
|
static size_t mg_dns_parse_name(const uint8_t *s, size_t n, size_t ofs,
|
|
|
|
char *dst, size_t dstlen) {
|
2022-03-22 00:29:27 +08:00
|
|
|
return mg_dns_parse_name_depth(s, n, ofs, dst, dstlen, 0, 0);
|
2020-12-28 13:25:29 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
size_t mg_dns_parse_rr(const uint8_t *buf, size_t len, size_t ofs,
|
|
|
|
bool is_question, struct mg_dns_rr *rr) {
|
|
|
|
const uint8_t *s = buf + ofs, *e = &buf[len];
|
|
|
|
|
|
|
|
memset(rr, 0, sizeof(*rr));
|
2021-04-14 02:42:47 +08:00
|
|
|
if (len < sizeof(struct mg_dns_header)) return 0; // Too small
|
2021-10-22 15:56:45 +08:00
|
|
|
if (len > 512) return 0; // Too large, we don't expect that
|
|
|
|
if (s >= e) return 0; // Overflow
|
2020-12-28 13:25:29 +08:00
|
|
|
|
2020-12-28 14:32:55 +08:00
|
|
|
if ((rr->nlen = (uint16_t) mg_dns_parse_name(buf, len, ofs, NULL, 0)) == 0)
|
|
|
|
return 0;
|
2020-12-28 13:25:29 +08:00
|
|
|
s += rr->nlen + 4;
|
|
|
|
if (s > e) return 0;
|
2021-10-22 15:56:45 +08:00
|
|
|
rr->atype = (uint16_t) (((uint16_t) s[-4] << 8) | s[-3]);
|
|
|
|
rr->aclass = (uint16_t) (((uint16_t) s[-2] << 8) | s[-1]);
|
|
|
|
if (is_question) return (size_t) (rr->nlen + 4);
|
2020-12-28 13:25:29 +08:00
|
|
|
|
|
|
|
s += 6;
|
|
|
|
if (s > e) return 0;
|
2021-10-22 15:56:45 +08:00
|
|
|
rr->alen = (uint16_t) (((uint16_t) s[-2] << 8) | s[-1]);
|
2020-12-28 13:25:29 +08:00
|
|
|
if (s + rr->alen > e) return 0;
|
2021-10-22 15:56:45 +08:00
|
|
|
return (size_t) (rr->nlen + rr->alen + 10);
|
2020-12-28 13:25:29 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
bool mg_dns_parse(const uint8_t *buf, size_t len, struct mg_dns_message *dm) {
|
|
|
|
const struct mg_dns_header *h = (struct mg_dns_header *) buf;
|
|
|
|
struct mg_dns_rr rr;
|
|
|
|
size_t i, n, ofs = sizeof(*h);
|
|
|
|
memset(dm, 0, sizeof(*dm));
|
|
|
|
|
|
|
|
if (len < sizeof(*h)) return 0; // Too small, headers dont fit
|
2020-12-25 12:32:56 +08:00
|
|
|
if (mg_ntohs(h->num_questions) > 1) return 0; // Sanity
|
|
|
|
if (mg_ntohs(h->num_answers) > 10) return 0; // Sanity
|
2020-12-28 13:25:29 +08:00
|
|
|
dm->txnid = mg_ntohs(h->txnid);
|
|
|
|
|
2020-12-12 01:35:58 +08:00
|
|
|
for (i = 0; i < mg_ntohs(h->num_questions); i++) {
|
2020-12-28 13:25:29 +08:00
|
|
|
if ((n = mg_dns_parse_rr(buf, len, ofs, true, &rr)) == 0) return false;
|
2022-03-22 00:29:27 +08:00
|
|
|
// MG_INFO(("Q %lu %lu %hu/%hu", ofs, n, rr.atype, rr.aclass));
|
2020-12-28 13:25:29 +08:00
|
|
|
ofs += n;
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
|
|
|
for (i = 0; i < mg_ntohs(h->num_answers); i++) {
|
2020-12-28 13:25:29 +08:00
|
|
|
if ((n = mg_dns_parse_rr(buf, len, ofs, false, &rr)) == 0) return false;
|
2022-03-22 00:29:27 +08:00
|
|
|
// MG_INFO(("A -- %lu %lu %hu/%hu %s", ofs, n, rr.atype, rr.aclass,
|
|
|
|
// dm->name));
|
2020-12-28 13:25:29 +08:00
|
|
|
mg_dns_parse_name(buf, len, ofs, dm->name, sizeof(dm->name));
|
|
|
|
ofs += n;
|
|
|
|
|
|
|
|
if (rr.alen == 4 && rr.atype == 1 && rr.aclass == 1) {
|
2020-12-22 17:44:59 +08:00
|
|
|
dm->addr.is_ip6 = false;
|
2020-12-28 13:25:29 +08:00
|
|
|
memcpy(&dm->addr.ip, &buf[ofs - 4], 4);
|
2020-12-22 17:44:59 +08:00
|
|
|
dm->resolved = true;
|
|
|
|
break; // Return success
|
2020-12-28 13:25:29 +08:00
|
|
|
} else if (rr.alen == 16 && rr.atype == 28 && rr.aclass == 1) {
|
2020-12-22 17:44:59 +08:00
|
|
|
dm->addr.is_ip6 = true;
|
2020-12-28 13:25:29 +08:00
|
|
|
memcpy(&dm->addr.ip6, &buf[ofs - 16], 16);
|
2020-12-21 00:55:33 +08:00
|
|
|
dm->resolved = true;
|
|
|
|
break; // Return success
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
|
|
|
}
|
2020-12-21 00:55:33 +08:00
|
|
|
return true;
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
2017-11-24 18:21:45 +08:00
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
static void dns_cb(struct mg_connection *c, int ev, void *ev_data,
|
|
|
|
void *fn_data) {
|
2020-12-22 17:44:59 +08:00
|
|
|
struct dns_data *d, *tmp;
|
2020-12-05 19:26:32 +08:00
|
|
|
if (ev == MG_EV_POLL) {
|
2022-04-07 20:50:25 +08:00
|
|
|
uint64_t now = *(uint64_t *) ev_data;
|
2022-04-12 21:14:55 +08:00
|
|
|
for (d = (struct dns_data *) c->mgr->active_dns_requests; d != NULL;
|
|
|
|
d = tmp) {
|
2020-12-05 19:26:32 +08:00
|
|
|
tmp = d->next;
|
2022-02-13 02:17:25 +08:00
|
|
|
// MG_DEBUG ("%lu %lu dns poll", d->expire, now));
|
2020-12-05 19:26:32 +08:00
|
|
|
if (now > d->expire) mg_error(d->c, "DNS timeout");
|
|
|
|
}
|
|
|
|
} else if (ev == MG_EV_READ) {
|
|
|
|
struct mg_dns_message dm;
|
|
|
|
int resolved = 0;
|
2020-12-21 00:55:33 +08:00
|
|
|
if (mg_dns_parse(c->recv.buf, c->recv.len, &dm) == false) {
|
2022-05-07 04:09:13 +08:00
|
|
|
MG_ERROR(("Unexpected DNS response:"));
|
|
|
|
mg_hexdump(c->recv.buf, c->recv.len);
|
2020-12-21 00:55:33 +08:00
|
|
|
} else {
|
2022-02-13 02:17:25 +08:00
|
|
|
MG_VERBOSE(("%s %d", dm.name, dm.resolved));
|
2022-04-12 21:14:55 +08:00
|
|
|
for (d = (struct dns_data *) c->mgr->active_dns_requests; d != NULL;
|
|
|
|
d = tmp) {
|
2020-12-05 19:26:32 +08:00
|
|
|
tmp = d->next;
|
2022-02-13 02:17:25 +08:00
|
|
|
// MG_INFO(("d %p %hu %hu", d, d->txnid, dm.txnid));
|
2020-12-05 19:26:32 +08:00
|
|
|
if (dm.txnid != d->txnid) continue;
|
|
|
|
if (d->c->is_resolving) {
|
2020-12-21 00:55:33 +08:00
|
|
|
if (dm.resolved) {
|
2021-01-24 21:57:40 +08:00
|
|
|
char buf[100];
|
2022-02-23 06:00:55 +08:00
|
|
|
dm.addr.port = d->c->rem.port; // Save port
|
|
|
|
d->c->rem = dm.addr; // Copy resolved address
|
2022-05-07 03:19:40 +08:00
|
|
|
MG_DEBUG(("%lu %s is %s", d->c->id, dm.name,
|
2022-02-23 06:00:55 +08:00
|
|
|
mg_ntoa(&d->c->rem, buf, sizeof(buf))));
|
2020-12-21 00:55:33 +08:00
|
|
|
mg_connect_resolved(d->c);
|
2020-12-22 17:44:59 +08:00
|
|
|
#if MG_ENABLE_IPV6
|
2022-04-23 03:44:53 +08:00
|
|
|
} else if (dm.addr.is_ip6 == false && dm.name[0] != '\0' &&
|
|
|
|
c->mgr->use_dns6 == false) {
|
2020-12-22 17:44:59 +08:00
|
|
|
struct mg_str x = mg_str(dm.name);
|
|
|
|
mg_sendnsreq(d->c, &x, c->mgr->dnstimeout, &c->mgr->dns6, true);
|
|
|
|
#endif
|
2020-12-21 00:55:33 +08:00
|
|
|
} else {
|
|
|
|
mg_error(d->c, "%s DNS lookup failed", dm.name);
|
|
|
|
}
|
2020-12-05 19:26:32 +08:00
|
|
|
} else {
|
2022-02-13 02:17:25 +08:00
|
|
|
MG_ERROR(("%lu already resolved", d->c->id));
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
2022-04-12 21:14:55 +08:00
|
|
|
mg_dns_free(c, d);
|
2020-12-05 19:26:32 +08:00
|
|
|
resolved = 1;
|
|
|
|
}
|
|
|
|
}
|
2022-02-13 02:17:25 +08:00
|
|
|
if (!resolved) MG_ERROR(("stray DNS reply"));
|
2020-12-05 19:26:32 +08:00
|
|
|
c->recv.len = 0;
|
|
|
|
} else if (ev == MG_EV_CLOSE) {
|
2022-04-12 21:14:55 +08:00
|
|
|
for (d = (struct dns_data *) c->mgr->active_dns_requests; d != NULL;
|
|
|
|
d = tmp) {
|
2020-12-05 19:26:32 +08:00
|
|
|
tmp = d->next;
|
2022-01-14 16:50:01 +08:00
|
|
|
mg_error(d->c, "DNS error");
|
2022-04-12 21:14:55 +08:00
|
|
|
mg_dns_free(c, d);
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
|
|
|
}
|
2021-01-21 18:00:18 +08:00
|
|
|
(void) fn_data;
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
|
|
|
|
2022-04-01 22:42:15 +08:00
|
|
|
static bool mg_dns_send(struct mg_connection *c, const struct mg_str *name,
|
2021-10-23 02:41:26 +08:00
|
|
|
uint16_t txnid, bool ipv6) {
|
2020-12-05 19:26:32 +08:00
|
|
|
struct {
|
|
|
|
struct mg_dns_header header;
|
|
|
|
uint8_t data[256];
|
|
|
|
} pkt;
|
|
|
|
size_t i, n;
|
|
|
|
memset(&pkt, 0, sizeof(pkt));
|
2020-12-28 13:25:29 +08:00
|
|
|
pkt.header.txnid = mg_htons(txnid);
|
2020-12-05 19:26:32 +08:00
|
|
|
pkt.header.flags = mg_htons(0x100);
|
2020-12-22 17:44:59 +08:00
|
|
|
pkt.header.num_questions = mg_htons(1);
|
2020-12-05 19:26:32 +08:00
|
|
|
for (i = n = 0; i < sizeof(pkt.data) - 5; i++) {
|
|
|
|
if (name->ptr[i] == '.' || i >= name->len) {
|
2021-10-22 15:56:45 +08:00
|
|
|
pkt.data[n] = (uint8_t) (i - n);
|
2020-12-05 19:26:32 +08:00
|
|
|
memcpy(&pkt.data[n + 1], name->ptr + n, i - n);
|
|
|
|
n = i + 1;
|
|
|
|
}
|
|
|
|
if (i >= name->len) break;
|
|
|
|
}
|
|
|
|
memcpy(&pkt.data[n], "\x00\x00\x01\x00\x01", 5); // A query
|
|
|
|
n += 5;
|
2020-12-22 17:44:59 +08:00
|
|
|
if (ipv6) pkt.data[n - 3] = 0x1c; // AAAA query
|
|
|
|
// memcpy(&pkt.data[n], "\xc0\x0c\x00\x1c\x00\x01", 6); // AAAA query
|
|
|
|
// n += 6;
|
2022-04-01 22:42:15 +08:00
|
|
|
return mg_send(c, &pkt, sizeof(pkt.header) + n);
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
2018-07-13 04:28:51 +08:00
|
|
|
|
2020-12-22 17:44:59 +08:00
|
|
|
static void mg_sendnsreq(struct mg_connection *c, struct mg_str *name, int ms,
|
|
|
|
struct mg_dns *dnsc, bool ipv6) {
|
2020-12-05 19:26:32 +08:00
|
|
|
struct dns_data *d = NULL;
|
2020-12-22 17:44:59 +08:00
|
|
|
if (dnsc->url == NULL) {
|
|
|
|
mg_error(c, "DNS server URL is NULL. Call mg_mgr_init()");
|
|
|
|
} else if (dnsc->c == NULL) {
|
|
|
|
dnsc->c = mg_connect(c->mgr, dnsc->url, NULL, NULL);
|
|
|
|
if (dnsc->c != NULL) {
|
|
|
|
dnsc->c->pfn = dns_cb;
|
2022-06-03 20:57:57 +08:00
|
|
|
// dnsc->c->is_hexdumping = 1;
|
2020-12-22 17:44:59 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
if (dnsc->c == NULL) {
|
|
|
|
mg_error(c, "resolver");
|
|
|
|
} else if ((d = (struct dns_data *) calloc(1, sizeof(*d))) == NULL) {
|
|
|
|
mg_error(c, "resolve OOM");
|
|
|
|
} else {
|
2022-04-12 21:14:55 +08:00
|
|
|
struct dns_data *reqs = (struct dns_data *) c->mgr->active_dns_requests;
|
2021-04-22 22:21:16 +08:00
|
|
|
char buf[100];
|
2022-04-12 21:14:55 +08:00
|
|
|
d->txnid = reqs ? (uint16_t) (reqs->txnid + 1) : 1;
|
|
|
|
d->next = (struct dns_data *) c->mgr->active_dns_requests;
|
|
|
|
c->mgr->active_dns_requests = d;
|
2022-04-07 20:50:25 +08:00
|
|
|
d->expire = mg_millis() + (uint64_t) ms;
|
2020-12-22 17:44:59 +08:00
|
|
|
d->c = c;
|
|
|
|
c->is_resolving = 1;
|
2022-02-13 02:17:25 +08:00
|
|
|
MG_VERBOSE(("%lu resolving %.*s @ %s, txnid %hu", c->id, (int) name->len,
|
2022-02-23 06:00:55 +08:00
|
|
|
name->ptr, mg_ntoa(&dnsc->c->rem, buf, sizeof(buf)), d->txnid));
|
2022-04-01 22:42:15 +08:00
|
|
|
if (!mg_dns_send(dnsc->c, name, d->txnid, ipv6)) {
|
|
|
|
mg_error(dnsc->c, "DNS send");
|
|
|
|
}
|
2020-12-22 17:44:59 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2022-01-07 23:00:10 +08:00
|
|
|
void mg_resolve(struct mg_connection *c, const char *url) {
|
|
|
|
struct mg_str host = mg_url_host(url);
|
2022-02-23 06:00:55 +08:00
|
|
|
c->rem.port = mg_htons(mg_url_port(url));
|
|
|
|
if (mg_aton(host, &c->rem)) {
|
2022-01-07 23:00:10 +08:00
|
|
|
// host is an IP address, do not fire name resolution
|
2020-12-05 19:26:32 +08:00
|
|
|
mg_connect_resolved(c);
|
|
|
|
} else {
|
2022-01-07 23:00:10 +08:00
|
|
|
// host is not an IP, send DNS resolution request
|
2022-04-23 03:44:53 +08:00
|
|
|
struct mg_dns *dns = c->mgr->use_dns6 ? &c->mgr->dns6 : &c->mgr->dns4;
|
|
|
|
mg_sendnsreq(c, &host, c->mgr->dnstimeout, dns, c->mgr->use_dns6);
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
|
|
|
}
|
2018-07-13 04:28:51 +08:00
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
#ifdef MG_ENABLE_LINES
|
|
|
|
#line 1 "src/event.c"
|
2018-07-13 04:28:51 +08:00
|
|
|
#endif
|
|
|
|
|
2017-11-24 18:21:45 +08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
void mg_call(struct mg_connection *c, int ev, void *ev_data) {
|
2021-10-31 20:40:56 +08:00
|
|
|
// Run user-defined handler first, in order to give it an ability
|
|
|
|
// to intercept processing (e.g. clean input buffer) before the
|
|
|
|
// protocol handler kicks in
|
2020-12-05 19:26:32 +08:00
|
|
|
if (c->fn != NULL) c->fn(c, ev, ev_data, c->fn_data);
|
2021-10-31 20:40:56 +08:00
|
|
|
if (c->pfn != NULL) c->pfn(c, ev, ev_data, c->pfn_data);
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
2017-11-24 18:21:45 +08:00
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
void mg_error(struct mg_connection *c, const char *fmt, ...) {
|
|
|
|
char mem[256], *buf = mem;
|
|
|
|
va_list ap;
|
|
|
|
va_start(ap, fmt);
|
|
|
|
mg_vasprintf(&buf, sizeof(mem), fmt, ap);
|
|
|
|
va_end(ap);
|
2022-04-01 22:42:15 +08:00
|
|
|
MG_ERROR(("%lu %p %s", c->id, c->fd, buf));
|
2021-12-15 19:31:42 +08:00
|
|
|
c->is_closing = 1; // Set is_closing before sending MG_EV_CALL
|
|
|
|
mg_call(c, MG_EV_ERROR, buf); // Let user handler to override it
|
2020-12-05 19:26:32 +08:00
|
|
|
if (buf != mem) free(buf);
|
|
|
|
}
|
2017-11-24 18:21:45 +08:00
|
|
|
|
2022-01-17 22:42:41 +08:00
|
|
|
#ifdef MG_ENABLE_LINES
|
|
|
|
#line 1 "src/fs.c"
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
2022-01-19 01:11:02 +08:00
|
|
|
|
2022-01-17 22:42:41 +08:00
|
|
|
struct mg_fd *mg_fs_open(struct mg_fs *fs, const char *path, int flags) {
|
|
|
|
struct mg_fd *fd = (struct mg_fd *) calloc(1, sizeof(*fd));
|
|
|
|
if (fd != NULL) {
|
2022-02-08 21:36:04 +08:00
|
|
|
fd->fd = fs->op(path, flags);
|
2022-01-17 22:42:41 +08:00
|
|
|
fd->fs = fs;
|
|
|
|
if (fd->fd == NULL) {
|
|
|
|
free(fd);
|
|
|
|
fd = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return fd;
|
|
|
|
}
|
|
|
|
|
|
|
|
void mg_fs_close(struct mg_fd *fd) {
|
|
|
|
if (fd != NULL) {
|
2022-02-08 21:36:04 +08:00
|
|
|
fd->fs->cl(fd->fd);
|
2022-01-17 22:42:41 +08:00
|
|
|
free(fd);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2022-01-19 01:11:02 +08:00
|
|
|
char *mg_file_read(struct mg_fs *fs, const char *path, size_t *sizep) {
|
|
|
|
struct mg_fd *fd;
|
|
|
|
char *data = NULL;
|
|
|
|
size_t size = 0;
|
2022-02-08 21:36:04 +08:00
|
|
|
fs->st(path, &size, NULL);
|
2022-01-19 01:11:02 +08:00
|
|
|
if ((fd = mg_fs_open(fs, path, MG_FS_READ)) != NULL) {
|
|
|
|
data = (char *) calloc(1, size + 1);
|
|
|
|
if (data != NULL) {
|
2022-02-08 21:36:04 +08:00
|
|
|
if (fs->rd(fd->fd, data, size) != size) {
|
2022-01-19 01:11:02 +08:00
|
|
|
free(data);
|
|
|
|
data = NULL;
|
|
|
|
} else {
|
|
|
|
data[size] = '\0';
|
|
|
|
if (sizep != NULL) *sizep = size;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
mg_fs_close(fd);
|
|
|
|
}
|
|
|
|
return data;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool mg_file_write(struct mg_fs *fs, const char *path, const void *buf,
|
|
|
|
size_t len) {
|
|
|
|
bool result = false;
|
|
|
|
struct mg_fd *fd;
|
|
|
|
char tmp[MG_PATH_MAX];
|
2022-02-10 19:56:55 +08:00
|
|
|
mg_snprintf(tmp, sizeof(tmp), "%s..%d", path, rand());
|
2022-01-19 01:11:02 +08:00
|
|
|
if ((fd = mg_fs_open(fs, tmp, MG_FS_WRITE)) != NULL) {
|
2022-02-08 21:36:04 +08:00
|
|
|
result = fs->wr(fd->fd, buf, len) == len;
|
2022-01-19 01:11:02 +08:00
|
|
|
mg_fs_close(fd);
|
|
|
|
if (result) {
|
2022-02-08 21:36:04 +08:00
|
|
|
fs->rm(path);
|
|
|
|
fs->mv(tmp, path);
|
2022-01-19 01:11:02 +08:00
|
|
|
} else {
|
2022-02-08 21:36:04 +08:00
|
|
|
fs->rm(tmp);
|
2022-01-19 01:11:02 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool mg_file_printf(struct mg_fs *fs, const char *path, const char *fmt, ...) {
|
|
|
|
char tmp[256], *buf = tmp;
|
|
|
|
bool result;
|
2022-02-11 01:11:03 +08:00
|
|
|
size_t len;
|
2022-01-19 01:11:02 +08:00
|
|
|
va_list ap;
|
|
|
|
va_start(ap, fmt);
|
|
|
|
len = mg_vasprintf(&buf, sizeof(tmp), fmt, ap);
|
|
|
|
va_end(ap);
|
|
|
|
result = mg_file_write(fs, path, buf, len > 0 ? (size_t) len : 0);
|
|
|
|
if (buf != tmp) free(buf);
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2022-01-18 15:44:30 +08:00
|
|
|
#ifdef MG_ENABLE_LINES
|
|
|
|
#line 1 "src/fs_fat.c"
|
|
|
|
#endif
|
2022-01-18 16:02:41 +08:00
|
|
|
|
|
|
|
|
2022-01-18 15:44:30 +08:00
|
|
|
#if MG_ENABLE_FATFS
|
|
|
|
#include <ff.h>
|
|
|
|
|
2022-02-10 19:56:55 +08:00
|
|
|
static int mg_days_from_epoch(int y, int m, int d) {
|
|
|
|
y -= m <= 2;
|
|
|
|
int era = y / 400;
|
|
|
|
int yoe = y - era * 400;
|
|
|
|
int doy = (153 * (m + (m > 2 ? -3 : 9)) + 2) / 5 + d - 1;
|
|
|
|
int doe = yoe * 365 + yoe / 4 - yoe / 100 + doy;
|
|
|
|
return era * 146097 + doe - 719468;
|
|
|
|
}
|
|
|
|
|
2022-03-14 19:16:41 +08:00
|
|
|
static time_t mg_timegm(const struct tm *t) {
|
2022-02-10 19:56:55 +08:00
|
|
|
int year = t->tm_year + 1900;
|
|
|
|
int month = t->tm_mon; // 0-11
|
|
|
|
if (month > 11) {
|
|
|
|
year += month / 12;
|
|
|
|
month %= 12;
|
|
|
|
} else if (month < 0) {
|
|
|
|
int years_diff = (11 - month) / 12;
|
|
|
|
year -= years_diff;
|
|
|
|
month += 12 * years_diff;
|
|
|
|
}
|
|
|
|
int x = mg_days_from_epoch(year, month + 1, t->tm_mday);
|
|
|
|
return 60 * (60 * (24L * x + t->tm_hour) + t->tm_min) + t->tm_sec;
|
|
|
|
}
|
|
|
|
|
|
|
|
static time_t ff_time_to_epoch(uint16_t fdate, uint16_t ftime) {
|
|
|
|
struct tm tm;
|
|
|
|
memset(&tm, 0, sizeof(struct tm));
|
|
|
|
tm.tm_sec = (ftime << 1) & 0x3e;
|
|
|
|
tm.tm_min = ((ftime >> 5) & 0x3f);
|
|
|
|
tm.tm_hour = ((ftime >> 11) & 0x1f);
|
|
|
|
tm.tm_mday = (fdate & 0x1f);
|
|
|
|
tm.tm_mon = ((fdate >> 5) & 0x0f) - 1;
|
|
|
|
tm.tm_year = ((fdate >> 9) & 0x7f) + 80;
|
|
|
|
return mg_timegm(&tm);
|
|
|
|
}
|
|
|
|
|
2022-01-18 15:44:30 +08:00
|
|
|
static int ff_stat(const char *path, size_t *size, time_t *mtime) {
|
|
|
|
FILINFO fi;
|
2022-04-05 19:54:20 +08:00
|
|
|
if (path[0] == '\0') {
|
2022-01-18 15:44:30 +08:00
|
|
|
if (size) *size = 0;
|
|
|
|
if (mtime) *mtime = 0;
|
|
|
|
return MG_FS_DIR;
|
|
|
|
} else if (f_stat(path, &fi) == 0) {
|
|
|
|
if (size) *size = (size_t) fi.fsize;
|
2022-02-10 19:56:55 +08:00
|
|
|
if (mtime) *mtime = ff_time_to_epoch(fi.fdate, fi.ftime);
|
2022-01-18 15:44:30 +08:00
|
|
|
return MG_FS_READ | MG_FS_WRITE | ((fi.fattrib & AM_DIR) ? MG_FS_DIR : 0);
|
|
|
|
} else {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void ff_list(const char *dir, void (*fn)(const char *, void *),
|
|
|
|
void *userdata) {
|
|
|
|
DIR d;
|
|
|
|
FILINFO fi;
|
|
|
|
if (f_opendir(&d, dir) == FR_OK) {
|
|
|
|
while (f_readdir(&d, &fi) == FR_OK && fi.fname[0] != '\0') {
|
|
|
|
if (!strcmp(fi.fname, ".") || !strcmp(fi.fname, "..")) continue;
|
|
|
|
fn(fi.fname, userdata);
|
|
|
|
}
|
|
|
|
f_closedir(&d);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void *ff_open(const char *path, int flags) {
|
|
|
|
FIL f;
|
2022-01-25 18:50:08 +08:00
|
|
|
unsigned char mode = FA_READ;
|
2022-03-14 19:16:41 +08:00
|
|
|
if (flags & MG_FS_WRITE) mode |= FA_WRITE | FA_OPEN_ALWAYS | FA_OPEN_APPEND;
|
2022-01-18 15:44:30 +08:00
|
|
|
if (f_open(&f, path, mode) == 0) {
|
|
|
|
FIL *fp = calloc(1, sizeof(*fp));
|
|
|
|
*fp = f;
|
|
|
|
return fp;
|
|
|
|
} else {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void ff_close(void *fp) {
|
|
|
|
if (fp != NULL) {
|
|
|
|
f_close((FIL *) fp);
|
|
|
|
free(fp);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static size_t ff_read(void *fp, void *buf, size_t len) {
|
2022-02-11 19:02:06 +08:00
|
|
|
unsigned n = 0, misalign = ((size_t) buf) & 3;
|
|
|
|
if (misalign) {
|
|
|
|
char aligned[4];
|
|
|
|
f_read((FIL *) fp, aligned, len > misalign ? misalign : len, &n);
|
|
|
|
memcpy(buf, aligned, n);
|
|
|
|
} else {
|
|
|
|
f_read((FIL *) fp, buf, len, &n);
|
|
|
|
}
|
2022-01-18 15:44:30 +08:00
|
|
|
return n;
|
|
|
|
}
|
|
|
|
|
|
|
|
static size_t ff_write(void *fp, const void *buf, size_t len) {
|
2022-03-14 19:16:41 +08:00
|
|
|
unsigned n = 0;
|
|
|
|
return f_write((FIL *) fp, (char *) buf, len, &n) == FR_OK ? n : 0;
|
2022-01-18 15:44:30 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static size_t ff_seek(void *fp, size_t offset) {
|
|
|
|
f_lseek((FIL *) fp, offset);
|
|
|
|
return offset;
|
|
|
|
}
|
|
|
|
|
2022-01-19 01:11:02 +08:00
|
|
|
static bool ff_rename(const char *from, const char *to) {
|
2022-01-19 03:19:34 +08:00
|
|
|
return f_rename(from, to) == FR_OK;
|
2022-01-19 01:11:02 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static bool ff_remove(const char *path) {
|
2022-01-19 03:19:34 +08:00
|
|
|
return f_unlink(path) == FR_OK;
|
2022-01-19 01:11:02 +08:00
|
|
|
}
|
|
|
|
|
2022-01-19 03:19:34 +08:00
|
|
|
static bool ff_mkdir(const char *path) {
|
|
|
|
return f_mkdir(path) == FR_OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct mg_fs mg_fs_fat = {ff_stat, ff_list, ff_open, ff_close, ff_read,
|
|
|
|
ff_write, ff_seek, ff_rename, ff_remove, ff_mkdir};
|
2022-01-18 15:44:30 +08:00
|
|
|
#endif
|
|
|
|
|
2021-07-24 10:44:00 +08:00
|
|
|
#ifdef MG_ENABLE_LINES
|
2021-07-29 04:11:07 +08:00
|
|
|
#line 1 "src/fs_packed.c"
|
2021-07-24 10:44:00 +08:00
|
|
|
#endif
|
|
|
|
|
|
|
|
|
2022-02-10 19:56:55 +08:00
|
|
|
|
2021-07-26 16:05:34 +08:00
|
|
|
struct packed_file {
|
|
|
|
const char *data;
|
|
|
|
size_t size;
|
|
|
|
size_t pos;
|
|
|
|
};
|
|
|
|
|
2021-07-30 20:19:20 +08:00
|
|
|
const char *mg_unpack(const char *path, size_t *size, time_t *mtime);
|
|
|
|
const char *mg_unlist(size_t no);
|
2022-03-06 22:31:42 +08:00
|
|
|
|
2021-07-30 20:19:20 +08:00
|
|
|
#if MG_ENABLE_PACKED_FS
|
|
|
|
#else
|
|
|
|
const char *mg_unpack(const char *path, size_t *size, time_t *mtime) {
|
|
|
|
(void) path, (void) size, (void) mtime;
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
const char *mg_unlist(size_t no) {
|
|
|
|
(void) no;
|
2021-07-26 16:05:34 +08:00
|
|
|
return NULL;
|
|
|
|
}
|
2021-07-30 20:19:20 +08:00
|
|
|
#endif
|
2021-07-26 16:05:34 +08:00
|
|
|
|
2021-07-30 20:19:20 +08:00
|
|
|
static int is_dir_prefix(const char *prefix, size_t n, const char *path) {
|
2022-02-15 01:44:43 +08:00
|
|
|
// MG_INFO(("[%.*s] [%s] %c", (int) n, prefix, path, path[n]));
|
|
|
|
return n < strlen(path) && strncmp(prefix, path, n) == 0 &&
|
|
|
|
(n == 0 || path[n] == '/' || path[n - 1] == '/');
|
2021-07-30 20:19:20 +08:00
|
|
|
}
|
|
|
|
|
2021-07-29 21:21:20 +08:00
|
|
|
static int packed_stat(const char *path, size_t *size, time_t *mtime) {
|
2021-07-30 20:19:20 +08:00
|
|
|
const char *p;
|
|
|
|
size_t i, n = strlen(path);
|
|
|
|
if (mg_unpack(path, size, mtime)) return MG_FS_READ; // Regular file
|
|
|
|
// Scan all files. If `path` is a dir prefix for any of them, it's a dir
|
|
|
|
for (i = 0; (p = mg_unlist(i)) != NULL; i++) {
|
|
|
|
if (is_dir_prefix(path, n, p)) return MG_FS_DIR;
|
|
|
|
}
|
|
|
|
return 0;
|
2021-07-26 16:05:34 +08:00
|
|
|
}
|
|
|
|
|
2021-07-31 00:41:23 +08:00
|
|
|
static void packed_list(const char *dir, void (*fn)(const char *, void *),
|
2021-07-29 04:11:07 +08:00
|
|
|
void *userdata) {
|
2021-07-31 00:41:23 +08:00
|
|
|
char buf[256], tmp[sizeof(buf)];
|
|
|
|
const char *path, *begin, *end;
|
|
|
|
size_t i, n = strlen(dir);
|
|
|
|
tmp[0] = '\0'; // Previously listed entry
|
|
|
|
for (i = 0; (path = mg_unlist(i)) != NULL; i++) {
|
|
|
|
if (!is_dir_prefix(dir, n, path)) continue;
|
|
|
|
begin = &path[n + 1];
|
|
|
|
end = strchr(begin, '/');
|
|
|
|
if (end == NULL) end = begin + strlen(begin);
|
2022-02-10 19:56:55 +08:00
|
|
|
mg_snprintf(buf, sizeof(buf), "%.*s", (int) (end - begin), begin);
|
2021-07-31 00:41:23 +08:00
|
|
|
buf[sizeof(buf) - 1] = '\0';
|
|
|
|
// If this entry has been already listed, skip
|
|
|
|
// NOTE: we're assuming that file list is sorted alphabetically
|
|
|
|
if (strcmp(buf, tmp) == 0) continue;
|
|
|
|
fn(buf, userdata); // Not yet listed, call user function
|
|
|
|
strcpy(tmp, buf); // And save this entry as listed
|
2021-07-30 20:19:20 +08:00
|
|
|
}
|
2021-07-26 16:05:34 +08:00
|
|
|
}
|
|
|
|
|
2022-01-17 22:42:41 +08:00
|
|
|
static void *packed_open(const char *path, int flags) {
|
2021-07-26 16:05:34 +08:00
|
|
|
size_t size = 0;
|
2021-07-30 20:19:20 +08:00
|
|
|
const char *data = mg_unpack(path, &size, NULL);
|
2021-07-29 04:11:07 +08:00
|
|
|
struct packed_file *fp = NULL;
|
2021-07-26 16:05:34 +08:00
|
|
|
if (data == NULL) return NULL;
|
2021-07-29 04:11:07 +08:00
|
|
|
if (flags & MG_FS_WRITE) return NULL;
|
2021-07-29 21:21:20 +08:00
|
|
|
fp = (struct packed_file *) calloc(1, sizeof(*fp));
|
2021-07-29 04:11:07 +08:00
|
|
|
fp->size = size;
|
|
|
|
fp->data = data;
|
2022-01-17 22:42:41 +08:00
|
|
|
return (void *) fp;
|
2021-07-29 04:11:07 +08:00
|
|
|
}
|
|
|
|
|
2022-01-17 22:42:41 +08:00
|
|
|
static void packed_close(void *fp) {
|
|
|
|
if (fp != NULL) free(fp);
|
2021-07-29 04:11:07 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static size_t packed_read(void *fd, void *buf, size_t len) {
|
|
|
|
struct packed_file *fp = (struct packed_file *) fd;
|
|
|
|
if (fp->pos + len > fp->size) len = fp->size - fp->pos;
|
|
|
|
memcpy(buf, &fp->data[fp->pos], len);
|
|
|
|
fp->pos += len;
|
|
|
|
return len;
|
|
|
|
}
|
|
|
|
|
|
|
|
static size_t packed_write(void *fd, const void *buf, size_t len) {
|
|
|
|
(void) fd, (void) buf, (void) len;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static size_t packed_seek(void *fd, size_t offset) {
|
|
|
|
struct packed_file *fp = (struct packed_file *) fd;
|
|
|
|
fp->pos = offset;
|
|
|
|
if (fp->pos > fp->size) fp->pos = fp->size;
|
|
|
|
return fp->pos;
|
|
|
|
}
|
|
|
|
|
2022-01-19 01:11:02 +08:00
|
|
|
static bool packed_rename(const char *from, const char *to) {
|
|
|
|
(void) from, (void) to;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
static bool packed_remove(const char *path) {
|
|
|
|
(void) path;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2022-01-19 03:19:34 +08:00
|
|
|
static bool packed_mkdir(const char *path) {
|
|
|
|
(void) path;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct mg_fs mg_fs_packed = {
|
|
|
|
packed_stat, packed_list, packed_open, packed_close, packed_read,
|
|
|
|
packed_write, packed_seek, packed_rename, packed_remove, packed_mkdir};
|
2021-07-29 04:11:07 +08:00
|
|
|
|
|
|
|
#ifdef MG_ENABLE_LINES
|
|
|
|
#line 1 "src/fs_posix.c"
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
2021-12-22 01:39:55 +08:00
|
|
|
#if MG_ENABLE_FILE
|
2022-01-11 02:07:45 +08:00
|
|
|
|
|
|
|
#ifndef MG_STAT_STRUCT
|
|
|
|
#define MG_STAT_STRUCT stat
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifndef MG_STAT_FUNC
|
|
|
|
#define MG_STAT_FUNC stat
|
|
|
|
#endif
|
|
|
|
|
2021-09-16 18:16:10 +08:00
|
|
|
static int p_stat(const char *path, size_t *size, time_t *mtime) {
|
2021-12-23 02:04:36 +08:00
|
|
|
#if !defined(S_ISDIR)
|
2022-02-13 02:17:25 +08:00
|
|
|
MG_ERROR(("stat() API is not supported. %p %p %p", path, size, mtime));
|
2021-12-23 02:04:36 +08:00
|
|
|
return 0;
|
|
|
|
#else
|
2022-02-12 22:33:43 +08:00
|
|
|
#if MG_ARCH == MG_ARCH_WIN32
|
2021-07-29 04:11:07 +08:00
|
|
|
struct _stati64 st;
|
|
|
|
wchar_t tmp[PATH_MAX];
|
|
|
|
MultiByteToWideChar(CP_UTF8, 0, path, -1, tmp, sizeof(tmp) / sizeof(tmp[0]));
|
|
|
|
if (_wstati64(tmp, &st) != 0) return 0;
|
|
|
|
#else
|
2022-01-11 02:07:45 +08:00
|
|
|
struct MG_STAT_STRUCT st;
|
|
|
|
if (MG_STAT_FUNC(path, &st) != 0) return 0;
|
2021-07-29 04:11:07 +08:00
|
|
|
#endif
|
|
|
|
if (size) *size = (size_t) st.st_size;
|
2021-07-29 21:21:20 +08:00
|
|
|
if (mtime) *mtime = st.st_mtime;
|
2021-07-29 04:11:07 +08:00
|
|
|
return MG_FS_READ | MG_FS_WRITE | (S_ISDIR(st.st_mode) ? MG_FS_DIR : 0);
|
2021-12-23 02:04:36 +08:00
|
|
|
#endif
|
2021-07-29 04:11:07 +08:00
|
|
|
}
|
|
|
|
|
2022-02-12 22:33:43 +08:00
|
|
|
#if MG_ARCH == MG_ARCH_WIN32
|
2021-07-29 21:21:20 +08:00
|
|
|
struct dirent {
|
|
|
|
char d_name[MAX_PATH];
|
|
|
|
};
|
|
|
|
|
|
|
|
typedef struct win32_dir {
|
|
|
|
HANDLE handle;
|
|
|
|
WIN32_FIND_DATAW info;
|
|
|
|
struct dirent result;
|
|
|
|
} DIR;
|
|
|
|
|
|
|
|
int gettimeofday(struct timeval *tv, void *tz) {
|
|
|
|
FILETIME ft;
|
|
|
|
unsigned __int64 tmpres = 0;
|
|
|
|
|
|
|
|
if (tv != NULL) {
|
|
|
|
GetSystemTimeAsFileTime(&ft);
|
|
|
|
tmpres |= ft.dwHighDateTime;
|
|
|
|
tmpres <<= 32;
|
|
|
|
tmpres |= ft.dwLowDateTime;
|
|
|
|
tmpres /= 10; // convert into microseconds
|
|
|
|
tmpres -= (int64_t) 11644473600000000;
|
|
|
|
tv->tv_sec = (long) (tmpres / 1000000UL);
|
|
|
|
tv->tv_usec = (long) (tmpres % 1000000UL);
|
|
|
|
}
|
|
|
|
(void) tz;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int to_wchar(const char *path, wchar_t *wbuf, size_t wbuf_len) {
|
|
|
|
int ret;
|
|
|
|
char buf[MAX_PATH * 2], buf2[MAX_PATH * 2], *p;
|
|
|
|
strncpy(buf, path, sizeof(buf));
|
|
|
|
buf[sizeof(buf) - 1] = '\0';
|
|
|
|
// Trim trailing slashes. Leave backslash for paths like "X:\"
|
|
|
|
p = buf + strlen(buf) - 1;
|
|
|
|
while (p > buf && p[-1] != ':' && (p[0] == '\\' || p[0] == '/')) *p-- = '\0';
|
|
|
|
memset(wbuf, 0, wbuf_len * sizeof(wchar_t));
|
|
|
|
ret = MultiByteToWideChar(CP_UTF8, 0, buf, -1, wbuf, (int) wbuf_len);
|
|
|
|
// Convert back to Unicode. If doubly-converted string does not match the
|
|
|
|
// original, something is fishy, reject.
|
|
|
|
WideCharToMultiByte(CP_UTF8, 0, wbuf, (int) wbuf_len, buf2, sizeof(buf2),
|
|
|
|
NULL, NULL);
|
|
|
|
if (strcmp(buf, buf2) != 0) {
|
|
|
|
wbuf[0] = L'\0';
|
|
|
|
ret = 0;
|
|
|
|
}
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
DIR *opendir(const char *name) {
|
|
|
|
DIR *d = NULL;
|
|
|
|
wchar_t wpath[MAX_PATH];
|
|
|
|
DWORD attrs;
|
|
|
|
|
|
|
|
if (name == NULL) {
|
|
|
|
SetLastError(ERROR_BAD_ARGUMENTS);
|
|
|
|
} else if ((d = (DIR *) calloc(1, sizeof(*d))) == NULL) {
|
|
|
|
SetLastError(ERROR_NOT_ENOUGH_MEMORY);
|
|
|
|
} else {
|
|
|
|
to_wchar(name, wpath, sizeof(wpath) / sizeof(wpath[0]));
|
|
|
|
attrs = GetFileAttributesW(wpath);
|
|
|
|
if (attrs != 0Xffffffff && (attrs & FILE_ATTRIBUTE_DIRECTORY)) {
|
|
|
|
(void) wcscat(wpath, L"\\*");
|
|
|
|
d->handle = FindFirstFileW(wpath, &d->info);
|
|
|
|
d->result.d_name[0] = '\0';
|
|
|
|
} else {
|
|
|
|
free(d);
|
|
|
|
d = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return d;
|
|
|
|
}
|
|
|
|
|
|
|
|
int closedir(DIR *d) {
|
|
|
|
int result = 0;
|
|
|
|
if (d != NULL) {
|
|
|
|
if (d->handle != INVALID_HANDLE_VALUE)
|
|
|
|
result = FindClose(d->handle) ? 0 : -1;
|
|
|
|
free(d);
|
|
|
|
} else {
|
|
|
|
result = -1;
|
|
|
|
SetLastError(ERROR_BAD_ARGUMENTS);
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct dirent *readdir(DIR *d) {
|
|
|
|
struct dirent *result = NULL;
|
|
|
|
if (d != NULL) {
|
|
|
|
memset(&d->result, 0, sizeof(d->result));
|
|
|
|
if (d->handle != INVALID_HANDLE_VALUE) {
|
|
|
|
result = &d->result;
|
|
|
|
WideCharToMultiByte(CP_UTF8, 0, d->info.cFileName, -1, result->d_name,
|
|
|
|
sizeof(result->d_name), NULL, NULL);
|
|
|
|
if (!FindNextFileW(d->handle, &d->info)) {
|
|
|
|
FindClose(d->handle);
|
|
|
|
d->handle = INVALID_HANDLE_VALUE;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
SetLastError(ERROR_FILE_NOT_FOUND);
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
SetLastError(ERROR_BAD_ARGUMENTS);
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2021-09-16 18:16:10 +08:00
|
|
|
static void p_list(const char *dir, void (*fn)(const char *, void *),
|
|
|
|
void *userdata) {
|
2021-07-29 21:21:20 +08:00
|
|
|
#if MG_ENABLE_DIRLIST
|
2021-07-29 04:11:07 +08:00
|
|
|
struct dirent *dp;
|
|
|
|
DIR *dirp;
|
2021-07-29 21:21:20 +08:00
|
|
|
if ((dirp = (opendir(dir))) == NULL) return;
|
|
|
|
while ((dp = readdir(dirp)) != NULL) {
|
|
|
|
if (!strcmp(dp->d_name, ".") || !strcmp(dp->d_name, "..")) continue;
|
|
|
|
fn(dp->d_name, userdata);
|
2021-07-29 04:11:07 +08:00
|
|
|
}
|
2021-07-29 21:21:20 +08:00
|
|
|
closedir(dirp);
|
|
|
|
#else
|
|
|
|
(void) dir, (void) fn, (void) userdata;
|
|
|
|
#endif
|
2021-07-29 04:11:07 +08:00
|
|
|
}
|
|
|
|
|
2022-01-17 22:42:41 +08:00
|
|
|
static void *p_open(const char *path, int flags) {
|
2022-01-19 01:11:02 +08:00
|
|
|
const char *mode = flags == MG_FS_READ ? "rb" : "a+b";
|
2022-02-12 22:33:43 +08:00
|
|
|
#if MG_ARCH == MG_ARCH_WIN32
|
2021-07-29 04:11:07 +08:00
|
|
|
wchar_t b1[PATH_MAX], b2[10];
|
|
|
|
MultiByteToWideChar(CP_UTF8, 0, path, -1, b1, sizeof(b1) / sizeof(b1[0]));
|
|
|
|
MultiByteToWideChar(CP_UTF8, 0, mode, -1, b2, sizeof(b2) / sizeof(b2[0]));
|
2022-01-17 22:42:41 +08:00
|
|
|
return (void *) _wfopen(b1, b2);
|
2021-07-29 04:11:07 +08:00
|
|
|
#else
|
2022-01-17 22:42:41 +08:00
|
|
|
return (void *) fopen(path, mode);
|
2021-07-29 04:11:07 +08:00
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2022-01-17 22:42:41 +08:00
|
|
|
static void p_close(void *fp) {
|
2022-01-19 01:11:02 +08:00
|
|
|
fclose((FILE *) fp);
|
2021-07-29 04:11:07 +08:00
|
|
|
}
|
|
|
|
|
2021-09-16 18:16:10 +08:00
|
|
|
static size_t p_read(void *fp, void *buf, size_t len) {
|
2021-07-29 04:11:07 +08:00
|
|
|
return fread(buf, 1, len, (FILE *) fp);
|
|
|
|
}
|
|
|
|
|
2021-09-16 18:16:10 +08:00
|
|
|
static size_t p_write(void *fp, const void *buf, size_t len) {
|
2021-07-29 04:11:07 +08:00
|
|
|
return fwrite(buf, 1, len, (FILE *) fp);
|
2021-07-26 16:05:34 +08:00
|
|
|
}
|
2021-07-29 04:11:07 +08:00
|
|
|
|
2021-09-16 18:16:10 +08:00
|
|
|
static size_t p_seek(void *fp, size_t offset) {
|
2021-12-22 01:39:55 +08:00
|
|
|
#if (defined(_FILE_OFFSET_BITS) && _FILE_OFFSET_BITS == 64) || \
|
|
|
|
(defined(_POSIX_C_SOURCE) && _POSIX_C_SOURCE >= 200112L) || \
|
|
|
|
(defined(_XOPEN_SOURCE) && _XOPEN_SOURCE >= 600)
|
2022-02-23 21:31:00 +08:00
|
|
|
if (fseeko((FILE *) fp, (off_t) offset, SEEK_SET) != 0) (void) 0;
|
2021-07-26 16:05:34 +08:00
|
|
|
#else
|
2022-02-23 21:31:00 +08:00
|
|
|
if (fseek((FILE *) fp, (long) offset, SEEK_SET) != 0) (void) 0;
|
2021-07-29 04:11:07 +08:00
|
|
|
#endif
|
|
|
|
return (size_t) ftell((FILE *) fp);
|
|
|
|
}
|
2021-12-22 02:16:12 +08:00
|
|
|
|
2022-01-19 01:11:02 +08:00
|
|
|
static bool p_rename(const char *from, const char *to) {
|
|
|
|
return rename(from, to) == 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static bool p_remove(const char *path) {
|
|
|
|
return remove(path) == 0;
|
|
|
|
}
|
|
|
|
|
2022-01-19 03:19:34 +08:00
|
|
|
static bool p_mkdir(const char *path) {
|
|
|
|
return mkdir(path, 0775) == 0;
|
|
|
|
}
|
|
|
|
|
2021-07-29 04:11:07 +08:00
|
|
|
#else
|
|
|
|
|
2021-09-16 18:16:10 +08:00
|
|
|
static int p_stat(const char *path, size_t *size, time_t *mtime) {
|
2021-07-29 04:11:07 +08:00
|
|
|
(void) path, (void) size, (void) mtime;
|
|
|
|
return 0;
|
|
|
|
}
|
2021-09-16 18:16:10 +08:00
|
|
|
static void p_list(const char *path, void (*fn)(const char *, void *),
|
|
|
|
void *userdata) {
|
2021-07-29 04:11:07 +08:00
|
|
|
(void) path, (void) fn, (void) userdata;
|
|
|
|
}
|
2022-01-19 03:19:34 +08:00
|
|
|
static void *p_open(const char *path, int flags) {
|
2021-07-29 04:11:07 +08:00
|
|
|
(void) path, (void) flags;
|
|
|
|
return NULL;
|
|
|
|
}
|
2022-01-19 03:19:34 +08:00
|
|
|
static void p_close(void *fp) {
|
|
|
|
(void) fp;
|
2021-07-29 04:11:07 +08:00
|
|
|
}
|
2021-09-16 18:16:10 +08:00
|
|
|
static size_t p_read(void *fd, void *buf, size_t len) {
|
2021-07-29 04:11:07 +08:00
|
|
|
(void) fd, (void) buf, (void) len;
|
|
|
|
return 0;
|
|
|
|
}
|
2021-09-16 18:16:10 +08:00
|
|
|
static size_t p_write(void *fd, const void *buf, size_t len) {
|
2021-07-29 04:11:07 +08:00
|
|
|
(void) fd, (void) buf, (void) len;
|
|
|
|
return 0;
|
|
|
|
}
|
2021-09-16 18:16:10 +08:00
|
|
|
static size_t p_seek(void *fd, size_t offset) {
|
2021-07-29 04:11:07 +08:00
|
|
|
(void) fd, (void) offset;
|
|
|
|
return (size_t) ~0;
|
|
|
|
}
|
2022-01-19 01:11:02 +08:00
|
|
|
static bool p_rename(const char *from, const char *to) {
|
|
|
|
(void) from, (void) to;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
static bool p_remove(const char *path) {
|
|
|
|
(void) path;
|
|
|
|
return false;
|
|
|
|
}
|
2022-01-19 03:19:34 +08:00
|
|
|
static bool p_mkdir(const char *path) {
|
|
|
|
(void) path;
|
|
|
|
return false;
|
|
|
|
}
|
2021-07-26 16:05:34 +08:00
|
|
|
#endif
|
2021-07-24 10:44:00 +08:00
|
|
|
|
2022-01-19 03:19:34 +08:00
|
|
|
struct mg_fs mg_fs_posix = {p_stat, p_list, p_open, p_close, p_read,
|
|
|
|
p_write, p_seek, p_rename, p_remove, p_mkdir};
|
2021-07-29 04:11:07 +08:00
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
#ifdef MG_ENABLE_LINES
|
|
|
|
#line 1 "src/http.c"
|
2017-11-24 18:21:45 +08:00
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2018-01-15 21:15:59 +08:00
|
|
|
|
2017-11-24 18:21:45 +08:00
|
|
|
|
2020-12-11 01:46:26 +08:00
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
// Multipart POST example:
|
2021-03-17 15:43:29 +08:00
|
|
|
// --xyz
|
|
|
|
// Content-Disposition: form-data; name="val"
|
|
|
|
//
|
|
|
|
// abcdef
|
|
|
|
// --xyz
|
|
|
|
// Content-Disposition: form-data; name="foo"; filename="a.txt"
|
|
|
|
// Content-Type: text/plain
|
|
|
|
//
|
|
|
|
// hello world
|
|
|
|
//
|
|
|
|
// --xyz--
|
|
|
|
size_t mg_http_next_multipart(struct mg_str body, size_t ofs,
|
|
|
|
struct mg_http_part *part) {
|
|
|
|
struct mg_str cd = mg_str_n("Content-Disposition", 19);
|
|
|
|
const char *s = body.ptr;
|
|
|
|
size_t b = ofs, h1, h2, b1, b2, max = body.len;
|
|
|
|
|
|
|
|
// Init part params
|
|
|
|
if (part != NULL) part->name = part->filename = part->body = mg_str_n(0, 0);
|
|
|
|
|
|
|
|
// Skip boundary
|
|
|
|
while (b + 2 < max && s[b] != '\r' && s[b + 1] != '\n') b++;
|
|
|
|
if (b <= ofs || b + 2 >= max) return 0;
|
2022-02-13 02:17:25 +08:00
|
|
|
// MG_INFO(("B: %zu %zu [%.*s]", ofs, b - ofs, (int) (b - ofs), s));
|
2021-03-17 15:43:29 +08:00
|
|
|
|
|
|
|
// Skip headers
|
|
|
|
h1 = h2 = b + 2;
|
|
|
|
for (;;) {
|
|
|
|
while (h2 + 2 < max && s[h2] != '\r' && s[h2 + 1] != '\n') h2++;
|
|
|
|
if (h2 == h1) break;
|
|
|
|
if (h2 + 2 >= max) return 0;
|
2022-02-13 02:17:25 +08:00
|
|
|
// MG_INFO(("Header: [%.*s]", (int) (h2 - h1), &s[h1]));
|
2021-03-17 15:43:29 +08:00
|
|
|
if (part != NULL && h1 + cd.len + 2 < h2 && s[h1 + cd.len] == ':' &&
|
|
|
|
mg_ncasecmp(&s[h1], cd.ptr, cd.len) == 0) {
|
|
|
|
struct mg_str v = mg_str_n(&s[h1 + cd.len + 2], h2 - (h1 + cd.len + 2));
|
|
|
|
part->name = mg_http_get_header_var(v, mg_str_n("name", 4));
|
|
|
|
part->filename = mg_http_get_header_var(v, mg_str_n("filename", 8));
|
|
|
|
}
|
|
|
|
h1 = h2 = h2 + 2;
|
|
|
|
}
|
|
|
|
b1 = b2 = h2 + 2;
|
2021-03-17 21:28:36 +08:00
|
|
|
while (b2 + 2 + (b - ofs) + 2 < max && !(s[b2] == '\r' && s[b2 + 1] == '\n' &&
|
|
|
|
memcmp(&s[b2 + 2], s, b - ofs) == 0))
|
2021-03-17 15:43:29 +08:00
|
|
|
b2++;
|
|
|
|
|
|
|
|
if (b2 + 2 >= max) return 0;
|
|
|
|
if (part != NULL) part->body = mg_str_n(&s[b1], b2 - b1);
|
2022-02-13 02:17:25 +08:00
|
|
|
// MG_INFO(("Body: [%.*s]", (int) (b2 - b1), &s[b1]));
|
2021-03-17 15:43:29 +08:00
|
|
|
return b2 + 2;
|
2021-03-15 21:20:53 +08:00
|
|
|
}
|
2017-11-24 18:21:45 +08:00
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
void mg_http_bauth(struct mg_connection *c, const char *user,
|
|
|
|
const char *pass) {
|
|
|
|
struct mg_str u = mg_str(user), p = mg_str(pass);
|
|
|
|
size_t need = c->send.len + 36 + (u.len + p.len) * 2;
|
|
|
|
if (c->send.size < need) mg_iobuf_resize(&c->send, need);
|
|
|
|
if (c->send.size >= need) {
|
2021-05-29 01:30:42 +08:00
|
|
|
int i, n = 0;
|
2020-12-05 19:26:32 +08:00
|
|
|
char *buf = (char *) &c->send.buf[c->send.len + 21];
|
|
|
|
memcpy(&buf[-21], "Authorization: Basic ", 21); // DON'T use mg_send!
|
2021-05-29 01:30:42 +08:00
|
|
|
for (i = 0; i < (int) u.len; i++) {
|
|
|
|
n = mg_base64_update(((unsigned char *) u.ptr)[i], buf, n);
|
|
|
|
}
|
2020-12-05 19:26:32 +08:00
|
|
|
if (p.len > 0) {
|
|
|
|
n = mg_base64_update(':', buf, n);
|
2021-05-29 01:30:42 +08:00
|
|
|
for (i = 0; i < (int) p.len; i++) {
|
|
|
|
n = mg_base64_update(((unsigned char *) p.ptr)[i], buf, n);
|
|
|
|
}
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
|
|
|
n = mg_base64_final(buf, n);
|
2021-05-29 01:30:42 +08:00
|
|
|
c->send.len += 21 + (size_t) n + 2;
|
2020-12-05 19:26:32 +08:00
|
|
|
memcpy(&c->send.buf[c->send.len - 2], "\r\n", 2);
|
|
|
|
} else {
|
2022-02-13 02:17:25 +08:00
|
|
|
MG_ERROR(("%lu %s cannot resize iobuf %d->%d ", c->id, c->label,
|
|
|
|
(int) c->send.size, (int) need));
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
2020-08-29 03:29:13 +08:00
|
|
|
}
|
|
|
|
|
2022-06-18 11:23:56 +08:00
|
|
|
struct mg_str mg_http_var(struct mg_str buf, struct mg_str name) {
|
|
|
|
struct mg_str k, v, result = mg_str_n(NULL, 0);
|
|
|
|
while (mg_split(&buf, &k, &v, '&')) {
|
|
|
|
if (name.len == k.len && mg_ncasecmp(name.ptr, k.ptr, k.len) == 0) {
|
|
|
|
result = v;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
int mg_http_get_var(const struct mg_str *buf, const char *name, char *dst,
|
2021-05-29 01:30:42 +08:00
|
|
|
size_t dst_len) {
|
2020-12-05 19:26:32 +08:00
|
|
|
int len;
|
|
|
|
if (dst == NULL || dst_len == 0) {
|
|
|
|
len = -2; // Bad destination
|
|
|
|
} else if (buf->ptr == NULL || name == NULL || buf->len == 0) {
|
|
|
|
len = -1; // Bad source
|
|
|
|
dst[0] = '\0';
|
2017-11-24 18:21:45 +08:00
|
|
|
} else {
|
2022-06-18 11:23:56 +08:00
|
|
|
struct mg_str v = mg_http_var(*buf, mg_str(name));
|
|
|
|
if (v.ptr == NULL) {
|
|
|
|
len = -4; // Name does not exist
|
|
|
|
} else {
|
|
|
|
len = mg_url_decode(v.ptr, v.len, dst, dst_len, 1);
|
|
|
|
if (len < 0) len = -3; // Failed to decode
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
2017-11-24 18:21:45 +08:00
|
|
|
}
|
2020-12-05 19:26:32 +08:00
|
|
|
return len;
|
2017-11-24 18:21:45 +08:00
|
|
|
}
|
|
|
|
|
2022-02-23 04:20:56 +08:00
|
|
|
static bool isx(int c) {
|
|
|
|
return (c >= '0' && c <= '9') || (c >= 'a' && c <= 'f') ||
|
|
|
|
(c >= 'A' && c <= 'F');
|
|
|
|
}
|
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
int mg_url_decode(const char *src, size_t src_len, char *dst, size_t dst_len,
|
|
|
|
int is_form_url_encoded) {
|
|
|
|
size_t i, j;
|
2020-12-11 17:35:50 +08:00
|
|
|
for (i = j = 0; i < src_len && j + 1 < dst_len; i++, j++) {
|
2020-12-05 19:26:32 +08:00
|
|
|
if (src[i] == '%') {
|
2020-12-11 17:35:50 +08:00
|
|
|
// Use `i + 2 < src_len`, not `i < src_len - 2`, note small src_len
|
2022-02-23 04:20:56 +08:00
|
|
|
if (i + 2 < src_len && isx(src[i + 1]) && isx(src[i + 2])) {
|
2020-12-05 19:26:32 +08:00
|
|
|
mg_unhex(src + i + 1, 2, (uint8_t *) &dst[j]);
|
|
|
|
i += 2;
|
|
|
|
} else {
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
} else if (is_form_url_encoded && src[i] == '+') {
|
|
|
|
dst[j] = ' ';
|
|
|
|
} else {
|
|
|
|
dst[j] = src[i];
|
|
|
|
}
|
|
|
|
}
|
2020-12-11 17:35:50 +08:00
|
|
|
if (j < dst_len) dst[j] = '\0'; // Null-terminate the destination
|
2021-02-03 10:13:05 +08:00
|
|
|
return i >= src_len && j < dst_len ? (int) j : -1;
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
2019-01-26 12:37:17 +08:00
|
|
|
|
2022-02-23 04:20:56 +08:00
|
|
|
static bool isok(uint8_t c) {
|
|
|
|
return c == '\n' || c == '\r' || c >= ' ';
|
|
|
|
}
|
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
int mg_http_get_request_len(const unsigned char *buf, size_t buf_len) {
|
|
|
|
size_t i;
|
|
|
|
for (i = 0; i < buf_len; i++) {
|
2022-02-23 04:20:56 +08:00
|
|
|
if (!isok(buf[i])) return -1;
|
2020-12-05 19:26:32 +08:00
|
|
|
if ((i > 0 && buf[i] == '\n' && buf[i - 1] == '\n') ||
|
|
|
|
(i > 3 && buf[i] == '\n' && buf[i - 1] == '\r' && buf[i - 2] == '\n'))
|
|
|
|
return (int) i + 1;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
2019-01-26 12:37:17 +08:00
|
|
|
|
2021-02-10 05:16:33 +08:00
|
|
|
static const char *skip(const char *s, const char *e, const char *d,
|
2020-12-05 19:26:32 +08:00
|
|
|
struct mg_str *v) {
|
|
|
|
v->ptr = s;
|
2021-02-10 05:16:33 +08:00
|
|
|
while (s < e && *s != '\n' && strchr(d, *s) == NULL) s++;
|
2021-08-08 00:22:47 +08:00
|
|
|
v->len = (size_t) (s - v->ptr);
|
2021-02-10 05:16:33 +08:00
|
|
|
while (s < e && strchr(d, *s) != NULL) s++;
|
2020-12-05 19:26:32 +08:00
|
|
|
return s;
|
|
|
|
}
|
2017-11-24 18:21:45 +08:00
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
struct mg_str *mg_http_get_header(struct mg_http_message *h, const char *name) {
|
|
|
|
size_t i, n = strlen(name), max = sizeof(h->headers) / sizeof(h->headers[0]);
|
|
|
|
for (i = 0; i < max && h->headers[i].name.len > 0; i++) {
|
|
|
|
struct mg_str *k = &h->headers[i].name, *v = &h->headers[i].value;
|
|
|
|
if (n == k->len && mg_ncasecmp(k->ptr, name, n) == 0) return v;
|
2019-01-26 12:37:17 +08:00
|
|
|
}
|
2020-12-05 19:26:32 +08:00
|
|
|
return NULL;
|
|
|
|
}
|
2019-01-26 12:37:17 +08:00
|
|
|
|
Make private functions static and add missing prototypes.
Fixes:
mongoose/mongoose.c:180:8: warning: no previous prototype for ‘mg_dns_parse_name’ [-Wmissing-prototypes]
180 | size_t mg_dns_parse_name(const uint8_t *s, size_t n, size_t ofs, char *dst,
| ^~~~~~~~~~~~~~~~~
mongoose/mongoose.c:306:6: warning: no previous prototype for ‘mg_dns_send’ [-Wmissing-prototypes]
306 | void mg_dns_send(struct mg_connection *c, const struct mg_str *name,
| ^~~~~~~~~~~
mongoose/mongoose.c:925:6: warning: no previous prototype for ‘mg_http_parse_headers’ [-Wmissing-prototypes]
925 | void mg_http_parse_headers(const char *s, const char *end,
| ^~~~~~~~~~~~~~~~~~~~~
mongoose/mongoose.c:1125:7: warning: no previous prototype for ‘mg_http_etag’ [-Wmissing-prototypes]
1125 | char *mg_http_etag(char *buf, size_t len, size_t size, time_t mtime) {
| ^~~~~~~~~~~~
mongoose/mongoose.c:2578:6: warning: no previous prototype for ‘mg_sha1_transform’ [-Wmissing-prototypes]
2578 | void mg_sha1_transform(uint32_t state[5], const unsigned char buffer[64]) {
| ^~~~~~~~~~~~~~~~~
mongoose/mongoose.c:2976:8: warning: no previous prototype for ‘mg_open_listener’ [-Wmissing-prototypes]
2976 | SOCKET mg_open_listener(const char *url, struct mg_addr *addr) {
| ^~~~~~~~~~~~~~~~
Signed-off-by: James Hilliard <james.hilliard1@gmail.com>
2021-10-13 08:26:20 +08:00
|
|
|
static void mg_http_parse_headers(const char *s, const char *end,
|
2021-10-22 21:33:51 +08:00
|
|
|
struct mg_http_header *h, int max_headers) {
|
2020-12-05 19:26:32 +08:00
|
|
|
int i;
|
|
|
|
for (i = 0; i < max_headers; i++) {
|
|
|
|
struct mg_str k, v, tmp;
|
|
|
|
const char *he = skip(s, end, "\n", &tmp);
|
|
|
|
s = skip(s, he, ": \r\n", &k);
|
|
|
|
s = skip(s, he, "\r\n", &v);
|
|
|
|
if (k.len == tmp.len) continue;
|
|
|
|
while (v.len > 0 && v.ptr[v.len - 1] == ' ') v.len--; // Trim spaces
|
|
|
|
if (k.len == 0) break;
|
2022-02-13 02:17:25 +08:00
|
|
|
// MG_INFO(("--HH [%.*s] [%.*s] [%.*s]", (int) tmp.len - 1, tmp.ptr,
|
2020-12-05 19:26:32 +08:00
|
|
|
//(int) k.len, k.ptr, (int) v.len, v.ptr));
|
|
|
|
h[i].name = k;
|
|
|
|
h[i].value = v;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
int mg_http_parse(const char *s, size_t len, struct mg_http_message *hm) {
|
|
|
|
int is_response, req_len = mg_http_get_request_len((unsigned char *) s, len);
|
|
|
|
const char *end = s + req_len, *qs;
|
|
|
|
struct mg_str *cl;
|
2019-01-26 12:37:17 +08:00
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
memset(hm, 0, sizeof(*hm));
|
|
|
|
if (req_len <= 0) return req_len;
|
|
|
|
|
2021-02-09 21:27:17 +08:00
|
|
|
hm->message.ptr = hm->head.ptr = s;
|
|
|
|
hm->body.ptr = end;
|
2021-05-29 01:30:42 +08:00
|
|
|
hm->head.len = (size_t) req_len;
|
2021-03-07 19:56:20 +08:00
|
|
|
hm->chunk.ptr = end;
|
2020-12-05 19:26:32 +08:00
|
|
|
hm->message.len = hm->body.len = (size_t) ~0; // Set body length to infinite
|
|
|
|
|
|
|
|
// Parse request line
|
|
|
|
s = skip(s, end, " ", &hm->method);
|
|
|
|
s = skip(s, end, " ", &hm->uri);
|
|
|
|
s = skip(s, end, "\r\n", &hm->proto);
|
2021-02-10 19:09:13 +08:00
|
|
|
|
2021-05-29 17:07:05 +08:00
|
|
|
// Sanity check. Allow protocol/reason to be empty
|
|
|
|
if (hm->method.len == 0 || hm->uri.len == 0) return -1;
|
2020-12-05 19:26:32 +08:00
|
|
|
|
|
|
|
// If URI contains '?' character, setup query string
|
|
|
|
if ((qs = (const char *) memchr(hm->uri.ptr, '?', hm->uri.len)) != NULL) {
|
|
|
|
hm->query.ptr = qs + 1;
|
2021-08-08 00:22:47 +08:00
|
|
|
hm->query.len = (size_t) (&hm->uri.ptr[hm->uri.len] - (qs + 1));
|
|
|
|
hm->uri.len = (size_t) (qs - hm->uri.ptr);
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
mg_http_parse_headers(s, end, hm->headers,
|
|
|
|
sizeof(hm->headers) / sizeof(hm->headers[0]));
|
|
|
|
if ((cl = mg_http_get_header(hm, "Content-Length")) != NULL) {
|
2020-12-23 19:58:08 +08:00
|
|
|
hm->body.len = (size_t) mg_to64(*cl);
|
2021-05-29 01:30:42 +08:00
|
|
|
hm->message.len = (size_t) req_len + hm->body.len;
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// mg_http_parse() is used to parse both HTTP requests and HTTP
|
|
|
|
// responses. If HTTP response does not have Content-Length set, then
|
|
|
|
// body is read until socket is closed, i.e. body.len is infinite (~0).
|
|
|
|
//
|
|
|
|
// For HTTP requests though, according to
|
|
|
|
// http://tools.ietf.org/html/rfc7231#section-8.1.3,
|
|
|
|
// only POST and PUT methods have defined body semantics.
|
|
|
|
// Therefore, if Content-Length is not specified and methods are
|
|
|
|
// not one of PUT or POST, set body length to 0.
|
|
|
|
//
|
|
|
|
// So, if it is HTTP request, and Content-Length is not set,
|
|
|
|
// and method is not (PUT or POST) then reset body length to zero.
|
|
|
|
is_response = mg_ncasecmp(hm->method.ptr, "HTTP/", 5) == 0;
|
|
|
|
if (hm->body.len == (size_t) ~0 && !is_response &&
|
|
|
|
mg_vcasecmp(&hm->method, "PUT") != 0 &&
|
|
|
|
mg_vcasecmp(&hm->method, "POST") != 0) {
|
|
|
|
hm->body.len = 0;
|
2021-05-29 01:30:42 +08:00
|
|
|
hm->message.len = (size_t) req_len;
|
2017-11-24 18:21:45 +08:00
|
|
|
}
|
|
|
|
|
2020-12-25 01:01:49 +08:00
|
|
|
// The 204 (No content) responses also have 0 body length
|
|
|
|
if (hm->body.len == (size_t) ~0 && is_response &&
|
|
|
|
mg_vcasecmp(&hm->uri, "204") == 0) {
|
|
|
|
hm->body.len = 0;
|
2021-05-29 01:30:42 +08:00
|
|
|
hm->message.len = (size_t) req_len;
|
2020-12-25 01:01:49 +08:00
|
|
|
}
|
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
return req_len;
|
2017-11-24 18:21:45 +08:00
|
|
|
}
|
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
static void mg_http_vprintf_chunk(struct mg_connection *c, const char *fmt,
|
|
|
|
va_list ap) {
|
|
|
|
char mem[256], *buf = mem;
|
2022-02-11 01:11:03 +08:00
|
|
|
size_t len = mg_vasprintf(&buf, sizeof(mem), fmt, ap);
|
|
|
|
mg_printf(c, "%lx\r\n", (unsigned long) len);
|
2021-05-29 01:30:42 +08:00
|
|
|
mg_send(c, buf, len > 0 ? (size_t) len : 0);
|
2020-12-05 19:26:32 +08:00
|
|
|
mg_send(c, "\r\n", 2);
|
|
|
|
if (buf != mem) free(buf);
|
|
|
|
}
|
|
|
|
|
|
|
|
void mg_http_printf_chunk(struct mg_connection *c, const char *fmt, ...) {
|
2017-11-24 18:21:45 +08:00
|
|
|
va_list ap;
|
|
|
|
va_start(ap, fmt);
|
2020-12-05 19:26:32 +08:00
|
|
|
mg_http_vprintf_chunk(c, fmt, ap);
|
2017-11-24 18:21:45 +08:00
|
|
|
va_end(ap);
|
|
|
|
}
|
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
void mg_http_write_chunk(struct mg_connection *c, const char *buf, size_t len) {
|
2022-02-11 01:11:03 +08:00
|
|
|
mg_printf(c, "%lx\r\n", (unsigned long) len);
|
2020-12-05 19:26:32 +08:00
|
|
|
mg_send(c, buf, len);
|
|
|
|
mg_send(c, "\r\n", 2);
|
2017-11-24 18:21:45 +08:00
|
|
|
}
|
|
|
|
|
2021-04-29 16:17:24 +08:00
|
|
|
// clang-format off
|
|
|
|
static const char *mg_http_status_code_str(int status_code) {
|
|
|
|
switch (status_code) {
|
|
|
|
case 100: return "Continue";
|
|
|
|
case 201: return "Created";
|
|
|
|
case 202: return "Accepted";
|
|
|
|
case 204: return "No Content";
|
|
|
|
case 206: return "Partial Content";
|
|
|
|
case 301: return "Moved Permanently";
|
|
|
|
case 302: return "Found";
|
|
|
|
case 304: return "Not Modified";
|
|
|
|
case 400: return "Bad Request";
|
|
|
|
case 401: return "Unauthorized";
|
|
|
|
case 403: return "Forbidden";
|
|
|
|
case 404: return "Not Found";
|
|
|
|
case 418: return "I'm a teapot";
|
|
|
|
case 500: return "Internal Server Error";
|
|
|
|
case 501: return "Not Implemented";
|
|
|
|
default: return "OK";
|
|
|
|
}
|
|
|
|
}
|
|
|
|
// clang-format on
|
|
|
|
|
2020-12-18 06:45:22 +08:00
|
|
|
void mg_http_reply(struct mg_connection *c, int code, const char *headers,
|
|
|
|
const char *fmt, ...) {
|
2021-08-08 00:22:47 +08:00
|
|
|
char mem[256], *buf = mem;
|
2020-12-05 19:26:32 +08:00
|
|
|
va_list ap;
|
2022-02-11 01:11:03 +08:00
|
|
|
size_t len;
|
2020-12-05 19:26:32 +08:00
|
|
|
va_start(ap, fmt);
|
|
|
|
len = mg_vasprintf(&buf, sizeof(mem), fmt, ap);
|
|
|
|
va_end(ap);
|
2021-04-29 16:17:24 +08:00
|
|
|
mg_printf(c, "HTTP/1.1 %d %s\r\n%sContent-Length: %d\r\n\r\n", code,
|
|
|
|
mg_http_status_code_str(code), headers == NULL ? "" : headers, len);
|
2022-02-11 01:11:03 +08:00
|
|
|
mg_send(c, buf, len > 0 ? len : 0);
|
2020-12-05 19:26:32 +08:00
|
|
|
if (buf != mem) free(buf);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void http_cb(struct mg_connection *, int, void *, void *);
|
|
|
|
static void restore_http_cb(struct mg_connection *c) {
|
2022-01-17 22:42:41 +08:00
|
|
|
mg_fs_close((struct mg_fd *) c->pfn_data);
|
2021-03-07 19:56:20 +08:00
|
|
|
c->pfn_data = NULL;
|
2020-12-05 19:26:32 +08:00
|
|
|
c->pfn = http_cb;
|
|
|
|
}
|
|
|
|
|
Make private functions static and add missing prototypes.
Fixes:
mongoose/mongoose.c:180:8: warning: no previous prototype for ‘mg_dns_parse_name’ [-Wmissing-prototypes]
180 | size_t mg_dns_parse_name(const uint8_t *s, size_t n, size_t ofs, char *dst,
| ^~~~~~~~~~~~~~~~~
mongoose/mongoose.c:306:6: warning: no previous prototype for ‘mg_dns_send’ [-Wmissing-prototypes]
306 | void mg_dns_send(struct mg_connection *c, const struct mg_str *name,
| ^~~~~~~~~~~
mongoose/mongoose.c:925:6: warning: no previous prototype for ‘mg_http_parse_headers’ [-Wmissing-prototypes]
925 | void mg_http_parse_headers(const char *s, const char *end,
| ^~~~~~~~~~~~~~~~~~~~~
mongoose/mongoose.c:1125:7: warning: no previous prototype for ‘mg_http_etag’ [-Wmissing-prototypes]
1125 | char *mg_http_etag(char *buf, size_t len, size_t size, time_t mtime) {
| ^~~~~~~~~~~~
mongoose/mongoose.c:2578:6: warning: no previous prototype for ‘mg_sha1_transform’ [-Wmissing-prototypes]
2578 | void mg_sha1_transform(uint32_t state[5], const unsigned char buffer[64]) {
| ^~~~~~~~~~~~~~~~~
mongoose/mongoose.c:2976:8: warning: no previous prototype for ‘mg_open_listener’ [-Wmissing-prototypes]
2976 | SOCKET mg_open_listener(const char *url, struct mg_addr *addr) {
| ^~~~~~~~~~~~~~~~
Signed-off-by: James Hilliard <james.hilliard1@gmail.com>
2021-10-13 08:26:20 +08:00
|
|
|
char *mg_http_etag(char *buf, size_t len, size_t size, time_t mtime);
|
2021-07-29 21:21:20 +08:00
|
|
|
char *mg_http_etag(char *buf, size_t len, size_t size, time_t mtime) {
|
2022-02-10 19:56:55 +08:00
|
|
|
mg_snprintf(buf, len, "\"%lld.%lld\"", (int64_t) mtime, (int64_t) size);
|
2020-12-05 19:26:32 +08:00
|
|
|
return buf;
|
2018-01-15 21:15:59 +08:00
|
|
|
}
|
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
static void static_cb(struct mg_connection *c, int ev, void *ev_data,
|
|
|
|
void *fn_data) {
|
|
|
|
if (ev == MG_EV_WRITE || ev == MG_EV_POLL) {
|
2021-07-29 21:21:20 +08:00
|
|
|
struct mg_fd *fd = (struct mg_fd *) fn_data;
|
2020-12-05 19:26:32 +08:00
|
|
|
// Read to send IO buffer directly, avoid extra on-stack buffer
|
2022-05-16 18:45:08 +08:00
|
|
|
size_t n, max = MG_IO_SIZE, space, *cl = (size_t *) c->label;
|
2020-12-05 19:26:32 +08:00
|
|
|
if (c->send.size < max) mg_iobuf_resize(&c->send, max);
|
2022-02-15 01:44:43 +08:00
|
|
|
if (c->send.len >= c->send.size) return; // Rate limit
|
2022-05-16 18:45:08 +08:00
|
|
|
if ((space = c->send.size - c->send.len) > *cl) space = *cl;
|
|
|
|
n = fd->fs->rd(fd->fd, c->send.buf + c->send.len, space);
|
2022-02-11 19:02:06 +08:00
|
|
|
c->send.len += n;
|
2022-05-16 18:45:08 +08:00
|
|
|
*cl -= n;
|
2022-02-11 19:02:06 +08:00
|
|
|
if (n == 0) restore_http_cb(c);
|
2020-12-05 19:26:32 +08:00
|
|
|
} else if (ev == MG_EV_CLOSE) {
|
|
|
|
restore_http_cb(c);
|
|
|
|
}
|
|
|
|
(void) ev_data;
|
2017-11-24 18:21:45 +08:00
|
|
|
}
|
2016-04-22 23:12:42 +08:00
|
|
|
|
2021-07-29 04:11:07 +08:00
|
|
|
static struct mg_str guess_content_type(struct mg_str path, const char *extra) {
|
2022-01-23 14:10:14 +08:00
|
|
|
struct mg_str k, v, s = mg_str(extra);
|
|
|
|
size_t i = 0;
|
|
|
|
|
2021-07-29 04:11:07 +08:00
|
|
|
// clang-format off
|
2022-01-23 14:10:14 +08:00
|
|
|
struct mg_str tab[] = {
|
|
|
|
MG_C_STR("html"), MG_C_STR("text/html; charset=utf-8"),
|
|
|
|
MG_C_STR("htm"), MG_C_STR("text/html; charset=utf-8"),
|
|
|
|
MG_C_STR("css"), MG_C_STR("text/css; charset=utf-8"),
|
|
|
|
MG_C_STR("js"), MG_C_STR("text/javascript; charset=utf-8"),
|
|
|
|
MG_C_STR("gif"), MG_C_STR("image/gif"),
|
|
|
|
MG_C_STR("png"), MG_C_STR("image/png"),
|
|
|
|
MG_C_STR("jpg"), MG_C_STR("image/jpeg"),
|
|
|
|
MG_C_STR("jpeg"), MG_C_STR("image/jpeg"),
|
|
|
|
MG_C_STR("woff"), MG_C_STR("font/woff"),
|
|
|
|
MG_C_STR("ttf"), MG_C_STR("font/ttf"),
|
|
|
|
MG_C_STR("svg"), MG_C_STR("image/svg+xml"),
|
|
|
|
MG_C_STR("txt"), MG_C_STR("text/plain; charset=utf-8"),
|
|
|
|
MG_C_STR("avi"), MG_C_STR("video/x-msvideo"),
|
|
|
|
MG_C_STR("csv"), MG_C_STR("text/csv"),
|
|
|
|
MG_C_STR("doc"), MG_C_STR("application/msword"),
|
|
|
|
MG_C_STR("exe"), MG_C_STR("application/octet-stream"),
|
|
|
|
MG_C_STR("gz"), MG_C_STR("application/gzip"),
|
|
|
|
MG_C_STR("ico"), MG_C_STR("image/x-icon"),
|
|
|
|
MG_C_STR("json"), MG_C_STR("application/json"),
|
|
|
|
MG_C_STR("mov"), MG_C_STR("video/quicktime"),
|
|
|
|
MG_C_STR("mp3"), MG_C_STR("audio/mpeg"),
|
|
|
|
MG_C_STR("mp4"), MG_C_STR("video/mp4"),
|
|
|
|
MG_C_STR("mpeg"), MG_C_STR("video/mpeg"),
|
|
|
|
MG_C_STR("pdf"), MG_C_STR("application/pdf"),
|
|
|
|
MG_C_STR("shtml"), MG_C_STR("text/html; charset=utf-8"),
|
|
|
|
MG_C_STR("tgz"), MG_C_STR("application/tar-gz"),
|
|
|
|
MG_C_STR("wav"), MG_C_STR("audio/wav"),
|
|
|
|
MG_C_STR("webp"), MG_C_STR("image/webp"),
|
|
|
|
MG_C_STR("zip"), MG_C_STR("application/zip"),
|
|
|
|
MG_C_STR("3gp"), MG_C_STR("video/3gpp"),
|
|
|
|
{0, 0},
|
2021-07-29 04:11:07 +08:00
|
|
|
};
|
2022-01-23 14:10:14 +08:00
|
|
|
// clang-format on
|
2021-07-29 04:11:07 +08:00
|
|
|
|
|
|
|
// Shrink path to its extension only
|
|
|
|
while (i < path.len && path.ptr[path.len - i - 1] != '.') i++;
|
|
|
|
path.ptr += path.len - i;
|
|
|
|
path.len = i;
|
|
|
|
|
|
|
|
// Process user-provided mime type overrides, if any
|
2021-08-28 13:54:56 +08:00
|
|
|
while (mg_commalist(&s, &k, &v)) {
|
2021-07-29 04:11:07 +08:00
|
|
|
if (mg_strcmp(path, k) == 0) return v;
|
2020-12-15 19:58:30 +08:00
|
|
|
}
|
2021-07-29 04:11:07 +08:00
|
|
|
|
|
|
|
// Process built-in mime types
|
2022-01-23 14:10:14 +08:00
|
|
|
for (i = 0; tab[i].ptr != NULL; i += 2) {
|
|
|
|
if (mg_strcmp(path, tab[i]) == 0) return tab[i + 1];
|
2021-07-29 04:11:07 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
return mg_str("text/plain; charset=utf-8");
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
|
|
|
|
2021-04-29 18:00:57 +08:00
|
|
|
static int getrange(struct mg_str *s, int64_t *a, int64_t *b) {
|
2021-05-29 01:30:42 +08:00
|
|
|
size_t i, numparsed = 0;
|
2022-02-13 02:17:25 +08:00
|
|
|
// MG_INFO(("%.*s", (int) s->len, s->ptr));
|
2021-05-29 01:30:42 +08:00
|
|
|
for (i = 0; i + 6 < s->len; i++) {
|
2021-04-29 18:00:57 +08:00
|
|
|
if (memcmp(&s->ptr[i], "bytes=", 6) == 0) {
|
|
|
|
struct mg_str p = mg_str_n(s->ptr + i + 6, s->len - i - 6);
|
|
|
|
if (p.len > 0 && p.ptr[0] >= '0' && p.ptr[0] <= '9') numparsed++;
|
|
|
|
*a = mg_to64(p);
|
2022-02-13 02:17:25 +08:00
|
|
|
// MG_INFO(("PPP [%.*s] %d", (int) p.len, p.ptr, numparsed));
|
2021-04-29 18:00:57 +08:00
|
|
|
while (p.len && p.ptr[0] >= '0' && p.ptr[0] <= '9') p.ptr++, p.len--;
|
|
|
|
if (p.len && p.ptr[0] == '-') p.ptr++, p.len--;
|
|
|
|
*b = mg_to64(p);
|
|
|
|
if (p.len > 0 && p.ptr[0] >= '0' && p.ptr[0] <= '9') numparsed++;
|
2022-02-13 02:17:25 +08:00
|
|
|
// MG_INFO(("PPP [%.*s] %d", (int) p.len, p.ptr, numparsed));
|
2021-04-29 18:00:57 +08:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2021-05-29 01:30:42 +08:00
|
|
|
return (int) numparsed;
|
2021-04-29 18:00:57 +08:00
|
|
|
}
|
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
void mg_http_serve_file(struct mg_connection *c, struct mg_http_message *hm,
|
2022-04-12 17:04:55 +08:00
|
|
|
const char *path,
|
|
|
|
const struct mg_http_serve_opts *opts) {
|
2022-06-02 13:13:25 +08:00
|
|
|
char etag[64], tmp[MG_PATH_MAX];
|
2021-07-29 21:21:20 +08:00
|
|
|
struct mg_fs *fs = opts->fs == NULL ? &mg_fs_posix : opts->fs;
|
2022-06-01 06:44:03 +08:00
|
|
|
struct mg_fd *fd = path == NULL ? NULL : mg_fs_open(fs, path, MG_FS_READ);
|
2021-07-29 21:21:20 +08:00
|
|
|
size_t size = 0;
|
|
|
|
time_t mtime = 0;
|
|
|
|
struct mg_str *inm = NULL;
|
2022-06-02 13:13:25 +08:00
|
|
|
struct mg_str mime = guess_content_type(mg_str(path), opts->mime_types);
|
|
|
|
bool gzip = false;
|
|
|
|
|
|
|
|
// If file does not exist, we try to open file PATH.gz - and if such
|
|
|
|
// pre-compressed .gz file exists, serve it with the Content-Encoding: gzip
|
|
|
|
// Note - we ignore Accept-Encoding, cause we don't have a choice
|
|
|
|
if (fd == NULL) {
|
|
|
|
MG_DEBUG(("NULL [%s]", path));
|
|
|
|
mg_snprintf(tmp, sizeof(tmp), "%s.gz", path);
|
|
|
|
if ((fd = mg_fs_open(fs, tmp, MG_FS_READ)) != NULL) {
|
|
|
|
gzip = true;
|
|
|
|
path = tmp;
|
|
|
|
} else if (opts->page404 != NULL) {
|
|
|
|
// No precompressed file, serve 404
|
|
|
|
fd = mg_fs_open(fs, opts->page404, MG_FS_READ);
|
|
|
|
mime = guess_content_type(mg_str(path), opts->mime_types);
|
|
|
|
path = opts->page404;
|
|
|
|
}
|
|
|
|
}
|
2021-07-29 21:21:20 +08:00
|
|
|
|
2022-02-08 21:36:04 +08:00
|
|
|
if (fd == NULL || fs->st(path, &size, &mtime) == 0) {
|
2022-06-01 06:44:03 +08:00
|
|
|
mg_http_reply(c, 404, opts->extra_headers, "Not found\n");
|
2022-01-17 22:42:41 +08:00
|
|
|
mg_fs_close(fd);
|
2021-07-29 21:21:20 +08:00
|
|
|
// NOTE: mg_http_etag() call should go first!
|
|
|
|
} else if (mg_http_etag(etag, sizeof(etag), size, mtime) != NULL &&
|
|
|
|
(inm = mg_http_get_header(hm, "If-None-Match")) != NULL &&
|
|
|
|
mg_vcasecmp(inm, etag) == 0) {
|
2022-01-17 22:42:41 +08:00
|
|
|
mg_fs_close(fd);
|
2022-05-31 00:44:26 +08:00
|
|
|
mg_printf(c, "HTTP/1.1 304 Not Modified\r\n%sContent-Length: 0\r\n\r\n",
|
|
|
|
opts->extra_headers ? opts->extra_headers : "");
|
2020-12-05 19:26:32 +08:00
|
|
|
} else {
|
2021-04-29 18:00:57 +08:00
|
|
|
int n, status = 200;
|
2022-02-11 01:11:03 +08:00
|
|
|
char range[100] = "";
|
2021-07-29 21:21:20 +08:00
|
|
|
int64_t r1 = 0, r2 = 0, cl = (int64_t) size;
|
2021-04-29 18:00:57 +08:00
|
|
|
|
|
|
|
// Handle Range header
|
|
|
|
struct mg_str *rh = mg_http_get_header(hm, "Range");
|
|
|
|
if (rh != NULL && (n = getrange(rh, &r1, &r2)) > 0 && r1 >= 0 && r2 >= 0) {
|
|
|
|
// If range is specified like "400-", set second limit to content len
|
|
|
|
if (n == 1) r2 = cl - 1;
|
|
|
|
if (r1 > r2 || r2 >= cl) {
|
|
|
|
status = 416;
|
|
|
|
cl = 0;
|
2022-02-10 19:56:55 +08:00
|
|
|
mg_snprintf(range, sizeof(range), "Content-Range: bytes */%lld\r\n",
|
|
|
|
(int64_t) size);
|
2021-04-29 18:00:57 +08:00
|
|
|
} else {
|
|
|
|
status = 206;
|
|
|
|
cl = r2 - r1 + 1;
|
2022-02-10 19:56:55 +08:00
|
|
|
mg_snprintf(range, sizeof(range),
|
|
|
|
"Content-Range: bytes %lld-%lld/%lld\r\n", r1, r1 + cl - 1,
|
|
|
|
(int64_t) size);
|
2022-02-08 21:36:04 +08:00
|
|
|
fs->sk(fd->fd, (size_t) r1);
|
2021-04-29 18:00:57 +08:00
|
|
|
}
|
|
|
|
}
|
2020-12-05 19:26:32 +08:00
|
|
|
mg_printf(c,
|
2022-02-11 01:11:03 +08:00
|
|
|
"HTTP/1.1 %d %s\r\n"
|
|
|
|
"Content-Type: %.*s\r\n"
|
|
|
|
"Etag: %s\r\n"
|
|
|
|
"Content-Length: %llu\r\n"
|
2022-06-02 13:13:25 +08:00
|
|
|
"%s%s%s\r\n",
|
2021-07-29 04:11:07 +08:00
|
|
|
status, mg_http_status_code_str(status), (int) mime.len, mime.ptr,
|
2022-06-02 13:13:25 +08:00
|
|
|
etag, cl, gzip ? "Content-Encoding: gzip\r\n" : "", range,
|
|
|
|
opts->extra_headers ? opts->extra_headers : "");
|
2020-12-05 19:26:32 +08:00
|
|
|
if (mg_vcasecmp(&hm->method, "HEAD") == 0) {
|
2021-08-05 17:39:24 +08:00
|
|
|
c->is_draining = 1;
|
2022-01-17 22:42:41 +08:00
|
|
|
mg_fs_close(fd);
|
2020-12-05 19:26:32 +08:00
|
|
|
} else {
|
2021-03-07 19:56:20 +08:00
|
|
|
c->pfn = static_cb;
|
2021-07-29 21:21:20 +08:00
|
|
|
c->pfn_data = fd;
|
2022-05-16 18:45:08 +08:00
|
|
|
*(size_t *) c->label = (size_t) cl; // Track to-be-sent content length
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2017-01-24 20:41:44 +08:00
|
|
|
|
2021-07-29 21:21:20 +08:00
|
|
|
struct printdirentrydata {
|
|
|
|
struct mg_connection *c;
|
|
|
|
struct mg_http_message *hm;
|
2022-04-12 17:04:55 +08:00
|
|
|
const struct mg_http_serve_opts *opts;
|
2021-07-29 21:21:20 +08:00
|
|
|
const char *dir;
|
2017-01-24 20:41:44 +08:00
|
|
|
};
|
2016-12-23 20:24:27 +08:00
|
|
|
|
2021-07-29 21:21:20 +08:00
|
|
|
static void printdirentry(const char *name, void *userdata) {
|
|
|
|
struct printdirentrydata *d = (struct printdirentrydata *) userdata;
|
|
|
|
struct mg_fs *fs = d->opts->fs == NULL ? &mg_fs_posix : d->opts->fs;
|
|
|
|
size_t size = 0;
|
2021-11-03 00:01:06 +08:00
|
|
|
time_t t = 0;
|
2022-02-10 19:56:55 +08:00
|
|
|
char path[MG_PATH_MAX], sz[40], mod[40];
|
2021-07-29 21:21:20 +08:00
|
|
|
int flags, n = 0;
|
|
|
|
|
2022-02-13 02:17:25 +08:00
|
|
|
// MG_DEBUG(("[%s] [%s]", d->dir, name));
|
2022-02-10 19:56:55 +08:00
|
|
|
if (mg_snprintf(path, sizeof(path), "%s%c%s", d->dir, '/', name) >
|
|
|
|
sizeof(path)) {
|
2022-02-13 02:17:25 +08:00
|
|
|
MG_ERROR(("%s truncated", name));
|
2022-02-08 21:36:04 +08:00
|
|
|
} else if ((flags = fs->st(path, &size, &t)) == 0) {
|
2022-02-13 02:17:25 +08:00
|
|
|
MG_ERROR(("%lu stat(%s): %d", d->c->id, path, errno));
|
2020-12-05 19:26:32 +08:00
|
|
|
} else {
|
2021-07-29 21:21:20 +08:00
|
|
|
const char *slash = flags & MG_FS_DIR ? "/" : "";
|
|
|
|
if (flags & MG_FS_DIR) {
|
2022-02-10 19:56:55 +08:00
|
|
|
mg_snprintf(sz, sizeof(sz), "%s", "[DIR]");
|
2020-12-05 19:26:32 +08:00
|
|
|
} else {
|
2022-02-11 01:11:03 +08:00
|
|
|
mg_snprintf(sz, sizeof(sz), "%lld", (uint64_t) size);
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
2022-02-11 01:11:03 +08:00
|
|
|
mg_snprintf(mod, sizeof(mod), "%ld", (unsigned long) t);
|
2021-07-29 21:21:20 +08:00
|
|
|
n = (int) mg_url_encode(name, strlen(name), path, sizeof(path));
|
|
|
|
mg_printf(d->c,
|
|
|
|
" <tr><td><a href=\"%.*s%s\">%s%s</a></td>"
|
2022-02-11 01:11:03 +08:00
|
|
|
"<td name=%lu>%s</td><td name=%lld>%s</td></tr>\n",
|
2021-11-03 00:40:25 +08:00
|
|
|
n, path, slash, name, slash, (unsigned long) t, mod,
|
|
|
|
flags & MG_FS_DIR ? (int64_t) -1 : (int64_t) size, sz);
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void listdir(struct mg_connection *c, struct mg_http_message *hm,
|
2022-04-12 17:04:55 +08:00
|
|
|
const struct mg_http_serve_opts *opts, char *dir) {
|
2022-04-12 21:14:55 +08:00
|
|
|
const char *sort_js_code =
|
2021-02-08 06:43:49 +08:00
|
|
|
"<script>function srt(tb, sc, so, d) {"
|
|
|
|
"var tr = Array.prototype.slice.call(tb.rows, 0),"
|
|
|
|
"tr = tr.sort(function (a, b) { var c1 = a.cells[sc], c2 = b.cells[sc],"
|
|
|
|
"n1 = c1.getAttribute('name'), n2 = c2.getAttribute('name'), "
|
|
|
|
"t1 = a.cells[2].getAttribute('name'), "
|
|
|
|
"t2 = b.cells[2].getAttribute('name'); "
|
|
|
|
"return so * (t1 < 0 && t2 >= 0 ? -1 : t2 < 0 && t1 >= 0 ? 1 : "
|
|
|
|
"n1 ? parseInt(n2) - parseInt(n1) : "
|
|
|
|
"c1.textContent.trim().localeCompare(c2.textContent.trim())); });";
|
2022-04-12 21:14:55 +08:00
|
|
|
const char *sort_js_code2 =
|
2021-02-08 06:43:49 +08:00
|
|
|
"for (var i = 0; i < tr.length; i++) tb.appendChild(tr[i]); "
|
|
|
|
"if (!d) window.location.hash = ('sc=' + sc + '&so=' + so); "
|
|
|
|
"};"
|
|
|
|
"window.onload = function() {"
|
|
|
|
"var tb = document.getElementById('tb');"
|
|
|
|
"var m = /sc=([012]).so=(1|-1)/.exec(window.location.hash) || [0, 2, 1];"
|
|
|
|
"var sc = m[1], so = m[2]; document.onclick = function(ev) { "
|
|
|
|
"var c = ev.target.rel; if (c) {if (c == sc) so *= -1; srt(tb, c, so); "
|
|
|
|
"sc = c; ev.preventDefault();}};"
|
|
|
|
"srt(tb, sc, so, true);"
|
|
|
|
"}"
|
|
|
|
"</script>";
|
2021-07-29 21:21:20 +08:00
|
|
|
struct mg_fs *fs = opts->fs == NULL ? &mg_fs_posix : opts->fs;
|
|
|
|
struct printdirentrydata d = {c, hm, opts, dir};
|
2021-11-02 23:11:56 +08:00
|
|
|
char tmp[10], buf[MG_PATH_MAX];
|
2021-07-29 21:21:20 +08:00
|
|
|
size_t off, n;
|
2021-11-02 23:11:56 +08:00
|
|
|
int len = mg_url_decode(hm->uri.ptr, hm->uri.len, buf, sizeof(buf), 0);
|
|
|
|
struct mg_str uri = len > 0 ? mg_str_n(buf, (size_t) len) : hm->uri;
|
2016-04-18 23:04:45 +08:00
|
|
|
|
2021-07-29 21:21:20 +08:00
|
|
|
mg_printf(c,
|
|
|
|
"HTTP/1.1 200 OK\r\n"
|
|
|
|
"Content-Type: text/html; charset=utf-8\r\n"
|
|
|
|
"%s"
|
|
|
|
"Content-Length: \r\n\r\n",
|
|
|
|
opts->extra_headers == NULL ? "" : opts->extra_headers);
|
|
|
|
off = c->send.len; // Start of body
|
|
|
|
mg_printf(c,
|
|
|
|
"<!DOCTYPE html><html><head><title>Index of %.*s</title>%s%s"
|
|
|
|
"<style>th,td {text-align: left; padding-right: 1em; "
|
|
|
|
"font-family: monospace; }</style></head>"
|
2022-02-11 01:11:03 +08:00
|
|
|
"<body><h1>Index of %.*s</h1><table cellpadding=\"0\"><thead>"
|
2021-07-29 21:21:20 +08:00
|
|
|
"<tr><th><a href=\"#\" rel=\"0\">Name</a></th><th>"
|
|
|
|
"<a href=\"#\" rel=\"1\">Modified</a></th>"
|
|
|
|
"<th><a href=\"#\" rel=\"2\">Size</a></th></tr>"
|
|
|
|
"<tr><td colspan=\"3\"><hr></td></tr>"
|
|
|
|
"</thead>"
|
|
|
|
"<tbody id=\"tb\">\n",
|
2021-11-02 23:11:56 +08:00
|
|
|
(int) uri.len, uri.ptr, sort_js_code, sort_js_code2, (int) uri.len,
|
|
|
|
uri.ptr);
|
2022-02-11 01:11:03 +08:00
|
|
|
mg_printf(c, "%s",
|
|
|
|
" <tr><td><a href=\"..\">..</a></td>"
|
|
|
|
"<td name=-1></td><td name=-1>[DIR]</td></tr>\n");
|
2021-07-29 21:21:20 +08:00
|
|
|
|
2022-02-08 21:36:04 +08:00
|
|
|
fs->ls(dir, printdirentry, &d);
|
2021-07-29 21:21:20 +08:00
|
|
|
mg_printf(c,
|
|
|
|
"</tbody><tfoot><tr><td colspan=\"3\"><hr></td></tr></tfoot>"
|
|
|
|
"</table><address>Mongoose v.%s</address></body></html>\n",
|
|
|
|
MG_VERSION);
|
2022-02-10 19:56:55 +08:00
|
|
|
n = mg_snprintf(tmp, sizeof(tmp), "%lu", (unsigned long) (c->send.len - off));
|
2021-07-29 21:21:20 +08:00
|
|
|
if (n > sizeof(tmp)) n = 0;
|
2022-06-09 02:51:03 +08:00
|
|
|
memcpy(c->send.buf + off - 12, tmp, n); // Set content length
|
2021-07-29 21:21:20 +08:00
|
|
|
}
|
|
|
|
|
2021-09-15 14:43:48 +08:00
|
|
|
static void remove_double_dots(char *s) {
|
|
|
|
char *p = s;
|
|
|
|
while (*s != '\0') {
|
|
|
|
*p++ = *s++;
|
|
|
|
if (s[-1] == '/' || s[-1] == '\\') {
|
|
|
|
while (s[0] != '\0') {
|
|
|
|
if (s[0] == '/' || s[0] == '\\') {
|
|
|
|
s++;
|
2021-10-31 20:36:34 +08:00
|
|
|
} else if (s[0] == '.' && s[1] == '.' &&
|
|
|
|
(s[2] == '/' || s[2] == '\\')) {
|
2021-09-15 14:43:48 +08:00
|
|
|
s += 2;
|
|
|
|
} else {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
*p = '\0';
|
|
|
|
}
|
|
|
|
|
2022-02-08 21:36:04 +08:00
|
|
|
// Resolve requested file into `path` and return its fs->st() result
|
2021-09-20 19:24:44 +08:00
|
|
|
static int uri_to_path2(struct mg_connection *c, struct mg_http_message *hm,
|
|
|
|
struct mg_fs *fs, struct mg_str url, struct mg_str dir,
|
|
|
|
char *path, size_t path_size) {
|
2022-04-05 19:54:20 +08:00
|
|
|
int flags, tmp;
|
2021-09-15 14:43:48 +08:00
|
|
|
// Append URI to the root_dir, and sanitize it
|
2022-02-10 19:56:55 +08:00
|
|
|
size_t n = mg_snprintf(path, path_size, "%.*s", (int) dir.len, dir.ptr);
|
2021-09-15 14:43:48 +08:00
|
|
|
if (n > path_size) n = path_size;
|
2021-09-20 19:24:44 +08:00
|
|
|
path[path_size - 1] = '\0';
|
2022-04-05 19:54:20 +08:00
|
|
|
if (n + 2 < path_size) path[n++] = '/', path[n] = '\0';
|
|
|
|
mg_url_decode(hm->uri.ptr + url.len, hm->uri.len - url.len, path + n,
|
|
|
|
path_size - n, 0);
|
|
|
|
path[path_size - 1] = '\0'; // Double-check
|
|
|
|
remove_double_dots(path);
|
|
|
|
n = strlen(path);
|
2022-06-07 11:33:46 +08:00
|
|
|
while (n > 1 && path[n - 1] == '/') path[--n] = 0; // Trim trailing slashes
|
2022-04-05 19:54:20 +08:00
|
|
|
flags = mg_vcmp(&hm->uri, "/") == 0 ? MG_FS_DIR : fs->st(path, NULL, NULL);
|
2022-06-02 13:13:25 +08:00
|
|
|
MG_VERBOSE(("%lu %.*s -> %s %d", c->id, (int) hm->uri.len, hm->uri.ptr, path,
|
|
|
|
flags));
|
2022-04-05 19:54:20 +08:00
|
|
|
if (flags == 0) {
|
2022-06-01 06:44:03 +08:00
|
|
|
// Do nothing - let's caller decide
|
2022-04-05 19:54:20 +08:00
|
|
|
} else if ((flags & MG_FS_DIR) && hm->uri.len > 0 &&
|
|
|
|
hm->uri.ptr[hm->uri.len - 1] != '/') {
|
|
|
|
mg_printf(c,
|
|
|
|
"HTTP/1.1 301 Moved\r\n"
|
|
|
|
"Location: %.*s/\r\n"
|
|
|
|
"Content-Length: 0\r\n"
|
|
|
|
"\r\n",
|
|
|
|
(int) hm->uri.len, hm->uri.ptr);
|
2022-06-01 06:44:03 +08:00
|
|
|
flags = -1;
|
2022-04-05 19:54:20 +08:00
|
|
|
} else if (flags & MG_FS_DIR) {
|
|
|
|
if (((mg_snprintf(path + n, path_size - n, "/" MG_HTTP_INDEX) > 0 &&
|
|
|
|
(tmp = fs->st(path, NULL, NULL)) != 0) ||
|
|
|
|
(mg_snprintf(path + n, path_size - n, "/index.shtml") > 0 &&
|
|
|
|
(tmp = fs->st(path, NULL, NULL)) != 0))) {
|
|
|
|
flags = tmp;
|
|
|
|
} else {
|
|
|
|
path[n] = '\0'; // Remove appended index file name
|
2021-07-29 21:21:20 +08:00
|
|
|
}
|
2021-07-25 05:00:37 +08:00
|
|
|
}
|
2021-07-29 21:21:20 +08:00
|
|
|
return flags;
|
2021-07-25 05:00:37 +08:00
|
|
|
}
|
|
|
|
|
2021-09-20 19:24:44 +08:00
|
|
|
static int uri_to_path(struct mg_connection *c, struct mg_http_message *hm,
|
2022-04-12 17:04:55 +08:00
|
|
|
const struct mg_http_serve_opts *opts, char *path,
|
2021-09-20 19:24:44 +08:00
|
|
|
size_t path_size) {
|
|
|
|
struct mg_fs *fs = opts->fs == NULL ? &mg_fs_posix : opts->fs;
|
|
|
|
struct mg_str k, v, s = mg_str(opts->root_dir), u = {0, 0}, p = {0, 0};
|
|
|
|
while (mg_commalist(&s, &k, &v)) {
|
|
|
|
if (v.len == 0) v = k, k = mg_str("/");
|
|
|
|
if (hm->uri.len < k.len) continue;
|
|
|
|
if (mg_strcmp(k, mg_str_n(hm->uri.ptr, k.len)) != 0) continue;
|
|
|
|
u = k, p = v;
|
|
|
|
}
|
|
|
|
return uri_to_path2(c, hm, fs, u, p, path, path_size);
|
|
|
|
}
|
|
|
|
|
2021-07-25 05:00:37 +08:00
|
|
|
void mg_http_serve_dir(struct mg_connection *c, struct mg_http_message *hm,
|
2022-04-12 17:04:55 +08:00
|
|
|
const struct mg_http_serve_opts *opts) {
|
2021-09-15 14:43:48 +08:00
|
|
|
char path[MG_PATH_MAX] = "";
|
|
|
|
const char *sp = opts->ssi_pattern;
|
2021-09-20 19:24:44 +08:00
|
|
|
int flags = uri_to_path(c, hm, opts, path, sizeof(path));
|
2022-06-01 06:44:03 +08:00
|
|
|
if (flags < 0) {
|
|
|
|
// Do nothing: the response has already been sent by uri_to_path()
|
|
|
|
} else if (flags & MG_FS_DIR) {
|
2021-09-20 19:24:44 +08:00
|
|
|
listdir(c, hm, opts, path);
|
2022-06-02 13:13:25 +08:00
|
|
|
} else if (flags && sp != NULL &&
|
|
|
|
mg_globmatch(sp, strlen(sp), path, strlen(path))) {
|
2021-09-20 19:24:44 +08:00
|
|
|
mg_http_serve_ssi(c, opts->root_dir, path);
|
|
|
|
} else {
|
|
|
|
mg_http_serve_file(c, hm, path, opts);
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
|
|
|
}
|
2015-12-16 08:52:37 +08:00
|
|
|
|
2021-02-15 22:42:55 +08:00
|
|
|
static bool mg_is_url_safe(int c) {
|
|
|
|
return (c >= '0' && c <= '9') || (c >= 'a' && c <= 'z') ||
|
|
|
|
(c >= 'A' && c <= 'Z') || c == '.' || c == '_' || c == '-' || c == '~';
|
|
|
|
}
|
|
|
|
|
2021-05-29 01:30:42 +08:00
|
|
|
size_t mg_url_encode(const char *s, size_t sl, char *buf, size_t len) {
|
2021-02-15 22:42:55 +08:00
|
|
|
size_t i, n = 0;
|
|
|
|
for (i = 0; i < sl; i++) {
|
|
|
|
int c = *(unsigned char *) &s[i];
|
|
|
|
if (n + 4 >= len) return 0;
|
|
|
|
if (mg_is_url_safe(c)) {
|
|
|
|
buf[n++] = s[i];
|
|
|
|
} else {
|
|
|
|
buf[n++] = '%';
|
|
|
|
mg_hex(&s[i], 1, &buf[n]);
|
|
|
|
n += 2;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return n;
|
|
|
|
}
|
|
|
|
|
2021-05-29 01:30:42 +08:00
|
|
|
void mg_http_creds(struct mg_http_message *hm, char *user, size_t userlen,
|
|
|
|
char *pass, size_t passlen) {
|
2020-12-05 19:26:32 +08:00
|
|
|
struct mg_str *v = mg_http_get_header(hm, "Authorization");
|
|
|
|
user[0] = pass[0] = '\0';
|
|
|
|
if (v != NULL && v->len > 6 && memcmp(v->ptr, "Basic ", 6) == 0) {
|
|
|
|
char buf[256];
|
|
|
|
int n = mg_base64_decode(v->ptr + 6, (int) v->len - 6, buf);
|
2021-05-29 01:30:42 +08:00
|
|
|
const char *p = (const char *) memchr(buf, ':', n > 0 ? (size_t) n : 0);
|
2020-12-05 19:26:32 +08:00
|
|
|
if (p != NULL) {
|
2022-02-10 19:56:55 +08:00
|
|
|
mg_snprintf(user, userlen, "%.*s", (int) (p - buf), buf);
|
|
|
|
mg_snprintf(pass, passlen, "%.*s", n - (int) (p - buf) - 1, p + 1);
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
|
|
|
} else if (v != NULL && v->len > 7 && memcmp(v->ptr, "Bearer ", 7) == 0) {
|
2022-02-10 19:56:55 +08:00
|
|
|
mg_snprintf(pass, passlen, "%.*s", (int) v->len - 7, v->ptr + 7);
|
2020-12-05 19:26:32 +08:00
|
|
|
} else if ((v = mg_http_get_header(hm, "Cookie")) != NULL) {
|
2021-03-17 15:43:29 +08:00
|
|
|
struct mg_str t = mg_http_get_header_var(*v, mg_str_n("access_token", 12));
|
2022-02-10 19:56:55 +08:00
|
|
|
if (t.len > 0) mg_snprintf(pass, passlen, "%.*s", (int) t.len, t.ptr);
|
2020-12-05 19:26:32 +08:00
|
|
|
} else {
|
|
|
|
mg_http_get_var(&hm->query, "access_token", pass, passlen);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2021-03-17 15:43:29 +08:00
|
|
|
static struct mg_str stripquotes(struct mg_str s) {
|
|
|
|
return s.len > 1 && s.ptr[0] == '"' && s.ptr[s.len - 1] == '"'
|
|
|
|
? mg_str_n(s.ptr + 1, s.len - 2)
|
|
|
|
: s;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct mg_str mg_http_get_header_var(struct mg_str s, struct mg_str v) {
|
|
|
|
size_t i;
|
2021-10-22 21:33:51 +08:00
|
|
|
for (i = 0; v.len > 0 && i + v.len + 2 < s.len; i++) {
|
2021-03-17 15:43:29 +08:00
|
|
|
if (s.ptr[i + v.len] == '=' && memcmp(&s.ptr[i], v.ptr, v.len) == 0) {
|
2021-03-17 21:28:36 +08:00
|
|
|
const char *p = &s.ptr[i + v.len + 1], *b = p, *x = &s.ptr[s.len];
|
|
|
|
int q = p < x && *p == '"' ? 1 : 0;
|
2021-10-22 21:33:51 +08:00
|
|
|
while (p < x &&
|
|
|
|
(q ? p == b || *p != '"' : *p != ';' && *p != ' ' && *p != ','))
|
|
|
|
p++;
|
2022-02-13 02:17:25 +08:00
|
|
|
// MG_INFO(("[%.*s] [%.*s] [%.*s]", (int) s.len, s.ptr, (int) v.len,
|
2021-03-17 21:28:36 +08:00
|
|
|
// v.ptr, (int) (p - b), b));
|
2021-08-08 00:22:47 +08:00
|
|
|
return stripquotes(mg_str_n(b, (size_t) (p - b + q)));
|
2021-03-17 15:43:29 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
return mg_str_n(NULL, 0);
|
|
|
|
}
|
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
bool mg_http_match_uri(const struct mg_http_message *hm, const char *glob) {
|
2022-01-29 19:03:54 +08:00
|
|
|
return mg_match(hm->uri, mg_str(glob), NULL);
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
|
|
|
|
2021-03-08 23:41:16 +08:00
|
|
|
static size_t get_chunk_length(const char *buf, size_t len, size_t *ll) {
|
|
|
|
size_t i = 0, n;
|
|
|
|
while (i < len && buf[i] != '\r' && i != '\n') i++;
|
|
|
|
n = mg_unhexn((char *) buf, i);
|
|
|
|
while (i < len && (buf[i] == '\r' || i == '\n')) i++;
|
2022-02-13 02:17:25 +08:00
|
|
|
// MG_INFO(("len %zu i %zu n %zu ", len, i, n));
|
2021-03-08 23:41:16 +08:00
|
|
|
if (ll != NULL) *ll = i + 1;
|
|
|
|
if (i < len && i + n + 2 < len) return i + n + 3;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Walk through all chunks in the chunked body. For each chunk, fire
|
|
|
|
// an MG_EV_HTTP_CHUNK event.
|
2022-05-30 23:02:59 +08:00
|
|
|
static bool walkchunks(struct mg_connection *c, struct mg_http_message *hm,
|
2021-05-29 01:30:42 +08:00
|
|
|
size_t reqlen) {
|
2021-03-09 16:21:29 +08:00
|
|
|
size_t off = 0, bl, ll;
|
2021-03-09 17:54:02 +08:00
|
|
|
while (off + reqlen < c->recv.len) {
|
2021-03-08 23:41:16 +08:00
|
|
|
char *buf = (char *) &c->recv.buf[reqlen];
|
|
|
|
size_t memo = c->recv.len;
|
|
|
|
size_t cl = get_chunk_length(&buf[off], memo - reqlen - off, &ll);
|
2022-02-13 02:17:25 +08:00
|
|
|
// MG_INFO(("len %zu off %zu cl %zu ll %zu", len, off, cl, ll));
|
2021-03-08 23:41:16 +08:00
|
|
|
if (cl == 0) break;
|
|
|
|
hm->chunk = mg_str_n(&buf[off + ll], cl < ll + 2 ? 0 : cl - ll - 2);
|
|
|
|
mg_call(c, MG_EV_HTTP_CHUNK, hm);
|
|
|
|
// Increase offset only if user has not deleted this chunk
|
|
|
|
if (memo == c->recv.len) off += cl;
|
|
|
|
if (cl <= 5) {
|
2021-03-09 16:21:29 +08:00
|
|
|
// Zero chunk - last one. Prepare body - cut off chunk lengths
|
2022-05-30 23:02:59 +08:00
|
|
|
if (memo != c->recv.len) return true; // Tell caller to cleanup
|
2021-03-09 16:21:29 +08:00
|
|
|
off = bl = 0;
|
2021-03-09 17:54:02 +08:00
|
|
|
while (off + reqlen < c->recv.len) {
|
2021-05-29 01:30:42 +08:00
|
|
|
char *buf2 = (char *) &c->recv.buf[reqlen];
|
|
|
|
size_t memo2 = c->recv.len;
|
|
|
|
size_t cl2 = get_chunk_length(&buf2[off], memo2 - reqlen - off, &ll);
|
2021-08-23 14:40:35 +08:00
|
|
|
size_t n = cl2 < ll + 2 ? 0 : cl2 - ll - 2;
|
2021-05-29 01:30:42 +08:00
|
|
|
memmove(buf2 + bl, buf2 + off + ll, n);
|
2021-03-09 16:21:29 +08:00
|
|
|
bl += n;
|
2021-05-29 01:30:42 +08:00
|
|
|
off += cl2;
|
|
|
|
if (cl2 <= 5) break;
|
2021-03-09 16:21:29 +08:00
|
|
|
}
|
2022-02-13 02:17:25 +08:00
|
|
|
// MG_INFO(("BL->%d del %d off %d", (int) bl, (int) del, (int) off));
|
2021-03-19 21:13:24 +08:00
|
|
|
c->recv.len -= off - bl;
|
2021-03-09 16:21:29 +08:00
|
|
|
// Set message length to indicate we've received
|
2021-03-08 23:41:16 +08:00
|
|
|
// everything, to fire MG_EV_HTTP_MSG
|
2021-03-09 16:21:29 +08:00
|
|
|
hm->message.len = bl + reqlen;
|
|
|
|
hm->body.len = bl;
|
2022-05-30 23:02:59 +08:00
|
|
|
// If user was deleting chunks, send nothing
|
2021-03-08 23:41:16 +08:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2022-05-30 23:02:59 +08:00
|
|
|
return false;
|
2021-03-08 23:41:16 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static bool mg_is_chunked(struct mg_http_message *hm) {
|
2022-05-16 18:19:45 +08:00
|
|
|
const char *needle = "chunked";
|
2021-03-08 23:41:16 +08:00
|
|
|
struct mg_str *te = mg_http_get_header(hm, "Transfer-Encoding");
|
2022-05-16 18:19:45 +08:00
|
|
|
return te != NULL && mg_vcasecmp(te, needle) == 0;
|
2021-03-08 23:41:16 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void mg_http_delete_chunk(struct mg_connection *c, struct mg_http_message *hm) {
|
|
|
|
struct mg_str ch = hm->chunk;
|
2022-02-09 20:24:06 +08:00
|
|
|
const char *end = (char *) &c->recv.buf[c->recv.len], *ce;
|
|
|
|
bool chunked = mg_is_chunked(hm);
|
|
|
|
if (chunked) {
|
|
|
|
ch.len += 4, ch.ptr -= 2; // \r\n before and after the chunk
|
2021-03-08 23:41:16 +08:00
|
|
|
while (ch.ptr > hm->body.ptr && *ch.ptr != '\n') ch.ptr--, ch.len++;
|
|
|
|
}
|
2022-02-09 20:24:06 +08:00
|
|
|
ce = &ch.ptr[ch.len];
|
|
|
|
if (ce < end) memmove((void *) ch.ptr, ce, (size_t) (end - ce));
|
2021-03-08 23:41:16 +08:00
|
|
|
c->recv.len -= ch.len;
|
2022-02-12 22:28:02 +08:00
|
|
|
if (c->pfn_data != NULL) c->pfn_data = (char *) c->pfn_data - ch.len;
|
2021-03-08 23:41:16 +08:00
|
|
|
}
|
|
|
|
|
2022-01-17 20:08:23 +08:00
|
|
|
int mg_http_upload(struct mg_connection *c, struct mg_http_message *hm,
|
2022-01-19 01:11:02 +08:00
|
|
|
struct mg_fs *fs, const char *dir) {
|
2022-01-17 20:08:23 +08:00
|
|
|
char offset[40] = "", name[200] = "", path[256];
|
2022-03-14 19:16:41 +08:00
|
|
|
int res = 0;
|
2022-01-17 20:08:23 +08:00
|
|
|
mg_http_get_var(&hm->query, "offset", offset, sizeof(offset));
|
|
|
|
mg_http_get_var(&hm->query, "name", name, sizeof(name));
|
|
|
|
if (name[0] == '\0') {
|
|
|
|
mg_http_reply(c, 400, "", "%s", "name required");
|
2022-03-14 19:16:41 +08:00
|
|
|
res = -1;
|
2022-06-13 21:48:52 +08:00
|
|
|
} else if (hm->body.len == 0) {
|
|
|
|
mg_http_reply(c, 200, "", "%d", res); // Nothing to write
|
|
|
|
} else {
|
2022-01-19 01:11:02 +08:00
|
|
|
struct mg_fd *fd;
|
2022-01-17 20:08:23 +08:00
|
|
|
long oft = strtol(offset, NULL, 0);
|
2022-02-10 19:56:55 +08:00
|
|
|
mg_snprintf(path, sizeof(path), "%s%c%s", dir, MG_DIRSEP, name);
|
2022-01-17 20:08:23 +08:00
|
|
|
remove_double_dots(path);
|
2022-02-13 02:17:25 +08:00
|
|
|
MG_DEBUG(("%d bytes @ %ld [%s]", (int) hm->body.len, oft, path));
|
2022-02-08 21:36:04 +08:00
|
|
|
if (oft == 0) fs->rm(path);
|
2022-01-19 01:11:02 +08:00
|
|
|
if ((fd = mg_fs_open(fs, path, MG_FS_WRITE)) == NULL) {
|
|
|
|
mg_http_reply(c, 400, "", "open(%s): %d", path, errno);
|
2022-03-14 19:16:41 +08:00
|
|
|
res = -2;
|
2022-01-17 20:08:23 +08:00
|
|
|
} else {
|
2022-03-14 19:16:41 +08:00
|
|
|
res = (int) fs->wr(fd->fd, hm->body.ptr, hm->body.len);
|
2022-01-19 01:11:02 +08:00
|
|
|
mg_fs_close(fd);
|
2022-03-14 19:16:41 +08:00
|
|
|
mg_http_reply(c, 200, "", "%d", res);
|
2022-01-17 20:08:23 +08:00
|
|
|
}
|
|
|
|
}
|
2022-03-14 19:16:41 +08:00
|
|
|
return res;
|
2022-01-17 20:08:23 +08:00
|
|
|
}
|
|
|
|
|
2022-02-13 00:51:37 +08:00
|
|
|
int mg_http_status(const struct mg_http_message *hm) {
|
|
|
|
return atoi(hm->uri.ptr);
|
|
|
|
}
|
|
|
|
|
2021-03-08 23:41:16 +08:00
|
|
|
static void http_cb(struct mg_connection *c, int ev, void *evd, void *fnd) {
|
2020-12-05 19:26:32 +08:00
|
|
|
if (ev == MG_EV_READ || ev == MG_EV_CLOSE) {
|
|
|
|
struct mg_http_message hm;
|
2022-01-14 17:55:15 +08:00
|
|
|
while (c->recv.buf != NULL && c->recv.len > 0) {
|
2020-12-05 19:26:32 +08:00
|
|
|
int n = mg_http_parse((char *) c->recv.buf, c->recv.len, &hm);
|
2021-03-08 23:41:16 +08:00
|
|
|
bool is_chunked = n > 0 && mg_is_chunked(&hm);
|
2020-12-05 19:26:32 +08:00
|
|
|
if (ev == MG_EV_CLOSE) {
|
|
|
|
hm.message.len = c->recv.len;
|
2021-08-08 00:22:47 +08:00
|
|
|
hm.body.len = hm.message.len - (size_t) (hm.body.ptr - hm.message.ptr);
|
2022-05-30 23:02:59 +08:00
|
|
|
} else if (is_chunked && n > 0 && walkchunks(c, &hm, (size_t) n)) {
|
|
|
|
// walkchunks told us to cleanup the request
|
|
|
|
if (n > (int) c->recv.len) n = (int) c->recv.len;
|
|
|
|
mg_iobuf_del(&c->recv, 0, (size_t) n);
|
|
|
|
break;
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
2022-02-13 02:17:25 +08:00
|
|
|
// MG_INFO(("---->%d %d\n%.*s", n, is_chunked, (int) c->recv.len,
|
|
|
|
// c->recv.buf));
|
2020-12-05 19:26:32 +08:00
|
|
|
if (n < 0 && ev == MG_EV_READ) {
|
2021-03-19 21:13:24 +08:00
|
|
|
mg_error(c, "HTTP parse:\n%.*s", (int) c->recv.len, c->recv.buf);
|
2020-12-05 19:26:32 +08:00
|
|
|
break;
|
|
|
|
} else if (n > 0 && (size_t) c->recv.len >= hm.message.len) {
|
|
|
|
mg_call(c, MG_EV_HTTP_MSG, &hm);
|
2021-08-28 14:16:38 +08:00
|
|
|
mg_iobuf_del(&c->recv, 0, hm.message.len);
|
2020-12-05 19:26:32 +08:00
|
|
|
} else {
|
2021-03-08 23:41:16 +08:00
|
|
|
if (n > 0 && !is_chunked) {
|
2021-05-29 01:30:42 +08:00
|
|
|
hm.chunk =
|
|
|
|
mg_str_n((char *) &c->recv.buf[n], c->recv.len - (size_t) n);
|
2022-02-09 20:24:06 +08:00
|
|
|
// Store remaining body length in c->pfn_data
|
|
|
|
if (c->pfn_data == NULL)
|
|
|
|
c->pfn_data = (void *) (hm.message.len - (size_t) n);
|
2021-03-08 23:41:16 +08:00
|
|
|
mg_call(c, MG_EV_HTTP_CHUNK, &hm);
|
2022-02-09 20:24:06 +08:00
|
|
|
if (c->pfn_data == NULL) {
|
|
|
|
hm.chunk.len = 0; // Last chunk!
|
|
|
|
mg_call(c, MG_EV_HTTP_CHUNK, &hm); // Lest user know
|
|
|
|
memmove(c->recv.buf, c->recv.buf + n, c->recv.len - (size_t) n);
|
|
|
|
c->recv.len -= (size_t) n;
|
|
|
|
}
|
2021-03-08 23:41:16 +08:00
|
|
|
}
|
2020-12-05 19:26:32 +08:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2021-03-08 23:41:16 +08:00
|
|
|
(void) fnd;
|
|
|
|
(void) evd;
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
struct mg_connection *mg_http_connect(struct mg_mgr *mgr, const char *url,
|
|
|
|
mg_event_handler_t fn, void *fn_data) {
|
|
|
|
struct mg_connection *c = mg_connect(mgr, url, fn, fn_data);
|
2021-03-07 19:56:20 +08:00
|
|
|
if (c != NULL) c->pfn = http_cb;
|
2020-12-05 19:26:32 +08:00
|
|
|
return c;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct mg_connection *mg_http_listen(struct mg_mgr *mgr, const char *url,
|
|
|
|
mg_event_handler_t fn, void *fn_data) {
|
|
|
|
struct mg_connection *c = mg_listen(mgr, url, fn, fn_data);
|
2021-03-07 19:56:20 +08:00
|
|
|
if (c != NULL) c->pfn = http_cb;
|
2020-12-05 19:26:32 +08:00
|
|
|
return c;
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef MG_ENABLE_LINES
|
|
|
|
#line 1 "src/iobuf.c"
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#include <string.h>
|
|
|
|
|
2021-04-29 15:49:23 +08:00
|
|
|
// Not using memset for zeroing memory, cause it can be dropped by compiler
|
|
|
|
// See https://github.com/cesanta/mongoose/pull/1265
|
|
|
|
static void zeromem(volatile unsigned char *buf, size_t len) {
|
|
|
|
if (buf != NULL) {
|
|
|
|
while (len--) *buf++ = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2021-01-29 20:32:34 +08:00
|
|
|
int mg_iobuf_resize(struct mg_iobuf *io, size_t new_size) {
|
|
|
|
int ok = 1;
|
2020-12-05 19:26:32 +08:00
|
|
|
if (new_size == 0) {
|
2021-04-29 15:49:23 +08:00
|
|
|
zeromem(io->buf, io->size);
|
2020-12-11 01:39:40 +08:00
|
|
|
free(io->buf);
|
|
|
|
io->buf = NULL;
|
|
|
|
io->len = io->size = 0;
|
2020-12-05 19:26:32 +08:00
|
|
|
} else if (new_size != io->size) {
|
2021-05-18 00:36:57 +08:00
|
|
|
// NOTE(lsm): do not use realloc here. Use calloc/free only, to ease the
|
2020-12-05 19:26:32 +08:00
|
|
|
// porting to some obscure platforms like FreeRTOS
|
2021-05-18 00:36:57 +08:00
|
|
|
void *p = calloc(1, new_size);
|
2020-12-05 19:26:32 +08:00
|
|
|
if (p != NULL) {
|
2021-03-22 19:30:48 +08:00
|
|
|
size_t len = new_size < io->len ? new_size : io->len;
|
2022-03-01 00:51:46 +08:00
|
|
|
if (len > 0) memmove(p, io->buf, len);
|
2021-04-29 15:49:23 +08:00
|
|
|
zeromem(io->buf, io->size);
|
2020-12-05 19:26:32 +08:00
|
|
|
free(io->buf);
|
|
|
|
io->buf = (unsigned char *) p;
|
|
|
|
io->size = new_size;
|
|
|
|
} else {
|
2021-01-29 20:32:34 +08:00
|
|
|
ok = 0;
|
2022-02-13 02:17:25 +08:00
|
|
|
MG_ERROR(("%lld->%lld", (uint64_t) io->size, (uint64_t) new_size));
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
|
|
|
}
|
2021-01-29 20:32:34 +08:00
|
|
|
return ok;
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
|
|
|
|
2021-01-29 20:32:34 +08:00
|
|
|
int mg_iobuf_init(struct mg_iobuf *io, size_t size) {
|
2022-04-12 16:53:42 +08:00
|
|
|
io->buf = NULL;
|
|
|
|
io->size = io->len = 0;
|
2021-02-15 22:42:55 +08:00
|
|
|
return mg_iobuf_resize(io, size);
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
|
|
|
|
2021-08-28 15:08:54 +08:00
|
|
|
size_t mg_iobuf_add(struct mg_iobuf *io, size_t ofs, const void *buf,
|
|
|
|
size_t len, size_t chunk_size) {
|
2021-05-29 16:44:07 +08:00
|
|
|
size_t new_size = io->len + len;
|
|
|
|
if (new_size > io->size) {
|
2021-05-29 16:46:50 +08:00
|
|
|
new_size += chunk_size; // Make sure that io->size
|
|
|
|
new_size -= new_size % chunk_size; // is aligned by chunk_size boundary
|
|
|
|
mg_iobuf_resize(io, new_size); // Attempt to realloc
|
2021-05-29 16:44:07 +08:00
|
|
|
if (new_size != io->size) len = 0; // Realloc failure, append nothing
|
|
|
|
}
|
2021-08-28 15:08:54 +08:00
|
|
|
if (ofs < io->len) memmove(io->buf + ofs + len, io->buf + ofs, io->len - ofs);
|
|
|
|
if (buf != NULL) memmove(io->buf + ofs, buf, len);
|
|
|
|
if (ofs > io->len) io->len += ofs - io->len;
|
2020-12-05 19:26:32 +08:00
|
|
|
io->len += len;
|
|
|
|
return len;
|
|
|
|
}
|
|
|
|
|
2021-08-27 17:25:24 +08:00
|
|
|
size_t mg_iobuf_del(struct mg_iobuf *io, size_t ofs, size_t len) {
|
|
|
|
if (ofs > io->len) ofs = io->len;
|
|
|
|
if (ofs + len > io->len) len = io->len - ofs;
|
2022-03-14 21:26:00 +08:00
|
|
|
if (io->buf) memmove(io->buf + ofs, io->buf + ofs + len, io->len - ofs - len);
|
|
|
|
if (io->buf) zeromem(io->buf + io->len - len, len);
|
2020-12-05 19:26:32 +08:00
|
|
|
io->len -= len;
|
|
|
|
return len;
|
|
|
|
}
|
|
|
|
|
|
|
|
void mg_iobuf_free(struct mg_iobuf *io) {
|
2021-02-15 22:42:55 +08:00
|
|
|
mg_iobuf_resize(io, 0);
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
|
|
|
|
2022-06-09 19:39:48 +08:00
|
|
|
#ifdef MG_ENABLE_LINES
|
|
|
|
#line 1 "src/json.c"
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
2022-06-22 23:28:22 +08:00
|
|
|
|
2022-06-09 19:39:48 +08:00
|
|
|
static const char *escapeseq(int esc) {
|
|
|
|
return esc ? "\b\f\n\r\t\\\"" : "bfnrt\\\"";
|
|
|
|
}
|
|
|
|
|
|
|
|
static char json_esc(int c, int esc) {
|
|
|
|
const char *p, *esc1 = escapeseq(esc), *esc2 = escapeseq(!esc);
|
|
|
|
for (p = esc1; *p != '\0'; p++) {
|
|
|
|
if (*p == c) return esc2[p - esc1];
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int mg_pass_string(const char *s, int len) {
|
|
|
|
int i;
|
|
|
|
for (i = 0; i < len; i++) {
|
|
|
|
if (s[i] == '\\' && i + 1 < len && json_esc(s[i + 1], 1)) {
|
|
|
|
i++;
|
|
|
|
} else if (s[i] == '\0') {
|
|
|
|
return MG_JSON_INVALID;
|
|
|
|
} else if (s[i] == '"') {
|
|
|
|
return i;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return MG_JSON_INVALID;
|
|
|
|
}
|
|
|
|
|
|
|
|
int mg_json_get(const char *s, int len, const char *path, int *toklen) {
|
|
|
|
enum { S_VALUE, S_KEY, S_COLON, S_COMMA_OR_EOO } expecting = S_VALUE;
|
|
|
|
unsigned char nesting[MG_JSON_MAX_DEPTH];
|
|
|
|
int i, j = 0, depth = 0;
|
|
|
|
int pos = 1; // Current position in path
|
|
|
|
int ed = 0; // Expected depth
|
|
|
|
int ci = -1, ei = -1; // Current and expected index in array
|
|
|
|
|
|
|
|
if (path[0] != '$') return MG_JSON_INVALID;
|
|
|
|
|
|
|
|
#if 0
|
|
|
|
#define MG_DBGP(x) \
|
|
|
|
do { \
|
|
|
|
printf("%c %.*s j=%d i=%d pos=%d depth=%d ed=%d ci=%d ei=%d\n", x, len, s, \
|
|
|
|
j, i, pos, depth, ed, ci, ei); \
|
|
|
|
} while (0)
|
|
|
|
#else
|
|
|
|
#define MG_DBGP(x)
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#define MG_CHECKRET(x) \
|
|
|
|
do { \
|
|
|
|
MG_DBGP(x); \
|
|
|
|
if (depth == ed && path[pos] == '\0' && ci == ei) { \
|
|
|
|
if (toklen) *toklen = i - j + 1; \
|
|
|
|
return j; \
|
|
|
|
} \
|
|
|
|
} while (0)
|
|
|
|
|
|
|
|
// In the ascii table, the distance between `[` and `]` is 2.
|
|
|
|
// Ditto for `{` and `}`. Hence +2 in the code below.
|
|
|
|
#define MG_EOO(x) \
|
|
|
|
do { \
|
|
|
|
if (depth == ed && ci != ei) return MG_JSON_NOT_FOUND; \
|
|
|
|
if (c != nesting[depth - 1] + 2) return MG_JSON_INVALID; \
|
|
|
|
depth--; \
|
|
|
|
MG_CHECKRET(x); \
|
|
|
|
} while (0)
|
|
|
|
|
|
|
|
for (i = 0; i < len; i++) {
|
|
|
|
unsigned char c = ((unsigned char *) s)[i];
|
|
|
|
if (c == ' ' || c == '\t' || c == '\n' || c == '\r') continue;
|
|
|
|
MG_DBGP('-');
|
|
|
|
switch (expecting) {
|
|
|
|
case S_VALUE:
|
|
|
|
if (depth == ed) j = i;
|
|
|
|
if (c == '{') {
|
|
|
|
if (depth >= (int) sizeof(nesting)) return MG_JSON_TOO_DEEP;
|
|
|
|
if (depth == ed && path[pos] == '.') ed++, pos++;
|
|
|
|
nesting[depth++] = c;
|
|
|
|
expecting = S_KEY;
|
|
|
|
break;
|
|
|
|
} else if (c == '[') {
|
|
|
|
if (depth >= (int) sizeof(nesting)) return MG_JSON_TOO_DEEP;
|
|
|
|
if (depth == ed && path[pos] == '[' && ei == ci) {
|
|
|
|
ed++, pos++, ci = 0;
|
|
|
|
for (ei = 0; path[pos] != ']' && path[pos] != '\0'; pos++) {
|
|
|
|
ei *= 10;
|
|
|
|
ei += path[pos] - '0';
|
|
|
|
}
|
|
|
|
if (path[pos] != 0) pos++;
|
|
|
|
}
|
|
|
|
nesting[depth++] = c;
|
|
|
|
break;
|
|
|
|
} else if (c == ']' && depth > 0) { // Empty array
|
|
|
|
MG_EOO(']');
|
|
|
|
} else if (c == 't' && i + 3 < len && memcmp(&s[i], "true", 4) == 0) {
|
|
|
|
i += 3;
|
|
|
|
} else if (c == 'n' && i + 3 < len && memcmp(&s[i], "null", 4) == 0) {
|
|
|
|
i += 3;
|
|
|
|
} else if (c == 'f' && i + 4 < len && memcmp(&s[i], "false", 5) == 0) {
|
|
|
|
i += 4;
|
|
|
|
} else if (c == '-' || ((c >= '0' && c <= '9'))) {
|
|
|
|
int numlen = 0;
|
|
|
|
mg_atod(&s[i], len - i, &numlen);
|
|
|
|
i += numlen - 1;
|
|
|
|
} else if (c == '"') {
|
|
|
|
int n = mg_pass_string(&s[i + 1], len - i - 1);
|
|
|
|
if (n < 0) return n;
|
|
|
|
i += n + 1;
|
|
|
|
} else {
|
|
|
|
return MG_JSON_INVALID;
|
|
|
|
}
|
|
|
|
MG_CHECKRET('V');
|
|
|
|
if (depth == ed && ei >= 0) ci++;
|
|
|
|
expecting = S_COMMA_OR_EOO;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case S_KEY:
|
|
|
|
if (c == '"') {
|
|
|
|
int n = mg_pass_string(&s[i + 1], len - i - 1);
|
|
|
|
if (n < 0) return n;
|
|
|
|
// printf("K[%.*s] %d %d\n", n, &s[i + 1], depth, ed);
|
|
|
|
if (depth == ed && path[pos - 1] == '.' &&
|
|
|
|
memcmp(&s[i + 1], &path[pos], (size_t) n) == 0) {
|
|
|
|
pos += n;
|
|
|
|
}
|
|
|
|
i += n + 1;
|
|
|
|
expecting = S_COLON;
|
|
|
|
} else if (c == '}') { // Empty object
|
|
|
|
MG_EOO('}');
|
|
|
|
expecting = S_COMMA_OR_EOO;
|
|
|
|
} else {
|
|
|
|
return MG_JSON_INVALID;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case S_COLON:
|
|
|
|
if (c == ':') {
|
|
|
|
expecting = S_VALUE;
|
|
|
|
} else {
|
|
|
|
return MG_JSON_INVALID;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case S_COMMA_OR_EOO:
|
|
|
|
if (depth <= 0) {
|
|
|
|
return MG_JSON_INVALID;
|
|
|
|
} else if (c == ',') {
|
|
|
|
expecting = (nesting[depth - 1] == '{') ? S_KEY : S_VALUE;
|
|
|
|
// MG_CHECKRET('C');
|
|
|
|
} else if (c == ']' || c == '}') {
|
|
|
|
MG_EOO('O');
|
|
|
|
if (depth == ed && ei >= 0) ci++;
|
|
|
|
} else {
|
|
|
|
return MG_JSON_INVALID;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
MG_DBGP('E');
|
|
|
|
}
|
|
|
|
return MG_JSON_NOT_FOUND;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool mg_json_get_num(struct mg_str json, const char *path, double *v) {
|
|
|
|
int n, toklen, found = 0;
|
|
|
|
if ((n = mg_json_get(json.ptr, (int) json.len, path, &toklen)) >= 0 &&
|
|
|
|
(json.ptr[n] == '-' || (json.ptr[n] >= '0' && json.ptr[n] <= '9'))) {
|
|
|
|
if (v != NULL) *v = mg_atod(json.ptr + n, toklen, NULL);
|
|
|
|
found = 1;
|
|
|
|
}
|
|
|
|
return found;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool mg_json_get_bool(struct mg_str json, const char *path, bool *v) {
|
|
|
|
int n, toklen, found = 0;
|
|
|
|
if ((n = mg_json_get(json.ptr, (int) json.len, path, &toklen)) >= 0 &&
|
|
|
|
(json.ptr[n] == 't' || json.ptr[n] == 'f')) {
|
|
|
|
if (v != NULL) *v = json.ptr[n] == 't';
|
|
|
|
found = 1;
|
|
|
|
}
|
|
|
|
return found;
|
|
|
|
}
|
|
|
|
|
|
|
|
static bool json_unescape(const char *s, size_t len, char *to, size_t n) {
|
|
|
|
size_t i, j;
|
|
|
|
for (i = 0, j = 0; i < len && j < n; i++, j++) {
|
|
|
|
if (s[i] == '\\' && i + 5 < len && s[i + 1] == 'u') {
|
|
|
|
// \uXXXX escape. We could process a simple one-byte chars
|
|
|
|
// \u00xx from the ASCII range. More complex chars would require
|
|
|
|
// dragging in a UTF8 library, which is too much for us
|
|
|
|
if (s[i + 2] != '0' || s[i + 3] != '0') return false; // Give up
|
|
|
|
((unsigned char *) to)[j] = (unsigned char) mg_unhexn(s + i + 4, 2);
|
|
|
|
|
|
|
|
i += 5;
|
|
|
|
} else if (s[i] == '\\' && i + 1 < len) {
|
|
|
|
char c = json_esc(s[i + 1], 0);
|
|
|
|
if (c == 0) return false;
|
|
|
|
to[j] = c;
|
|
|
|
i++;
|
|
|
|
} else {
|
|
|
|
to[j] = s[i];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (j >= n) return false;
|
|
|
|
if (n > 0) to[j] = '\0';
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
char *mg_json_get_str(struct mg_str json, const char *path) {
|
|
|
|
int n, toklen;
|
|
|
|
char *result = NULL;
|
|
|
|
if ((n = mg_json_get(json.ptr, (int) json.len, path, &toklen)) >= 0 &&
|
|
|
|
json.ptr[n] == '"') {
|
|
|
|
if ((result = (char *) calloc(1, (size_t) toklen)) != NULL &&
|
|
|
|
!json_unescape(json.ptr + n + 1, (size_t) (toklen - 2), result,
|
|
|
|
(size_t) toklen)) {
|
|
|
|
free(result);
|
|
|
|
result = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2022-06-22 23:28:22 +08:00
|
|
|
char *mg_json_get_b64(struct mg_str json, const char *path, int *len) {
|
|
|
|
int n, toklen;
|
|
|
|
char *result = NULL;
|
|
|
|
if ((n = mg_json_get(json.ptr, (int) json.len, path, &toklen)) >= 0 &&
|
|
|
|
json.ptr[n] == '"' && toklen > 1 &&
|
|
|
|
(result = (char *) calloc(1, (size_t) toklen)) != NULL) {
|
|
|
|
int k = mg_base64_decode(json.ptr + n + 1, toklen - 2, result);
|
|
|
|
if (len != NULL) *len = k;
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
char *mg_json_get_hex(struct mg_str json, const char *path, int *len) {
|
|
|
|
int n, toklen;
|
|
|
|
char *result = NULL;
|
|
|
|
if ((n = mg_json_get(json.ptr, (int) json.len, path, &toklen)) >= 0 &&
|
|
|
|
json.ptr[n] == '"' && toklen > 1 &&
|
|
|
|
(result = (char *) calloc(1, (size_t) toklen / 2)) != NULL) {
|
|
|
|
mg_unhex(json.ptr + n + 1, (size_t) (toklen - 2), (uint8_t *) result);
|
|
|
|
result[(toklen - 2) / 2] = '\0';
|
|
|
|
if (len != NULL) *len = (toklen - 2) / 2;
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
#ifdef MG_ENABLE_LINES
|
|
|
|
#line 1 "src/log.c"
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-06-19 16:04:22 +08:00
|
|
|
static void default_logger(unsigned char c) {
|
|
|
|
putchar(c);
|
|
|
|
}
|
|
|
|
|
2022-05-20 16:45:17 +08:00
|
|
|
static const char *s_spec = "2";
|
2022-06-19 16:04:22 +08:00
|
|
|
static void (*s_log_func)(unsigned char) = default_logger;
|
|
|
|
|
2022-06-19 16:08:37 +08:00
|
|
|
void mg_log_set_fn(void (*fn)(unsigned char)) {
|
2022-06-19 16:04:22 +08:00
|
|
|
s_log_func = fn;
|
|
|
|
}
|
2022-05-20 16:45:17 +08:00
|
|
|
|
|
|
|
static void logc(unsigned char c) {
|
2022-06-19 16:04:22 +08:00
|
|
|
s_log_func(c);
|
2022-05-07 04:09:13 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static void logs(const char *buf, size_t len) {
|
|
|
|
size_t i;
|
2022-05-20 16:45:17 +08:00
|
|
|
for (i = 0; i < len; i++) logc(((unsigned char *) buf)[i]);
|
2022-05-07 04:09:13 +08:00
|
|
|
}
|
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
void mg_log_set(const char *spec) {
|
2022-02-13 02:17:25 +08:00
|
|
|
MG_DEBUG(("Setting log level to %s", spec));
|
2020-12-05 19:26:32 +08:00
|
|
|
s_spec = spec;
|
2015-12-16 08:52:37 +08:00
|
|
|
}
|
2017-09-13 00:08:43 +08:00
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
bool mg_log_prefix(int level, const char *file, int line, const char *fname) {
|
|
|
|
// static unsigned long seq;
|
2022-02-13 02:17:25 +08:00
|
|
|
int max = MG_LL_INFO;
|
2020-12-05 19:26:32 +08:00
|
|
|
struct mg_str k, v, s = mg_str(s_spec);
|
|
|
|
const char *p = strrchr(file, '/');
|
2021-05-29 01:30:42 +08:00
|
|
|
|
2021-04-14 04:02:05 +08:00
|
|
|
if (p == NULL) p = strrchr(file, '\\');
|
2020-12-05 19:26:32 +08:00
|
|
|
p = p == NULL ? file : p + 1;
|
2017-09-13 00:08:43 +08:00
|
|
|
|
2021-08-28 13:54:56 +08:00
|
|
|
while (mg_commalist(&s, &k, &v)) {
|
2020-12-05 19:26:32 +08:00
|
|
|
if (v.len == 0) max = atoi(k.ptr);
|
|
|
|
if (v.len > 0 && strncmp(p, k.ptr, k.len) == 0) max = atoi(v.ptr);
|
|
|
|
}
|
2017-09-13 00:08:43 +08:00
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
if (level <= max) {
|
2022-02-11 19:02:06 +08:00
|
|
|
char buf[41];
|
2022-02-10 19:56:55 +08:00
|
|
|
size_t n = mg_snprintf(buf, sizeof(buf), "%llx %d %s:%d:%s", mg_millis(),
|
|
|
|
level, p, line, fname);
|
|
|
|
if (n > sizeof(buf) - 2) n = sizeof(buf) - 2;
|
2022-02-11 19:02:06 +08:00
|
|
|
while (n < sizeof(buf)) buf[n++] = ' ';
|
2022-05-20 16:45:17 +08:00
|
|
|
logs(buf, n - 1);
|
2020-12-05 19:26:32 +08:00
|
|
|
return true;
|
|
|
|
} else {
|
|
|
|
return false;
|
2017-09-13 00:08:43 +08:00
|
|
|
}
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void mg_log(const char *fmt, ...) {
|
|
|
|
char mem[256], *buf = mem;
|
|
|
|
va_list ap;
|
2022-02-11 19:02:06 +08:00
|
|
|
size_t len;
|
2020-12-05 19:26:32 +08:00
|
|
|
va_start(ap, fmt);
|
|
|
|
len = mg_vasprintf(&buf, sizeof(mem), fmt, ap);
|
|
|
|
va_end(ap);
|
2022-05-20 16:45:17 +08:00
|
|
|
logs(buf, len);
|
|
|
|
logc((unsigned char) '\n');
|
2020-12-05 19:26:32 +08:00
|
|
|
if (buf != mem) free(buf);
|
|
|
|
}
|
2017-09-13 00:08:43 +08:00
|
|
|
|
2022-05-07 04:09:13 +08:00
|
|
|
static unsigned char nibble(unsigned c) {
|
|
|
|
return (unsigned char) (c < 10 ? c + '0' : c + 'W');
|
|
|
|
}
|
|
|
|
|
|
|
|
#define ISPRINT(x) ((x) >= ' ' && (x) <= '~')
|
|
|
|
void mg_hexdump(const void *buf, size_t len) {
|
|
|
|
const unsigned char *p = (const unsigned char *) buf;
|
|
|
|
unsigned char ascii[16], alen = 0;
|
|
|
|
size_t i;
|
|
|
|
for (i = 0; i < len; i++) {
|
|
|
|
if ((i % 16) == 0) {
|
|
|
|
// Print buffered ascii chars
|
|
|
|
if (i > 0) logs(" ", 2), logs((char *) ascii, 16), logc('\n'), alen = 0;
|
|
|
|
// Print hex address, then \t
|
|
|
|
logc(nibble((i >> 12) & 15)), logc(nibble((i >> 8) & 15)),
|
|
|
|
logc(nibble((i >> 4) & 15)), logc('0'), logs(" ", 3);
|
|
|
|
}
|
|
|
|
logc(nibble(p[i] >> 4)), logc(nibble(p[i] & 15)); // Two nibbles, e.g. c5
|
|
|
|
logc(' '); // Space after hex number
|
|
|
|
ascii[alen++] = ISPRINT(p[i]) ? p[i] : '.'; // Add to the ascii buf
|
|
|
|
}
|
|
|
|
while (alen < 16) logs(" ", 3), ascii[alen++] = ' ';
|
|
|
|
logs(" ", 2), logs((char *) ascii, 16), logc('\n');
|
|
|
|
}
|
2016-08-24 20:46:30 +08:00
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
#ifdef MG_ENABLE_LINES
|
|
|
|
#line 1 "src/md5.c"
|
|
|
|
#endif
|
|
|
|
#include <string.h>
|
|
|
|
|
2020-12-24 05:20:48 +08:00
|
|
|
|
2021-10-14 03:00:08 +08:00
|
|
|
#if defined(MG_ENABLE_MD5) && MG_ENABLE_MD5
|
2016-08-24 20:46:30 +08:00
|
|
|
#if !defined(BYTE_ORDER) && defined(__BYTE_ORDER)
|
|
|
|
#define BYTE_ORDER __BYTE_ORDER
|
|
|
|
#ifndef LITTLE_ENDIAN
|
|
|
|
#define LITTLE_ENDIAN __LITTLE_ENDIAN
|
|
|
|
#endif /* LITTLE_ENDIAN */
|
|
|
|
#ifndef BIG_ENDIAN
|
|
|
|
#define BIG_ENDIAN __LITTLE_ENDIAN
|
|
|
|
#endif /* BIG_ENDIAN */
|
|
|
|
#endif /* BYTE_ORDER */
|
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
static void mg_byte_reverse(unsigned char *buf, unsigned longs) {
|
2015-11-01 00:26:19 +08:00
|
|
|
/* Forrest: MD5 expect LITTLE_ENDIAN, swap if BIG_ENDIAN */
|
|
|
|
#if BYTE_ORDER == BIG_ENDIAN
|
|
|
|
do {
|
|
|
|
uint32_t t = (uint32_t)((unsigned) buf[3] << 8 | buf[2]) << 16 |
|
|
|
|
((unsigned) buf[1] << 8 | buf[0]);
|
|
|
|
*(uint32_t *) buf = t;
|
|
|
|
buf += 4;
|
|
|
|
} while (--longs);
|
|
|
|
#else
|
|
|
|
(void) buf;
|
|
|
|
(void) longs;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
#define F1(x, y, z) (z ^ (x & (y ^ z)))
|
|
|
|
#define F2(x, y, z) F1(z, x, y)
|
|
|
|
#define F3(x, y, z) (x ^ y ^ z)
|
|
|
|
#define F4(x, y, z) (y ^ (x | ~z))
|
|
|
|
|
|
|
|
#define MD5STEP(f, w, x, y, z, data, s) \
|
|
|
|
(w += f(x, y, z) + data, w = w << s | w >> (32 - s), w += x)
|
2015-09-08 19:49:03 +08:00
|
|
|
|
|
|
|
/*
|
2015-11-01 00:26:19 +08:00
|
|
|
* Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
|
|
|
|
* initialization constants.
|
2015-09-08 19:49:03 +08:00
|
|
|
*/
|
2020-12-05 19:26:32 +08:00
|
|
|
void mg_md5_init(mg_md5_ctx *ctx) {
|
2015-11-01 00:26:19 +08:00
|
|
|
ctx->buf[0] = 0x67452301;
|
|
|
|
ctx->buf[1] = 0xefcdab89;
|
|
|
|
ctx->buf[2] = 0x98badcfe;
|
|
|
|
ctx->buf[3] = 0x10325476;
|
2015-09-08 19:49:03 +08:00
|
|
|
|
2015-11-01 00:26:19 +08:00
|
|
|
ctx->bits[0] = 0;
|
|
|
|
ctx->bits[1] = 0;
|
|
|
|
}
|
2015-09-08 19:49:03 +08:00
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
static void mg_md5_transform(uint32_t buf[4], uint32_t const in[16]) {
|
2020-12-24 05:20:48 +08:00
|
|
|
uint32_t a, b, c, d;
|
2015-09-08 19:49:03 +08:00
|
|
|
|
2015-11-01 00:26:19 +08:00
|
|
|
a = buf[0];
|
|
|
|
b = buf[1];
|
|
|
|
c = buf[2];
|
|
|
|
d = buf[3];
|
2015-09-08 19:49:03 +08:00
|
|
|
|
2015-11-01 00:26:19 +08:00
|
|
|
MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7);
|
|
|
|
MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
|
|
|
|
MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17);
|
|
|
|
MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
|
|
|
|
MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
|
|
|
|
MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12);
|
|
|
|
MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17);
|
|
|
|
MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22);
|
|
|
|
MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7);
|
|
|
|
MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
|
|
|
|
MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
|
|
|
|
MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
|
|
|
|
MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7);
|
|
|
|
MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
|
|
|
|
MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
|
|
|
|
MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);
|
2015-09-08 19:49:03 +08:00
|
|
|
|
2015-11-01 00:26:19 +08:00
|
|
|
MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5);
|
|
|
|
MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9);
|
|
|
|
MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
|
|
|
|
MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
|
|
|
|
MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5);
|
|
|
|
MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9);
|
|
|
|
MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
|
|
|
|
MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
|
|
|
|
MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
|
|
|
|
MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9);
|
|
|
|
MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
|
|
|
|
MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20);
|
|
|
|
MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
|
|
|
|
MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
|
|
|
|
MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14);
|
|
|
|
MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
|
2015-09-08 19:49:03 +08:00
|
|
|
|
2015-11-01 00:26:19 +08:00
|
|
|
MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4);
|
|
|
|
MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11);
|
|
|
|
MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
|
|
|
|
MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
|
|
|
|
MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4);
|
|
|
|
MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
|
|
|
|
MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
|
|
|
|
MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
|
|
|
|
MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
|
|
|
|
MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
|
|
|
|
MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
|
|
|
|
MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23);
|
|
|
|
MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
|
|
|
|
MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
|
|
|
|
MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
|
|
|
|
MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
|
2015-09-08 19:49:03 +08:00
|
|
|
|
2015-11-01 00:26:19 +08:00
|
|
|
MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6);
|
|
|
|
MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10);
|
|
|
|
MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
|
|
|
|
MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21);
|
|
|
|
MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6);
|
|
|
|
MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
|
|
|
|
MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
|
|
|
|
MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21);
|
|
|
|
MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
|
|
|
|
MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
|
|
|
|
MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15);
|
|
|
|
MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
|
|
|
|
MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6);
|
|
|
|
MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
|
|
|
|
MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
|
|
|
|
MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21);
|
2015-09-08 19:49:03 +08:00
|
|
|
|
2015-11-01 00:26:19 +08:00
|
|
|
buf[0] += a;
|
|
|
|
buf[1] += b;
|
|
|
|
buf[2] += c;
|
|
|
|
buf[3] += d;
|
2015-09-08 19:49:03 +08:00
|
|
|
}
|
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
void mg_md5_update(mg_md5_ctx *ctx, const unsigned char *buf, size_t len) {
|
2015-11-01 00:26:19 +08:00
|
|
|
uint32_t t;
|
2015-09-08 19:49:03 +08:00
|
|
|
|
2015-11-01 00:26:19 +08:00
|
|
|
t = ctx->bits[0];
|
|
|
|
if ((ctx->bits[0] = t + ((uint32_t) len << 3)) < t) ctx->bits[1]++;
|
|
|
|
ctx->bits[1] += (uint32_t) len >> 29;
|
2015-09-08 19:49:03 +08:00
|
|
|
|
2015-11-01 00:26:19 +08:00
|
|
|
t = (t >> 3) & 0x3f;
|
2015-09-08 19:49:03 +08:00
|
|
|
|
2015-11-01 00:26:19 +08:00
|
|
|
if (t) {
|
|
|
|
unsigned char *p = (unsigned char *) ctx->in + t;
|
|
|
|
|
|
|
|
t = 64 - t;
|
|
|
|
if (len < t) {
|
|
|
|
memcpy(p, buf, len);
|
|
|
|
return;
|
2015-09-08 19:49:03 +08:00
|
|
|
}
|
2015-11-01 00:26:19 +08:00
|
|
|
memcpy(p, buf, t);
|
2020-12-05 19:26:32 +08:00
|
|
|
mg_byte_reverse(ctx->in, 16);
|
|
|
|
mg_md5_transform(ctx->buf, (uint32_t *) ctx->in);
|
2015-11-01 00:26:19 +08:00
|
|
|
buf += t;
|
|
|
|
len -= t;
|
2015-09-08 19:49:03 +08:00
|
|
|
}
|
|
|
|
|
2015-11-01 00:26:19 +08:00
|
|
|
while (len >= 64) {
|
|
|
|
memcpy(ctx->in, buf, 64);
|
2020-12-05 19:26:32 +08:00
|
|
|
mg_byte_reverse(ctx->in, 16);
|
|
|
|
mg_md5_transform(ctx->buf, (uint32_t *) ctx->in);
|
2015-11-01 00:26:19 +08:00
|
|
|
buf += 64;
|
|
|
|
len -= 64;
|
|
|
|
}
|
2015-09-08 19:49:03 +08:00
|
|
|
|
2015-11-01 00:26:19 +08:00
|
|
|
memcpy(ctx->in, buf, len);
|
|
|
|
}
|
2015-09-08 19:49:03 +08:00
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
void mg_md5_final(mg_md5_ctx *ctx, unsigned char digest[16]) {
|
2015-11-01 00:26:19 +08:00
|
|
|
unsigned count;
|
|
|
|
unsigned char *p;
|
|
|
|
uint32_t *a;
|
2015-09-08 19:49:03 +08:00
|
|
|
|
2015-11-01 00:26:19 +08:00
|
|
|
count = (ctx->bits[0] >> 3) & 0x3F;
|
2015-09-08 19:49:03 +08:00
|
|
|
|
2015-11-01 00:26:19 +08:00
|
|
|
p = ctx->in + count;
|
|
|
|
*p++ = 0x80;
|
|
|
|
count = 64 - 1 - count;
|
|
|
|
if (count < 8) {
|
|
|
|
memset(p, 0, count);
|
2020-12-05 19:26:32 +08:00
|
|
|
mg_byte_reverse(ctx->in, 16);
|
|
|
|
mg_md5_transform(ctx->buf, (uint32_t *) ctx->in);
|
2015-11-01 00:26:19 +08:00
|
|
|
memset(ctx->in, 0, 56);
|
|
|
|
} else {
|
|
|
|
memset(p, 0, count - 8);
|
|
|
|
}
|
2020-12-05 19:26:32 +08:00
|
|
|
mg_byte_reverse(ctx->in, 14);
|
2015-09-08 19:49:03 +08:00
|
|
|
|
2015-11-01 00:26:19 +08:00
|
|
|
a = (uint32_t *) ctx->in;
|
|
|
|
a[14] = ctx->bits[0];
|
|
|
|
a[15] = ctx->bits[1];
|
2015-09-08 19:49:03 +08:00
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
mg_md5_transform(ctx->buf, (uint32_t *) ctx->in);
|
|
|
|
mg_byte_reverse((unsigned char *) ctx->buf, 4);
|
2015-11-01 00:26:19 +08:00
|
|
|
memcpy(digest, ctx->buf, 16);
|
|
|
|
memset((char *) ctx, 0, sizeof(*ctx));
|
|
|
|
}
|
2020-12-05 19:26:32 +08:00
|
|
|
#endif
|
2015-09-08 19:49:03 +08:00
|
|
|
|
2022-05-19 04:19:21 +08:00
|
|
|
#ifdef MG_ENABLE_LINES
|
2022-06-12 00:29:45 +08:00
|
|
|
#line 1 "src/mqtt.c"
|
2022-05-19 04:19:21 +08:00
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
#define MQTT_CLEAN_SESSION 0x02
|
|
|
|
#define MQTT_HAS_WILL 0x04
|
|
|
|
#define MQTT_WILL_RETAIN 0x20
|
|
|
|
#define MQTT_HAS_PASSWORD 0x40
|
|
|
|
#define MQTT_HAS_USER_NAME 0x80
|
2022-05-19 04:19:21 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
enum { MQTT_OK, MQTT_INCOMPLETE, MQTT_MALFORMED };
|
2022-05-19 04:19:21 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
void mg_mqtt_send_header(struct mg_connection *c, uint8_t cmd, uint8_t flags,
|
|
|
|
uint32_t len) {
|
|
|
|
uint8_t buf[1 + sizeof(len)], *vlen = &buf[1];
|
|
|
|
buf[0] = (uint8_t) ((cmd << 4) | flags);
|
|
|
|
do {
|
|
|
|
*vlen = len % 0x80;
|
|
|
|
len /= 0x80;
|
|
|
|
if (len > 0) *vlen |= 0x80;
|
|
|
|
vlen++;
|
|
|
|
} while (len > 0 && vlen < &buf[sizeof(buf)]);
|
|
|
|
mg_send(c, buf, (size_t) (vlen - buf));
|
|
|
|
}
|
2022-05-19 04:19:21 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static void mg_send_u16(struct mg_connection *c, uint16_t value) {
|
|
|
|
mg_send(c, &value, sizeof(value));
|
|
|
|
}
|
2022-05-19 04:19:21 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
void mg_mqtt_login(struct mg_connection *c, const struct mg_mqtt_opts *opts) {
|
|
|
|
char rnd[9], client_id[16];
|
|
|
|
struct mg_str cid = opts->client_id;
|
|
|
|
uint32_t total_len = 7 + 1 + 2 + 2;
|
|
|
|
uint8_t connflag = (uint8_t) ((opts->will_qos & 3) << 3);
|
2022-05-19 04:19:21 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
if (cid.len == 0) {
|
|
|
|
mg_random(rnd, sizeof(rnd));
|
|
|
|
mg_base64_encode((unsigned char *) rnd, sizeof(rnd), client_id);
|
|
|
|
client_id[sizeof(client_id) - 1] = '\0';
|
|
|
|
cid = mg_str(client_id);
|
|
|
|
}
|
2022-05-19 04:19:21 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
if (opts->user.len > 0) {
|
|
|
|
total_len += 2 + (uint32_t) opts->user.len;
|
|
|
|
connflag |= MQTT_HAS_USER_NAME;
|
|
|
|
}
|
|
|
|
if (opts->pass.len > 0) {
|
|
|
|
total_len += 2 + (uint32_t) opts->pass.len;
|
|
|
|
connflag |= MQTT_HAS_PASSWORD;
|
|
|
|
}
|
|
|
|
if (opts->will_topic.len > 0 && opts->will_message.len > 0) {
|
|
|
|
total_len +=
|
|
|
|
4 + (uint32_t) opts->will_topic.len + (uint32_t) opts->will_message.len;
|
|
|
|
connflag |= MQTT_HAS_WILL;
|
|
|
|
}
|
|
|
|
if (opts->clean || cid.len == 0) connflag |= MQTT_CLEAN_SESSION;
|
|
|
|
if (opts->will_retain) connflag |= MQTT_WILL_RETAIN;
|
|
|
|
total_len += (uint32_t) cid.len;
|
2022-05-19 04:19:21 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
mg_mqtt_send_header(c, MQTT_CMD_CONNECT, 0, total_len);
|
|
|
|
mg_send(c, "\00\04MQTT\04", 7);
|
|
|
|
mg_send(c, &connflag, sizeof(connflag));
|
|
|
|
// keepalive == 0 means "do not disconnect us!"
|
|
|
|
mg_send_u16(c, mg_htons((uint16_t) opts->keepalive));
|
|
|
|
mg_send_u16(c, mg_htons((uint16_t) cid.len));
|
|
|
|
mg_send(c, cid.ptr, cid.len);
|
|
|
|
if (connflag & MQTT_HAS_WILL) {
|
|
|
|
mg_send_u16(c, mg_htons((uint16_t) opts->will_topic.len));
|
|
|
|
mg_send(c, opts->will_topic.ptr, opts->will_topic.len);
|
|
|
|
mg_send_u16(c, mg_htons((uint16_t) opts->will_message.len));
|
|
|
|
mg_send(c, opts->will_message.ptr, opts->will_message.len);
|
|
|
|
}
|
|
|
|
if (opts->user.len > 0) {
|
|
|
|
mg_send_u16(c, mg_htons((uint16_t) opts->user.len));
|
|
|
|
mg_send(c, opts->user.ptr, opts->user.len);
|
|
|
|
}
|
|
|
|
if (opts->pass.len > 0) {
|
|
|
|
mg_send_u16(c, mg_htons((uint16_t) opts->pass.len));
|
|
|
|
mg_send(c, opts->pass.ptr, opts->pass.len);
|
|
|
|
}
|
2022-05-19 04:19:21 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
void mg_mqtt_pub(struct mg_connection *c, struct mg_str topic,
|
|
|
|
struct mg_str data, int qos, bool retain) {
|
|
|
|
uint8_t flags = (uint8_t) (((qos & 3) << 1) | (retain ? 1 : 0));
|
|
|
|
uint32_t total_len = 2 + (uint32_t) topic.len + (uint32_t) data.len;
|
|
|
|
MG_DEBUG(("%lu [%.*s] -> [%.*s]", c->id, (int) topic.len, (char *) topic.ptr,
|
|
|
|
(int) data.len, (char *) data.ptr));
|
|
|
|
if (qos > 0) total_len += 2;
|
|
|
|
mg_mqtt_send_header(c, MQTT_CMD_PUBLISH, flags, total_len);
|
|
|
|
mg_send_u16(c, mg_htons((uint16_t) topic.len));
|
|
|
|
mg_send(c, topic.ptr, topic.len);
|
|
|
|
if (qos > 0) {
|
|
|
|
if (++c->mgr->mqtt_id == 0) ++c->mgr->mqtt_id;
|
|
|
|
mg_send_u16(c, mg_htons(c->mgr->mqtt_id));
|
|
|
|
}
|
|
|
|
mg_send(c, data.ptr, data.len);
|
2022-05-19 04:19:21 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
void mg_mqtt_sub(struct mg_connection *c, struct mg_str topic, int qos) {
|
|
|
|
uint8_t qos_ = qos & 3;
|
|
|
|
uint32_t total_len = 2 + (uint32_t) topic.len + 2 + 1;
|
|
|
|
mg_mqtt_send_header(c, MQTT_CMD_SUBSCRIBE, 2, total_len);
|
|
|
|
if (++c->mgr->mqtt_id == 0) ++c->mgr->mqtt_id;
|
|
|
|
mg_send_u16(c, mg_htons(c->mgr->mqtt_id));
|
|
|
|
mg_send_u16(c, mg_htons((uint16_t) topic.len));
|
|
|
|
mg_send(c, topic.ptr, topic.len);
|
|
|
|
mg_send(c, &qos_, sizeof(qos_));
|
2022-05-19 04:19:21 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
int mg_mqtt_parse(const uint8_t *buf, size_t len, struct mg_mqtt_message *m) {
|
|
|
|
uint8_t lc = 0, *p, *end;
|
|
|
|
uint32_t n = 0, len_len = 0;
|
2022-05-19 04:19:21 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
memset(m, 0, sizeof(*m));
|
|
|
|
m->dgram.ptr = (char *) buf;
|
|
|
|
if (len < 2) return MQTT_INCOMPLETE;
|
|
|
|
m->cmd = (uint8_t) (buf[0] >> 4);
|
|
|
|
m->qos = (buf[0] >> 1) & 3;
|
2022-05-19 04:19:21 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
n = len_len = 0;
|
|
|
|
p = (uint8_t *) buf + 1;
|
|
|
|
while ((size_t) (p - buf) < len) {
|
|
|
|
lc = *((uint8_t *) p++);
|
|
|
|
n += (uint32_t) ((lc & 0x7f) << 7 * len_len);
|
|
|
|
len_len++;
|
|
|
|
if (!(lc & 0x80)) break;
|
|
|
|
if (len_len >= 4) return MQTT_MALFORMED;
|
|
|
|
}
|
|
|
|
end = p + n;
|
|
|
|
if ((lc & 0x80) || (end > buf + len)) return MQTT_INCOMPLETE;
|
|
|
|
m->dgram.len = (size_t) (end - buf);
|
2022-05-19 04:19:21 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
switch (m->cmd) {
|
|
|
|
case MQTT_CMD_CONNACK:
|
|
|
|
if (end - p < 2) return MQTT_MALFORMED;
|
|
|
|
m->ack = p[1];
|
|
|
|
break;
|
|
|
|
case MQTT_CMD_PUBACK:
|
|
|
|
case MQTT_CMD_PUBREC:
|
|
|
|
case MQTT_CMD_PUBREL:
|
|
|
|
case MQTT_CMD_PUBCOMP:
|
|
|
|
case MQTT_CMD_SUBACK:
|
|
|
|
if (p + 2 > end) return MQTT_MALFORMED;
|
|
|
|
m->id = (uint16_t) ((((uint16_t) p[0]) << 8) | p[1]);
|
|
|
|
break;
|
|
|
|
case MQTT_CMD_SUBSCRIBE: {
|
|
|
|
if (p + 2 > end) return MQTT_MALFORMED;
|
|
|
|
m->id = (uint16_t) ((((uint16_t) p[0]) << 8) | p[1]);
|
|
|
|
p += 2;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case MQTT_CMD_PUBLISH: {
|
|
|
|
if (p + 2 > end) return MQTT_MALFORMED;
|
|
|
|
m->topic.len = (uint16_t) ((((uint16_t) p[0]) << 8) | p[1]);
|
|
|
|
m->topic.ptr = (char *) p + 2;
|
|
|
|
p += 2 + m->topic.len;
|
|
|
|
if (p > end) return MQTT_MALFORMED;
|
|
|
|
if (m->qos > 0) {
|
|
|
|
if (p + 2 > end) return MQTT_MALFORMED;
|
|
|
|
m->id = (uint16_t) ((((uint16_t) p[0]) << 8) | p[1]);
|
|
|
|
p += 2;
|
|
|
|
}
|
|
|
|
if (p > end) return MQTT_MALFORMED;
|
|
|
|
m->data.ptr = (char *) p;
|
|
|
|
m->data.len = (size_t) (end - p);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return MQTT_OK;
|
2022-05-19 04:19:21 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static size_t mg_mqtt_next_topic(struct mg_mqtt_message *msg,
|
|
|
|
struct mg_str *topic, uint8_t *qos,
|
|
|
|
size_t pos) {
|
|
|
|
unsigned char *buf = (unsigned char *) msg->dgram.ptr + pos;
|
|
|
|
size_t new_pos;
|
|
|
|
if (pos >= msg->dgram.len) return 0;
|
2022-05-19 04:19:21 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
topic->len = (size_t) (((unsigned) buf[0]) << 8 | buf[1]);
|
|
|
|
topic->ptr = (char *) buf + 2;
|
|
|
|
new_pos = pos + 2 + topic->len + (qos == NULL ? 0 : 1);
|
|
|
|
if ((size_t) new_pos > msg->dgram.len) return 0;
|
|
|
|
if (qos != NULL) *qos = buf[2 + topic->len];
|
|
|
|
return new_pos;
|
2022-05-19 04:19:21 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
size_t mg_mqtt_next_sub(struct mg_mqtt_message *msg, struct mg_str *topic,
|
|
|
|
uint8_t *qos, size_t pos) {
|
|
|
|
uint8_t tmp;
|
|
|
|
return mg_mqtt_next_topic(msg, topic, qos == NULL ? &tmp : qos, pos);
|
2022-05-19 04:19:21 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
size_t mg_mqtt_next_unsub(struct mg_mqtt_message *msg, struct mg_str *topic,
|
|
|
|
size_t pos) {
|
|
|
|
return mg_mqtt_next_topic(msg, topic, NULL, pos);
|
2022-05-19 04:19:21 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static void mqtt_cb(struct mg_connection *c, int ev, void *ev_data,
|
|
|
|
void *fn_data) {
|
|
|
|
if (ev == MG_EV_READ) {
|
|
|
|
for (;;) {
|
|
|
|
struct mg_mqtt_message mm;
|
|
|
|
int rc = mg_mqtt_parse(c->recv.buf, c->recv.len, &mm);
|
|
|
|
if (rc == MQTT_MALFORMED) {
|
|
|
|
MG_ERROR(("%lu MQTT malformed message", c->id));
|
|
|
|
c->is_closing = 1;
|
|
|
|
break;
|
|
|
|
} else if (rc == MQTT_OK) {
|
|
|
|
MG_VERBOSE(("%p MQTT CMD %d len %d [%.*s]", c->fd, mm.cmd,
|
|
|
|
(int) mm.dgram.len, (int) mm.data.len, mm.data.ptr));
|
|
|
|
switch (mm.cmd) {
|
|
|
|
case MQTT_CMD_CONNACK:
|
|
|
|
mg_call(c, MG_EV_MQTT_OPEN, &mm.ack);
|
|
|
|
if (mm.ack == 0) {
|
|
|
|
MG_DEBUG(("%lu Connected", c->id));
|
|
|
|
} else {
|
|
|
|
MG_ERROR(("%lu MQTT auth failed, code %d", c->id, mm.ack));
|
|
|
|
c->is_closing = 1;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case MQTT_CMD_PUBLISH: {
|
|
|
|
MG_DEBUG(("%lu [%.*s] -> [%.*s]", c->id, (int) mm.topic.len,
|
|
|
|
mm.topic.ptr, (int) mm.data.len, mm.data.ptr));
|
|
|
|
if (mm.qos > 0) {
|
|
|
|
uint16_t id = mg_htons(mm.id);
|
|
|
|
mg_mqtt_send_header(c, MQTT_CMD_PUBACK, 0, sizeof(id));
|
|
|
|
mg_send(c, &id, sizeof(id));
|
|
|
|
}
|
|
|
|
mg_call(c, MG_EV_MQTT_MSG, &mm);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
mg_call(c, MG_EV_MQTT_CMD, &mm);
|
|
|
|
mg_iobuf_del(&c->recv, 0, mm.dgram.len);
|
|
|
|
} else {
|
|
|
|
break;
|
|
|
|
}
|
2022-05-19 04:19:21 +08:00
|
|
|
}
|
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
(void) ev_data;
|
|
|
|
(void) fn_data;
|
2022-05-19 04:19:21 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
void mg_mqtt_ping(struct mg_connection *nc) {
|
|
|
|
mg_mqtt_send_header(nc, MQTT_CMD_PINGREQ, 0, 0);
|
2022-05-19 04:19:21 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
void mg_mqtt_pong(struct mg_connection *nc) {
|
|
|
|
mg_mqtt_send_header(nc, MQTT_CMD_PINGRESP, 0, 0);
|
2022-05-19 04:19:21 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
void mg_mqtt_disconnect(struct mg_connection *nc) {
|
|
|
|
mg_mqtt_send_header(nc, MQTT_CMD_DISCONNECT, 0, 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
struct mg_connection *mg_mqtt_connect(struct mg_mgr *mgr, const char *url,
|
|
|
|
const struct mg_mqtt_opts *opts,
|
|
|
|
mg_event_handler_t fn, void *fn_data) {
|
|
|
|
struct mg_connection *c = mg_connect(mgr, url, fn, fn_data);
|
|
|
|
if (c != NULL) {
|
|
|
|
struct mg_mqtt_opts empty;
|
|
|
|
memset(&empty, 0, sizeof(empty));
|
|
|
|
mg_mqtt_login(c, opts == NULL ? &empty : opts);
|
|
|
|
c->pfn = mqtt_cb;
|
2022-05-19 04:19:21 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
return c;
|
2022-05-19 04:19:21 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
struct mg_connection *mg_mqtt_listen(struct mg_mgr *mgr, const char *url,
|
|
|
|
mg_event_handler_t fn, void *fn_data) {
|
|
|
|
struct mg_connection *c = mg_listen(mgr, url, fn, fn_data);
|
|
|
|
if (c != NULL) c->pfn = mqtt_cb, c->pfn_data = mgr;
|
|
|
|
return c;
|
2022-05-19 04:19:21 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
#ifdef MG_ENABLE_LINES
|
|
|
|
#line 1 "src/net.c"
|
|
|
|
#endif
|
2022-05-19 04:19:21 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
size_t mg_vprintf(struct mg_connection *c, const char *fmt, va_list ap) {
|
|
|
|
char mem[256], *buf = mem;
|
|
|
|
size_t len = mg_vasprintf(&buf, sizeof(mem), fmt, ap);
|
|
|
|
len = mg_send(c, buf, len);
|
|
|
|
if (buf != mem) free(buf);
|
|
|
|
return len;
|
2022-05-19 04:19:21 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
size_t mg_printf(struct mg_connection *c, const char *fmt, ...) {
|
|
|
|
size_t len = 0;
|
|
|
|
va_list ap;
|
|
|
|
va_start(ap, fmt);
|
|
|
|
len = mg_vprintf(c, fmt, ap);
|
|
|
|
va_end(ap);
|
|
|
|
return len;
|
2022-05-19 04:19:21 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
char *mg_straddr(struct mg_addr *a, char *buf, size_t len) {
|
|
|
|
char tmp[30];
|
|
|
|
const char *fmt = a->is_ip6 ? "[%s]:%d" : "%s:%d";
|
|
|
|
mg_ntoa(a, tmp, sizeof(tmp));
|
|
|
|
mg_snprintf(buf, len, fmt, tmp, (int) mg_ntohs(a->port));
|
|
|
|
return buf;
|
2022-05-19 04:19:21 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
char *mg_ntoa(const struct mg_addr *addr, char *buf, size_t len) {
|
|
|
|
if (addr->is_ip6) {
|
|
|
|
uint16_t *p = (uint16_t *) addr->ip6;
|
|
|
|
mg_snprintf(buf, len, "%x:%x:%x:%x:%x:%x:%x:%x", mg_htons(p[0]),
|
|
|
|
mg_htons(p[1]), mg_htons(p[2]), mg_htons(p[3]), mg_htons(p[4]),
|
|
|
|
mg_htons(p[5]), mg_htons(p[6]), mg_htons(p[7]));
|
|
|
|
} else {
|
|
|
|
uint8_t p[4];
|
|
|
|
memcpy(p, &addr->ip, sizeof(p));
|
|
|
|
mg_snprintf(buf, len, "%d.%d.%d.%d", (int) p[0], (int) p[1], (int) p[2],
|
|
|
|
(int) p[3]);
|
2022-05-19 04:19:21 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
return buf;
|
2022-05-19 04:19:21 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static bool mg_atonl(struct mg_str str, struct mg_addr *addr) {
|
|
|
|
if (mg_vcasecmp(&str, "localhost") != 0) return false;
|
|
|
|
addr->ip = mg_htonl(0x7f000001);
|
|
|
|
addr->is_ip6 = false;
|
|
|
|
return true;
|
2022-05-19 04:19:21 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static bool mg_atone(struct mg_str str, struct mg_addr *addr) {
|
|
|
|
if (str.len > 0) return false;
|
|
|
|
addr->ip = 0;
|
|
|
|
addr->is_ip6 = false;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
static bool mg_aton4(struct mg_str str, struct mg_addr *addr) {
|
|
|
|
uint8_t data[4] = {0, 0, 0, 0};
|
|
|
|
size_t i, num_dots = 0;
|
|
|
|
for (i = 0; i < str.len; i++) {
|
|
|
|
if (str.ptr[i] >= '0' && str.ptr[i] <= '9') {
|
|
|
|
int octet = data[num_dots] * 10 + (str.ptr[i] - '0');
|
|
|
|
if (octet > 255) return false;
|
|
|
|
data[num_dots] = (uint8_t) octet;
|
|
|
|
} else if (str.ptr[i] == '.') {
|
|
|
|
if (num_dots >= 3 || i == 0 || str.ptr[i - 1] == '.') return false;
|
|
|
|
num_dots++;
|
|
|
|
} else {
|
|
|
|
return false;
|
2022-05-19 04:19:21 +08:00
|
|
|
}
|
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
if (num_dots != 3 || str.ptr[i - 1] == '.') return false;
|
|
|
|
memcpy(&addr->ip, data, sizeof(data));
|
|
|
|
addr->is_ip6 = false;
|
|
|
|
return true;
|
2022-05-19 04:19:21 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static bool mg_v4mapped(struct mg_str str, struct mg_addr *addr) {
|
|
|
|
int i;
|
|
|
|
if (str.len < 14) return false;
|
|
|
|
if (str.ptr[0] != ':' || str.ptr[1] != ':' || str.ptr[6] != ':') return false;
|
|
|
|
for (i = 2; i < 6; i++) {
|
|
|
|
if (str.ptr[i] != 'f' && str.ptr[i] != 'F') return false;
|
2022-05-19 04:19:21 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
if (!mg_aton4(mg_str_n(&str.ptr[7], str.len - 7), addr)) return false;
|
|
|
|
memset(addr->ip6, 0, sizeof(addr->ip6));
|
|
|
|
addr->ip6[10] = addr->ip6[11] = 255;
|
|
|
|
memcpy(&addr->ip6[12], &addr->ip, 4);
|
|
|
|
addr->is_ip6 = true;
|
|
|
|
return true;
|
2022-05-19 04:19:21 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static bool mg_aton6(struct mg_str str, struct mg_addr *addr) {
|
|
|
|
size_t i, j = 0, n = 0, dc = 42;
|
|
|
|
if (str.len > 2 && str.ptr[0] == '[') str.ptr++, str.len -= 2;
|
|
|
|
if (mg_v4mapped(str, addr)) return true;
|
|
|
|
for (i = 0; i < str.len; i++) {
|
|
|
|
if ((str.ptr[i] >= '0' && str.ptr[i] <= '9') ||
|
|
|
|
(str.ptr[i] >= 'a' && str.ptr[i] <= 'f') ||
|
|
|
|
(str.ptr[i] >= 'A' && str.ptr[i] <= 'F')) {
|
|
|
|
unsigned long val;
|
|
|
|
if (i > j + 3) return false;
|
|
|
|
// MG_DEBUG(("%zu %zu [%.*s]", i, j, (int) (i - j + 1), &str.ptr[j]));
|
|
|
|
val = mg_unhexn(&str.ptr[j], i - j + 1);
|
|
|
|
addr->ip6[n] = (uint8_t) ((val >> 8) & 255);
|
|
|
|
addr->ip6[n + 1] = (uint8_t) (val & 255);
|
|
|
|
} else if (str.ptr[i] == ':') {
|
|
|
|
j = i + 1;
|
|
|
|
if (i > 0 && str.ptr[i - 1] == ':') {
|
|
|
|
dc = n; // Double colon
|
|
|
|
if (i > 1 && str.ptr[i - 2] == ':') return false;
|
|
|
|
} else if (i > 0) {
|
|
|
|
n += 2;
|
|
|
|
}
|
|
|
|
if (n > 14) return false;
|
|
|
|
addr->ip6[n] = addr->ip6[n + 1] = 0; // For trailing ::
|
2022-05-19 04:19:21 +08:00
|
|
|
} else {
|
2022-06-12 00:29:45 +08:00
|
|
|
return false;
|
2022-05-19 04:19:21 +08:00
|
|
|
}
|
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
if (n < 14 && dc == 42) return false;
|
|
|
|
if (n < 14) {
|
|
|
|
memmove(&addr->ip6[dc + (14 - n)], &addr->ip6[dc], n - dc + 2);
|
|
|
|
memset(&addr->ip6[dc], 0, 14 - n);
|
|
|
|
}
|
|
|
|
addr->is_ip6 = true;
|
|
|
|
return true;
|
2022-05-19 04:19:21 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
bool mg_aton(struct mg_str str, struct mg_addr *addr) {
|
|
|
|
// MG_INFO(("[%.*s]", (int) str.len, str.ptr));
|
|
|
|
return mg_atone(str, addr) || mg_atonl(str, addr) || mg_aton4(str, addr) ||
|
|
|
|
mg_aton6(str, addr);
|
|
|
|
}
|
2022-05-19 04:19:21 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
struct mg_connection *mg_alloc_conn(struct mg_mgr *mgr) {
|
|
|
|
struct mg_connection *c =
|
|
|
|
(struct mg_connection *) calloc(1, sizeof(*c) + mgr->extraconnsize);
|
|
|
|
if (c != NULL) {
|
|
|
|
c->mgr = mgr;
|
|
|
|
c->id = ++mgr->nextid;
|
|
|
|
}
|
|
|
|
return c;
|
2022-05-19 04:19:21 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
void mg_close_conn(struct mg_connection *c) {
|
|
|
|
mg_resolve_cancel(c); // Close any pending DNS query
|
|
|
|
LIST_DELETE(struct mg_connection, &c->mgr->conns, c);
|
|
|
|
if (c == c->mgr->dns4.c) c->mgr->dns4.c = NULL;
|
|
|
|
if (c == c->mgr->dns6.c) c->mgr->dns6.c = NULL;
|
|
|
|
// Order of operations is important. `MG_EV_CLOSE` event must be fired
|
|
|
|
// before we deallocate received data, see #1331
|
|
|
|
mg_call(c, MG_EV_CLOSE, NULL);
|
|
|
|
MG_DEBUG(("%lu closed", c->id));
|
|
|
|
|
|
|
|
mg_tls_free(c);
|
|
|
|
mg_iobuf_free(&c->recv);
|
|
|
|
mg_iobuf_free(&c->send);
|
|
|
|
memset(c, 0, sizeof(*c));
|
|
|
|
free(c);
|
2022-05-19 04:19:21 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
struct mg_connection *mg_connect(struct mg_mgr *mgr, const char *url,
|
|
|
|
mg_event_handler_t fn, void *fn_data) {
|
|
|
|
struct mg_connection *c = NULL;
|
|
|
|
if (url == NULL || url[0] == '\0') {
|
|
|
|
MG_ERROR(("null url"));
|
|
|
|
} else if ((c = mg_alloc_conn(mgr)) == NULL) {
|
|
|
|
MG_ERROR(("OOM"));
|
|
|
|
} else {
|
|
|
|
LIST_ADD_HEAD(struct mg_connection, &mgr->conns, c);
|
|
|
|
c->is_udp = (strncmp(url, "udp:", 4) == 0);
|
|
|
|
c->fn = fn;
|
|
|
|
c->is_client = true;
|
|
|
|
c->fd = (void *) (size_t) -1; // Set to invalid socket
|
|
|
|
c->fn_data = fn_data;
|
|
|
|
MG_DEBUG(("%lu -1 %s", c->id, url));
|
|
|
|
mg_call(c, MG_EV_OPEN, NULL);
|
|
|
|
mg_resolve(c, url);
|
|
|
|
}
|
2022-05-19 04:19:21 +08:00
|
|
|
return c;
|
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
struct mg_connection *mg_listen(struct mg_mgr *mgr, const char *url,
|
|
|
|
mg_event_handler_t fn, void *fn_data) {
|
|
|
|
struct mg_connection *c = NULL;
|
|
|
|
if ((c = mg_alloc_conn(mgr)) == NULL) {
|
|
|
|
MG_ERROR(("OOM %s", url));
|
|
|
|
} else if (!mg_open_listener(c, url)) {
|
|
|
|
MG_ERROR(("Failed: %s, errno %d", url, errno));
|
|
|
|
free(c);
|
|
|
|
c = NULL;
|
2022-05-19 04:19:21 +08:00
|
|
|
} else {
|
2022-06-12 00:29:45 +08:00
|
|
|
c->is_listening = 1;
|
|
|
|
c->is_udp = strncmp(url, "udp:", 4) == 0;
|
|
|
|
LIST_ADD_HEAD(struct mg_connection, &mgr->conns, c);
|
|
|
|
c->fn = fn;
|
|
|
|
c->fn_data = fn_data;
|
|
|
|
mg_call(c, MG_EV_OPEN, NULL);
|
|
|
|
MG_DEBUG(("%lu %p %s", c->id, c->fd, url));
|
2022-05-19 04:19:21 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
return c;
|
2022-05-19 04:19:21 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
struct mg_connection *mg_wrapfd(struct mg_mgr *mgr, int fd,
|
|
|
|
mg_event_handler_t fn, void *fn_data) {
|
|
|
|
struct mg_connection *c = mg_alloc_conn(mgr);
|
2022-05-19 04:19:21 +08:00
|
|
|
if (c != NULL) {
|
2022-06-12 00:29:45 +08:00
|
|
|
c->fd = (void *) (size_t) fd;
|
|
|
|
c->fn = fn;
|
|
|
|
c->fn_data = fn_data;
|
|
|
|
mg_call(c, MG_EV_OPEN, NULL);
|
|
|
|
LIST_ADD_HEAD(struct mg_connection, &mgr->conns, c);
|
2022-05-19 04:19:21 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
return c;
|
2022-05-19 04:19:21 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
struct mg_timer *mg_timer_add(struct mg_mgr *mgr, uint64_t milliseconds,
|
|
|
|
unsigned flags, void (*fn)(void *), void *arg) {
|
|
|
|
struct mg_timer *t = (struct mg_timer *) calloc(1, sizeof(*t));
|
|
|
|
mg_timer_init(&mgr->timers, t, milliseconds, flags, fn, arg);
|
|
|
|
return t;
|
2022-05-19 04:19:21 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
void mg_mgr_free(struct mg_mgr *mgr) {
|
|
|
|
struct mg_connection *c;
|
|
|
|
struct mg_timer *tmp, *t = mgr->timers;
|
|
|
|
while (t != NULL) tmp = t->next, free(t), t = tmp;
|
|
|
|
mgr->timers = NULL; // Important. Next call to poll won't touch timers
|
|
|
|
for (c = mgr->conns; c != NULL; c = c->next) c->is_closing = 1;
|
|
|
|
mg_mgr_poll(mgr, 0);
|
|
|
|
#if MG_ARCH == MG_ARCH_FREERTOS_TCP
|
|
|
|
FreeRTOS_DeleteSocketSet(mgr->ss);
|
|
|
|
#endif
|
|
|
|
MG_DEBUG(("All connections closed"));
|
2022-05-19 04:19:21 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
void mg_mgr_init(struct mg_mgr *mgr) {
|
|
|
|
memset(mgr, 0, sizeof(*mgr));
|
|
|
|
#if MG_ARCH == MG_ARCH_WIN32 && MG_ENABLE_WINSOCK
|
|
|
|
// clang-format off
|
|
|
|
{ WSADATA data; WSAStartup(MAKEWORD(2, 2), &data); }
|
|
|
|
// clang-format on
|
|
|
|
#elif MG_ARCH == MG_ARCH_FREERTOS_TCP
|
|
|
|
mgr->ss = FreeRTOS_CreateSocketSet();
|
|
|
|
#elif defined(__unix) || defined(__unix__) || defined(__APPLE__)
|
|
|
|
// Ignore SIGPIPE signal, so if client cancels the request, it
|
|
|
|
// won't kill the whole process.
|
|
|
|
signal(SIGPIPE, SIG_IGN);
|
|
|
|
#endif
|
|
|
|
mgr->dnstimeout = 3000;
|
|
|
|
mgr->dns4.url = "udp://8.8.8.8:53";
|
|
|
|
mgr->dns6.url = "udp://[2001:4860:4860::8888]:53";
|
2022-05-19 04:19:21 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
#ifdef MG_ENABLE_LINES
|
|
|
|
#line 1 "src/sha1.c"
|
|
|
|
#endif
|
|
|
|
/* Copyright(c) By Steve Reid <steve@edmweb.com> */
|
|
|
|
/* 100% Public Domain */
|
2022-05-19 04:19:21 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
#include <string.h>
|
2022-05-19 04:19:21 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
/*
|
|
|
|
* clang with std=-c99 uses __LITTLE_ENDIAN, by default
|
|
|
|
* while for ex, RTOS gcc - LITTLE_ENDIAN, by default
|
|
|
|
* it depends on __USE_BSD, but let's have everything
|
|
|
|
*/
|
|
|
|
#if !defined(BYTE_ORDER) && defined(__BYTE_ORDER)
|
|
|
|
#define BYTE_ORDER __BYTE_ORDER
|
|
|
|
#ifndef LITTLE_ENDIAN
|
|
|
|
#define LITTLE_ENDIAN __LITTLE_ENDIAN
|
|
|
|
#endif /* LITTLE_ENDIAN */
|
|
|
|
#ifndef BIG_ENDIAN
|
|
|
|
#define BIG_ENDIAN __LITTLE_ENDIAN
|
|
|
|
#endif /* BIG_ENDIAN */
|
|
|
|
#endif /* BYTE_ORDER */
|
2022-05-19 04:19:21 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
union char64long16 {
|
|
|
|
unsigned char c[64];
|
|
|
|
uint32_t l[16];
|
|
|
|
};
|
2022-05-19 04:19:21 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
#define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
|
2022-05-19 04:19:21 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static uint32_t blk0(union char64long16 *block, int i) {
|
|
|
|
/* Forrest: SHA expect BIG_ENDIAN, swap if LITTLE_ENDIAN */
|
|
|
|
#if BYTE_ORDER == LITTLE_ENDIAN
|
|
|
|
block->l[i] =
|
|
|
|
(rol(block->l[i], 24) & 0xFF00FF00) | (rol(block->l[i], 8) & 0x00FF00FF);
|
|
|
|
#endif
|
|
|
|
return block->l[i];
|
2022-05-19 04:19:21 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
/* Avoid redefine warning (ARM /usr/include/sys/ucontext.h define R0~R4) */
|
|
|
|
#undef blk
|
|
|
|
#undef R0
|
|
|
|
#undef R1
|
|
|
|
#undef R2
|
|
|
|
#undef R3
|
|
|
|
#undef R4
|
2022-05-19 04:19:21 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
#define blk(i) \
|
|
|
|
(block->l[i & 15] = rol(block->l[(i + 13) & 15] ^ block->l[(i + 8) & 15] ^ \
|
|
|
|
block->l[(i + 2) & 15] ^ block->l[i & 15], \
|
|
|
|
1))
|
|
|
|
#define R0(v, w, x, y, z, i) \
|
|
|
|
z += ((w & (x ^ y)) ^ y) + blk0(block, i) + 0x5A827999 + rol(v, 5); \
|
|
|
|
w = rol(w, 30);
|
|
|
|
#define R1(v, w, x, y, z, i) \
|
|
|
|
z += ((w & (x ^ y)) ^ y) + blk(i) + 0x5A827999 + rol(v, 5); \
|
|
|
|
w = rol(w, 30);
|
|
|
|
#define R2(v, w, x, y, z, i) \
|
|
|
|
z += (w ^ x ^ y) + blk(i) + 0x6ED9EBA1 + rol(v, 5); \
|
|
|
|
w = rol(w, 30);
|
|
|
|
#define R3(v, w, x, y, z, i) \
|
|
|
|
z += (((w | x) & y) | (w & x)) + blk(i) + 0x8F1BBCDC + rol(v, 5); \
|
|
|
|
w = rol(w, 30);
|
|
|
|
#define R4(v, w, x, y, z, i) \
|
|
|
|
z += (w ^ x ^ y) + blk(i) + 0xCA62C1D6 + rol(v, 5); \
|
|
|
|
w = rol(w, 30);
|
2022-05-19 04:19:21 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static void mg_sha1_transform(uint32_t state[5],
|
|
|
|
const unsigned char buffer[64]) {
|
|
|
|
uint32_t a, b, c, d, e;
|
|
|
|
union char64long16 block[1];
|
|
|
|
|
|
|
|
memcpy(block, buffer, 64);
|
|
|
|
a = state[0];
|
|
|
|
b = state[1];
|
|
|
|
c = state[2];
|
|
|
|
d = state[3];
|
|
|
|
e = state[4];
|
|
|
|
R0(a, b, c, d, e, 0);
|
|
|
|
R0(e, a, b, c, d, 1);
|
|
|
|
R0(d, e, a, b, c, 2);
|
|
|
|
R0(c, d, e, a, b, 3);
|
|
|
|
R0(b, c, d, e, a, 4);
|
|
|
|
R0(a, b, c, d, e, 5);
|
|
|
|
R0(e, a, b, c, d, 6);
|
|
|
|
R0(d, e, a, b, c, 7);
|
|
|
|
R0(c, d, e, a, b, 8);
|
|
|
|
R0(b, c, d, e, a, 9);
|
|
|
|
R0(a, b, c, d, e, 10);
|
|
|
|
R0(e, a, b, c, d, 11);
|
|
|
|
R0(d, e, a, b, c, 12);
|
|
|
|
R0(c, d, e, a, b, 13);
|
|
|
|
R0(b, c, d, e, a, 14);
|
|
|
|
R0(a, b, c, d, e, 15);
|
|
|
|
R1(e, a, b, c, d, 16);
|
|
|
|
R1(d, e, a, b, c, 17);
|
|
|
|
R1(c, d, e, a, b, 18);
|
|
|
|
R1(b, c, d, e, a, 19);
|
|
|
|
R2(a, b, c, d, e, 20);
|
|
|
|
R2(e, a, b, c, d, 21);
|
|
|
|
R2(d, e, a, b, c, 22);
|
|
|
|
R2(c, d, e, a, b, 23);
|
|
|
|
R2(b, c, d, e, a, 24);
|
|
|
|
R2(a, b, c, d, e, 25);
|
|
|
|
R2(e, a, b, c, d, 26);
|
|
|
|
R2(d, e, a, b, c, 27);
|
|
|
|
R2(c, d, e, a, b, 28);
|
|
|
|
R2(b, c, d, e, a, 29);
|
|
|
|
R2(a, b, c, d, e, 30);
|
|
|
|
R2(e, a, b, c, d, 31);
|
|
|
|
R2(d, e, a, b, c, 32);
|
|
|
|
R2(c, d, e, a, b, 33);
|
|
|
|
R2(b, c, d, e, a, 34);
|
|
|
|
R2(a, b, c, d, e, 35);
|
|
|
|
R2(e, a, b, c, d, 36);
|
|
|
|
R2(d, e, a, b, c, 37);
|
|
|
|
R2(c, d, e, a, b, 38);
|
|
|
|
R2(b, c, d, e, a, 39);
|
|
|
|
R3(a, b, c, d, e, 40);
|
|
|
|
R3(e, a, b, c, d, 41);
|
|
|
|
R3(d, e, a, b, c, 42);
|
|
|
|
R3(c, d, e, a, b, 43);
|
|
|
|
R3(b, c, d, e, a, 44);
|
|
|
|
R3(a, b, c, d, e, 45);
|
|
|
|
R3(e, a, b, c, d, 46);
|
|
|
|
R3(d, e, a, b, c, 47);
|
|
|
|
R3(c, d, e, a, b, 48);
|
|
|
|
R3(b, c, d, e, a, 49);
|
|
|
|
R3(a, b, c, d, e, 50);
|
|
|
|
R3(e, a, b, c, d, 51);
|
|
|
|
R3(d, e, a, b, c, 52);
|
|
|
|
R3(c, d, e, a, b, 53);
|
|
|
|
R3(b, c, d, e, a, 54);
|
|
|
|
R3(a, b, c, d, e, 55);
|
|
|
|
R3(e, a, b, c, d, 56);
|
|
|
|
R3(d, e, a, b, c, 57);
|
|
|
|
R3(c, d, e, a, b, 58);
|
|
|
|
R3(b, c, d, e, a, 59);
|
|
|
|
R4(a, b, c, d, e, 60);
|
|
|
|
R4(e, a, b, c, d, 61);
|
|
|
|
R4(d, e, a, b, c, 62);
|
|
|
|
R4(c, d, e, a, b, 63);
|
|
|
|
R4(b, c, d, e, a, 64);
|
|
|
|
R4(a, b, c, d, e, 65);
|
|
|
|
R4(e, a, b, c, d, 66);
|
|
|
|
R4(d, e, a, b, c, 67);
|
|
|
|
R4(c, d, e, a, b, 68);
|
|
|
|
R4(b, c, d, e, a, 69);
|
|
|
|
R4(a, b, c, d, e, 70);
|
|
|
|
R4(e, a, b, c, d, 71);
|
|
|
|
R4(d, e, a, b, c, 72);
|
|
|
|
R4(c, d, e, a, b, 73);
|
|
|
|
R4(b, c, d, e, a, 74);
|
|
|
|
R4(a, b, c, d, e, 75);
|
|
|
|
R4(e, a, b, c, d, 76);
|
|
|
|
R4(d, e, a, b, c, 77);
|
|
|
|
R4(c, d, e, a, b, 78);
|
|
|
|
R4(b, c, d, e, a, 79);
|
|
|
|
state[0] += a;
|
|
|
|
state[1] += b;
|
|
|
|
state[2] += c;
|
|
|
|
state[3] += d;
|
|
|
|
state[4] += e;
|
|
|
|
/* Erase working structures. The order of operations is important,
|
|
|
|
* used to ensure that compiler doesn't optimize those out. */
|
|
|
|
memset(block, 0, sizeof(block));
|
|
|
|
a = b = c = d = e = 0;
|
|
|
|
(void) a;
|
|
|
|
(void) b;
|
|
|
|
(void) c;
|
|
|
|
(void) d;
|
|
|
|
(void) e;
|
2022-05-19 04:19:21 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
void mg_sha1_init(mg_sha1_ctx *context) {
|
|
|
|
context->state[0] = 0x67452301;
|
|
|
|
context->state[1] = 0xEFCDAB89;
|
|
|
|
context->state[2] = 0x98BADCFE;
|
|
|
|
context->state[3] = 0x10325476;
|
|
|
|
context->state[4] = 0xC3D2E1F0;
|
|
|
|
context->count[0] = context->count[1] = 0;
|
2022-05-19 04:19:21 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
void mg_sha1_update(mg_sha1_ctx *context, const unsigned char *data,
|
|
|
|
size_t len) {
|
|
|
|
size_t i, j;
|
|
|
|
|
|
|
|
j = context->count[0];
|
|
|
|
if ((context->count[0] += (uint32_t) len << 3) < j) context->count[1]++;
|
|
|
|
context->count[1] += (uint32_t) (len >> 29);
|
|
|
|
j = (j >> 3) & 63;
|
|
|
|
if ((j + len) > 63) {
|
|
|
|
memcpy(&context->buffer[j], data, (i = 64 - j));
|
|
|
|
mg_sha1_transform(context->state, context->buffer);
|
|
|
|
for (; i + 63 < len; i += 64) {
|
|
|
|
mg_sha1_transform(context->state, &data[i]);
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
j = 0;
|
|
|
|
} else
|
|
|
|
i = 0;
|
|
|
|
memcpy(&context->buffer[j], &data[i], len - i);
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
void mg_sha1_final(unsigned char digest[20], mg_sha1_ctx *context) {
|
|
|
|
unsigned i;
|
|
|
|
unsigned char finalcount[8], c;
|
|
|
|
|
|
|
|
for (i = 0; i < 8; i++) {
|
|
|
|
finalcount[i] = (unsigned char) ((context->count[(i >= 4 ? 0 : 1)] >>
|
|
|
|
((3 - (i & 3)) * 8)) &
|
|
|
|
255);
|
|
|
|
}
|
|
|
|
c = 0200;
|
|
|
|
mg_sha1_update(context, &c, 1);
|
|
|
|
while ((context->count[0] & 504) != 448) {
|
|
|
|
c = 0000;
|
|
|
|
mg_sha1_update(context, &c, 1);
|
|
|
|
}
|
|
|
|
mg_sha1_update(context, finalcount, 8);
|
|
|
|
for (i = 0; i < 20; i++) {
|
|
|
|
digest[i] =
|
|
|
|
(unsigned char) ((context->state[i >> 2] >> ((3 - (i & 3)) * 8)) & 255);
|
|
|
|
}
|
|
|
|
memset(context, '\0', sizeof(*context));
|
|
|
|
memset(&finalcount, '\0', sizeof(finalcount));
|
2021-03-07 20:21:59 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
#ifdef MG_ENABLE_LINES
|
|
|
|
#line 1 "src/sntp.c"
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#define SNTP_INTERVAL_SEC 3600
|
|
|
|
#define SNTP_TIME_OFFSET 2208988800UL
|
|
|
|
|
|
|
|
int64_t mg_sntp_parse(const unsigned char *buf, size_t len) {
|
|
|
|
int64_t res = -1;
|
|
|
|
int mode = len > 0 ? buf[0] & 7 : 0;
|
|
|
|
int version = len > 0 ? (buf[0] >> 3) & 7 : 0;
|
|
|
|
if (len < 48) {
|
|
|
|
MG_ERROR(("%s", "corrupt packet"));
|
|
|
|
} else if (mode != 4 && mode != 5) {
|
|
|
|
MG_ERROR(("%s", "not a server reply"));
|
|
|
|
} else if (buf[1] == 0) {
|
|
|
|
MG_ERROR(("%s", "server sent a kiss of death"));
|
|
|
|
} else if (version == 4 || version == 3) {
|
|
|
|
uint32_t *data = (uint32_t *) &buf[40];
|
|
|
|
unsigned long seconds = mg_ntohl(data[0]) - SNTP_TIME_OFFSET;
|
|
|
|
unsigned long useconds = mg_ntohl(data[1]);
|
|
|
|
res = ((int64_t) seconds) * 1000 + (int64_t) ((useconds / 1000) % 1000);
|
|
|
|
} else {
|
|
|
|
MG_ERROR(("unexpected version: %d", version));
|
|
|
|
}
|
|
|
|
return res;
|
2021-03-07 20:21:59 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static void sntp_cb(struct mg_connection *c, int ev, void *evd, void *fnd) {
|
|
|
|
if (ev == MG_EV_READ) {
|
|
|
|
int64_t milliseconds = mg_sntp_parse(c->recv.buf, c->recv.len);
|
|
|
|
if (milliseconds > 0) {
|
|
|
|
mg_call(c, MG_EV_SNTP_TIME, (uint64_t *) &milliseconds);
|
|
|
|
MG_VERBOSE(("%u.%u", (unsigned) (milliseconds / 1000),
|
|
|
|
(unsigned) (milliseconds % 1000)));
|
|
|
|
}
|
|
|
|
mg_iobuf_del(&c->recv, 0, c->recv.len); // Free receive buffer
|
|
|
|
} else if (ev == MG_EV_CONNECT) {
|
|
|
|
mg_sntp_request(c);
|
|
|
|
} else if (ev == MG_EV_CLOSE) {
|
|
|
|
}
|
|
|
|
(void) fnd;
|
|
|
|
(void) evd;
|
2021-03-07 20:21:59 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
void mg_sntp_request(struct mg_connection *c) {
|
|
|
|
if (c->is_resolving) {
|
|
|
|
MG_ERROR(("%lu wait until resolved", c->id));
|
|
|
|
} else {
|
|
|
|
uint8_t buf[48] = {0};
|
|
|
|
buf[0] = (0 << 6) | (4 << 3) | 3;
|
|
|
|
mg_send(c, buf, sizeof(buf));
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
struct mg_connection *mg_sntp_connect(struct mg_mgr *mgr, const char *url,
|
|
|
|
mg_event_handler_t fn, void *fnd) {
|
|
|
|
struct mg_connection *c = NULL;
|
|
|
|
if (url == NULL) url = "udp://time.google.com:123";
|
|
|
|
if ((c = mg_connect(mgr, url, fn, fnd)) != NULL) c->pfn = sntp_cb;
|
2020-12-16 04:29:47 +08:00
|
|
|
return c;
|
|
|
|
}
|
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
#ifdef MG_ENABLE_LINES
|
2022-06-12 00:29:45 +08:00
|
|
|
#line 1 "src/sock.c"
|
2020-12-05 19:26:32 +08:00
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-02-23 05:35:03 +08:00
|
|
|
|
2022-02-23 11:06:02 +08:00
|
|
|
|
2022-04-12 21:14:55 +08:00
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
|
|
|
|
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
#if MG_ENABLE_SOCKET
|
|
|
|
#if MG_ARCH == MG_ARCH_WIN32 && MG_ENABLE_WINSOCK
|
|
|
|
#define MG_SOCK_ERRNO WSAGetLastError()
|
|
|
|
#ifndef SO_EXCLUSIVEADDRUSE
|
|
|
|
#define SO_EXCLUSIVEADDRUSE ((int) (~SO_REUSEADDR))
|
|
|
|
#pragma comment(lib, "ws2_32.lib")
|
|
|
|
#endif
|
|
|
|
#elif MG_ARCH == MG_ARCH_FREERTOS_TCP
|
|
|
|
#define MG_SOCK_ERRNO errno
|
|
|
|
typedef Socket_t SOCKET;
|
|
|
|
#define INVALID_SOCKET FREERTOS_INVALID_SOCKET
|
|
|
|
#elif MG_ARCH == MG_ARCH_TIRTOS
|
|
|
|
#define MG_SOCK_ERRNO errno
|
|
|
|
#define closesocket(x) close(x)
|
|
|
|
#else
|
|
|
|
#define MG_SOCK_ERRNO errno
|
|
|
|
#ifndef closesocket
|
|
|
|
#define closesocket(x) close(x)
|
|
|
|
#endif
|
|
|
|
#define INVALID_SOCKET (-1)
|
|
|
|
typedef int SOCKET;
|
|
|
|
#endif
|
2020-12-21 00:55:33 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
#define FD(c_) ((SOCKET) (size_t) (c_)->fd)
|
|
|
|
#define S2PTR(s_) ((void *) (size_t) (s_))
|
2020-12-22 17:44:59 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
#ifndef MSG_NONBLOCKING
|
|
|
|
#define MSG_NONBLOCKING 0
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifndef AF_INET6
|
|
|
|
#define AF_INET6 10
|
|
|
|
#endif
|
|
|
|
|
|
|
|
union usa {
|
|
|
|
struct sockaddr sa;
|
|
|
|
struct sockaddr_in sin;
|
|
|
|
#if MG_ENABLE_IPV6
|
|
|
|
struct sockaddr_in6 sin6;
|
|
|
|
#endif
|
|
|
|
};
|
|
|
|
|
|
|
|
static socklen_t tousa(struct mg_addr *a, union usa *usa) {
|
|
|
|
socklen_t len = sizeof(usa->sin);
|
|
|
|
memset(usa, 0, sizeof(*usa));
|
|
|
|
usa->sin.sin_family = AF_INET;
|
|
|
|
usa->sin.sin_port = a->port;
|
|
|
|
*(uint32_t *) &usa->sin.sin_addr = a->ip;
|
|
|
|
#if MG_ENABLE_IPV6
|
|
|
|
if (a->is_ip6) {
|
|
|
|
usa->sin.sin_family = AF_INET6;
|
|
|
|
usa->sin6.sin6_port = a->port;
|
|
|
|
memcpy(&usa->sin6.sin6_addr, a->ip6, sizeof(a->ip6));
|
|
|
|
len = sizeof(usa->sin6);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
return len;
|
2021-11-29 21:57:33 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static void tomgaddr(union usa *usa, struct mg_addr *a, bool is_ip6) {
|
|
|
|
a->is_ip6 = is_ip6;
|
|
|
|
a->port = usa->sin.sin_port;
|
|
|
|
memcpy(&a->ip, &usa->sin.sin_addr, sizeof(a->ip));
|
|
|
|
#if MG_ENABLE_IPV6
|
|
|
|
if (is_ip6) {
|
|
|
|
memcpy(a->ip6, &usa->sin6.sin6_addr, sizeof(a->ip6));
|
|
|
|
a->port = usa->sin6.sin6_port;
|
2020-12-22 17:44:59 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
bool mg_sock_would_block(void);
|
|
|
|
bool mg_sock_would_block(void) {
|
|
|
|
int err = MG_SOCK_ERRNO;
|
|
|
|
return err == EINPROGRESS || err == EWOULDBLOCK
|
|
|
|
#ifndef WINCE
|
|
|
|
|| err == EAGAIN || err == EINTR
|
|
|
|
#endif
|
|
|
|
#if MG_ARCH == MG_ARCH_WIN32 && MG_ENABLE_WINSOCK
|
|
|
|
|| err == WSAEINTR || err == WSAEWOULDBLOCK
|
|
|
|
#endif
|
|
|
|
;
|
2020-12-22 17:44:59 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
bool mg_sock_conn_reset(void);
|
|
|
|
bool mg_sock_conn_reset(void) {
|
|
|
|
int err = MG_SOCK_ERRNO;
|
|
|
|
#if MG_ARCH == MG_ARCH_WIN32 && MG_ENABLE_WINSOCK
|
|
|
|
return err == WSAECONNRESET;
|
|
|
|
#else
|
|
|
|
return err == EPIPE || err == ECONNRESET;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
static void setlocaddr(SOCKET fd, struct mg_addr *addr) {
|
|
|
|
union usa usa;
|
|
|
|
socklen_t n = sizeof(usa);
|
|
|
|
if (getsockname(fd, &usa.sa, &n) == 0) {
|
|
|
|
tomgaddr(&usa, addr, n != sizeof(usa.sin));
|
2021-09-19 02:38:59 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static void iolog(struct mg_connection *c, char *buf, long n, bool r) {
|
|
|
|
if (n == 0) {
|
|
|
|
// Do nothing
|
|
|
|
} else if (n < 0) {
|
|
|
|
c->is_closing = 1; // Termination. Don't call mg_error(): #1529
|
|
|
|
} else if (n > 0) {
|
|
|
|
if (c->is_hexdumping) {
|
|
|
|
union usa usa;
|
|
|
|
char t1[50] = "", t2[50] = "";
|
|
|
|
socklen_t slen = sizeof(usa.sin);
|
|
|
|
struct mg_addr a;
|
|
|
|
memset(&usa, 0, sizeof(usa));
|
|
|
|
memset(&a, 0, sizeof(a));
|
|
|
|
if (getsockname(FD(c), &usa.sa, &slen) < 0) (void) 0; // Ignore result
|
|
|
|
tomgaddr(&usa, &a, c->rem.is_ip6);
|
|
|
|
MG_INFO(("\n-- %lu %s %s %s %s %ld", c->id,
|
|
|
|
mg_straddr(&a, t1, sizeof(t1)), r ? "<-" : "->",
|
|
|
|
mg_straddr(&c->rem, t2, sizeof(t2)), c->label, n));
|
|
|
|
|
|
|
|
mg_hexdump(buf, (size_t) n);
|
|
|
|
}
|
|
|
|
if (r) {
|
|
|
|
struct mg_str evd = mg_str_n(buf, (size_t) n);
|
|
|
|
c->recv.len += (size_t) n;
|
|
|
|
mg_call(c, MG_EV_READ, &evd);
|
2020-12-22 17:44:59 +08:00
|
|
|
} else {
|
2022-06-12 00:29:45 +08:00
|
|
|
mg_iobuf_del(&c->send, 0, (size_t) n);
|
|
|
|
// if (c->send.len == 0) mg_iobuf_resize(&c->send, 0);
|
|
|
|
mg_call(c, MG_EV_WRITE, &n);
|
2020-12-21 00:55:33 +08:00
|
|
|
}
|
|
|
|
}
|
2020-12-22 17:44:59 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static long mg_sock_send(struct mg_connection *c, const void *buf, size_t len) {
|
|
|
|
long n;
|
|
|
|
if (c->is_udp) {
|
|
|
|
union usa usa;
|
|
|
|
socklen_t slen = tousa(&c->rem, &usa);
|
|
|
|
n = sendto(FD(c), (char *) buf, len, 0, &usa.sa, slen);
|
|
|
|
if (n > 0) setlocaddr(FD(c), &c->loc);
|
|
|
|
} else {
|
|
|
|
n = send(FD(c), (char *) buf, len, MSG_NONBLOCKING);
|
|
|
|
#if MG_ARCH == MG_ARCH_RTX
|
|
|
|
if (n == BSD_EWOULDBLOCK) return 0;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
return n == 0 ? -1 : n < 0 && mg_sock_would_block() ? 0 : n;
|
2020-12-21 00:55:33 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
bool mg_send(struct mg_connection *c, const void *buf, size_t len) {
|
|
|
|
if (c->is_udp) {
|
|
|
|
long n = mg_sock_send(c, buf, len);
|
|
|
|
MG_DEBUG(("%lu %p %d:%d %ld err %d", c->id, c->fd, (int) c->send.len,
|
|
|
|
(int) c->recv.len, n, MG_SOCK_ERRNO));
|
|
|
|
iolog(c, (char *) buf, n, false);
|
|
|
|
return n > 0;
|
|
|
|
} else {
|
|
|
|
return mg_iobuf_add(&c->send, c->send.len, buf, len, MG_IO_SIZE);
|
2022-02-23 05:14:29 +08:00
|
|
|
}
|
|
|
|
}
|
2022-02-23 11:06:02 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static void mg_set_non_blocking_mode(SOCKET fd) {
|
|
|
|
#if defined(MG_CUSTOM_NONBLOCK)
|
|
|
|
MG_CUSTOM_NONBLOCK(fd);
|
|
|
|
#elif MG_ARCH == MG_ARCH_WIN32 && MG_ENABLE_WINSOCK
|
|
|
|
unsigned long on = 1;
|
|
|
|
ioctlsocket(fd, FIONBIO, &on);
|
|
|
|
#elif MG_ARCH == MG_ARCH_RTX
|
|
|
|
unsigned long on = 1;
|
|
|
|
ioctlsocket(fd, FIONBIO, &on);
|
|
|
|
#elif MG_ARCH == MG_ARCH_FREERTOS_TCP
|
|
|
|
const BaseType_t off = 0;
|
|
|
|
if (setsockopt(fd, 0, FREERTOS_SO_RCVTIMEO, &off, sizeof(off)) != 0) (void) 0;
|
|
|
|
if (setsockopt(fd, 0, FREERTOS_SO_SNDTIMEO, &off, sizeof(off)) != 0) (void) 0;
|
|
|
|
#elif MG_ARCH == MG_ARCH_FREERTOS_LWIP || MG_ARCH == MG_ARCH_RTX_LWIP
|
|
|
|
lwip_fcntl(fd, F_SETFL, O_NONBLOCK);
|
|
|
|
#elif MG_ARCH == MG_ARCH_AZURERTOS
|
|
|
|
fcntl(fd, F_SETFL, O_NONBLOCK);
|
|
|
|
#elif MG_ARCH == MG_ARCH_TIRTOS
|
|
|
|
int val = 0;
|
|
|
|
setsockopt(fd, 0, SO_BLOCKING, &val, sizeof(val));
|
|
|
|
int status = 0;
|
|
|
|
int res = SockStatus(fd, FDSTATUS_SEND, &status);
|
|
|
|
if (res == 0 && status > 0) {
|
|
|
|
val = status / 2;
|
|
|
|
int val_size = sizeof(val);
|
|
|
|
res = SockSet(fd, SOL_SOCKET, SO_SNDLOWAT, &val, val_size);
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
fcntl(fd, F_SETFL, fcntl(fd, F_GETFL, 0) | O_NONBLOCK); // Non-blocking mode
|
|
|
|
fcntl(fd, F_SETFD, FD_CLOEXEC); // Set close-on-exec
|
|
|
|
#endif
|
2022-02-23 11:06:02 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
bool mg_open_listener(struct mg_connection *c, const char *url) {
|
|
|
|
SOCKET fd = INVALID_SOCKET;
|
|
|
|
bool success = false;
|
|
|
|
c->loc.port = mg_htons(mg_url_port(url));
|
|
|
|
if (!mg_aton(mg_url_host(url), &c->loc)) {
|
|
|
|
MG_ERROR(("invalid listening URL: %s", url));
|
2022-02-23 05:27:08 +08:00
|
|
|
} else {
|
2022-06-12 00:29:45 +08:00
|
|
|
union usa usa;
|
|
|
|
socklen_t slen = tousa(&c->loc, &usa);
|
|
|
|
int on = 1, af = c->loc.is_ip6 ? AF_INET6 : AF_INET;
|
|
|
|
int type = strncmp(url, "udp:", 4) == 0 ? SOCK_DGRAM : SOCK_STREAM;
|
|
|
|
int proto = type == SOCK_DGRAM ? IPPROTO_UDP : IPPROTO_TCP;
|
|
|
|
(void) on;
|
|
|
|
|
|
|
|
if ((fd = socket(af, type, proto)) == INVALID_SOCKET) {
|
|
|
|
MG_ERROR(("socket: %d", MG_SOCK_ERRNO));
|
|
|
|
#if ((MG_ARCH == MG_ARCH_WIN32) || (MG_ARCH == MG_ARCH_UNIX) || \
|
|
|
|
(defined(LWIP_SOCKET) && SO_REUSE == 1))
|
|
|
|
} else if (setsockopt(fd, SOL_SOCKET, SO_REUSEADDR, (char *) &on,
|
|
|
|
sizeof(on)) != 0) {
|
|
|
|
// 1. SO_RESUSEADDR is not enabled on Windows because the semantics of
|
|
|
|
// SO_REUSEADDR on UNIX and Windows is different. On Windows,
|
|
|
|
// SO_REUSEADDR allows to bind a socket to a port without error even
|
|
|
|
// if the port is already open by another program. This is not the
|
|
|
|
// behavior SO_REUSEADDR was designed for, and leads to hard-to-track
|
|
|
|
// failure scenarios. Therefore, SO_REUSEADDR was disabled on Windows
|
|
|
|
// unless SO_EXCLUSIVEADDRUSE is supported and set on a socket.
|
|
|
|
// 2. In case of LWIP, SO_REUSEADDR should be explicitly enabled, by
|
|
|
|
// defining
|
|
|
|
// SO_REUSE (in lwipopts.h), otherwise the code below will compile
|
|
|
|
// but won't work! (setsockopt will return EINVAL)
|
|
|
|
MG_ERROR(("reuseaddr: %d", MG_SOCK_ERRNO));
|
|
|
|
#endif
|
|
|
|
#if MG_ARCH == MG_ARCH_WIN32 && !defined(SO_EXCLUSIVEADDRUSE) && !defined(WINCE)
|
|
|
|
} else if (setsockopt(fd, SOL_SOCKET, SO_EXCLUSIVEADDRUSE, (char *) &on,
|
|
|
|
sizeof(on)) != 0) {
|
|
|
|
// "Using SO_REUSEADDR and SO_EXCLUSIVEADDRUSE"
|
|
|
|
MG_ERROR(("exclusiveaddruse: %d", MG_SOCK_ERRNO));
|
|
|
|
#endif
|
|
|
|
} else if (bind(fd, &usa.sa, slen) != 0) {
|
|
|
|
MG_ERROR(("bind: %d", MG_SOCK_ERRNO));
|
|
|
|
} else if ((type == SOCK_STREAM &&
|
|
|
|
listen(fd, MG_SOCK_LISTEN_BACKLOG_SIZE) != 0)) {
|
|
|
|
// NOTE(lsm): FreeRTOS uses backlog value as a connection limit
|
|
|
|
// In case port was set to 0, get the real port number
|
|
|
|
MG_ERROR(("listen: %d", MG_SOCK_ERRNO));
|
|
|
|
} else {
|
|
|
|
setlocaddr(fd, &c->loc);
|
|
|
|
mg_set_non_blocking_mode(fd);
|
|
|
|
c->fd = S2PTR(fd);
|
|
|
|
success = true;
|
|
|
|
}
|
2022-02-23 05:27:08 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
if (success == false && fd != INVALID_SOCKET) closesocket(fd);
|
|
|
|
return success;
|
2022-02-23 05:27:08 +08:00
|
|
|
}
|
2022-02-23 05:14:29 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static long mg_sock_recv(struct mg_connection *c, void *buf, size_t len) {
|
|
|
|
long n = 0;
|
|
|
|
if (c->is_udp) {
|
|
|
|
union usa usa;
|
|
|
|
socklen_t slen = tousa(&c->rem, &usa);
|
|
|
|
n = recvfrom(FD(c), (char *) buf, len, 0, &usa.sa, &slen);
|
|
|
|
if (n > 0) tomgaddr(&usa, &c->rem, slen != sizeof(usa.sin));
|
2022-02-23 11:06:02 +08:00
|
|
|
} else {
|
2022-06-12 00:29:45 +08:00
|
|
|
n = recv(FD(c), (char *) buf, len, MSG_NONBLOCKING);
|
2022-02-23 11:06:02 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
return n == 0 ? -1 : n < 0 && mg_sock_would_block() ? 0 : n;
|
2022-02-23 11:06:02 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
// NOTE(lsm): do only one iteration of reads, cause some systems
|
|
|
|
// (e.g. FreeRTOS stack) return 0 instead of -1/EWOULDBLOCK when no data
|
|
|
|
static void read_conn(struct mg_connection *c) {
|
|
|
|
long n = -1;
|
|
|
|
if (c->recv.len >= MG_MAX_RECV_SIZE) {
|
|
|
|
mg_error(c, "max_recv_buf_size reached");
|
|
|
|
} else if (c->recv.size <= c->recv.len &&
|
|
|
|
!mg_iobuf_resize(&c->recv, c->recv.size + MG_IO_SIZE)) {
|
|
|
|
mg_error(c, "oom");
|
|
|
|
} else {
|
|
|
|
char *buf = (char *) &c->recv.buf[c->recv.len];
|
|
|
|
size_t len = c->recv.size - c->recv.len;
|
|
|
|
n = c->is_tls ? mg_tls_recv(c, buf, len) : mg_sock_recv(c, buf, len);
|
|
|
|
MG_DEBUG(("%lu %p %d:%d %ld err %d", c->id, c->fd, (int) c->send.len,
|
|
|
|
(int) c->recv.len, n, MG_SOCK_ERRNO));
|
|
|
|
iolog(c, buf, n, true);
|
2022-04-22 21:42:07 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static void write_conn(struct mg_connection *c) {
|
|
|
|
char *buf = (char *) c->send.buf;
|
|
|
|
size_t len = c->send.len;
|
|
|
|
long n = c->is_tls ? mg_tls_send(c, buf, len) : mg_sock_send(c, buf, len);
|
|
|
|
MG_DEBUG(("%lu %p %d:%d %ld err %d", c->id, c->fd, (int) c->send.len,
|
|
|
|
(int) c->recv.len, n, MG_SOCK_ERRNO));
|
|
|
|
iolog(c, buf, n, false);
|
2022-04-12 21:14:55 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static void close_conn(struct mg_connection *c) {
|
|
|
|
if (FD(c) != INVALID_SOCKET) {
|
|
|
|
closesocket(FD(c));
|
2021-05-18 00:36:57 +08:00
|
|
|
#if MG_ARCH == MG_ARCH_FREERTOS_TCP
|
2022-06-12 00:29:45 +08:00
|
|
|
FreeRTOS_FD_CLR(c->fd, c->mgr->ss, eSELECT_ALL);
|
2020-12-21 20:26:44 +08:00
|
|
|
#endif
|
2022-06-12 00:29:45 +08:00
|
|
|
c->fd = NULL;
|
|
|
|
}
|
|
|
|
mg_close_conn(c);
|
2020-12-21 20:26:44 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static void setsockopts(struct mg_connection *c) {
|
|
|
|
#if MG_ARCH == MG_ARCH_FREERTOS_TCP || MG_ARCH == MG_ARCH_AZURERTOS || \
|
|
|
|
MG_ARCH == MG_ARCH_TIRTOS
|
|
|
|
(void) c;
|
|
|
|
#else
|
|
|
|
int on = 1;
|
|
|
|
#if !defined(SOL_TCP)
|
|
|
|
#define SOL_TCP IPPROTO_TCP
|
|
|
|
#endif
|
|
|
|
if (setsockopt(FD(c), SOL_TCP, TCP_NODELAY, (char *) &on, sizeof(on)) != 0)
|
|
|
|
(void) 0;
|
|
|
|
if (setsockopt(FD(c), SOL_SOCKET, SO_KEEPALIVE, (char *) &on, sizeof(on)) !=
|
|
|
|
0)
|
|
|
|
(void) 0;
|
2020-12-21 20:26:44 +08:00
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
void mg_connect_resolved(struct mg_connection *c) {
|
|
|
|
// char buf[40];
|
|
|
|
int type = c->is_udp ? SOCK_DGRAM : SOCK_STREAM;
|
|
|
|
int rc, af = c->rem.is_ip6 ? AF_INET6 : AF_INET;
|
|
|
|
// mg_straddr(&c->rem, buf, sizeof(buf));
|
|
|
|
c->fd = S2PTR(socket(af, type, 0));
|
|
|
|
c->is_resolving = 0;
|
|
|
|
if (FD(c) == INVALID_SOCKET) {
|
|
|
|
mg_error(c, "socket(): %d", MG_SOCK_ERRNO);
|
|
|
|
} else if (c->is_udp) {
|
|
|
|
mg_call(c, MG_EV_RESOLVE, NULL);
|
|
|
|
mg_call(c, MG_EV_CONNECT, NULL);
|
|
|
|
} else {
|
|
|
|
union usa usa;
|
|
|
|
socklen_t slen = tousa(&c->rem, &usa);
|
|
|
|
mg_set_non_blocking_mode(FD(c));
|
|
|
|
setsockopts(c);
|
|
|
|
mg_call(c, MG_EV_RESOLVE, NULL);
|
|
|
|
if ((rc = connect(FD(c), &usa.sa, slen)) == 0) {
|
|
|
|
mg_call(c, MG_EV_CONNECT, NULL);
|
|
|
|
} else if (mg_sock_would_block()) {
|
|
|
|
MG_DEBUG(("%lu %p connect in progress...", c->id, c->fd));
|
|
|
|
c->is_connecting = 1;
|
|
|
|
} else {
|
|
|
|
mg_error(c, "connect: %d", MG_SOCK_ERRNO);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2020-12-05 19:26:32 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static SOCKET raccept(SOCKET sock, union usa *usa, socklen_t len) {
|
|
|
|
SOCKET s = INVALID_SOCKET;
|
|
|
|
do {
|
|
|
|
memset(usa, 0, sizeof(*usa));
|
|
|
|
s = accept(sock, &usa->sa, &len);
|
|
|
|
} while (s == INVALID_SOCKET && errno == EINTR);
|
|
|
|
return s;
|
|
|
|
}
|
2020-12-05 19:26:32 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static void accept_conn(struct mg_mgr *mgr, struct mg_connection *lsn) {
|
|
|
|
struct mg_connection *c = NULL;
|
|
|
|
union usa usa;
|
|
|
|
socklen_t sa_len = sizeof(usa);
|
|
|
|
SOCKET fd = raccept(FD(lsn), &usa, sa_len);
|
|
|
|
if (fd == INVALID_SOCKET) {
|
|
|
|
#if MG_ARCH == MG_ARCH_AZURERTOS
|
|
|
|
// AzureRTOS, in non-block socket mode can mark listening socket readable
|
|
|
|
// even it is not. See comment for 'select' func implementation in
|
|
|
|
// nx_bsd.c That's not an error, just should try later
|
|
|
|
if (MG_SOCK_ERRNO != EAGAIN)
|
|
|
|
#endif
|
|
|
|
MG_ERROR(("%lu accept failed, errno %d", lsn->id, MG_SOCK_ERRNO));
|
|
|
|
#if (MG_ARCH != MG_ARCH_WIN32) && (MG_ARCH != MG_ARCH_FREERTOS_TCP) && \
|
|
|
|
(MG_ARCH != MG_ARCH_TIRTOS) && !(MG_ENABLE_POLL)
|
|
|
|
} else if ((long) fd >= FD_SETSIZE) {
|
|
|
|
MG_ERROR(("%ld > %ld", (long) fd, (long) FD_SETSIZE));
|
|
|
|
closesocket(fd);
|
|
|
|
#endif
|
|
|
|
} else if ((c = mg_alloc_conn(mgr)) == NULL) {
|
|
|
|
MG_ERROR(("%lu OOM", lsn->id));
|
|
|
|
closesocket(fd);
|
|
|
|
} else {
|
|
|
|
char buf[40];
|
|
|
|
tomgaddr(&usa, &c->rem, sa_len != sizeof(usa.sin));
|
|
|
|
mg_straddr(&c->rem, buf, sizeof(buf));
|
|
|
|
MG_DEBUG(("%lu accepted %s", c->id, buf));
|
|
|
|
LIST_ADD_HEAD(struct mg_connection, &mgr->conns, c);
|
|
|
|
c->fd = S2PTR(fd);
|
|
|
|
mg_set_non_blocking_mode(FD(c));
|
|
|
|
setsockopts(c);
|
|
|
|
c->is_accepted = 1;
|
|
|
|
c->is_hexdumping = lsn->is_hexdumping;
|
|
|
|
c->loc = lsn->loc;
|
|
|
|
c->pfn = lsn->pfn;
|
|
|
|
c->pfn_data = lsn->pfn_data;
|
|
|
|
c->fn = lsn->fn;
|
|
|
|
c->fn_data = lsn->fn_data;
|
|
|
|
mg_call(c, MG_EV_OPEN, NULL);
|
|
|
|
mg_call(c, MG_EV_ACCEPT, NULL);
|
|
|
|
}
|
|
|
|
}
|
2020-12-05 19:26:32 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static bool mg_socketpair(SOCKET sp[2], union usa usa[2], bool udp) {
|
|
|
|
SOCKET sock;
|
|
|
|
socklen_t n = sizeof(usa[0].sin);
|
|
|
|
bool success = false;
|
2015-11-01 00:26:19 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
sock = sp[0] = sp[1] = INVALID_SOCKET;
|
|
|
|
(void) memset(&usa[0], 0, sizeof(usa[0]));
|
|
|
|
usa[0].sin.sin_family = AF_INET;
|
|
|
|
*(uint32_t *) &usa->sin.sin_addr = mg_htonl(0x7f000001U); // 127.0.0.1
|
|
|
|
usa[1] = usa[0];
|
2015-11-01 00:26:19 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
if (udp && (sp[0] = socket(AF_INET, SOCK_DGRAM, 0)) != INVALID_SOCKET &&
|
|
|
|
(sp[1] = socket(AF_INET, SOCK_DGRAM, 0)) != INVALID_SOCKET &&
|
|
|
|
bind(sp[0], &usa[0].sa, n) == 0 && bind(sp[1], &usa[1].sa, n) == 0 &&
|
|
|
|
getsockname(sp[0], &usa[0].sa, &n) == 0 &&
|
|
|
|
getsockname(sp[1], &usa[1].sa, &n) == 0 &&
|
|
|
|
connect(sp[0], &usa[1].sa, n) == 0 &&
|
|
|
|
connect(sp[1], &usa[0].sa, n) == 0) {
|
|
|
|
success = true;
|
|
|
|
} else if (!udp &&
|
|
|
|
(sock = socket(AF_INET, SOCK_STREAM, 0)) != INVALID_SOCKET &&
|
|
|
|
bind(sock, &usa[0].sa, n) == 0 &&
|
|
|
|
listen(sock, MG_SOCK_LISTEN_BACKLOG_SIZE) == 0 &&
|
|
|
|
getsockname(sock, &usa[0].sa, &n) == 0 &&
|
|
|
|
(sp[0] = socket(AF_INET, SOCK_STREAM, 0)) != INVALID_SOCKET &&
|
|
|
|
connect(sp[0], &usa[0].sa, n) == 0 &&
|
|
|
|
(sp[1] = raccept(sock, &usa[1], n)) != INVALID_SOCKET) {
|
|
|
|
success = true;
|
|
|
|
}
|
|
|
|
if (success) {
|
|
|
|
mg_set_non_blocking_mode(sp[1]);
|
|
|
|
} else {
|
|
|
|
if (sp[0] != INVALID_SOCKET) closesocket(sp[0]);
|
|
|
|
if (sp[1] != INVALID_SOCKET) closesocket(sp[1]);
|
|
|
|
sp[0] = sp[1] = INVALID_SOCKET;
|
|
|
|
}
|
|
|
|
if (sock != INVALID_SOCKET) closesocket(sock);
|
|
|
|
return success;
|
|
|
|
}
|
|
|
|
|
|
|
|
int mg_mkpipe(struct mg_mgr *mgr, mg_event_handler_t fn, void *fn_data,
|
|
|
|
bool udp) {
|
|
|
|
union usa usa[2];
|
|
|
|
SOCKET sp[2] = {INVALID_SOCKET, INVALID_SOCKET};
|
|
|
|
struct mg_connection *c = NULL;
|
|
|
|
if (!mg_socketpair(sp, usa, udp)) {
|
|
|
|
MG_ERROR(("Cannot create socket pair"));
|
|
|
|
} else if ((c = mg_wrapfd(mgr, (int) sp[1], fn, fn_data)) == NULL) {
|
|
|
|
closesocket(sp[0]);
|
|
|
|
closesocket(sp[1]);
|
|
|
|
sp[0] = sp[1] = INVALID_SOCKET;
|
|
|
|
} else {
|
|
|
|
tomgaddr(&usa[0], &c->rem, false);
|
|
|
|
MG_DEBUG(("%lu %p pipe %lu", c->id, c->fd, (unsigned long) sp[0]));
|
|
|
|
}
|
|
|
|
return (int) sp[0];
|
2015-09-08 19:49:03 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static bool can_read(const struct mg_connection *c) {
|
|
|
|
return c->is_full == false;
|
|
|
|
}
|
2015-11-01 00:26:19 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static bool can_write(const struct mg_connection *c) {
|
|
|
|
return c->is_connecting || (c->send.len > 0 && c->is_tls_hs == 0);
|
2015-09-08 19:49:03 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static bool skip_iotest(const struct mg_connection *c) {
|
|
|
|
return (c->is_closing || c->is_resolving || FD(c) == INVALID_SOCKET) ||
|
|
|
|
(can_read(c) == false && can_write(c) == false);
|
2015-09-08 19:49:03 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static void mg_iotest(struct mg_mgr *mgr, int ms) {
|
|
|
|
#if MG_ARCH == MG_ARCH_FREERTOS_TCP
|
|
|
|
struct mg_connection *c;
|
|
|
|
for (c = mgr->conns; c != NULL; c = c->next) {
|
|
|
|
c->is_readable = c->is_writable = 0;
|
|
|
|
if (skip_iotest(c)) continue;
|
|
|
|
if (can_read(c))
|
|
|
|
FreeRTOS_FD_SET(c->fd, mgr->ss, eSELECT_READ | eSELECT_EXCEPT);
|
|
|
|
if (can_write(c)) FreeRTOS_FD_SET(c->fd, mgr->ss, eSELECT_WRITE);
|
|
|
|
}
|
|
|
|
FreeRTOS_select(mgr->ss, pdMS_TO_TICKS(ms));
|
|
|
|
for (c = mgr->conns; c != NULL; c = c->next) {
|
|
|
|
EventBits_t bits = FreeRTOS_FD_ISSET(c->fd, mgr->ss);
|
|
|
|
c->is_readable = bits & (eSELECT_READ | eSELECT_EXCEPT) ? 1 : 0;
|
|
|
|
c->is_writable = bits & eSELECT_WRITE ? 1 : 0;
|
|
|
|
FreeRTOS_FD_CLR(c->fd, mgr->ss,
|
|
|
|
eSELECT_READ | eSELECT_EXCEPT | eSELECT_WRITE);
|
|
|
|
}
|
|
|
|
#elif MG_ENABLE_POLL
|
|
|
|
nfds_t n = 0;
|
|
|
|
for (struct mg_connection *c = mgr->conns; c != NULL; c = c->next) n++;
|
|
|
|
struct pollfd fds[n == 0 ? 1 : n]; // Avoid zero-length VLA
|
2015-09-08 19:49:03 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
memset(fds, 0, sizeof(fds));
|
|
|
|
n = 0;
|
|
|
|
for (struct mg_connection *c = mgr->conns; c != NULL; c = c->next) {
|
|
|
|
c->is_readable = c->is_writable = 0;
|
|
|
|
if (skip_iotest(c)) {
|
|
|
|
// Socket not valid, ignore
|
|
|
|
} else {
|
|
|
|
fds[n].fd = FD(c);
|
|
|
|
if (can_read(c)) fds[n].events = POLLIN;
|
|
|
|
if (can_write(c)) fds[n].events |= POLLOUT;
|
|
|
|
n++;
|
|
|
|
if (mg_tls_pending(c) > 0) ms = 0; // Don't wait if TLS is ready
|
2015-11-01 00:26:19 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
}
|
2015-09-08 19:49:03 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
if (poll(fds, n, ms) < 0) {
|
|
|
|
MG_ERROR(("poll failed, errno: %d", MG_SOCK_ERRNO));
|
|
|
|
} else {
|
|
|
|
n = 0;
|
|
|
|
for (struct mg_connection *c = mgr->conns; c != NULL; c = c->next) {
|
|
|
|
if (skip_iotest(c)) {
|
|
|
|
// Socket not valid, ignore
|
|
|
|
} else {
|
|
|
|
c->is_readable = (unsigned) (fds[n].revents & POLLIN ? 1 : 0);
|
|
|
|
c->is_writable = (unsigned) (fds[n].revents & POLLOUT ? 1 : 0);
|
|
|
|
if (mg_tls_pending(c) > 0) c->is_readable = 1;
|
|
|
|
fds[n].revents = 0;
|
|
|
|
n++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
struct timeval tv = {ms / 1000, (ms % 1000) * 1000}, tv_zero = {0, 0};
|
|
|
|
struct mg_connection *c;
|
|
|
|
fd_set rset, wset;
|
|
|
|
SOCKET maxfd = 0;
|
|
|
|
int rc;
|
2015-09-08 19:49:03 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
FD_ZERO(&rset);
|
|
|
|
FD_ZERO(&wset);
|
|
|
|
|
|
|
|
for (c = mgr->conns; c != NULL; c = c->next) {
|
|
|
|
c->is_readable = c->is_writable = 0;
|
|
|
|
if (skip_iotest(c)) continue;
|
|
|
|
if (can_read(c)) FD_SET(FD(c), &rset);
|
|
|
|
if (can_write(c)) FD_SET(FD(c), &wset);
|
|
|
|
if (mg_tls_pending(c) > 0) tv = tv_zero;
|
|
|
|
if (FD(c) > maxfd) maxfd = FD(c);
|
2015-09-08 19:49:03 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
|
|
|
|
if ((rc = select((int) maxfd + 1, &rset, &wset, NULL, &tv)) < 0) {
|
|
|
|
#if MG_ARCH == MG_ARCH_WIN32
|
|
|
|
if (maxfd == 0) Sleep(ms); // On Windows, select fails if no sockets
|
|
|
|
#else
|
|
|
|
MG_ERROR(("select: %d %d", rc, MG_SOCK_ERRNO));
|
|
|
|
#endif
|
|
|
|
FD_ZERO(&rset);
|
|
|
|
FD_ZERO(&wset);
|
2015-11-01 00:26:19 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
|
|
|
|
for (c = mgr->conns; c != NULL; c = c->next) {
|
|
|
|
c->is_readable = FD(c) != INVALID_SOCKET && FD_ISSET(FD(c), &rset);
|
|
|
|
c->is_writable = FD(c) != INVALID_SOCKET && FD_ISSET(FD(c), &wset);
|
|
|
|
if (mg_tls_pending(c) > 0) c->is_readable = 1;
|
2015-11-01 00:26:19 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
#endif
|
2015-09-08 19:49:03 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static void connect_conn(struct mg_connection *c) {
|
|
|
|
int rc = 0;
|
|
|
|
#if (MG_ARCH != MG_ARCH_FREERTOS_TCP) && (MG_ARCH != MG_ARCH_RTX)
|
|
|
|
socklen_t len = sizeof(rc);
|
|
|
|
if (getsockopt(FD(c), SOL_SOCKET, SO_ERROR, (char *) &rc, &len)) rc = 1;
|
2017-04-11 18:32:19 +08:00
|
|
|
#endif
|
2022-06-12 00:29:45 +08:00
|
|
|
if (rc == EAGAIN || rc == EWOULDBLOCK) rc = 0;
|
|
|
|
c->is_connecting = 0;
|
|
|
|
if (rc) {
|
|
|
|
char buf[50];
|
|
|
|
mg_error(c, "error connecting to %s",
|
|
|
|
mg_straddr(&c->rem, buf, sizeof(buf)));
|
2022-05-26 23:22:44 +08:00
|
|
|
} else {
|
2022-06-12 00:29:45 +08:00
|
|
|
if (c->is_tls_hs) mg_tls_handshake(c);
|
|
|
|
mg_call(c, MG_EV_CONNECT, NULL);
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
2017-04-11 18:32:19 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
void mg_mgr_poll(struct mg_mgr *mgr, int ms) {
|
|
|
|
struct mg_connection *c, *tmp;
|
|
|
|
uint64_t now;
|
|
|
|
|
|
|
|
mg_iotest(mgr, ms);
|
|
|
|
now = mg_millis();
|
|
|
|
mg_timer_poll(&mgr->timers, now);
|
|
|
|
|
|
|
|
for (c = mgr->conns; c != NULL; c = tmp) {
|
|
|
|
tmp = c->next;
|
|
|
|
mg_call(c, MG_EV_POLL, &now);
|
|
|
|
MG_VERBOSE(("%lu %c%c %c%c%c%c%c", c->id, c->is_readable ? 'r' : '-',
|
|
|
|
c->is_writable ? 'w' : '-', c->is_tls ? 'T' : 't',
|
|
|
|
c->is_connecting ? 'C' : 'c', c->is_tls_hs ? 'H' : 'h',
|
|
|
|
c->is_resolving ? 'R' : 'r', c->is_closing ? 'C' : 'c'));
|
|
|
|
if (c->is_resolving || c->is_closing) {
|
|
|
|
// Do nothing
|
|
|
|
} else if (c->is_listening && c->is_udp == 0) {
|
|
|
|
if (c->is_readable) accept_conn(mgr, c);
|
|
|
|
} else if (c->is_connecting) {
|
|
|
|
if (c->is_readable || c->is_writable) connect_conn(c);
|
|
|
|
} else if (c->is_tls_hs) {
|
|
|
|
if ((c->is_readable || c->is_writable)) mg_tls_handshake(c);
|
|
|
|
} else {
|
|
|
|
if (c->is_readable) read_conn(c);
|
|
|
|
if (c->is_writable) write_conn(c);
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
2017-04-11 18:32:19 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
if (c->is_draining && c->send.len == 0) c->is_closing = 1;
|
|
|
|
if (c->is_closing) close_conn(c);
|
2017-04-11 18:32:19 +08:00
|
|
|
}
|
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
#endif
|
2017-04-11 18:32:19 +08:00
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
#ifdef MG_ENABLE_LINES
|
2022-06-12 00:29:45 +08:00
|
|
|
#line 1 "src/ssi.c"
|
2020-12-05 19:26:32 +08:00
|
|
|
#endif
|
2017-04-11 18:32:19 +08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
#ifndef MG_MAX_SSI_DEPTH
|
|
|
|
#define MG_MAX_SSI_DEPTH 5
|
2020-12-05 19:26:32 +08:00
|
|
|
#endif
|
2017-04-11 18:32:19 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
#ifndef MG_SSI_BUFSIZ
|
|
|
|
#define MG_SSI_BUFSIZ 1024
|
2020-12-13 00:48:47 +08:00
|
|
|
#endif
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
#if MG_ENABLE_SSI
|
|
|
|
static char *mg_ssi(const char *path, const char *root, int depth) {
|
|
|
|
struct mg_iobuf b = {NULL, 0, 0};
|
|
|
|
FILE *fp = fopen(path, "rb");
|
|
|
|
if (fp != NULL) {
|
|
|
|
char buf[MG_SSI_BUFSIZ] = "", arg[sizeof(buf)] = "";
|
|
|
|
int ch, intag = 0;
|
|
|
|
size_t len = 0, align = MG_IO_SIZE;
|
|
|
|
while ((ch = fgetc(fp)) != EOF) {
|
|
|
|
if (intag && ch == '>' && buf[len - 1] == '-' && buf[len - 2] == '-') {
|
|
|
|
buf[len++] = (char) (ch & 0xff);
|
|
|
|
if (sscanf(buf, "<!--#include file=\"%[^\"]", arg)) {
|
|
|
|
char tmp[MG_PATH_MAX + MG_SSI_BUFSIZ + 10],
|
|
|
|
*p = (char *) path + strlen(path), *data;
|
|
|
|
while (p > path && p[-1] != MG_DIRSEP && p[-1] != '/') p--;
|
|
|
|
mg_snprintf(tmp, sizeof(tmp), "%.*s%s", (int) (p - path), path, arg);
|
|
|
|
if (depth < MG_MAX_SSI_DEPTH &&
|
|
|
|
(data = mg_ssi(tmp, root, depth + 1)) != NULL) {
|
|
|
|
mg_iobuf_add(&b, b.len, data, strlen(data), align);
|
|
|
|
free(data);
|
|
|
|
} else {
|
|
|
|
MG_ERROR(("%s: file=%s error or too deep", path, arg));
|
|
|
|
}
|
|
|
|
} else if (sscanf(buf, "<!--#include virtual=\"%[^\"]", arg)) {
|
|
|
|
char tmp[MG_PATH_MAX + MG_SSI_BUFSIZ + 10], *data;
|
|
|
|
mg_snprintf(tmp, sizeof(tmp), "%s%s", root, arg);
|
|
|
|
if (depth < MG_MAX_SSI_DEPTH &&
|
|
|
|
(data = mg_ssi(tmp, root, depth + 1)) != NULL) {
|
|
|
|
mg_iobuf_add(&b, b.len, data, strlen(data), align);
|
|
|
|
free(data);
|
|
|
|
} else {
|
|
|
|
MG_ERROR(("%s: virtual=%s error or too deep", path, arg));
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
// Unknown SSI tag
|
|
|
|
MG_ERROR(("Unknown SSI tag: %.*s", (int) len, buf));
|
|
|
|
mg_iobuf_add(&b, b.len, buf, len, align);
|
|
|
|
}
|
|
|
|
intag = 0;
|
|
|
|
len = 0;
|
|
|
|
} else if (ch == '<') {
|
|
|
|
intag = 1;
|
|
|
|
if (len > 0) mg_iobuf_add(&b, b.len, buf, len, align);
|
|
|
|
len = 0;
|
|
|
|
buf[len++] = (char) (ch & 0xff);
|
|
|
|
} else if (intag) {
|
|
|
|
if (len == 5 && strncmp(buf, "<!--#", 5) != 0) {
|
|
|
|
intag = 0;
|
|
|
|
} else if (len >= sizeof(buf) - 2) {
|
|
|
|
MG_ERROR(("%s: SSI tag is too large", path));
|
|
|
|
len = 0;
|
|
|
|
}
|
|
|
|
buf[len++] = (char) (ch & 0xff);
|
|
|
|
} else {
|
|
|
|
buf[len++] = (char) (ch & 0xff);
|
|
|
|
if (len >= sizeof(buf)) {
|
|
|
|
mg_iobuf_add(&b, b.len, buf, len, align);
|
|
|
|
len = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (len > 0) mg_iobuf_add(&b, b.len, buf, len, align);
|
|
|
|
if (b.len > 0) mg_iobuf_add(&b, b.len, "", 1, align); // nul-terminate
|
|
|
|
fclose(fp);
|
|
|
|
}
|
|
|
|
(void) depth;
|
|
|
|
(void) root;
|
|
|
|
return (char *) b.buf;
|
|
|
|
}
|
2021-08-08 00:48:51 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
void mg_http_serve_ssi(struct mg_connection *c, const char *root,
|
|
|
|
const char *fullpath) {
|
|
|
|
const char *headers = "Content-Type: text/html; charset=utf-8\r\n";
|
|
|
|
char *data = mg_ssi(fullpath, root, 0);
|
|
|
|
mg_http_reply(c, 200, headers, "%s", data == NULL ? "" : data);
|
|
|
|
free(data);
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
void mg_http_serve_ssi(struct mg_connection *c, const char *root,
|
|
|
|
const char *fullpath) {
|
|
|
|
mg_http_reply(c, 501, NULL, "SSI not enabled");
|
|
|
|
(void) root, (void) fullpath;
|
|
|
|
}
|
2020-12-05 19:26:32 +08:00
|
|
|
#endif
|
2017-04-11 18:32:19 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
#ifdef MG_ENABLE_LINES
|
|
|
|
#line 1 "src/str.c"
|
2021-08-08 00:22:47 +08:00
|
|
|
#endif
|
2022-06-12 00:29:45 +08:00
|
|
|
|
|
|
|
#include <stdlib.h>
|
|
|
|
|
|
|
|
struct mg_str mg_str_s(const char *s) {
|
|
|
|
struct mg_str str = {s, s == NULL ? 0 : strlen(s)};
|
|
|
|
return str;
|
2021-08-08 00:22:47 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
struct mg_str mg_str_n(const char *s, size_t n) {
|
|
|
|
struct mg_str str = {s, n};
|
|
|
|
return str;
|
2017-04-11 18:32:19 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
int mg_lower(const char *s) {
|
|
|
|
int c = *s;
|
|
|
|
if (c >= 'A' && c <= 'Z') c += 'a' - 'A';
|
|
|
|
return c;
|
2017-04-11 18:32:19 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
int mg_ncasecmp(const char *s1, const char *s2, size_t len) {
|
|
|
|
int diff = 0;
|
|
|
|
if (len > 0) do {
|
|
|
|
diff = mg_lower(s1++) - mg_lower(s2++);
|
|
|
|
} while (diff == 0 && s1[-1] != '\0' && --len > 0);
|
|
|
|
return diff;
|
2022-04-03 04:43:13 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
int mg_casecmp(const char *s1, const char *s2) {
|
|
|
|
return mg_ncasecmp(s1, s2, (size_t) ~0);
|
2022-05-07 03:19:40 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
int mg_vcmp(const struct mg_str *s1, const char *s2) {
|
|
|
|
size_t n2 = strlen(s2), n1 = s1->len;
|
|
|
|
int r = strncmp(s1->ptr, s2, (n1 < n2) ? n1 : n2);
|
|
|
|
if (r == 0) return (int) (n1 - n2);
|
|
|
|
return r;
|
|
|
|
}
|
2022-05-07 04:09:13 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
int mg_vcasecmp(const struct mg_str *str1, const char *str2) {
|
|
|
|
size_t n2 = strlen(str2), n1 = str1->len;
|
|
|
|
int r = mg_ncasecmp(str1->ptr, str2, (n1 < n2) ? n1 : n2);
|
|
|
|
if (r == 0) return (int) (n1 - n2);
|
|
|
|
return r;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct mg_str mg_strdup(const struct mg_str s) {
|
|
|
|
struct mg_str r = {NULL, 0};
|
|
|
|
if (s.len > 0 && s.ptr != NULL) {
|
|
|
|
char *sc = (char *) calloc(1, s.len + 1);
|
|
|
|
if (sc != NULL) {
|
|
|
|
memcpy(sc, s.ptr, s.len);
|
|
|
|
sc[s.len] = '\0';
|
|
|
|
r.ptr = sc;
|
|
|
|
r.len = s.len;
|
2022-01-05 21:03:56 +08:00
|
|
|
}
|
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
return r;
|
2022-01-05 21:03:56 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
int mg_strcmp(const struct mg_str str1, const struct mg_str str2) {
|
|
|
|
size_t i = 0;
|
|
|
|
while (i < str1.len && i < str2.len) {
|
|
|
|
int c1 = str1.ptr[i];
|
|
|
|
int c2 = str2.ptr[i];
|
|
|
|
if (c1 < c2) return -1;
|
|
|
|
if (c1 > c2) return 1;
|
|
|
|
i++;
|
2021-10-22 15:56:45 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
if (i < str1.len) return 1;
|
|
|
|
if (i < str2.len) return -1;
|
|
|
|
return 0;
|
2017-04-11 18:32:19 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
const char *mg_strstr(const struct mg_str haystack,
|
|
|
|
const struct mg_str needle) {
|
|
|
|
size_t i;
|
|
|
|
if (needle.len > haystack.len) return NULL;
|
|
|
|
for (i = 0; i <= haystack.len - needle.len; i++) {
|
|
|
|
if (memcmp(haystack.ptr + i, needle.ptr, needle.len) == 0) {
|
|
|
|
return haystack.ptr + i;
|
|
|
|
}
|
2022-01-05 21:03:56 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
return NULL;
|
2017-07-03 22:55:24 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static bool is_digit(int c) {
|
|
|
|
return c >= '0' && c <= '9';
|
2017-04-11 18:32:19 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static bool is_space(int c) {
|
|
|
|
return c == ' ' || c == '\r' || c == '\n' || c == '\t';
|
|
|
|
}
|
2017-07-06 00:14:34 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
struct mg_str mg_strstrip(struct mg_str s) {
|
|
|
|
while (s.len > 0 && is_space((int) *s.ptr)) s.ptr++, s.len--;
|
|
|
|
while (s.len > 0 && is_space((int) *(s.ptr + s.len - 1))) s.len--;
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool mg_match(struct mg_str s, struct mg_str p, struct mg_str *caps) {
|
|
|
|
size_t i = 0, j = 0, ni = 0, nj = 0;
|
|
|
|
if (caps) caps->ptr = NULL, caps->len = 0;
|
|
|
|
while (i < p.len || j < s.len) {
|
|
|
|
if (i < p.len && j < s.len && (p.ptr[i] == '?' || s.ptr[j] == p.ptr[i])) {
|
|
|
|
if (caps == NULL) {
|
|
|
|
} else if (p.ptr[i] == '?') {
|
|
|
|
caps->ptr = &s.ptr[j], caps->len = 1; // Finalize `?` cap
|
|
|
|
caps++, caps->ptr = NULL, caps->len = 0; // Init next cap
|
|
|
|
} else if (caps->ptr != NULL && caps->len == 0) {
|
|
|
|
caps->len = (size_t) (&s.ptr[j] - caps->ptr); // Finalize current cap
|
|
|
|
caps++, caps->len = 0, caps->ptr = NULL; // Init next cap
|
|
|
|
}
|
|
|
|
i++, j++;
|
|
|
|
} else if (i < p.len && (p.ptr[i] == '*' || p.ptr[i] == '#')) {
|
|
|
|
if (caps && !caps->ptr) caps->len = 0, caps->ptr = &s.ptr[j]; // Init cap
|
|
|
|
ni = i++, nj = j + 1;
|
|
|
|
} else if (nj > 0 && nj <= s.len && (p.ptr[ni] == '#' || s.ptr[j] != '/')) {
|
|
|
|
i = ni, j = nj;
|
|
|
|
if (caps && caps->ptr == NULL && caps->len == 0) {
|
|
|
|
caps--, caps->len = 0; // Restart previous cap
|
|
|
|
}
|
2022-05-10 20:41:45 +08:00
|
|
|
} else {
|
2022-06-12 00:29:45 +08:00
|
|
|
return false;
|
2020-12-22 18:16:31 +08:00
|
|
|
}
|
2019-12-30 03:29:52 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
if (caps && caps->ptr && caps->len == 0) {
|
|
|
|
caps->len = (size_t) (&s.ptr[j] - caps->ptr);
|
|
|
|
}
|
|
|
|
return true;
|
2019-01-17 03:44:59 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
bool mg_globmatch(const char *s1, size_t n1, const char *s2, size_t n2) {
|
|
|
|
return mg_match(mg_str_n(s2, n2), mg_str_n(s1, n1), NULL);
|
2018-07-07 21:45:52 +08:00
|
|
|
}
|
2018-10-29 22:42:32 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static size_t mg_nce(const char *s, size_t n, size_t ofs, size_t *koff,
|
|
|
|
size_t *klen, size_t *voff, size_t *vlen, char delim) {
|
|
|
|
size_t kvlen, kl;
|
|
|
|
for (kvlen = 0; ofs + kvlen < n && s[ofs + kvlen] != delim;) kvlen++;
|
|
|
|
for (kl = 0; kl < kvlen && s[ofs + kl] != '=';) kl++;
|
|
|
|
if (koff != NULL) *koff = ofs;
|
|
|
|
if (klen != NULL) *klen = kl;
|
|
|
|
if (voff != NULL) *voff = kl < kvlen ? ofs + kl + 1 : 0;
|
|
|
|
if (vlen != NULL) *vlen = kl < kvlen ? kvlen - kl - 1 : 0;
|
|
|
|
ofs += kvlen + 1;
|
|
|
|
return ofs > n ? n : ofs;
|
2021-05-29 01:30:42 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
bool mg_split(struct mg_str *s, struct mg_str *k, struct mg_str *v, char sep) {
|
|
|
|
size_t koff = 0, klen = 0, voff = 0, vlen = 0, off = 0;
|
|
|
|
if (s->ptr == NULL || s->len == 0) return 0;
|
|
|
|
off = mg_nce(s->ptr, s->len, 0, &koff, &klen, &voff, &vlen, sep);
|
|
|
|
if (k != NULL) *k = mg_str_n(s->ptr + koff, klen);
|
|
|
|
if (v != NULL) *v = mg_str_n(s->ptr + voff, vlen);
|
|
|
|
*s = mg_str_n(s->ptr + off, s->len - off);
|
|
|
|
return off > 0;
|
2018-10-29 22:42:32 +08:00
|
|
|
}
|
2015-09-08 19:49:03 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
bool mg_commalist(struct mg_str *s, struct mg_str *k, struct mg_str *v) {
|
|
|
|
return mg_split(s, k, v, ',');
|
2015-09-08 19:49:03 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
size_t mg_snprintf(char *buf, size_t len, const char *fmt, ...) {
|
|
|
|
va_list ap;
|
|
|
|
size_t n;
|
|
|
|
va_start(ap, fmt);
|
|
|
|
n = mg_vsnprintf(buf, len, fmt, &ap);
|
|
|
|
va_end(ap);
|
|
|
|
return n;
|
2016-11-12 04:34:00 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
char *mg_hex(const void *buf, size_t len, char *to) {
|
|
|
|
const unsigned char *p = (const unsigned char *) buf;
|
|
|
|
const char *hex = "0123456789abcdef";
|
|
|
|
size_t i = 0;
|
|
|
|
for (; len--; p++) {
|
|
|
|
to[i++] = hex[p[0] >> 4];
|
|
|
|
to[i++] = hex[p[0] & 0x0f];
|
2016-11-12 04:34:00 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
to[i] = '\0';
|
|
|
|
return to;
|
2016-11-12 04:34:00 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static unsigned char mg_unhex_nimble(unsigned char c) {
|
|
|
|
return (c >= '0' && c <= '9') ? (unsigned char) (c - '0')
|
|
|
|
: (c >= 'A' && c <= 'F') ? (unsigned char) (c - '7')
|
|
|
|
: (unsigned char) (c - 'W');
|
2022-04-22 21:42:07 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
unsigned long mg_unhexn(const char *s, size_t len) {
|
|
|
|
unsigned long i = 0, v = 0;
|
|
|
|
for (i = 0; i < len; i++) v <<= 4, v |= mg_unhex_nimble(((uint8_t *) s)[i]);
|
|
|
|
return v;
|
|
|
|
}
|
|
|
|
|
|
|
|
void mg_unhex(const char *buf, size_t len, unsigned char *to) {
|
|
|
|
size_t i;
|
|
|
|
for (i = 0; i < len; i += 2) {
|
|
|
|
to[i >> 1] = (unsigned char) mg_unhexn(&buf[i], 2);
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
size_t mg_vasprintf(char **buf, size_t size, const char *fmt, va_list ap) {
|
|
|
|
va_list ap_copy;
|
|
|
|
size_t len;
|
2018-03-27 07:25:18 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
va_copy(ap_copy, ap);
|
|
|
|
len = mg_vsnprintf(*buf, size, fmt, &ap_copy);
|
|
|
|
va_end(ap_copy);
|
2018-03-27 07:25:18 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
if (len >= size) {
|
|
|
|
// Allocate a buffer that is large enough
|
|
|
|
if ((*buf = (char *) calloc(1, len + 1)) == NULL) {
|
|
|
|
len = 0;
|
|
|
|
} else {
|
|
|
|
va_copy(ap_copy, ap);
|
|
|
|
len = mg_vsnprintf(*buf, len + 1, fmt, &ap_copy);
|
|
|
|
va_end(ap_copy);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return len;
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t mg_asprintf(char **buf, size_t size, const char *fmt, ...) {
|
|
|
|
size_t ret;
|
|
|
|
va_list ap;
|
|
|
|
va_start(ap, fmt);
|
|
|
|
ret = mg_vasprintf(buf, size, fmt, ap);
|
|
|
|
va_end(ap);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
char *mg_vmprintf(const char *fmt, va_list ap) {
|
|
|
|
char *s = NULL;
|
|
|
|
mg_vasprintf(&s, 0, fmt, ap);
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
|
|
|
char *mg_mprintf(const char *fmt, ...) {
|
|
|
|
char *s = NULL;
|
|
|
|
va_list ap;
|
|
|
|
va_start(ap, fmt);
|
|
|
|
mg_vasprintf(&s, 0, fmt, ap);
|
|
|
|
va_end(ap);
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
|
|
|
uint64_t mg_tou64(struct mg_str str) {
|
|
|
|
uint64_t result = 0;
|
|
|
|
size_t i = 0;
|
|
|
|
while (i < str.len && (str.ptr[i] == ' ' || str.ptr[i] == '\t')) i++;
|
|
|
|
while (i < str.len && str.ptr[i] >= '0' && str.ptr[i] <= '9') {
|
|
|
|
result *= 10;
|
|
|
|
result += (unsigned) (str.ptr[i] - '0');
|
|
|
|
i++;
|
2022-06-01 01:23:32 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
int64_t mg_to64(struct mg_str str) {
|
|
|
|
int64_t result = 0, neg = 1, max = 922337203685477570 /* INT64_MAX/10-10 */;
|
|
|
|
size_t i = 0;
|
|
|
|
while (i < str.len && (str.ptr[i] == ' ' || str.ptr[i] == '\t')) i++;
|
|
|
|
if (i < str.len && str.ptr[i] == '-') neg = -1, i++;
|
|
|
|
while (i < str.len && str.ptr[i] >= '0' && str.ptr[i] <= '9') {
|
|
|
|
if (result > max) return 0;
|
|
|
|
result *= 10;
|
|
|
|
result += (str.ptr[i] - '0');
|
|
|
|
i++;
|
2016-11-26 03:20:59 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
return result * neg;
|
2021-08-08 00:22:47 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
size_t mg_lld(char *buf, int64_t val, bool is_signed, bool is_hex) {
|
|
|
|
const char *letters = "0123456789abcdef";
|
|
|
|
uint64_t v = (uint64_t) val;
|
|
|
|
size_t s = 0, n, i;
|
|
|
|
if (is_signed && val < 0) buf[s++] = '-', v = (uint64_t) (-val);
|
|
|
|
// This loop prints a number in reverse order. I guess this is because we
|
|
|
|
// write numbers from right to left: least significant digit comes last.
|
|
|
|
// Maybe because we use Arabic numbers, and Arabs write RTL?
|
|
|
|
if (is_hex) {
|
|
|
|
for (n = 0; v; v >>= 4) buf[s + n++] = letters[v & 15];
|
2021-08-12 02:17:04 +08:00
|
|
|
} else {
|
2022-06-12 00:29:45 +08:00
|
|
|
for (n = 0; v; v /= 10) buf[s + n++] = letters[v % 10];
|
2021-08-12 02:17:04 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
// Reverse a string
|
|
|
|
for (i = 0; i < n / 2; i++) {
|
|
|
|
char t = buf[s + i];
|
|
|
|
buf[s + i] = buf[s + n - i - 1], buf[s + n - i - 1] = t;
|
|
|
|
}
|
|
|
|
if (val == 0) buf[n++] = '0'; // Handle special case
|
|
|
|
return n + s;
|
2016-11-26 03:20:59 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static size_t mg_copys(char *buf, size_t len, size_t n, char *p, size_t k) {
|
|
|
|
size_t j = 0;
|
|
|
|
for (j = 0; j < k && p[j]; j++)
|
|
|
|
if (j + n < len) buf[n + j] = p[j];
|
|
|
|
return j;
|
2022-06-03 18:37:35 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static char mg_esc(int c, bool esc) {
|
|
|
|
const char *p, *esc1 = "\b\f\n\r\t\\\"", *esc2 = "bfnrt\\\"";
|
|
|
|
for (p = esc ? esc1 : esc2; *p != '\0'; p++) {
|
|
|
|
if (*p == c) return esc ? esc2[p - esc1] : esc1[p - esc2];
|
|
|
|
}
|
|
|
|
return 0;
|
2022-06-03 18:37:35 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static char mg_escape(int c) {
|
|
|
|
return mg_esc(c, true);
|
2022-06-03 18:37:35 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static size_t mg_copyq(char *buf, size_t len, size_t n, char *p, size_t k) {
|
|
|
|
size_t j = 0, extra = 2;
|
|
|
|
if (n < len) buf[n++] = '"';
|
|
|
|
for (j = 0; j < k && p[j]; j++) {
|
|
|
|
char c = mg_escape(p[j]);
|
|
|
|
if (c) {
|
|
|
|
if (j + n < len) buf[n + j] = '\\';
|
2022-05-28 04:59:13 +08:00
|
|
|
n++;
|
2022-06-12 00:29:45 +08:00
|
|
|
extra++;
|
|
|
|
if (j + n < len) buf[n + j] = c;
|
|
|
|
} else {
|
|
|
|
if (j + n < len) buf[n + j] = p[j];
|
2022-05-25 05:43:22 +08:00
|
|
|
}
|
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
if (j + n < len) buf[n + j] = '"';
|
|
|
|
return j + extra;
|
|
|
|
}
|
2022-05-25 05:43:22 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
// %M specifier printer function
|
|
|
|
typedef size_t (*mg_spfn_t)(char *, size_t, va_list *);
|
|
|
|
|
|
|
|
size_t mg_vsnprintf(char *buf, size_t len, const char *fmt, va_list *ap) {
|
|
|
|
size_t i = 0, n = 0;
|
|
|
|
while (fmt[i] != '\0') {
|
|
|
|
if (fmt[i] == '%') {
|
|
|
|
size_t j, k, x = 0, is_long = 0, w = 0 /* width */, pr = ~0U /* prec */;
|
|
|
|
char pad = ' ', minus = 0, c = fmt[++i];
|
|
|
|
if (c == '#') x++, c = fmt[++i];
|
|
|
|
if (c == '-') minus++, c = fmt[++i];
|
|
|
|
if (c == '0') pad = '0', c = fmt[++i];
|
|
|
|
while (is_digit(c)) w *= 10, w += (size_t) (c - '0'), c = fmt[++i];
|
|
|
|
if (c == '.') {
|
|
|
|
c = fmt[++i];
|
|
|
|
if (c == '*') {
|
|
|
|
pr = (size_t) va_arg(*ap, int);
|
|
|
|
c = fmt[++i];
|
|
|
|
} else {
|
|
|
|
pr = 0;
|
|
|
|
while (is_digit(c)) pr *= 10, pr += (size_t) (c - '0'), c = fmt[++i];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
while (c == 'h') c = fmt[++i]; // Treat h and hh as int
|
|
|
|
if (c == 'l') {
|
|
|
|
is_long++, c = fmt[++i];
|
|
|
|
if (c == 'l') is_long++, c = fmt[++i];
|
|
|
|
}
|
|
|
|
if (c == 'p') x = 1, is_long = 1;
|
|
|
|
if (c == 'd' || c == 'u' || c == 'x' || c == 'X' || c == 'p' ||
|
|
|
|
c == 'g') {
|
|
|
|
bool s = (c == 'd'), h = (c == 'x' || c == 'X' || c == 'p');
|
|
|
|
char tmp[40];
|
|
|
|
size_t xl = x ? 2 : 0;
|
|
|
|
if (c == 'g' || c == 'f') {
|
|
|
|
double v = va_arg(*ap, double);
|
|
|
|
if (pr == ~0U) pr = 6;
|
|
|
|
k = mg_dtoa(tmp, sizeof(tmp), v, (int) pr);
|
|
|
|
} else if (is_long == 2) {
|
|
|
|
int64_t v = va_arg(*ap, int64_t);
|
|
|
|
k = mg_lld(tmp, v, s, h);
|
|
|
|
} else if (is_long == 1) {
|
|
|
|
long v = va_arg(*ap, long);
|
|
|
|
k = mg_lld(tmp, s ? (int64_t) v : (int64_t) (unsigned long) v, s, h);
|
|
|
|
} else {
|
|
|
|
int v = va_arg(*ap, int);
|
|
|
|
k = mg_lld(tmp, s ? (int64_t) v : (int64_t) (unsigned) v, s, h);
|
|
|
|
}
|
|
|
|
for (j = 0; j < xl && w > 0; j++) w--;
|
|
|
|
for (j = 0; pad == ' ' && !minus && k < w && j + k < w; j++)
|
|
|
|
n += mg_copys(buf, len, n, &pad, 1);
|
|
|
|
n += mg_copys(buf, len, n, (char *) "0x", xl);
|
|
|
|
for (j = 0; pad == '0' && k < w && j + k < w; j++)
|
|
|
|
n += mg_copys(buf, len, n, &pad, 1);
|
|
|
|
n += mg_copys(buf, len, n, tmp, k);
|
|
|
|
for (j = 0; pad == ' ' && minus && k < w && j + k < w; j++)
|
|
|
|
n += mg_copys(buf, len, n, &pad, 1);
|
|
|
|
} else if (c == 'M') {
|
|
|
|
char *dst = buf ? buf + n : NULL;
|
|
|
|
size_t dstlen = n < len ? len - n : 0;
|
|
|
|
mg_spfn_t fn = va_arg(*ap, mg_spfn_t);
|
|
|
|
n += fn(dst, dstlen, ap);
|
|
|
|
} else if (c == 'c') {
|
|
|
|
int p = va_arg(*ap, int);
|
|
|
|
if (n < len) buf[n] = (char) p;
|
|
|
|
n++;
|
2022-06-22 20:15:52 +08:00
|
|
|
} else if (c == 'H') {
|
|
|
|
// Print hex-encoded double-quoted string
|
|
|
|
size_t bl = (size_t) va_arg(*ap, int);
|
|
|
|
uint8_t *p = va_arg(*ap, uint8_t *), dquote = '"';
|
|
|
|
const char *hex = "0123456789abcdef";
|
|
|
|
n += mg_copys(buf, len, n, (char *) &dquote, 1);
|
|
|
|
for (j = 0; j < bl; j++) {
|
|
|
|
n += mg_copys(buf, len, n, (char *) &hex[(p[j] >> 4) & 15], 1);
|
|
|
|
n += mg_copys(buf, len, n, (char *) &hex[p[j] & 15], 1);
|
|
|
|
}
|
|
|
|
n += mg_copys(buf, len, n, (char *) &dquote, 1);
|
|
|
|
} else if (c == 'V') {
|
|
|
|
// Print base64-encoded double-quoted string
|
|
|
|
size_t bl = (size_t) va_arg(*ap, int);
|
|
|
|
uint8_t *p = va_arg(*ap, uint8_t *), dquote = '"';
|
|
|
|
const char *t =
|
|
|
|
"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
|
|
|
|
n += mg_copys(buf, len, n, (char *) &dquote, 1);
|
|
|
|
for (j = 0; j < bl; j += 3) {
|
|
|
|
uint8_t c1 = p[j], c2 = j + 1 < bl ? p[j + 1] : 0,
|
|
|
|
c3 = j + 2 < bl ? p[j + 2] : 0;
|
|
|
|
char tmp[4] = {t[c1 >> 2], t[(c1 & 3) << 4 | (c2 >> 4)], '=', '='};
|
|
|
|
if (j + 1 < bl) tmp[2] = t[(c2 & 15) << 2 | (c3 >> 6)];
|
|
|
|
if (j + 2 < bl) tmp[3] = t[c3 & 63];
|
|
|
|
n += mg_copys(buf, len, n, tmp, sizeof(tmp));
|
|
|
|
}
|
|
|
|
n += mg_copys(buf, len, n, (char *) &dquote, 1);
|
2022-06-12 00:29:45 +08:00
|
|
|
} else if (c == 's' || c == 'Q') {
|
|
|
|
char *p = va_arg(*ap, char *);
|
|
|
|
size_t (*fn)(char *, size_t, size_t, char *, size_t) =
|
|
|
|
c == 's' ? mg_copys : mg_copyq;
|
|
|
|
if (pr == ~0U) pr = p == NULL ? 0 : strlen(p);
|
|
|
|
for (j = 0; !minus && pr < w && j + pr < w; j++)
|
|
|
|
n += fn(buf, len, n, &pad, 1);
|
|
|
|
n += fn(buf, len, n, p, pr);
|
|
|
|
for (j = 0; minus && pr < w && j + pr < w; j++)
|
|
|
|
n += fn(buf, len, n, &pad, 1);
|
|
|
|
} else if (c == '%') {
|
|
|
|
if (n < len) buf[n] = '%';
|
|
|
|
n++;
|
2022-05-26 15:55:28 +08:00
|
|
|
} else {
|
2022-06-12 00:29:45 +08:00
|
|
|
if (n < len) buf[n] = '%';
|
|
|
|
n++;
|
|
|
|
if (n < len) buf[n] = c;
|
2022-05-28 04:59:13 +08:00
|
|
|
n++;
|
2022-05-26 15:55:28 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
i++;
|
|
|
|
} else {
|
|
|
|
if (n < len) buf[n] = fmt[i];
|
|
|
|
n++, i++;
|
|
|
|
}
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
if (n < len) buf[n] = '\0';
|
|
|
|
return n;
|
|
|
|
}
|
2020-12-05 19:26:32 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
double mg_atod(const char *p, int len, int *numlen) {
|
|
|
|
double d = 0.0;
|
|
|
|
int i = 0, sign = 1;
|
2020-12-05 19:26:32 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
// Sign
|
|
|
|
if (i < len && *p == '-') {
|
|
|
|
sign = -1, i++;
|
|
|
|
} else if (i < len && *p == '+') {
|
|
|
|
i++;
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
// Decimal
|
|
|
|
for (; i < len && is_digit(p[i]); i++) {
|
|
|
|
d *= 10.0;
|
|
|
|
d += p[i] - '0';
|
2020-12-12 01:35:58 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
d *= sign;
|
2020-12-05 19:26:32 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
// Fractional
|
|
|
|
if (i < len && p[i] == '.') {
|
|
|
|
double frac = 0.0, base = 0.1;
|
|
|
|
i++;
|
|
|
|
for (; i < len && is_digit(p[i]); i++) {
|
|
|
|
frac += base * (p[i] - '0');
|
|
|
|
base /= 10.0;
|
2016-11-15 16:59:04 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
d += frac * sign;
|
2018-03-27 07:25:18 +08:00
|
|
|
}
|
2016-10-12 02:20:28 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
// Exponential
|
|
|
|
if (i < len && (p[i] == 'e' || p[i] == 'E')) {
|
|
|
|
int j, exp = 0, minus = 0;
|
|
|
|
i++;
|
|
|
|
if (i < len && p[i] == '-') minus = 1, i++;
|
|
|
|
if (i < len && p[i] == '+') i++;
|
|
|
|
while (i < len && is_digit(p[i]) && exp < 308)
|
|
|
|
exp = exp * 10 + (p[i++] - '0');
|
|
|
|
if (minus) exp = -exp;
|
|
|
|
for (j = 0; j < exp; j++) d *= 10.0;
|
|
|
|
for (j = 0; j < -exp; j++) d /= 10.0;
|
|
|
|
}
|
2021-01-03 01:57:51 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
if (numlen != NULL) *numlen = i;
|
|
|
|
return d;
|
|
|
|
}
|
2021-01-03 01:57:51 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static int addexp(char *buf, int e, int sign) {
|
|
|
|
int n = 0;
|
|
|
|
buf[n++] = 'e';
|
|
|
|
buf[n++] = (char) sign;
|
|
|
|
if (e > 400) return 0;
|
|
|
|
if (e < 10) buf[n++] = '0';
|
|
|
|
if (e >= 100) buf[n++] = (char) (e / 100 + '0'), e -= 100 * (e / 100);
|
|
|
|
if (e >= 10) buf[n++] = (char) (e / 10 + '0'), e -= 10 * (e / 10);
|
|
|
|
buf[n++] = (char) (e + '0');
|
|
|
|
return n;
|
|
|
|
}
|
2021-01-03 01:57:51 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static int xisinf(double x) {
|
|
|
|
union {
|
|
|
|
double f;
|
|
|
|
uint64_t u;
|
|
|
|
} ieee754 = {x};
|
|
|
|
return ((unsigned) (ieee754.u >> 32) & 0x7fffffff) == 0x7ff00000 &&
|
|
|
|
((unsigned) ieee754.u == 0);
|
|
|
|
}
|
2021-02-08 06:43:49 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static int xisnan(double x) {
|
|
|
|
union {
|
|
|
|
double f;
|
|
|
|
uint64_t u;
|
|
|
|
} ieee754 = {x};
|
|
|
|
return ((unsigned) (ieee754.u >> 32) & 0x7fffffff) +
|
|
|
|
((unsigned) ieee754.u != 0) >
|
|
|
|
0x7ff00000;
|
|
|
|
}
|
2021-01-03 01:57:51 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
size_t mg_dtoa(char *dst, size_t dstlen, double d, int width) {
|
|
|
|
char buf[40];
|
|
|
|
int i, s = 0, n = 0, e = 0;
|
|
|
|
double t, mul, saved;
|
|
|
|
if (d == 0.0) return mg_snprintf(dst, dstlen, "%s", "0");
|
|
|
|
if (xisinf(d)) return mg_snprintf(dst, dstlen, "%s", d > 0 ? "inf" : "-inf");
|
|
|
|
if (xisnan(d)) return mg_snprintf(dst, dstlen, "%s", "nan");
|
|
|
|
if (d < 0.0) d = -d, buf[s++] = '-';
|
2022-03-30 14:56:44 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
// Round
|
|
|
|
saved = d;
|
|
|
|
mul = 1.0;
|
|
|
|
while (d >= 10.0 && d / mul >= 10.0) mul *= 10.0;
|
|
|
|
while (d <= 1.0 && d / mul <= 1.0) mul /= 10.0;
|
|
|
|
for (i = 0, t = mul * 5; i < width; i++) t /= 10.0;
|
|
|
|
d += t;
|
|
|
|
// Calculate exponent, and 'mul' for scientific representation
|
|
|
|
mul = 1.0;
|
|
|
|
while (d >= 10.0 && d / mul >= 10.0) mul *= 10.0, e++;
|
|
|
|
while (d < 1.0 && d / mul < 1.0) mul /= 10.0, e--;
|
|
|
|
// printf(" --> %g %d %g %g\n", saved, e, t, mul);
|
2021-01-03 01:57:51 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
if (e >= width) {
|
|
|
|
n = (int) mg_dtoa(buf, sizeof(buf), saved / mul, width);
|
|
|
|
// printf(" --> %.*g %d [%.*s]\n", 10, d / t, e, n, buf);
|
|
|
|
n += addexp(buf + s + n, e, '+');
|
|
|
|
return mg_snprintf(dst, dstlen, "%.*s", n, buf);
|
|
|
|
} else if (e <= -width) {
|
|
|
|
n = (int) mg_dtoa(buf, sizeof(buf), saved / mul, width);
|
|
|
|
// printf(" --> %.*g %d [%.*s]\n", 10, d / mul, e, n, buf);
|
|
|
|
n += addexp(buf + s + n, -e, '-');
|
|
|
|
return mg_snprintf(dst, dstlen, "%.*s", n, buf);
|
|
|
|
} else {
|
|
|
|
for (i = 0, t = mul; t >= 1.0 && s + n < (int) sizeof(buf); i++) {
|
|
|
|
int ch = (int) (d / t);
|
|
|
|
if (n > 0 || ch > 0) buf[s + n++] = (char) (ch + '0');
|
|
|
|
d -= ch * t;
|
|
|
|
t /= 10.0;
|
|
|
|
}
|
|
|
|
// printf(" --> [%g] -> %g %g (%d) [%.*s]\n", saved, d, t, n, s + n, buf);
|
|
|
|
if (n == 0) buf[s++] = '0';
|
|
|
|
while (t >= 1.0 && n + s < (int) sizeof(buf)) buf[n++] = '0', t /= 10.0;
|
|
|
|
if (s + n < (int) sizeof(buf)) buf[n + s++] = '.';
|
|
|
|
// printf(" 1--> [%g] -> [%.*s]\n", saved, s + n, buf);
|
|
|
|
for (i = 0, t = 0.1; s + n < (int) sizeof(buf) && n < width; i++) {
|
|
|
|
int ch = (int) (d / t);
|
|
|
|
buf[s + n++] = (char) (ch + '0');
|
|
|
|
d -= ch * t;
|
|
|
|
t /= 10.0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
while (n > 0 && buf[s + n - 1] == '0') n--; // Trim trailing zeros
|
|
|
|
if (n > 0 && buf[s + n - 1] == '.') n--; // Trim trailing dot
|
|
|
|
buf[s + n] = '\0';
|
|
|
|
return mg_snprintf(dst, dstlen, "%s", buf);
|
2021-07-29 21:21:20 +08:00
|
|
|
}
|
2021-01-03 01:57:51 +08:00
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
#ifdef MG_ENABLE_LINES
|
2022-06-12 00:29:45 +08:00
|
|
|
#line 1 "src/timer.c"
|
2017-05-10 00:07:00 +08:00
|
|
|
#endif
|
2022-06-12 00:29:45 +08:00
|
|
|
// Copyright (c) Cesanta Software Limited
|
|
|
|
// All rights reserved
|
2017-05-10 00:07:00 +08:00
|
|
|
|
2016-11-09 06:29:07 +08:00
|
|
|
|
2017-02-16 23:59:26 +08:00
|
|
|
|
2017-02-09 01:34:28 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
#define MG_TIMER_CALLED 4
|
2020-12-05 19:26:32 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
void mg_timer_init(struct mg_timer **head, struct mg_timer *t, uint64_t ms,
|
|
|
|
unsigned flags, void (*fn)(void *), void *arg) {
|
|
|
|
struct mg_timer tmp = {ms, 0U, 0U, flags, fn, arg, *head};
|
|
|
|
*t = tmp;
|
|
|
|
*head = t;
|
2016-10-12 02:20:28 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
void mg_timer_free(struct mg_timer **head, struct mg_timer *t) {
|
|
|
|
while (*head && *head != t) head = &(*head)->next;
|
|
|
|
if (*head) *head = t->next;
|
2016-10-12 02:20:28 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
void mg_timer_poll(struct mg_timer **head, uint64_t now_ms) {
|
|
|
|
// If time goes back (wrapped around), reset timers
|
|
|
|
struct mg_timer *t, *tmp;
|
|
|
|
for (t = *head; t != NULL; t = tmp) {
|
|
|
|
tmp = t->next;
|
|
|
|
if (t->prev_ms > now_ms) t->expire = 0; // Handle time wrap
|
|
|
|
t->prev_ms = now_ms;
|
|
|
|
if (t->expire == 0 && (t->flags & MG_TIMER_RUN_NOW) &&
|
|
|
|
!(t->flags & MG_TIMER_CALLED)) {
|
|
|
|
// Handle MG_TIMER_NOW only once
|
|
|
|
} else if (t->expire == 0) {
|
|
|
|
t->expire = now_ms + t->period_ms;
|
|
|
|
}
|
|
|
|
if (t->expire > now_ms) continue;
|
|
|
|
if ((t->flags & MG_TIMER_REPEAT) || !(t->flags & MG_TIMER_CALLED)) {
|
|
|
|
t->fn(t->arg);
|
2017-02-09 01:34:28 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
t->flags |= MG_TIMER_CALLED;
|
|
|
|
// Try to tick timers with the given period as accurate as possible,
|
|
|
|
// even if this polling function is called with some random period.
|
|
|
|
t->expire = now_ms - t->expire > t->period_ms ? now_ms + t->period_ms
|
|
|
|
: t->expire + t->period_ms;
|
2017-02-09 01:34:28 +08:00
|
|
|
}
|
2016-10-12 02:20:28 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
#ifdef MG_ENABLE_LINES
|
|
|
|
#line 1 "src/tls_dummy.c"
|
|
|
|
#endif
|
2016-10-12 02:20:28 +08:00
|
|
|
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
#if !MG_ENABLE_MBEDTLS && !MG_ENABLE_OPENSSL && !MG_ENABLE_CUSTOM_TLS
|
|
|
|
void mg_tls_init(struct mg_connection *c, const struct mg_tls_opts *opts) {
|
|
|
|
(void) opts;
|
|
|
|
mg_error(c, "TLS is not enabled");
|
2022-02-14 19:19:24 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
void mg_tls_handshake(struct mg_connection *c) {
|
|
|
|
(void) c;
|
2022-02-14 19:19:24 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
void mg_tls_free(struct mg_connection *c) {
|
|
|
|
(void) c;
|
2017-05-10 00:07:00 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
long mg_tls_recv(struct mg_connection *c, void *buf, size_t len) {
|
|
|
|
return c == NULL || buf == NULL || len == 0 ? 0 : -1;
|
2022-01-29 19:03:54 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
long mg_tls_send(struct mg_connection *c, const void *buf, size_t len) {
|
|
|
|
return c == NULL || buf == NULL || len == 0 ? 0 : -1;
|
2022-01-29 19:03:54 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
size_t mg_tls_pending(struct mg_connection *c) {
|
|
|
|
(void) c;
|
|
|
|
return 0;
|
2022-01-29 19:03:54 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
#endif
|
2022-01-29 19:03:54 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
#ifdef MG_ENABLE_LINES
|
|
|
|
#line 1 "src/tls_mbed.c"
|
|
|
|
#endif
|
2022-01-29 19:03:54 +08:00
|
|
|
|
2022-05-31 17:41:14 +08:00
|
|
|
|
2022-02-10 19:56:55 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
#if MG_ENABLE_MBEDTLS
|
2022-02-10 19:56:55 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
#if defined(MBEDTLS_VERSION_NUMBER) && MBEDTLS_VERSION_NUMBER >= 0x03000000
|
|
|
|
#define MGRNG , rng_get, NULL
|
|
|
|
#else
|
|
|
|
#define MGRNG
|
|
|
|
#endif
|
|
|
|
|
|
|
|
void mg_tls_free(struct mg_connection *c) {
|
|
|
|
struct mg_tls *tls = (struct mg_tls *) c->tls;
|
|
|
|
if (tls != NULL) {
|
|
|
|
free(tls->cafile);
|
|
|
|
mbedtls_ssl_free(&tls->ssl);
|
|
|
|
mbedtls_pk_free(&tls->pk);
|
|
|
|
mbedtls_x509_crt_free(&tls->ca);
|
|
|
|
mbedtls_x509_crt_free(&tls->cert);
|
|
|
|
mbedtls_ssl_config_free(&tls->conf);
|
|
|
|
free(tls);
|
|
|
|
c->tls = NULL;
|
|
|
|
}
|
2022-02-10 19:56:55 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
bool mg_sock_would_block(void);
|
|
|
|
bool mg_sock_conn_reset(void);
|
2022-02-10 19:56:55 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static int mg_net_send(void *ctx, const unsigned char *buf, size_t len) {
|
|
|
|
struct mg_connection *c = (struct mg_connection *) ctx;
|
|
|
|
int fd = (int) (size_t) c->fd;
|
|
|
|
int n = (int) send(fd, buf, len, 0);
|
|
|
|
MG_VERBOSE(("%lu n=%d, errno=%d", c->id, n, errno));
|
|
|
|
if (n < 0) {
|
|
|
|
if (mg_sock_would_block()) return MBEDTLS_ERR_SSL_WANT_WRITE;
|
|
|
|
if (mg_sock_conn_reset()) return MBEDTLS_ERR_NET_CONN_RESET;
|
|
|
|
return MBEDTLS_ERR_NET_SEND_FAILED;
|
2022-02-10 19:56:55 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
return n;
|
2022-02-10 19:56:55 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static int mg_net_recv(void *ctx, unsigned char *buf, size_t len) {
|
|
|
|
struct mg_connection *c = (struct mg_connection *) ctx;
|
|
|
|
int n, fd = (int) (size_t) c->fd;
|
|
|
|
n = (int) recv(fd, buf, len, 0);
|
|
|
|
MG_VERBOSE(("%lu n=%d, errno=%d", c->id, n, errno));
|
|
|
|
if (n < 0) {
|
|
|
|
if (mg_sock_would_block()) return MBEDTLS_ERR_SSL_WANT_READ;
|
|
|
|
if (mg_sock_conn_reset()) return MBEDTLS_ERR_NET_CONN_RESET;
|
|
|
|
return MBEDTLS_ERR_NET_RECV_FAILED;
|
2022-02-10 19:56:55 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
return n;
|
2022-02-10 19:56:55 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
void mg_tls_handshake(struct mg_connection *c) {
|
|
|
|
struct mg_tls *tls = (struct mg_tls *) c->tls;
|
|
|
|
int rc;
|
|
|
|
mbedtls_ssl_set_bio(&tls->ssl, c, mg_net_send, mg_net_recv, 0);
|
|
|
|
rc = mbedtls_ssl_handshake(&tls->ssl);
|
|
|
|
if (rc == 0) { // Success
|
|
|
|
MG_DEBUG(("%lu success", c->id));
|
|
|
|
c->is_tls_hs = 0;
|
|
|
|
} else if (rc == MBEDTLS_ERR_SSL_WANT_READ ||
|
|
|
|
rc == MBEDTLS_ERR_SSL_WANT_WRITE) { // Still pending
|
|
|
|
MG_VERBOSE(("%lu pending, %d%d %d (-%#x)", c->id, c->is_connecting,
|
|
|
|
c->is_tls_hs, rc, -rc));
|
|
|
|
} else {
|
|
|
|
mg_error(c, "TLS handshake: -%#x", -rc); // Error
|
|
|
|
}
|
2022-02-10 19:56:55 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static int mbed_rng(void *ctx, unsigned char *buf, size_t len) {
|
|
|
|
mg_random(buf, len);
|
|
|
|
(void) ctx;
|
|
|
|
return 0;
|
2022-06-10 16:38:36 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static void debug_cb(void *c, int lev, const char *s, int n, const char *s2) {
|
|
|
|
n = (int) strlen(s2) - 1;
|
|
|
|
MG_VERBOSE(("%lu %d %.*s", ((struct mg_connection *) c)->id, lev, n, s2));
|
|
|
|
(void) s;
|
2022-06-10 16:38:36 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
#if defined(MBEDTLS_VERSION_NUMBER) && MBEDTLS_VERSION_NUMBER >= 0x03000000
|
|
|
|
static int rng_get(void *p_rng, unsigned char *buf, size_t len) {
|
|
|
|
(void) p_rng;
|
|
|
|
mg_random(buf, len);
|
|
|
|
return 0;
|
2022-04-12 17:20:43 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
#endif
|
2022-04-12 17:20:43 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static struct mg_str mg_loadfile(struct mg_fs *fs, const char *path) {
|
|
|
|
size_t n = 0;
|
|
|
|
if (path[0] == '-') return mg_str(path);
|
|
|
|
char *p = mg_file_read(fs, path, &n);
|
|
|
|
return mg_str_n(p, n);
|
2022-02-10 19:56:55 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
void mg_tls_init(struct mg_connection *c, const struct mg_tls_opts *opts) {
|
|
|
|
struct mg_fs *fs = opts->fs == NULL ? &mg_fs_posix : opts->fs;
|
|
|
|
struct mg_tls *tls = (struct mg_tls *) calloc(1, sizeof(*tls));
|
|
|
|
int rc = 0;
|
|
|
|
c->tls = tls;
|
|
|
|
if (c->tls == NULL) {
|
|
|
|
mg_error(c, "TLS OOM");
|
|
|
|
goto fail;
|
2022-02-11 19:02:06 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
MG_DEBUG(("%lu Setting TLS", c->id));
|
|
|
|
mbedtls_ssl_init(&tls->ssl);
|
|
|
|
mbedtls_ssl_config_init(&tls->conf);
|
|
|
|
mbedtls_x509_crt_init(&tls->ca);
|
|
|
|
mbedtls_x509_crt_init(&tls->cert);
|
|
|
|
mbedtls_pk_init(&tls->pk);
|
|
|
|
mbedtls_ssl_conf_dbg(&tls->conf, debug_cb, c);
|
|
|
|
#if defined(MG_MBEDTLS_DEBUG_LEVEL)
|
|
|
|
mbedtls_debug_set_threshold(MG_MBEDTLS_DEBUG_LEVEL);
|
|
|
|
#endif
|
|
|
|
if ((rc = mbedtls_ssl_config_defaults(
|
|
|
|
&tls->conf,
|
|
|
|
c->is_client ? MBEDTLS_SSL_IS_CLIENT : MBEDTLS_SSL_IS_SERVER,
|
|
|
|
MBEDTLS_SSL_TRANSPORT_STREAM, MBEDTLS_SSL_PRESET_DEFAULT)) != 0) {
|
|
|
|
mg_error(c, "tls defaults %#x", -rc);
|
|
|
|
goto fail;
|
2022-02-11 19:02:06 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
mbedtls_ssl_conf_rng(&tls->conf, mbed_rng, c);
|
|
|
|
if (opts->ca == NULL || strcmp(opts->ca, "*") == 0) {
|
|
|
|
mbedtls_ssl_conf_authmode(&tls->conf, MBEDTLS_SSL_VERIFY_NONE);
|
|
|
|
} else if (opts->ca != NULL && opts->ca[0] != '\0') {
|
|
|
|
#if defined(MBEDTLS_X509_CA_CHAIN_ON_DISK)
|
|
|
|
tls->cafile = strdup(opts->ca);
|
|
|
|
rc = mbedtls_ssl_conf_ca_chain_file(&tls->conf, tls->cafile, NULL);
|
|
|
|
if (rc != 0) {
|
|
|
|
mg_error(c, "parse on-disk chain(%s) err %#x", tls->cafile, -rc);
|
|
|
|
goto fail;
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
struct mg_str s = mg_loadfile(fs, opts->ca);
|
|
|
|
rc = mbedtls_x509_crt_parse(&tls->ca, (uint8_t *) s.ptr, s.len + 1);
|
|
|
|
if (opts->ca[0] != '-') free((char *) s.ptr);
|
|
|
|
if (rc != 0) {
|
|
|
|
mg_error(c, "parse(%s) err %#x", opts->ca, -rc);
|
|
|
|
goto fail;
|
|
|
|
}
|
|
|
|
mbedtls_ssl_conf_ca_chain(&tls->conf, &tls->ca, NULL);
|
|
|
|
#endif
|
|
|
|
if (opts->srvname.len > 0) {
|
|
|
|
char mem[128], *buf = mem;
|
|
|
|
mg_asprintf(&buf, sizeof(mem), "%.*s", (int) opts->srvname.len,
|
|
|
|
opts->srvname.ptr);
|
|
|
|
mbedtls_ssl_set_hostname(&tls->ssl, buf);
|
|
|
|
if (buf != mem) free(buf);
|
|
|
|
}
|
|
|
|
mbedtls_ssl_conf_authmode(&tls->conf, MBEDTLS_SSL_VERIFY_REQUIRED);
|
|
|
|
}
|
|
|
|
if (opts->cert != NULL && opts->cert[0] != '\0') {
|
|
|
|
struct mg_str s = mg_loadfile(fs, opts->cert);
|
|
|
|
const char *key = opts->certkey == NULL ? opts->cert : opts->certkey;
|
|
|
|
rc = mbedtls_x509_crt_parse(&tls->cert, (uint8_t *) s.ptr, s.len + 1);
|
|
|
|
if (opts->cert[0] != '-') free((char *) s.ptr);
|
|
|
|
if (rc != 0) {
|
|
|
|
mg_error(c, "parse(%s) err %#x", opts->cert, -rc);
|
|
|
|
goto fail;
|
|
|
|
}
|
|
|
|
s = mg_loadfile(fs, key);
|
|
|
|
rc = mbedtls_pk_parse_key(&tls->pk, (uint8_t *) s.ptr, s.len + 1, NULL,
|
|
|
|
0 MGRNG);
|
|
|
|
if (key[0] != '-') free((char *) s.ptr);
|
|
|
|
if (rc != 0) {
|
|
|
|
mg_error(c, "tls key(%s) %#x", key, -rc);
|
|
|
|
goto fail;
|
|
|
|
}
|
|
|
|
rc = mbedtls_ssl_conf_own_cert(&tls->conf, &tls->cert, &tls->pk);
|
|
|
|
if (rc != 0) {
|
|
|
|
mg_error(c, "own cert %#x", -rc);
|
|
|
|
goto fail;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if ((rc = mbedtls_ssl_setup(&tls->ssl, &tls->conf)) != 0) {
|
|
|
|
mg_error(c, "setup err %#x", -rc);
|
|
|
|
goto fail;
|
|
|
|
}
|
|
|
|
c->tls = tls;
|
|
|
|
c->is_tls = 1;
|
|
|
|
c->is_tls_hs = 1;
|
|
|
|
if (c->is_client && c->is_resolving == 0 && c->is_connecting == 0) {
|
|
|
|
mg_tls_handshake(c);
|
|
|
|
}
|
|
|
|
return;
|
|
|
|
fail:
|
|
|
|
mg_tls_free(c);
|
2022-02-11 19:02:06 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
size_t mg_tls_pending(struct mg_connection *c) {
|
|
|
|
struct mg_tls *tls = (struct mg_tls *) c->tls;
|
|
|
|
return tls == NULL ? 0 : mbedtls_ssl_get_bytes_avail(&tls->ssl);
|
2022-02-11 19:02:06 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
long mg_tls_recv(struct mg_connection *c, void *buf, size_t len) {
|
|
|
|
struct mg_tls *tls = (struct mg_tls *) c->tls;
|
|
|
|
long n = mbedtls_ssl_read(&tls->ssl, (unsigned char *) buf, len);
|
|
|
|
return n == 0 ? -1 : n == MBEDTLS_ERR_SSL_WANT_READ ? 0 : n;
|
|
|
|
}
|
|
|
|
|
|
|
|
long mg_tls_send(struct mg_connection *c, const void *buf, size_t len) {
|
|
|
|
struct mg_tls *tls = (struct mg_tls *) c->tls;
|
|
|
|
long n = mbedtls_ssl_write(&tls->ssl, (unsigned char *) buf, len);
|
|
|
|
return n == 0 ? -1 : n == MBEDTLS_ERR_SSL_WANT_WRITE ? 0 : n;
|
2022-06-09 04:44:01 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
#endif
|
2022-06-09 04:44:01 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
#ifdef MG_ENABLE_LINES
|
|
|
|
#line 1 "src/tls_openssl.c"
|
|
|
|
#endif
|
2022-06-09 04:44:01 +08:00
|
|
|
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
#if MG_ENABLE_OPENSSL
|
|
|
|
static int mg_tls_err(struct mg_tls *tls, int res) {
|
|
|
|
int err = SSL_get_error(tls->ssl, res);
|
|
|
|
// We've just fetched the last error from the queue.
|
|
|
|
// Now we need to clear the error queue. If we do not, then the following
|
|
|
|
// can happen (actually reported):
|
|
|
|
// - A new connection is accept()-ed with cert error (e.g. self-signed cert)
|
|
|
|
// - Since all accept()-ed connections share listener's context,
|
|
|
|
// - *ALL* SSL accepted connection report read error on the next poll cycle.
|
|
|
|
// Thus a single errored connection can close all the rest, unrelated ones.
|
|
|
|
// Clearing the error keeps the shared SSL_CTX in an OK state.
|
2022-06-10 16:38:36 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
if (err != 0) ERR_print_errors_fp(stderr);
|
|
|
|
ERR_clear_error();
|
|
|
|
if (err == SSL_ERROR_WANT_READ) return 0;
|
|
|
|
if (err == SSL_ERROR_WANT_WRITE) return 0;
|
|
|
|
return err;
|
2022-02-11 19:02:06 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
void mg_tls_init(struct mg_connection *c, const struct mg_tls_opts *opts) {
|
|
|
|
struct mg_tls *tls = (struct mg_tls *) calloc(1, sizeof(*tls));
|
|
|
|
const char *id = "mongoose";
|
|
|
|
static unsigned char s_initialised = 0;
|
|
|
|
int rc;
|
2022-06-09 19:39:48 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
if (tls == NULL) {
|
|
|
|
mg_error(c, "TLS OOM");
|
|
|
|
goto fail;
|
2022-06-09 19:39:48 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
if (!s_initialised) {
|
|
|
|
SSL_library_init();
|
|
|
|
s_initialised++;
|
2022-06-09 19:39:48 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
MG_DEBUG(("%lu Setting TLS, CA: %s, cert: %s, key: %s", c->id,
|
|
|
|
opts->ca == NULL ? "null" : opts->ca,
|
|
|
|
opts->cert == NULL ? "null" : opts->cert,
|
|
|
|
opts->certkey == NULL ? "null" : opts->certkey));
|
|
|
|
tls->ctx = c->is_client ? SSL_CTX_new(SSLv23_client_method())
|
|
|
|
: SSL_CTX_new(SSLv23_server_method());
|
|
|
|
if ((tls->ssl = SSL_new(tls->ctx)) == NULL) {
|
|
|
|
mg_error(c, "SSL_new");
|
|
|
|
goto fail;
|
|
|
|
}
|
|
|
|
SSL_set_session_id_context(tls->ssl, (const uint8_t *) id,
|
|
|
|
(unsigned) strlen(id));
|
|
|
|
// Disable deprecated protocols
|
|
|
|
SSL_set_options(tls->ssl, SSL_OP_NO_SSLv2);
|
|
|
|
SSL_set_options(tls->ssl, SSL_OP_NO_SSLv3);
|
|
|
|
SSL_set_options(tls->ssl, SSL_OP_NO_TLSv1);
|
|
|
|
SSL_set_options(tls->ssl, SSL_OP_NO_TLSv1_1);
|
|
|
|
#ifdef MG_ENABLE_OPENSSL_NO_COMPRESSION
|
|
|
|
SSL_set_options(tls->ssl, SSL_OP_NO_COMPRESSION);
|
|
|
|
#endif
|
|
|
|
#ifdef MG_ENABLE_OPENSSL_CIPHER_SERVER_PREFERENCE
|
|
|
|
SSL_set_options(tls->ssl, SSL_OP_CIPHER_SERVER_PREFERENCE);
|
|
|
|
#endif
|
2022-06-09 19:39:48 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
if (opts->ca != NULL && opts->ca[0] != '\0') {
|
|
|
|
SSL_set_verify(tls->ssl, SSL_VERIFY_PEER | SSL_VERIFY_FAIL_IF_NO_PEER_CERT,
|
|
|
|
NULL);
|
|
|
|
if ((rc = SSL_CTX_load_verify_locations(tls->ctx, opts->ca, NULL)) != 1) {
|
|
|
|
mg_error(c, "parse(%s): err %d", opts->ca, mg_tls_err(tls, rc));
|
|
|
|
goto fail;
|
2022-06-09 19:39:48 +08:00
|
|
|
}
|
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
if (opts->cert != NULL && opts->cert[0] != '\0') {
|
|
|
|
const char *key = opts->certkey;
|
|
|
|
if (key == NULL) key = opts->cert;
|
|
|
|
if ((rc = SSL_use_certificate_file(tls->ssl, opts->cert, 1)) != 1) {
|
|
|
|
mg_error(c, "Invalid SSL cert, err %d", mg_tls_err(tls, rc));
|
|
|
|
goto fail;
|
|
|
|
} else if ((rc = SSL_use_PrivateKey_file(tls->ssl, key, 1)) != 1) {
|
|
|
|
mg_error(c, "Invalid SSL key, err %d", mg_tls_err(tls, rc));
|
|
|
|
goto fail;
|
|
|
|
#if OPENSSL_VERSION_NUMBER > 0x10100000L
|
|
|
|
} else if ((rc = SSL_use_certificate_chain_file(tls->ssl, opts->cert)) !=
|
|
|
|
1) {
|
2022-06-23 20:11:04 +08:00
|
|
|
mg_error(c, "Invalid chain, err %d", mg_tls_err(tls, rc));
|
2022-06-12 00:29:45 +08:00
|
|
|
goto fail;
|
|
|
|
#endif
|
|
|
|
} else {
|
|
|
|
SSL_set_mode(tls->ssl, SSL_MODE_ACCEPT_MOVING_WRITE_BUFFER);
|
|
|
|
#if OPENSSL_VERSION_NUMBER > 0x10002000L
|
|
|
|
SSL_set_ecdh_auto(tls->ssl, 1);
|
|
|
|
#endif
|
|
|
|
}
|
2022-06-09 19:39:48 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
#if OPENSSL_VERSION_NUMBER > 0x10002000L
|
|
|
|
if (opts->srvname.len > 0) {
|
|
|
|
char mem[128], *buf = mem;
|
|
|
|
size_t len = mg_asprintf(&buf, sizeof(mem), "%.*s", (int) opts->srvname.len,
|
|
|
|
opts->srvname.ptr);
|
|
|
|
X509_VERIFY_PARAM_set1_host(SSL_get0_param(tls->ssl), buf, len);
|
|
|
|
if (buf != mem) free(buf);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
if (opts->ciphers != NULL) SSL_set_cipher_list(tls->ssl, opts->ciphers);
|
|
|
|
if (opts->srvname.len > 0) {
|
|
|
|
char mem[128], *buf = mem;
|
|
|
|
mg_asprintf(&buf, sizeof(mem), "%.*s", (int) opts->srvname.len,
|
|
|
|
opts->srvname.ptr);
|
|
|
|
SSL_set_tlsext_host_name(tls->ssl, buf);
|
|
|
|
if (buf != mem) free(buf);
|
|
|
|
}
|
|
|
|
c->tls = tls;
|
|
|
|
c->is_tls = 1;
|
|
|
|
c->is_tls_hs = 1;
|
|
|
|
if (c->is_client && c->is_resolving == 0 && c->is_connecting == 0) {
|
|
|
|
mg_tls_handshake(c);
|
|
|
|
}
|
|
|
|
MG_DEBUG(("%lu SSL %s OK", c->id, c->is_accepted ? "accept" : "client"));
|
|
|
|
return;
|
|
|
|
fail:
|
|
|
|
c->is_closing = 1;
|
|
|
|
free(tls);
|
2022-06-09 19:39:48 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
void mg_tls_handshake(struct mg_connection *c) {
|
|
|
|
struct mg_tls *tls = (struct mg_tls *) c->tls;
|
|
|
|
int rc;
|
|
|
|
SSL_set_fd(tls->ssl, (int) (size_t) c->fd);
|
|
|
|
rc = c->is_client ? SSL_connect(tls->ssl) : SSL_accept(tls->ssl);
|
|
|
|
if (rc == 1) {
|
|
|
|
MG_DEBUG(("%lu success", c->id));
|
|
|
|
c->is_tls_hs = 0;
|
|
|
|
} else {
|
|
|
|
int code = mg_tls_err(tls, rc);
|
|
|
|
if (code != 0) mg_error(c, "tls hs: rc %d, err %d", rc, code);
|
|
|
|
}
|
2022-06-10 16:38:36 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
void mg_tls_free(struct mg_connection *c) {
|
|
|
|
struct mg_tls *tls = (struct mg_tls *) c->tls;
|
|
|
|
if (tls == NULL) return;
|
|
|
|
SSL_free(tls->ssl);
|
|
|
|
SSL_CTX_free(tls->ctx);
|
|
|
|
free(tls);
|
|
|
|
c->tls = NULL;
|
2022-06-10 16:38:36 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
size_t mg_tls_pending(struct mg_connection *c) {
|
|
|
|
struct mg_tls *tls = (struct mg_tls *) c->tls;
|
|
|
|
return tls == NULL ? 0 : (size_t) SSL_pending(tls->ssl);
|
2022-06-10 16:38:36 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
long mg_tls_recv(struct mg_connection *c, void *buf, size_t len) {
|
|
|
|
struct mg_tls *tls = (struct mg_tls *) c->tls;
|
|
|
|
int n = SSL_read(tls->ssl, buf, (int) len);
|
|
|
|
return n == 0 ? -1 : n < 0 && mg_tls_err(tls, n) == 0 ? 0 : n;
|
|
|
|
}
|
2022-06-10 16:38:36 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
long mg_tls_send(struct mg_connection *c, const void *buf, size_t len) {
|
|
|
|
struct mg_tls *tls = (struct mg_tls *) c->tls;
|
|
|
|
int n = SSL_write(tls->ssl, buf, (int) len);
|
|
|
|
return n == 0 ? -1 : n < 0 && mg_tls_err(tls, n) == 0 ? 0 : n;
|
2022-06-10 16:38:36 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
#endif
|
2022-06-10 16:38:36 +08:00
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
#ifdef MG_ENABLE_LINES
|
2022-06-12 00:29:45 +08:00
|
|
|
#line 1 "src/url.c"
|
2017-05-10 00:07:00 +08:00
|
|
|
#endif
|
2017-02-09 01:34:28 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
#include <stdlib.h>
|
2016-10-12 02:20:28 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
struct url {
|
|
|
|
size_t key, user, pass, host, port, uri, end;
|
|
|
|
};
|
2016-10-12 02:20:28 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
int mg_url_is_ssl(const char *url) {
|
|
|
|
return strncmp(url, "wss:", 4) == 0 || strncmp(url, "https:", 6) == 0 ||
|
|
|
|
strncmp(url, "mqtts:", 6) == 0 || strncmp(url, "ssl:", 4) == 0 ||
|
|
|
|
strncmp(url, "tls:", 4) == 0;
|
|
|
|
}
|
2017-05-10 00:07:00 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static struct url urlparse(const char *url) {
|
|
|
|
size_t i;
|
|
|
|
struct url u;
|
|
|
|
memset(&u, 0, sizeof(u));
|
|
|
|
for (i = 0; url[i] != '\0'; i++) {
|
|
|
|
if (i > 0 && u.host == 0 && url[i - 1] == '/' && url[i] == '/') {
|
|
|
|
u.host = i + 1;
|
|
|
|
u.port = 0;
|
|
|
|
} else if (url[i] == ']') {
|
|
|
|
u.port = 0; // IPv6 URLs, like http://[::1]/bar
|
|
|
|
} else if (url[i] == ':' && u.port == 0 && u.uri == 0) {
|
|
|
|
u.port = i + 1;
|
|
|
|
} else if (url[i] == '@' && u.user == 0 && u.pass == 0) {
|
|
|
|
u.user = u.host;
|
|
|
|
u.pass = u.port;
|
|
|
|
u.host = i + 1;
|
|
|
|
u.port = 0;
|
|
|
|
} else if (u.host && u.uri == 0 && url[i] == '/') {
|
|
|
|
u.uri = i;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
u.end = i;
|
|
|
|
#if 0
|
|
|
|
printf("[%s] %d %d %d %d %d\n", url, u.user, u.pass, u.host, u.port, u.uri);
|
|
|
|
#endif
|
|
|
|
return u;
|
|
|
|
}
|
2022-05-15 21:29:34 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
struct mg_str mg_url_host(const char *url) {
|
|
|
|
struct url u = urlparse(url);
|
|
|
|
size_t n = u.port ? u.port - u.host - 1
|
|
|
|
: u.uri ? u.uri - u.host
|
|
|
|
: u.end - u.host;
|
|
|
|
struct mg_str s = mg_str_n(url + u.host, n);
|
|
|
|
return s;
|
2017-05-10 00:07:00 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
const char *mg_url_uri(const char *url) {
|
|
|
|
struct url u = urlparse(url);
|
|
|
|
return u.uri ? url + u.uri : "/";
|
2017-02-16 20:07:06 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
unsigned short mg_url_port(const char *url) {
|
|
|
|
struct url u = urlparse(url);
|
|
|
|
unsigned short port = 0;
|
|
|
|
if (strncmp(url, "http:", 5) == 0 || strncmp(url, "ws:", 3) == 0) port = 80;
|
|
|
|
if (strncmp(url, "wss:", 4) == 0 || strncmp(url, "https:", 6) == 0)
|
|
|
|
port = 443;
|
|
|
|
if (strncmp(url, "mqtt:", 5) == 0) port = 1883;
|
|
|
|
if (strncmp(url, "mqtts:", 6) == 0) port = 8883;
|
|
|
|
if (u.port) port = (unsigned short) atoi(url + u.port);
|
|
|
|
return port;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct mg_str mg_url_user(const char *url) {
|
|
|
|
struct url u = urlparse(url);
|
|
|
|
struct mg_str s = mg_str("");
|
|
|
|
if (u.user && (u.pass || u.host)) {
|
|
|
|
size_t n = u.pass ? u.pass - u.user - 1 : u.host - u.user - 1;
|
|
|
|
s = mg_str_n(url + u.user, n);
|
|
|
|
}
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct mg_str mg_url_pass(const char *url) {
|
|
|
|
struct url u = urlparse(url);
|
|
|
|
struct mg_str s = mg_str_n("", 0UL);
|
|
|
|
if (u.pass && u.host) {
|
|
|
|
size_t n = u.host - u.pass - 1;
|
|
|
|
s = mg_str_n(url + u.pass, n);
|
2016-10-12 02:20:28 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
return s;
|
2016-10-12 02:20:28 +08:00
|
|
|
}
|
|
|
|
|
2020-12-05 19:26:32 +08:00
|
|
|
#ifdef MG_ENABLE_LINES
|
2022-06-12 00:29:45 +08:00
|
|
|
#line 1 "src/util.c"
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
#if MG_ARCH == MG_ARCH_UNIX && defined(__APPLE__)
|
|
|
|
#include <mach/mach_time.h>
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#if MG_ENABLE_CUSTOM_RANDOM
|
|
|
|
#else
|
|
|
|
void mg_random(void *buf, size_t len) {
|
|
|
|
bool done = false;
|
|
|
|
unsigned char *p = (unsigned char *) buf;
|
|
|
|
#if MG_ARCH == MG_ARCH_ESP32
|
|
|
|
while (len--) *p++ = (unsigned char) (esp_random() & 255);
|
|
|
|
done = true;
|
|
|
|
#elif MG_ARCH == MG_ARCH_WIN32
|
|
|
|
#elif MG_ARCH == MG_ARCH_UNIX
|
|
|
|
FILE *fp = fopen("/dev/urandom", "rb");
|
|
|
|
if (fp != NULL) {
|
|
|
|
if (fread(buf, 1, len, fp) == len) done = true;
|
|
|
|
fclose(fp);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
// If everything above did not work, fallback to a pseudo random generator
|
|
|
|
while (!done && len--) *p++ = (unsigned char) (rand() & 255);
|
|
|
|
}
|
2020-12-05 19:26:32 +08:00
|
|
|
#endif
|
2017-05-10 00:07:00 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
uint32_t mg_ntohl(uint32_t net) {
|
|
|
|
uint8_t data[4] = {0, 0, 0, 0};
|
|
|
|
memcpy(&data, &net, sizeof(data));
|
|
|
|
return (((uint32_t) data[3]) << 0) | (((uint32_t) data[2]) << 8) |
|
|
|
|
(((uint32_t) data[1]) << 16) | (((uint32_t) data[0]) << 24);
|
|
|
|
}
|
2016-10-12 02:20:28 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
uint16_t mg_ntohs(uint16_t net) {
|
|
|
|
uint8_t data[2] = {0, 0};
|
|
|
|
memcpy(&data, &net, sizeof(data));
|
|
|
|
return (uint16_t) ((uint16_t) data[1] | (((uint16_t) data[0]) << 8));
|
2021-12-14 20:42:41 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
|
|
|
|
uint32_t mg_crc32(uint32_t crc, const char *buf, size_t len) {
|
|
|
|
int i;
|
|
|
|
crc = ~crc;
|
|
|
|
while (len--) {
|
|
|
|
crc ^= *(unsigned char *) buf++;
|
|
|
|
for (i = 0; i < 8; i++) crc = crc & 1 ? (crc >> 1) ^ 0xedb88320 : crc >> 1;
|
|
|
|
}
|
|
|
|
return ~crc;
|
2021-12-14 20:42:41 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
|
|
|
|
static int isbyte(int n) {
|
|
|
|
return n >= 0 && n <= 255;
|
2021-12-14 20:42:41 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
|
|
|
|
static int parse_net(const char *spec, uint32_t *net, uint32_t *mask) {
|
|
|
|
int n, a, b, c, d, slash = 32, len = 0;
|
|
|
|
if ((sscanf(spec, "%d.%d.%d.%d/%d%n", &a, &b, &c, &d, &slash, &n) == 5 ||
|
|
|
|
sscanf(spec, "%d.%d.%d.%d%n", &a, &b, &c, &d, &n) == 4) &&
|
|
|
|
isbyte(a) && isbyte(b) && isbyte(c) && isbyte(d) && slash >= 0 &&
|
|
|
|
slash < 33) {
|
|
|
|
len = n;
|
|
|
|
*net = ((uint32_t) a << 24) | ((uint32_t) b << 16) | ((uint32_t) c << 8) |
|
|
|
|
(uint32_t) d;
|
|
|
|
*mask = slash ? (uint32_t) (0xffffffffU << (32 - slash)) : (uint32_t) 0;
|
|
|
|
}
|
|
|
|
return len;
|
2021-12-14 20:42:41 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
|
|
|
|
int mg_check_ip_acl(struct mg_str acl, uint32_t remote_ip) {
|
|
|
|
struct mg_str k, v;
|
|
|
|
int allowed = acl.len == 0 ? '+' : '-'; // If any ACL is set, deny by default
|
|
|
|
while (mg_commalist(&acl, &k, &v)) {
|
|
|
|
uint32_t net, mask;
|
|
|
|
if (k.ptr[0] != '+' && k.ptr[0] != '-') return -1;
|
|
|
|
if (parse_net(&k.ptr[1], &net, &mask) == 0) return -2;
|
|
|
|
if ((mg_ntohl(remote_ip) & mask) == net) allowed = k.ptr[0];
|
|
|
|
}
|
|
|
|
return allowed == '+';
|
2021-12-14 20:42:41 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
|
|
|
|
#if MG_ENABLE_CUSTOM_MILLIS
|
|
|
|
#else
|
|
|
|
uint64_t mg_millis(void) {
|
|
|
|
#if MG_ARCH == MG_ARCH_WIN32
|
|
|
|
return GetTickCount();
|
|
|
|
#elif MG_ARCH == MG_ARCH_ESP32
|
|
|
|
return esp_timer_get_time() / 1000;
|
|
|
|
#elif MG_ARCH == MG_ARCH_ESP8266
|
|
|
|
return xTaskGetTickCount() * portTICK_PERIOD_MS;
|
|
|
|
#elif MG_ARCH == MG_ARCH_FREERTOS_TCP || MG_ARCH == MG_ARCH_FREERTOS_LWIP
|
|
|
|
return xTaskGetTickCount() * portTICK_PERIOD_MS;
|
|
|
|
#elif MG_ARCH == MG_ARCH_AZURERTOS
|
|
|
|
return tx_time_get() * (1000 /* MS per SEC */ / TX_TIMER_TICKS_PER_SECOND);
|
|
|
|
#elif MG_ARCH == MG_ARCH_UNIX
|
|
|
|
struct timespec ts = {0, 0};
|
|
|
|
clock_gettime(CLOCK_REALTIME, &ts);
|
|
|
|
return ((uint64_t) ts.tv_sec * 1000 + (uint64_t) ts.tv_nsec / 1000000);
|
|
|
|
#else
|
|
|
|
return (uint64_t) (time(NULL) * 1000);
|
|
|
|
#endif
|
2022-04-12 16:38:25 +08:00
|
|
|
}
|
2021-12-14 20:42:41 +08:00
|
|
|
#endif
|
2020-12-07 13:46:47 +08:00
|
|
|
|
2021-12-14 20:42:41 +08:00
|
|
|
#ifdef MG_ENABLE_LINES
|
2022-06-12 00:29:45 +08:00
|
|
|
#line 1 "src/ws.c"
|
2021-07-14 00:28:07 +08:00
|
|
|
#endif
|
|
|
|
|
2017-05-10 00:07:00 +08:00
|
|
|
|
2022-01-19 01:11:02 +08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
|
|
|
|
|
|
|
|
struct ws_msg {
|
|
|
|
uint8_t flags;
|
|
|
|
size_t header_len;
|
|
|
|
size_t data_len;
|
|
|
|
};
|
|
|
|
|
|
|
|
size_t mg_ws_vprintf(struct mg_connection *c, int op, const char *fmt,
|
|
|
|
va_list ap) {
|
|
|
|
char mem[256], *buf = mem;
|
|
|
|
size_t len = mg_vasprintf(&buf, sizeof(mem), fmt, ap);
|
|
|
|
len = mg_ws_send(c, buf, len, op);
|
|
|
|
if (buf != mem) free(buf);
|
|
|
|
return len;
|
2022-01-19 01:11:02 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
size_t mg_ws_printf(struct mg_connection *c, int op, const char *fmt, ...) {
|
|
|
|
size_t len = 0;
|
|
|
|
va_list ap;
|
|
|
|
va_start(ap, fmt);
|
|
|
|
len = mg_ws_vprintf(c, op, fmt, ap);
|
|
|
|
va_end(ap);
|
|
|
|
return len;
|
2022-01-19 01:11:02 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static void ws_handshake(struct mg_connection *c, const struct mg_str *wskey,
|
|
|
|
const struct mg_str *wsproto, const char *fmt,
|
|
|
|
va_list ap) {
|
|
|
|
const char *magic = "258EAFA5-E914-47DA-95CA-C5AB0DC85B11";
|
|
|
|
unsigned char sha[20], b64_sha[30];
|
|
|
|
char mem[128], *buf = mem;
|
|
|
|
|
|
|
|
mg_sha1_ctx sha_ctx;
|
|
|
|
mg_sha1_init(&sha_ctx);
|
|
|
|
mg_sha1_update(&sha_ctx, (unsigned char *) wskey->ptr, wskey->len);
|
|
|
|
mg_sha1_update(&sha_ctx, (unsigned char *) magic, 36);
|
|
|
|
mg_sha1_final(sha, &sha_ctx);
|
|
|
|
mg_base64_encode(sha, sizeof(sha), (char *) b64_sha);
|
|
|
|
buf[0] = '\0';
|
|
|
|
if (fmt != NULL) mg_vasprintf(&buf, sizeof(mem), fmt, ap);
|
|
|
|
mg_printf(c,
|
|
|
|
"HTTP/1.1 101 Switching Protocols\r\n"
|
|
|
|
"Upgrade: websocket\r\n"
|
|
|
|
"Connection: Upgrade\r\n"
|
|
|
|
"Sec-WebSocket-Accept: %s\r\n"
|
|
|
|
"%s",
|
|
|
|
b64_sha, buf);
|
|
|
|
if (buf != mem) free(buf);
|
|
|
|
if (wsproto != NULL) {
|
|
|
|
mg_printf(c, "Sec-WebSocket-Protocol: %.*s\r\n", (int) wsproto->len,
|
|
|
|
wsproto->ptr);
|
2016-10-12 02:20:28 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
mg_send(c, "\r\n", 2);
|
2016-10-12 02:20:28 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static size_t ws_process(uint8_t *buf, size_t len, struct ws_msg *msg) {
|
|
|
|
size_t i, n = 0, mask_len = 0;
|
|
|
|
memset(msg, 0, sizeof(*msg));
|
|
|
|
if (len >= 2) {
|
|
|
|
n = buf[1] & 0x7f; // Frame length
|
|
|
|
mask_len = buf[1] & 128 ? 4 : 0; // last bit is a mask bit
|
|
|
|
msg->flags = buf[0];
|
|
|
|
if (n < 126 && len >= mask_len) {
|
|
|
|
msg->data_len = n;
|
|
|
|
msg->header_len = 2 + mask_len;
|
|
|
|
} else if (n == 126 && len >= 4 + mask_len) {
|
|
|
|
msg->header_len = 4 + mask_len;
|
|
|
|
msg->data_len = mg_ntohs(*(uint16_t *) &buf[2]);
|
|
|
|
} else if (len >= 10 + mask_len) {
|
|
|
|
msg->header_len = 10 + mask_len;
|
|
|
|
msg->data_len =
|
|
|
|
(size_t) (((uint64_t) mg_ntohl(*(uint32_t *) &buf[2])) << 32) +
|
|
|
|
mg_ntohl(*(uint32_t *) &buf[6]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
// Sanity check, and integer overflow protection for the boundary check below
|
|
|
|
// data_len should not be larger than 1 Gb
|
|
|
|
if (msg->data_len > 1024 * 1024 * 1024) return 0;
|
|
|
|
if (msg->header_len + msg->data_len > len) return 0;
|
|
|
|
if (mask_len > 0) {
|
|
|
|
uint8_t *p = buf + msg->header_len, *m = p - mask_len;
|
|
|
|
for (i = 0; i < msg->data_len; i++) p[i] ^= m[i & 3];
|
|
|
|
}
|
|
|
|
return msg->header_len + msg->data_len;
|
2016-10-12 02:20:28 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static size_t mkhdr(size_t len, int op, bool is_client, uint8_t *buf) {
|
|
|
|
size_t n = 0;
|
|
|
|
buf[0] = (uint8_t) (op | 128);
|
|
|
|
if (len < 126) {
|
|
|
|
buf[1] = (unsigned char) len;
|
|
|
|
n = 2;
|
|
|
|
} else if (len < 65536) {
|
|
|
|
uint16_t tmp = mg_htons((uint16_t) len);
|
|
|
|
buf[1] = 126;
|
|
|
|
memcpy(&buf[2], &tmp, sizeof(tmp));
|
|
|
|
n = 4;
|
|
|
|
} else {
|
|
|
|
uint32_t tmp;
|
|
|
|
buf[1] = 127;
|
|
|
|
tmp = mg_htonl((uint32_t) ((uint64_t) len >> 32));
|
|
|
|
memcpy(&buf[2], &tmp, sizeof(tmp));
|
|
|
|
tmp = mg_htonl((uint32_t) (len & 0xffffffff));
|
|
|
|
memcpy(&buf[6], &tmp, sizeof(tmp));
|
|
|
|
n = 10;
|
|
|
|
}
|
|
|
|
if (is_client) {
|
|
|
|
buf[1] |= 1 << 7; // Set masking flag
|
|
|
|
mg_random(&buf[n], 4);
|
|
|
|
n += 4;
|
|
|
|
}
|
|
|
|
return n;
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static void mg_ws_mask(struct mg_connection *c, size_t len) {
|
|
|
|
if (c->is_client && c->send.buf != NULL) {
|
|
|
|
size_t i;
|
|
|
|
uint8_t *p = c->send.buf + c->send.len - len, *mask = p - 4;
|
|
|
|
for (i = 0; i < len; i++) p[i] ^= mask[i & 3];
|
|
|
|
}
|
2021-07-14 00:28:07 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
size_t mg_ws_send(struct mg_connection *c, const char *buf, size_t len,
|
|
|
|
int op) {
|
|
|
|
uint8_t header[14];
|
|
|
|
size_t header_len = mkhdr(len, op, c->is_client, header);
|
|
|
|
mg_send(c, header, header_len);
|
|
|
|
MG_VERBOSE(("WS out: %d [%.*s]", (int) len, (int) len, buf));
|
|
|
|
mg_send(c, buf, len);
|
|
|
|
mg_ws_mask(c, len);
|
|
|
|
return header_len + len;
|
2022-01-19 01:11:02 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static void mg_ws_cb(struct mg_connection *c, int ev, void *ev_data,
|
|
|
|
void *fn_data) {
|
|
|
|
struct ws_msg msg;
|
|
|
|
size_t ofs = (size_t) c->pfn_data;
|
|
|
|
|
|
|
|
// assert(ofs < c->recv.len);
|
|
|
|
if (ev == MG_EV_READ) {
|
|
|
|
if (!c->is_websocket && c->is_client) {
|
|
|
|
int n = mg_http_get_request_len(c->recv.buf, c->recv.len);
|
|
|
|
if (n < 0) {
|
|
|
|
c->is_closing = 1; // Some just, not an HTTP request
|
|
|
|
} else if (n > 0) {
|
|
|
|
if (n < 15 || memcmp(c->recv.buf + 9, "101", 3) != 0) {
|
|
|
|
MG_ERROR(("%lu WS handshake error: %.*s", c->id, 15, c->recv.buf));
|
|
|
|
c->is_closing = 1;
|
|
|
|
} else {
|
|
|
|
struct mg_http_message hm;
|
|
|
|
mg_http_parse((char *) c->recv.buf, c->recv.len, &hm);
|
|
|
|
c->is_websocket = 1;
|
|
|
|
mg_call(c, MG_EV_WS_OPEN, &hm);
|
|
|
|
}
|
|
|
|
mg_iobuf_del(&c->recv, 0, (size_t) n);
|
|
|
|
} else {
|
|
|
|
return; // A request is not yet received
|
|
|
|
}
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
|
|
|
|
while (ws_process(c->recv.buf + ofs, c->recv.len - ofs, &msg) > 0) {
|
|
|
|
char *s = (char *) c->recv.buf + ofs + msg.header_len;
|
|
|
|
struct mg_ws_message m = {{s, msg.data_len}, msg.flags};
|
|
|
|
size_t len = msg.header_len + msg.data_len;
|
|
|
|
uint8_t final = msg.flags & 128, op = msg.flags & 15;
|
|
|
|
// MG_VERBOSE ("fin %d op %d len %d [%.*s]", final, op,
|
|
|
|
// (int) m.data.len, (int) m.data.len, m.data.ptr));
|
|
|
|
switch (op) {
|
|
|
|
case WEBSOCKET_OP_CONTINUE:
|
|
|
|
mg_call(c, MG_EV_WS_CTL, &m);
|
|
|
|
break;
|
|
|
|
case WEBSOCKET_OP_PING:
|
|
|
|
MG_DEBUG(("%s", "WS PONG"));
|
|
|
|
mg_ws_send(c, s, msg.data_len, WEBSOCKET_OP_PONG);
|
|
|
|
mg_call(c, MG_EV_WS_CTL, &m);
|
|
|
|
break;
|
|
|
|
case WEBSOCKET_OP_PONG:
|
|
|
|
mg_call(c, MG_EV_WS_CTL, &m);
|
|
|
|
break;
|
|
|
|
case WEBSOCKET_OP_TEXT:
|
|
|
|
case WEBSOCKET_OP_BINARY:
|
|
|
|
if (final) mg_call(c, MG_EV_WS_MSG, &m);
|
|
|
|
break;
|
|
|
|
case WEBSOCKET_OP_CLOSE:
|
|
|
|
MG_DEBUG(("%lu Got WS CLOSE", c->id));
|
|
|
|
mg_call(c, MG_EV_WS_CTL, &m);
|
|
|
|
mg_ws_send(c, "", 0, WEBSOCKET_OP_CLOSE);
|
|
|
|
c->is_draining = 1;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
// Per RFC6455, close conn when an unknown op is recvd
|
|
|
|
mg_error(c, "unknown WS op %d", op);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Handle fragmented frames: strip header, keep in c->recv
|
|
|
|
if (final == 0 || op == 0) {
|
|
|
|
if (op) ofs++, len--, msg.header_len--; // First frame
|
|
|
|
mg_iobuf_del(&c->recv, ofs, msg.header_len); // Strip header
|
|
|
|
len -= msg.header_len;
|
|
|
|
ofs += len;
|
|
|
|
c->pfn_data = (void *) ofs;
|
|
|
|
// MG_INFO(("FRAG %d [%.*s]", (int) ofs, (int) ofs, c->recv.buf));
|
|
|
|
}
|
|
|
|
// Remove non-fragmented frame
|
|
|
|
if (final && op) mg_iobuf_del(&c->recv, ofs, len);
|
|
|
|
// Last chunk of the fragmented frame
|
|
|
|
if (final && !op) {
|
|
|
|
m.flags = c->recv.buf[0];
|
|
|
|
m.data = mg_str_n((char *) &c->recv.buf[1], (size_t) (ofs - 1));
|
|
|
|
mg_call(c, MG_EV_WS_MSG, &m);
|
|
|
|
mg_iobuf_del(&c->recv, 0, ofs);
|
|
|
|
ofs = 0;
|
|
|
|
c->pfn_data = NULL;
|
|
|
|
}
|
2021-01-30 21:03:11 +08:00
|
|
|
}
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
(void) fn_data;
|
|
|
|
(void) ev_data;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct mg_connection *mg_ws_connect(struct mg_mgr *mgr, const char *url,
|
|
|
|
mg_event_handler_t fn, void *fn_data,
|
|
|
|
const char *fmt, ...) {
|
|
|
|
struct mg_connection *c = mg_connect(mgr, url, fn, fn_data);
|
|
|
|
if (c != NULL) {
|
|
|
|
char nonce[16], key[30], mem1[128], mem2[256], *buf1 = mem1, *buf2 = mem2;
|
|
|
|
struct mg_str host = mg_url_host(url);
|
|
|
|
size_t n1 = 0, n2 = 0;
|
|
|
|
nonce[0] = key[0] = mem1[0] = mem2[0] = '\0';
|
|
|
|
if (fmt != NULL) {
|
|
|
|
va_list ap;
|
|
|
|
va_start(ap, fmt);
|
|
|
|
n1 = mg_vasprintf(&buf1, sizeof(mem1), fmt, ap);
|
|
|
|
va_end(ap);
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
// Send handshake request
|
|
|
|
mg_random(nonce, sizeof(nonce));
|
|
|
|
mg_base64_encode((unsigned char *) nonce, sizeof(nonce), key);
|
|
|
|
n2 = mg_asprintf(&buf2, sizeof(mem2),
|
|
|
|
"GET %s HTTP/1.1\r\n"
|
|
|
|
"Upgrade: websocket\r\n"
|
|
|
|
"Host: %.*s\r\n"
|
|
|
|
"Connection: Upgrade\r\n"
|
|
|
|
"%.*s"
|
|
|
|
"Sec-WebSocket-Version: 13\r\n"
|
|
|
|
"Sec-WebSocket-Key: %s\r\n"
|
|
|
|
"\r\n",
|
|
|
|
mg_url_uri(url), (int) host.len, host.ptr, (int) n1, buf1,
|
|
|
|
key);
|
|
|
|
mg_send(c, buf2, n2);
|
|
|
|
if (buf1 != mem1) free(buf1);
|
|
|
|
if (buf2 != mem2) free(buf2);
|
|
|
|
c->pfn = mg_ws_cb;
|
|
|
|
c->pfn_data = NULL;
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
return c;
|
2017-05-10 00:07:00 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
void mg_ws_upgrade(struct mg_connection *c, struct mg_http_message *hm,
|
|
|
|
const char *fmt, ...) {
|
|
|
|
struct mg_str *wskey = mg_http_get_header(hm, "Sec-WebSocket-Key");
|
|
|
|
c->pfn = mg_ws_cb;
|
|
|
|
c->pfn_data = NULL;
|
|
|
|
if (wskey == NULL) {
|
|
|
|
mg_http_reply(c, 426, "", "WS upgrade expected\n");
|
|
|
|
c->is_draining = 1;
|
|
|
|
} else {
|
|
|
|
struct mg_str *wsproto = mg_http_get_header(hm, "Sec-WebSocket-Protocol");
|
|
|
|
va_list ap;
|
|
|
|
va_start(ap, fmt);
|
|
|
|
ws_handshake(c, wskey, wsproto, fmt, ap);
|
|
|
|
va_end(ap);
|
|
|
|
c->is_websocket = 1;
|
|
|
|
mg_call(c, MG_EV_WS_OPEN, hm);
|
|
|
|
}
|
2022-04-12 16:38:25 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
size_t mg_ws_wrap(struct mg_connection *c, size_t len, int op) {
|
|
|
|
uint8_t header[14], *p;
|
|
|
|
size_t header_len = mkhdr(len, op, c->is_client, header);
|
|
|
|
|
|
|
|
// NOTE: order of operations is important!
|
|
|
|
mg_iobuf_add(&c->send, c->send.len, NULL, header_len, MG_IO_SIZE);
|
|
|
|
p = &c->send.buf[c->send.len - len]; // p points to data
|
|
|
|
memmove(p, p - header_len, len); // Shift data
|
|
|
|
memcpy(p - header_len, header, header_len); // Prepend header
|
|
|
|
mg_ws_mask(c, len); // Mask data
|
2016-10-12 02:20:28 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
return c->send.len;
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
2016-10-12 02:20:28 +08:00
|
|
|
|
2021-12-14 20:42:41 +08:00
|
|
|
#ifdef MG_ENABLE_LINES
|
2022-06-12 00:29:45 +08:00
|
|
|
#line 1 "mip/driver_stm32.c"
|
2021-12-14 20:42:41 +08:00
|
|
|
#endif
|
2022-06-12 00:29:45 +08:00
|
|
|
// Copyright (c) 2022 Cesanta Software Limited
|
|
|
|
// All rights reserved
|
2021-01-24 01:47:51 +08:00
|
|
|
|
2016-10-12 02:20:28 +08:00
|
|
|
|
2021-08-30 18:45:30 +08:00
|
|
|
|
2022-06-13 08:04:09 +08:00
|
|
|
#if MG_ENABLE_MIP && defined(__arm__)
|
2022-06-12 00:29:45 +08:00
|
|
|
|
|
|
|
struct stm32_eth {
|
2022-06-21 19:11:59 +08:00
|
|
|
volatile uint32_t MACCR, MACFFR, MACHTHR, MACHTLR, MACMIIAR, MACMIIDR, MACFCR,
|
2022-06-12 00:29:45 +08:00
|
|
|
MACVLANTR, RESERVED0[2], MACRWUFFR, MACPMTCSR, RESERVED1, MACDBGR, MACSR,
|
|
|
|
MACIMR, MACA0HR, MACA0LR, MACA1HR, MACA1LR, MACA2HR, MACA2LR, MACA3HR,
|
|
|
|
MACA3LR, RESERVED2[40], MMCCR, MMCRIR, MMCTIR, MMCRIMR, MMCTIMR,
|
|
|
|
RESERVED3[14], MMCTGFSCCR, MMCTGFMSCCR, RESERVED4[5], MMCTGFCR,
|
|
|
|
RESERVED5[10], MMCRFCECR, MMCRFAECR, RESERVED6[10], MMCRGUFCR,
|
|
|
|
RESERVED7[334], PTPTSCR, PTPSSIR, PTPTSHR, PTPTSLR, PTPTSHUR, PTPTSLUR,
|
|
|
|
PTPTSAR, PTPTTHR, PTPTTLR, RESERVED8, PTPTSSR, PTPPPSCR, RESERVED9[564],
|
|
|
|
DMABMR, DMATPDR, DMARPDR, DMARDLAR, DMATDLAR, DMASR, DMAOMR, DMAIER,
|
|
|
|
DMAMFBOCR, DMARSWTR, RESERVED10[8], DMACHTDR, DMACHRDR, DMACHTBAR,
|
|
|
|
DMACHRBAR;
|
|
|
|
};
|
|
|
|
#define ETH ((struct stm32_eth *) (uintptr_t) 0x40028000)
|
|
|
|
|
|
|
|
#define BIT(x) ((uint32_t) 1 << (x))
|
|
|
|
#define ETH_PKT_SIZE 1540 // Max frame size
|
|
|
|
#define ETH_DESC_CNT 4 // Descriptors count
|
|
|
|
#define ETH_DS 4 // Descriptor size (words)
|
|
|
|
|
|
|
|
static uint32_t s_rxdesc[ETH_DESC_CNT][ETH_DS]; // RX descriptors
|
|
|
|
static uint32_t s_txdesc[ETH_DESC_CNT][ETH_DS]; // TX descriptors
|
|
|
|
static uint8_t s_rxbuf[ETH_DESC_CNT][ETH_PKT_SIZE]; // RX ethernet buffers
|
|
|
|
static uint8_t s_txbuf[ETH_DESC_CNT][ETH_PKT_SIZE]; // TX ethernet buffers
|
|
|
|
static void (*s_rx)(void *, size_t, void *); // Recv callback
|
|
|
|
static void *s_rxdata; // Recv callback data
|
|
|
|
static void *s_userdata; // Driver data
|
|
|
|
enum { PHY_ADDR = 0, PHY_BCR = 0, PHY_BSR = 1 }; // PHY constants
|
|
|
|
|
|
|
|
static inline void spin(volatile uint32_t count) {
|
|
|
|
while (count--) asm("nop");
|
|
|
|
}
|
|
|
|
|
|
|
|
static uint32_t eth_read_phy(uint8_t addr, uint8_t reg) {
|
|
|
|
ETH->MACMIIAR &= (7 << 2);
|
|
|
|
ETH->MACMIIAR |= ((uint32_t) addr << 11) | ((uint32_t) reg << 6);
|
|
|
|
ETH->MACMIIAR |= BIT(0);
|
|
|
|
while (ETH->MACMIIAR & BIT(0)) spin(1);
|
|
|
|
return ETH->MACMIIDR;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void eth_write_phy(uint8_t addr, uint8_t reg, uint32_t val) {
|
|
|
|
ETH->MACMIIDR = val;
|
|
|
|
ETH->MACMIIAR &= (7 << 2);
|
|
|
|
ETH->MACMIIAR |= ((uint32_t) addr << 11) | ((uint32_t) reg << 6) | BIT(1);
|
|
|
|
ETH->MACMIIAR |= BIT(0);
|
|
|
|
while (ETH->MACMIIAR & BIT(0)) spin(1);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void mip_driver_stm32_init(void *userdata) {
|
|
|
|
s_userdata = userdata;
|
|
|
|
|
|
|
|
// Init RX descriptors
|
|
|
|
for (int i = 0; i < ETH_DESC_CNT; i++) {
|
|
|
|
s_rxdesc[i][0] = BIT(31); // Own
|
|
|
|
s_rxdesc[i][1] = sizeof(s_rxbuf[i]) | BIT(14); // 2nd address chained
|
|
|
|
s_rxdesc[i][2] = (uint32_t) (uintptr_t) s_rxbuf[i]; // Point to data buffer
|
|
|
|
s_rxdesc[i][3] =
|
|
|
|
(uint32_t) (uintptr_t) s_rxdesc[(i + 1) % ETH_DESC_CNT]; // Chain
|
|
|
|
}
|
|
|
|
|
|
|
|
// Init TX descriptors
|
|
|
|
for (int i = 0; i < ETH_DESC_CNT; i++) {
|
|
|
|
s_txdesc[i][2] = (uint32_t) (uintptr_t) s_txbuf[i]; // Buf pointer
|
|
|
|
s_txdesc[i][3] =
|
|
|
|
(uint32_t) (uintptr_t) s_txdesc[(i + 1) % ETH_DESC_CNT]; // Chain
|
|
|
|
}
|
|
|
|
|
|
|
|
ETH->DMABMR |= BIT(0); // Software reset
|
|
|
|
while ((ETH->DMABMR & BIT(0)) != 0) spin(1); // Wait until done
|
|
|
|
// NOTE(cpq): we do not use extended descriptor bit 7, and do not use
|
|
|
|
// hardware checksum. Therefore, descriptor size is 4, not 8
|
|
|
|
// ETH->DMABMR = BIT(13) | BIT(16) | BIT(22) | BIT(23) | BIT(25);
|
|
|
|
ETH->MACIMR = BIT(3) | BIT(9); // Mask timestamp & PMT IT
|
|
|
|
ETH->MACMIIAR = 4 << 2; // MDC clock 150-216 MHz, 38.8.1
|
|
|
|
ETH->MACFCR = BIT(7); // Disable zero quarta pause
|
|
|
|
ETH->MACFFR = BIT(31); // Receive all
|
|
|
|
eth_write_phy(PHY_ADDR, PHY_BCR, BIT(15)); // Reset PHY
|
|
|
|
eth_write_phy(PHY_ADDR, PHY_BCR, BIT(12)); // Set autonegotiation
|
|
|
|
ETH->DMARDLAR = (uint32_t) (uintptr_t) s_rxdesc; // RX descriptors
|
|
|
|
ETH->DMATDLAR = (uint32_t) (uintptr_t) s_txdesc; // RX descriptors
|
|
|
|
ETH->DMAIER = BIT(6) | BIT(16); // RIE, NISE
|
|
|
|
ETH->MACCR = BIT(2) | BIT(3) | BIT(11) | BIT(14); // RE, TE, Duplex, Fast
|
|
|
|
ETH->DMAOMR = BIT(1) | BIT(13) | BIT(21) | BIT(25); // SR, ST, TSF, RSF
|
|
|
|
}
|
|
|
|
|
|
|
|
static void mip_driver_stm32_setrx(void (*rx)(void *, size_t, void *),
|
|
|
|
void *rxdata) {
|
|
|
|
s_rx = rx;
|
|
|
|
s_rxdata = rxdata;
|
|
|
|
}
|
|
|
|
|
|
|
|
static uint32_t s_txno;
|
|
|
|
static size_t mip_driver_stm32_tx(const void *buf, size_t len, void *userdata) {
|
|
|
|
if (len > sizeof(s_txbuf[s_txno])) {
|
|
|
|
printf("%s: frame too big, %ld\n", __func__, (long) len);
|
|
|
|
len = 0; // Frame is too big
|
|
|
|
} else if ((s_txdesc[s_txno][0] & BIT(31))) {
|
|
|
|
printf("%s: no free descr\n", __func__);
|
|
|
|
len = 0; // All descriptors are busy, fail
|
|
|
|
} else {
|
|
|
|
memcpy(s_txbuf[s_txno], buf, len); // Copy data
|
|
|
|
s_txdesc[s_txno][1] = (uint32_t) len; // Set data len
|
|
|
|
s_txdesc[s_txno][0] = BIT(20) | BIT(28) | BIT(29) | BIT(30); // Chain,FS,LS
|
|
|
|
s_txdesc[s_txno][0] |= BIT(31); // Set OWN bit - let DMA take over
|
|
|
|
if (++s_txno >= ETH_DESC_CNT) s_txno = 0;
|
|
|
|
}
|
|
|
|
uint32_t sr = ETH->DMASR;
|
|
|
|
if (sr & BIT(2)) ETH->DMASR = BIT(2), ETH->DMATPDR = 0; // Resume
|
|
|
|
if (sr & BIT(5)) ETH->DMASR = BIT(5), ETH->DMATPDR = 0; // if busy
|
|
|
|
if (len == 0) printf("E: D0 %lx SR %lx\n", (long) s_txdesc[0][0], (long) sr);
|
|
|
|
return len;
|
|
|
|
(void) userdata;
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static bool mip_driver_stm32_status(void *userdata) {
|
|
|
|
uint32_t bsr = eth_read_phy(PHY_ADDR, PHY_BSR);
|
|
|
|
return bsr & BIT(2) ? 1 : 0;
|
|
|
|
(void) userdata;
|
|
|
|
}
|
2021-01-26 20:16:58 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
void ETH_IRQHandler(void);
|
|
|
|
void ETH_IRQHandler(void) {
|
|
|
|
volatile uint32_t sr = ETH->DMASR;
|
|
|
|
if (sr & BIT(6)) { // Frame received, loop
|
|
|
|
for (uint32_t i = 0; i < ETH_DESC_CNT; i++) {
|
|
|
|
if (s_rxdesc[i][0] & BIT(31)) continue;
|
|
|
|
uint32_t len = ((s_rxdesc[i][0] >> 16) & (BIT(14) - 1));
|
|
|
|
// printf("%lx %lu %lx %lx\n", i, len, s_rxdesc[i][0], sr);
|
|
|
|
if (s_rx != NULL) s_rx(s_rxbuf[i], len > 4 ? len - 4 : len, s_rxdata);
|
|
|
|
s_rxdesc[i][0] = BIT(31);
|
|
|
|
}
|
2021-01-26 20:16:58 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
if (sr & BIT(7)) ETH->DMARPDR = 0; // Resume RX
|
|
|
|
ETH->DMASR = sr & ~(BIT(2) | BIT(7)); // Clear status
|
|
|
|
}
|
2021-01-26 20:16:58 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
struct mip_driver mip_driver_stm32 = {.init = mip_driver_stm32_init,
|
|
|
|
.tx = mip_driver_stm32_tx,
|
|
|
|
.rxcb = mip_driver_stm32_setrx,
|
|
|
|
.status = mip_driver_stm32_status};
|
|
|
|
#endif // MG_ENABLE_MIP
|
2020-12-05 19:26:32 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
#ifdef MG_ENABLE_LINES
|
|
|
|
#line 1 "mip/mip.c"
|
2020-12-05 19:26:32 +08:00
|
|
|
#endif
|
2022-06-12 00:29:45 +08:00
|
|
|
|
|
|
|
|
|
|
|
#if MG_ENABLE_MIP
|
2022-06-12 01:54:32 +08:00
|
|
|
|
|
|
|
#if defined(_MSC_VER)
|
|
|
|
#define _Atomic
|
|
|
|
#define NET16(x) _byteswap_ushort(x)
|
|
|
|
#define NET32(x) _byteswap_ulong(x)
|
|
|
|
#else
|
2022-06-12 00:29:45 +08:00
|
|
|
#include <stdatomic.h>
|
|
|
|
#define NET16(x) __builtin_bswap16(x)
|
|
|
|
#define NET32(x) __builtin_bswap32(x)
|
2022-06-12 01:54:32 +08:00
|
|
|
#endif
|
|
|
|
|
|
|
|
#define MIP_ETHEMERAL_PORT 49152
|
|
|
|
#define U16(ptr) ((((uint16_t) (ptr)[0]) << 8) | (ptr)[1])
|
2022-06-12 00:29:45 +08:00
|
|
|
#define PDIFF(a, b) ((size_t) (((char *) (b)) - ((char *) (a))))
|
|
|
|
|
|
|
|
#ifndef MIP_ARP_ENTRIES
|
|
|
|
#define MIP_ARP_ENTRIES 5 // Number of ARP cache entries. Maximum 21
|
2022-04-05 20:09:17 +08:00
|
|
|
#endif
|
2022-06-12 00:29:45 +08:00
|
|
|
#define MIP_ARP_CS (2 + 12 * MIP_ARP_ENTRIES) // ARP cache size
|
|
|
|
|
|
|
|
struct str {
|
|
|
|
uint8_t *buf;
|
|
|
|
size_t len;
|
|
|
|
};
|
|
|
|
|
|
|
|
// Receive queue - single producer, single consumer queue. Interrupt-based
|
|
|
|
// drivers copy received frames to the queue in interrupt context. mip_poll()
|
|
|
|
// function runs in event loop context, reads from the queue
|
|
|
|
struct queue {
|
|
|
|
uint8_t *buf;
|
|
|
|
size_t len;
|
|
|
|
volatile _Atomic size_t tail, head;
|
|
|
|
};
|
|
|
|
|
|
|
|
// Network interface
|
|
|
|
struct mip_if {
|
|
|
|
uint8_t mac[6]; // MAC address. Must be set to a valid MAC
|
|
|
|
uint32_t ip, mask, gw; // IP address, mask, default gateway. Can be 0
|
|
|
|
struct str rx; // Output (TX) buffer
|
|
|
|
struct str tx; // Input (RX) buffer
|
|
|
|
bool use_dhcp; // Enable DCHP
|
|
|
|
struct mip_driver *driver; // Low level driver
|
|
|
|
struct mg_mgr *mgr; // Mongoose event manager
|
|
|
|
|
|
|
|
// Internal state, user can use it but should not change it
|
|
|
|
uint64_t curtime; // Last poll timestamp in millis
|
|
|
|
uint64_t timer; // Timer
|
|
|
|
uint8_t arp_cache[MIP_ARP_CS]; // Each entry is 12 bytes
|
|
|
|
uint16_t eport; // Next ephemeral port
|
|
|
|
int state; // Current state
|
|
|
|
#define MIP_STATE_DOWN 0 // Interface is down
|
|
|
|
#define MIP_STATE_UP 1 // Interface is up
|
|
|
|
#define MIP_STATE_READY 2 // Interface is up and has IP
|
|
|
|
struct queue queue; // Receive queue
|
|
|
|
};
|
|
|
|
|
2022-06-12 01:54:32 +08:00
|
|
|
#pragma pack(push, 1)
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
struct lcp {
|
|
|
|
uint8_t addr, ctrl, proto[2], code, id, len[2];
|
2022-06-12 01:54:32 +08:00
|
|
|
};
|
2022-06-12 00:29:45 +08:00
|
|
|
|
|
|
|
struct eth {
|
|
|
|
uint8_t dst[6]; // Destination MAC address
|
|
|
|
uint8_t src[6]; // Source MAC address
|
|
|
|
uint16_t type; // Ethernet type
|
2022-06-12 01:54:32 +08:00
|
|
|
};
|
2022-06-12 00:29:45 +08:00
|
|
|
|
|
|
|
struct ip {
|
|
|
|
uint8_t ver; // Version
|
|
|
|
uint8_t tos; // Unused
|
|
|
|
uint16_t len; // Length
|
|
|
|
uint16_t id; // Unused
|
|
|
|
uint16_t frag; // Fragmentation
|
|
|
|
uint8_t ttl; // Time to live
|
|
|
|
uint8_t proto; // Upper level protocol
|
|
|
|
uint16_t csum; // Checksum
|
|
|
|
uint32_t src; // Source IP
|
|
|
|
uint32_t dst; // Destination IP
|
2022-06-12 01:54:32 +08:00
|
|
|
};
|
2022-06-12 00:29:45 +08:00
|
|
|
|
|
|
|
struct ip6 {
|
|
|
|
uint8_t ver; // Version
|
|
|
|
uint8_t opts[3]; // Options
|
|
|
|
uint16_t len; // Length
|
|
|
|
uint8_t proto; // Upper level protocol
|
|
|
|
uint8_t ttl; // Time to live
|
|
|
|
uint8_t src[16]; // Source IP
|
|
|
|
uint8_t dst[16]; // Destination IP
|
2022-06-12 01:54:32 +08:00
|
|
|
};
|
2022-06-12 00:29:45 +08:00
|
|
|
|
|
|
|
struct icmp {
|
|
|
|
uint8_t type;
|
|
|
|
uint8_t code;
|
|
|
|
uint16_t csum;
|
2022-06-12 01:54:32 +08:00
|
|
|
};
|
2022-06-12 00:29:45 +08:00
|
|
|
|
|
|
|
struct arp {
|
|
|
|
uint16_t fmt; // Format of hardware address
|
|
|
|
uint16_t pro; // Format of protocol address
|
|
|
|
uint8_t hlen; // Length of hardware address
|
|
|
|
uint8_t plen; // Length of protocol address
|
|
|
|
uint16_t op; // Operation
|
|
|
|
uint8_t sha[6]; // Sender hardware address
|
|
|
|
uint32_t spa; // Sender protocol address
|
|
|
|
uint8_t tha[6]; // Target hardware address
|
|
|
|
uint32_t tpa; // Target protocol address
|
2022-06-12 01:54:32 +08:00
|
|
|
};
|
2022-06-12 00:29:45 +08:00
|
|
|
|
|
|
|
struct tcp {
|
|
|
|
uint16_t sport; // Source port
|
|
|
|
uint16_t dport; // Destination port
|
|
|
|
uint32_t seq; // Sequence number
|
|
|
|
uint32_t ack; // Acknowledgement number
|
|
|
|
uint8_t off; // Data offset
|
|
|
|
uint8_t flags; // TCP flags
|
|
|
|
#define TH_FIN 0x01
|
|
|
|
#define TH_SYN 0x02
|
|
|
|
#define TH_RST 0x04
|
|
|
|
#define TH_PUSH 0x08
|
|
|
|
#define TH_ACK 0x10
|
|
|
|
#define TH_URG 0x20
|
|
|
|
#define TH_ECE 0x40
|
|
|
|
#define TH_CWR 0x80
|
|
|
|
uint16_t win; // Window
|
|
|
|
uint16_t csum; // Checksum
|
|
|
|
uint16_t urp; // Urgent pointer
|
2022-06-12 01:54:32 +08:00
|
|
|
};
|
2022-06-12 00:29:45 +08:00
|
|
|
|
|
|
|
struct udp {
|
|
|
|
uint16_t sport; // Source port
|
|
|
|
uint16_t dport; // Destination port
|
|
|
|
uint16_t len; // UDP length
|
|
|
|
uint16_t csum; // UDP checksum
|
2022-06-12 01:54:32 +08:00
|
|
|
};
|
2022-06-12 00:29:45 +08:00
|
|
|
|
|
|
|
struct dhcp {
|
|
|
|
uint8_t op, htype, hlen, hops;
|
|
|
|
uint32_t xid;
|
|
|
|
uint16_t secs, flags;
|
|
|
|
uint32_t ciaddr, yiaddr, siaddr, giaddr;
|
|
|
|
uint8_t hwaddr[208];
|
|
|
|
uint32_t magic;
|
|
|
|
uint8_t options[32];
|
2022-06-12 01:54:32 +08:00
|
|
|
};
|
|
|
|
|
|
|
|
#pragma pack(pop)
|
2022-06-12 00:29:45 +08:00
|
|
|
|
|
|
|
struct pkt {
|
|
|
|
struct str raw; // Raw packet data
|
|
|
|
struct str pay; // Payload data
|
|
|
|
struct eth *eth;
|
|
|
|
struct llc *llc;
|
|
|
|
struct arp *arp;
|
|
|
|
struct ip *ip;
|
|
|
|
struct ip6 *ip6;
|
|
|
|
struct icmp *icmp;
|
|
|
|
struct tcp *tcp;
|
|
|
|
struct udp *udp;
|
|
|
|
struct dhcp *dhcp;
|
|
|
|
};
|
|
|
|
|
|
|
|
static void q_copyin(struct queue *q, const uint8_t *buf, size_t len,
|
|
|
|
size_t head) {
|
|
|
|
size_t i = 0, left = q->len - head;
|
|
|
|
for (; i < len && i < left; i++) q->buf[head + i] = buf[i];
|
|
|
|
for (; i < len; i++) q->buf[i - left] = buf[i];
|
2016-10-12 02:20:28 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static void q_copyout(struct queue *q, uint8_t *buf, size_t len, size_t tail) {
|
|
|
|
size_t i = 0, left = q->len - tail;
|
|
|
|
for (; i < len && i < left; i++) buf[i] = q->buf[tail + i];
|
|
|
|
for (; i < len; i++) buf[i] = q->buf[i - left];
|
|
|
|
}
|
|
|
|
|
|
|
|
static bool q_write(struct queue *q, const void *buf, size_t len) {
|
|
|
|
bool success = false;
|
|
|
|
size_t left = q->len - q->head + q->tail;
|
|
|
|
if (len + sizeof(size_t) <= left) {
|
|
|
|
q_copyin(q, (uint8_t *) &len, sizeof(len), q->head);
|
|
|
|
q_copyin(q, (uint8_t *) buf, len, (q->head + sizeof(size_t)) % q->len);
|
|
|
|
q->head = (q->head + sizeof(len) + len) % q->len;
|
|
|
|
success = true;
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
return success;
|
2016-10-12 02:20:28 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static size_t q_avail(struct queue *q) {
|
|
|
|
size_t n = 0;
|
|
|
|
if (q->tail != q->head) q_copyout(q, (uint8_t *) &n, sizeof(n), q->tail);
|
|
|
|
return n;
|
2016-10-12 02:20:28 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static size_t q_read(struct queue *q, void *buf) {
|
|
|
|
size_t n = q_avail(q);
|
|
|
|
if (n > 0) {
|
|
|
|
q_copyout(q, (uint8_t *) buf, n, (q->tail + sizeof(n)) % q->len);
|
|
|
|
q->tail = (q->tail + sizeof(n) + n) % q->len;
|
|
|
|
}
|
|
|
|
return n;
|
2022-04-12 16:38:25 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static struct str mkstr(void *buf, size_t len) {
|
|
|
|
struct str str = {(uint8_t *) buf, len};
|
|
|
|
return str;
|
2016-10-12 02:20:28 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static void mkpay(struct pkt *pkt, void *p) {
|
|
|
|
pkt->pay = mkstr(p, (size_t) (&pkt->raw.buf[pkt->raw.len] - (uint8_t *) p));
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
2017-12-29 06:54:59 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static uint32_t csumup(uint32_t sum, const void *buf, size_t len) {
|
|
|
|
const uint8_t *p = (const uint8_t *) buf;
|
|
|
|
for (size_t i = 0; i < len; i++) sum += i & 1 ? p[i] : (uint32_t) (p[i] << 8);
|
|
|
|
return sum;
|
|
|
|
}
|
2020-12-05 19:26:32 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static uint16_t csumfin(uint32_t sum) {
|
|
|
|
while (sum >> 16) sum = (sum & 0xffff) + (sum >> 16);
|
|
|
|
return NET16(~sum & 0xffff);
|
|
|
|
}
|
2020-12-22 17:44:59 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static uint16_t ipcsum(const void *buf, size_t len) {
|
|
|
|
uint32_t sum = csumup(0, buf, len);
|
|
|
|
return csumfin(sum);
|
|
|
|
}
|
2020-12-05 19:26:32 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
// ARP cache is organised as a doubly linked list. A successful cache lookup
|
|
|
|
// moves an entry to the head of the list. New entries are added by replacing
|
|
|
|
// the last entry in the list with a new IP/MAC.
|
|
|
|
// ARP cache format: | prev | next | Entry0 | Entry1 | .... | EntryN |
|
|
|
|
// ARP entry format: | prev | next | IP (4bytes) | MAC (6bytes) |
|
|
|
|
// prev and next are 1-byte offsets in the cache, so cache size is max 256 bytes
|
|
|
|
// ARP entry size is 12 bytes
|
|
|
|
static void arp_cache_init(uint8_t *p, int n, int size) {
|
|
|
|
for (int i = 0; i < n; i++) p[2 + i * size] = (uint8_t) (2 + (i - 1) * size);
|
|
|
|
for (int i = 0; i < n; i++) p[3 + i * size] = (uint8_t) (2 + (i + 1) * size);
|
|
|
|
p[0] = p[2] = (uint8_t) (2 + (n - 1) * size);
|
|
|
|
p[1] = p[3 + (n - 1) * size] = 2;
|
2016-10-12 02:20:28 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static uint8_t *arp_cache_find(struct mip_if *ifp, uint32_t ip) {
|
|
|
|
uint8_t *p = ifp->arp_cache;
|
|
|
|
if (ip == 0) return NULL;
|
|
|
|
if (p[0] == 0 || p[1] == 0) arp_cache_init(p, MIP_ARP_ENTRIES, 12);
|
|
|
|
for (uint8_t i = 0, j = p[1]; i < MIP_ARP_ENTRIES; i++, j = p[j + 1]) {
|
|
|
|
if (memcmp(p + j + 2, &ip, sizeof(ip)) == 0) {
|
|
|
|
p[1] = j, p[0] = p[j]; // Found entry! Point list head to us
|
|
|
|
// MG_DEBUG(("ARP find: %#lx @ %x:%x:%x:%x:%x:%x\n", (long) ip, p[j + 6],
|
|
|
|
// p[j + 7], p[j + 8], p[j + 9], p[j + 10], p[j + 11]));
|
|
|
|
return p + j + 6; // And return MAC address
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
return NULL;
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
2016-10-14 21:31:02 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static void arp_cache_add(struct mip_if *ifp, uint32_t ip, uint8_t mac[6]) {
|
|
|
|
uint8_t *p = ifp->arp_cache;
|
|
|
|
if (ip == 0 || ip == ~0U) return; // Bad IP
|
|
|
|
if (arp_cache_find(ifp, ip) != NULL) return; // Already exists, do nothing
|
|
|
|
memcpy(p + p[0] + 2, &ip, sizeof(ip)); // Replace last entry: IP address
|
|
|
|
memcpy(p + p[0] + 6, mac, 6); // And MAC address
|
|
|
|
p[1] = p[0], p[0] = p[p[1]]; // Point list head to us
|
|
|
|
// MG_DEBUG(("ARP cache: added %#lx @ %x:%x:%x:%x:%x:%x\n", (long) ip, mac[0],
|
|
|
|
// mac[1], mac[2], mac[3], mac[4], mac[5]));
|
2016-10-14 21:31:02 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static void arp_ask(struct mip_if *ifp, uint32_t ip) {
|
|
|
|
struct eth *eth = (struct eth *) ifp->tx.buf;
|
|
|
|
struct arp *arp = (struct arp *) (eth + 1);
|
|
|
|
memset(eth->dst, 255, sizeof(eth->dst));
|
|
|
|
memcpy(eth->src, ifp->mac, sizeof(eth->src));
|
|
|
|
eth->type = NET16(0x806);
|
|
|
|
memset(arp, 0, sizeof(*arp));
|
|
|
|
arp->fmt = NET16(1), arp->pro = NET16(0x800), arp->hlen = 6, arp->plen = 4;
|
|
|
|
arp->op = NET16(1), arp->tpa = ip, arp->spa = ifp->ip;
|
|
|
|
memcpy(arp->sha, ifp->mac, sizeof(arp->sha));
|
|
|
|
ifp->driver->tx(eth, PDIFF(eth, arp + 1), ifp->driver->data);
|
2016-10-17 17:03:59 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static void onstatechange(struct mip_if *ifp) {
|
|
|
|
if (ifp->state == MIP_STATE_READY) {
|
|
|
|
char buf[40];
|
|
|
|
struct mg_addr addr = {.ip = ifp->ip};
|
|
|
|
MG_INFO(("READY, IP: %s", mg_ntoa(&addr, buf, sizeof(buf))));
|
|
|
|
arp_ask(ifp, ifp->gw);
|
|
|
|
} else if (ifp->state == MIP_STATE_UP) {
|
|
|
|
MG_ERROR(("Network up"));
|
|
|
|
} else if (ifp->state == MIP_STATE_DOWN) {
|
|
|
|
MG_ERROR(("Network down"));
|
|
|
|
}
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static struct ip *tx_ip(struct mip_if *ifp, uint8_t proto, uint32_t ip_src,
|
|
|
|
uint32_t ip_dst, size_t plen) {
|
|
|
|
struct eth *eth = (struct eth *) ifp->tx.buf;
|
|
|
|
struct ip *ip = (struct ip *) (eth + 1);
|
|
|
|
uint8_t *mac = arp_cache_find(ifp, ip_dst); // Dst IP in ARP cache ?
|
|
|
|
if (!mac) mac = arp_cache_find(ifp, ifp->gw); // No, use gateway
|
|
|
|
if (mac) memcpy(eth->dst, mac, sizeof(eth->dst)); // Found? Use it
|
|
|
|
if (!mac) memset(eth->dst, 255, sizeof(eth->dst)); // No? Use broadcast
|
|
|
|
memcpy(eth->src, ifp->mac, sizeof(eth->src)); // TODO(cpq): ARP lookup
|
|
|
|
eth->type = NET16(0x800);
|
|
|
|
memset(ip, 0, sizeof(*ip));
|
|
|
|
ip->ver = 0x45; // Version 4, header length 5 words
|
|
|
|
ip->frag = 0x40; // Don't fragment
|
|
|
|
ip->len = NET16((uint16_t) (sizeof(*ip) + plen));
|
|
|
|
ip->ttl = 64;
|
|
|
|
ip->proto = proto;
|
|
|
|
ip->src = ip_src;
|
|
|
|
ip->dst = ip_dst;
|
|
|
|
ip->csum = ipcsum(ip, sizeof(*ip));
|
|
|
|
return ip;
|
2016-10-17 17:03:59 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 19:43:01 +08:00
|
|
|
static void tx_udp(struct mip_if *ifp, uint32_t ip_src, uint16_t sport,
|
|
|
|
uint32_t ip_dst, uint16_t dport, const void *buf,
|
|
|
|
size_t len) {
|
2022-06-12 00:29:45 +08:00
|
|
|
struct ip *ip = tx_ip(ifp, 17, ip_src, ip_dst, len + sizeof(struct udp));
|
|
|
|
struct udp *udp = (struct udp *) (ip + 1);
|
|
|
|
udp->sport = sport;
|
|
|
|
udp->dport = dport;
|
|
|
|
udp->len = NET16((uint16_t) (sizeof(*udp) + len));
|
|
|
|
udp->csum = 0;
|
|
|
|
uint32_t cs = csumup(0, udp, sizeof(*udp));
|
|
|
|
cs = csumup(cs, buf, len);
|
|
|
|
cs = csumup(cs, &ip->src, sizeof(ip->src));
|
|
|
|
cs = csumup(cs, &ip->dst, sizeof(ip->dst));
|
2022-06-12 01:54:32 +08:00
|
|
|
cs += (uint32_t) (ip->proto + sizeof(*udp) + len);
|
2022-06-12 00:29:45 +08:00
|
|
|
udp->csum = csumfin(cs);
|
|
|
|
memmove(udp + 1, buf, len);
|
|
|
|
// MG_DEBUG(("UDP LEN %d %d\n", (int) len, (int) ifp->frame_len));
|
|
|
|
ifp->driver->tx(ifp->tx.buf,
|
|
|
|
sizeof(struct eth) + sizeof(*ip) + sizeof(*udp) + len,
|
|
|
|
ifp->driver->data);
|
2016-10-17 17:03:59 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static void tx_dhcp(struct mip_if *ifp, uint32_t src, uint32_t dst,
|
|
|
|
uint8_t *opts, size_t optslen) {
|
|
|
|
struct dhcp dhcp = {.op = 1,
|
|
|
|
.htype = 1,
|
|
|
|
.hlen = 6,
|
|
|
|
.ciaddr = src,
|
|
|
|
.magic = NET32(0x63825363)};
|
|
|
|
memcpy(&dhcp.hwaddr, ifp->mac, sizeof(ifp->mac));
|
|
|
|
memcpy(&dhcp.xid, ifp->mac + 2, sizeof(dhcp.xid));
|
|
|
|
memcpy(&dhcp.options, opts, optslen);
|
|
|
|
tx_udp(ifp, src, NET16(68), dst, NET16(67), &dhcp, sizeof(dhcp));
|
2016-10-26 19:38:15 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static void tx_dhcp_request(struct mip_if *ifp, uint32_t src, uint32_t dst) {
|
|
|
|
uint8_t opts[] = {
|
|
|
|
53, 1, 3, // Type: DHCP request
|
|
|
|
55, 2, 1, 3, // GW and mask
|
|
|
|
12, 3, 'm', 'i', 'p', // Host name: "mip"
|
|
|
|
54, 4, 0, 0, 0, 0, // DHCP server ID
|
|
|
|
50, 4, 0, 0, 0, 0, // Requested IP
|
|
|
|
255 // End of options
|
|
|
|
};
|
|
|
|
memcpy(opts + 14, &dst, sizeof(dst));
|
|
|
|
memcpy(opts + 20, &src, sizeof(src));
|
|
|
|
tx_dhcp(ifp, src, dst, opts, sizeof(opts));
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
2016-10-26 19:38:15 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static void tx_dhcp_discover(struct mip_if *ifp) {
|
|
|
|
uint8_t opts[] = {
|
|
|
|
53, 1, 1, // Type: DHCP discover
|
|
|
|
55, 2, 1, 3, // Parameters: ip, mask
|
|
|
|
255 // End of options
|
|
|
|
};
|
|
|
|
tx_dhcp(ifp, 0, 0xffffffff, opts, sizeof(opts));
|
2016-10-26 19:38:15 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static void rx_arp(struct mip_if *ifp, struct pkt *pkt) {
|
|
|
|
// MG_DEBUG(("ARP op %d %#x %#x\n", NET16(arp->op), arp->spa, arp->tpa));
|
|
|
|
if (pkt->arp->op == NET16(1) && pkt->arp->tpa == ifp->ip) {
|
|
|
|
// ARP request. Make a response, then send
|
|
|
|
struct eth *eth = (struct eth *) ifp->tx.buf;
|
|
|
|
struct arp *arp = (struct arp *) (eth + 1);
|
|
|
|
memcpy(eth->dst, pkt->eth->src, sizeof(eth->dst));
|
|
|
|
memcpy(eth->src, ifp->mac, sizeof(eth->src));
|
|
|
|
eth->type = NET16(0x806);
|
|
|
|
*arp = *pkt->arp;
|
|
|
|
arp->op = NET16(2);
|
|
|
|
memcpy(arp->tha, pkt->arp->sha, sizeof(pkt->arp->tha));
|
|
|
|
memcpy(arp->sha, ifp->mac, sizeof(pkt->arp->sha));
|
|
|
|
arp->tpa = pkt->arp->spa;
|
|
|
|
arp->spa = ifp->ip;
|
|
|
|
MG_DEBUG(("ARP response: we're %#lx", (long) ifp->ip));
|
|
|
|
ifp->driver->tx(ifp->tx.buf, PDIFF(eth, arp + 1), ifp->driver->data);
|
|
|
|
} else if (pkt->arp->op == NET16(2)) {
|
|
|
|
if (memcmp(pkt->arp->tha, ifp->mac, sizeof(pkt->arp->tha)) != 0) return;
|
|
|
|
// MG_INFO(("ARP RESPONSE"));
|
|
|
|
arp_cache_add(ifp, pkt->arp->spa, pkt->arp->sha);
|
2021-03-08 23:41:16 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static void rx_icmp(struct mip_if *ifp, struct pkt *pkt) {
|
|
|
|
// MG_DEBUG(("ICMP %d\n", (int) len));
|
|
|
|
if (pkt->icmp->type == 8 && pkt->ip->dst == ifp->ip) {
|
|
|
|
struct ip *ip = tx_ip(ifp, 1, ifp->ip, pkt->ip->src,
|
|
|
|
sizeof(struct icmp) + pkt->pay.len);
|
|
|
|
struct icmp *icmp = (struct icmp *) (ip + 1);
|
|
|
|
memset(icmp, 0, sizeof(*icmp)); // Important - set csum to 0
|
|
|
|
memcpy(icmp + 1, pkt->pay.buf, pkt->pay.len);
|
|
|
|
icmp->csum = ipcsum(icmp, sizeof(*icmp) + pkt->pay.len);
|
|
|
|
ifp->driver->tx(ifp->tx.buf, PDIFF(ifp->tx.buf, icmp + 1) + pkt->pay.len,
|
|
|
|
ifp->driver->data);
|
|
|
|
}
|
2021-08-25 14:59:31 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static void rx_dhcp(struct mip_if *ifp, struct pkt *pkt) {
|
|
|
|
uint32_t ip = 0, gw = 0, mask = 0;
|
|
|
|
uint8_t *p = pkt->dhcp->options, *end = &pkt->raw.buf[pkt->raw.len];
|
|
|
|
if (end < (uint8_t *) (pkt->dhcp + 1)) return;
|
|
|
|
// MG_DEBUG(("DHCP %u\n", (unsigned) pkt->raw.len));
|
|
|
|
while (p < end && p[0] != 255) {
|
|
|
|
if (p[0] == 1 && p[1] == sizeof(ifp->mask)) {
|
|
|
|
memcpy(&mask, p + 2, sizeof(mask));
|
|
|
|
// MG_DEBUG(("MASK %x\n", mask));
|
|
|
|
} else if (p[0] == 3 && p[1] == sizeof(ifp->gw)) {
|
|
|
|
memcpy(&gw, p + 2, sizeof(gw));
|
|
|
|
ip = pkt->dhcp->yiaddr;
|
|
|
|
// MG_DEBUG(("IP %x GW %x\n", ip, gw));
|
|
|
|
}
|
|
|
|
p += p[1] + 2;
|
|
|
|
}
|
|
|
|
if (ip && mask && gw && ifp->ip == 0) {
|
|
|
|
// MG_DEBUG(("DHCP offer ip %#08lx mask %#08lx gw %#08lx\n",
|
|
|
|
// (long) ip, (long) mask, (long) gw));
|
|
|
|
arp_cache_add(ifp, pkt->dhcp->siaddr, ((struct eth *) pkt->raw.buf)->src);
|
|
|
|
ifp->ip = ip, ifp->gw = gw, ifp->mask = mask;
|
|
|
|
ifp->state = MIP_STATE_READY;
|
|
|
|
onstatechange(ifp);
|
|
|
|
tx_dhcp_request(ifp, ip, pkt->dhcp->siaddr);
|
2021-08-25 14:59:31 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2022-06-12 19:43:01 +08:00
|
|
|
static struct mg_connection *getpeer(struct mg_mgr *mgr, struct pkt *pkt,
|
|
|
|
bool lsn) {
|
2022-06-12 00:29:45 +08:00
|
|
|
struct mg_connection *c = NULL;
|
|
|
|
for (c = mgr->conns; c != NULL; c = c->next) {
|
|
|
|
if (c->is_udp && pkt->udp && c->loc.port == pkt->udp->dport) break;
|
|
|
|
if (!c->is_udp && pkt->tcp && c->loc.port == pkt->tcp->dport &&
|
|
|
|
lsn == c->is_listening && (lsn || c->rem.port == pkt->tcp->sport))
|
|
|
|
break;
|
2021-08-25 14:59:31 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
return c;
|
2021-08-25 14:59:31 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static void rx_udp(struct mip_if *ifp, struct pkt *pkt) {
|
|
|
|
struct mg_connection *c = getpeer(ifp->mgr, pkt, true);
|
|
|
|
if (c == NULL) {
|
|
|
|
// No UDP listener on this port. Should send ICMP, but keep silent.
|
|
|
|
} else if (c != NULL) {
|
|
|
|
c->rem.port = pkt->udp->sport;
|
|
|
|
c->rem.ip = pkt->ip->src;
|
|
|
|
if (c->recv.len >= MG_MAX_RECV_SIZE) {
|
|
|
|
mg_error(c, "max_recv_buf_size reached");
|
|
|
|
} else if (c->recv.size - c->recv.len < pkt->pay.len &&
|
|
|
|
!mg_iobuf_resize(&c->recv, c->recv.len + pkt->pay.len)) {
|
|
|
|
mg_error(c, "oom");
|
|
|
|
} else {
|
|
|
|
memcpy(&c->recv.buf[c->recv.len], pkt->pay.buf, pkt->pay.len);
|
|
|
|
c->recv.len += pkt->pay.len;
|
|
|
|
struct mg_str evd = mg_str_n((char *) pkt->pay.buf, pkt->pay.len);
|
|
|
|
mg_call(c, MG_EV_READ, &evd);
|
|
|
|
}
|
|
|
|
}
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
2016-10-26 19:38:15 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
struct tcpstate {
|
|
|
|
uint32_t seq, ack;
|
|
|
|
time_t expire;
|
2020-12-05 19:26:32 +08:00
|
|
|
};
|
2016-11-09 19:15:06 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static size_t tx_tcp(struct mip_if *ifp, uint32_t dst_ip, uint8_t flags,
|
|
|
|
uint16_t sport, uint16_t dport, uint32_t seq, uint32_t ack,
|
|
|
|
const void *buf, size_t len) {
|
|
|
|
struct ip *ip = tx_ip(ifp, 6, ifp->ip, dst_ip, sizeof(struct tcp) + len);
|
|
|
|
struct tcp *tcp = (struct tcp *) (ip + 1);
|
|
|
|
memset(tcp, 0, sizeof(*tcp));
|
|
|
|
memmove(tcp + 1, buf, len);
|
|
|
|
tcp->sport = sport;
|
|
|
|
tcp->dport = dport;
|
|
|
|
tcp->seq = seq;
|
|
|
|
tcp->ack = ack;
|
|
|
|
tcp->flags = flags;
|
|
|
|
tcp->win = mg_htons(8192);
|
|
|
|
tcp->off = (uint8_t) (sizeof(*tcp) / 4 << 4);
|
|
|
|
uint32_t cs = 0;
|
|
|
|
uint16_t n = (uint16_t) (sizeof(*tcp) + len);
|
|
|
|
uint8_t pseudo[] = {0, ip->proto, (uint8_t) (n >> 8), (uint8_t) (n & 255)};
|
|
|
|
cs = csumup(cs, tcp, n);
|
|
|
|
cs = csumup(cs, &ip->src, sizeof(ip->src));
|
|
|
|
cs = csumup(cs, &ip->dst, sizeof(ip->dst));
|
|
|
|
cs = csumup(cs, pseudo, sizeof(pseudo));
|
|
|
|
tcp->csum = csumfin(cs);
|
|
|
|
return ifp->driver->tx(ifp->tx.buf, PDIFF(ifp->tx.buf, tcp + 1) + len,
|
|
|
|
ifp->driver->data);
|
|
|
|
}
|
|
|
|
|
|
|
|
static size_t tx_tcp_pkt(struct mip_if *ifp, struct pkt *pkt, uint8_t flags,
|
|
|
|
uint32_t seq, const void *buf, size_t len) {
|
|
|
|
uint32_t delta = (pkt->tcp->flags & (TH_SYN | TH_FIN)) ? 1 : 0;
|
|
|
|
return tx_tcp(ifp, pkt->ip->src, flags, pkt->tcp->dport, pkt->tcp->sport, seq,
|
|
|
|
mg_htonl(mg_ntohl(pkt->tcp->seq) + delta), buf, len);
|
2022-06-05 21:59:50 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static struct mg_connection *accept_conn(struct mg_connection *lsn,
|
|
|
|
struct pkt *pkt) {
|
|
|
|
struct mg_connection *c = mg_alloc_conn(lsn->mgr);
|
|
|
|
struct tcpstate *s = (struct tcpstate *) (c + 1);
|
|
|
|
s->seq = mg_ntohl(pkt->tcp->ack), s->ack = mg_ntohl(pkt->tcp->seq);
|
|
|
|
c->rem.ip = pkt->ip->src;
|
|
|
|
c->rem.port = pkt->tcp->sport;
|
|
|
|
MG_DEBUG(("%lu accepted %lx:%hx", c->id, c->rem.ip, c->rem.port));
|
|
|
|
LIST_ADD_HEAD(struct mg_connection, &lsn->mgr->conns, c);
|
|
|
|
c->fd = (void *) (size_t) mg_ntohl(pkt->tcp->ack);
|
|
|
|
c->is_accepted = 1;
|
|
|
|
c->is_hexdumping = lsn->is_hexdumping;
|
|
|
|
c->pfn = lsn->pfn;
|
|
|
|
c->loc = lsn->loc;
|
|
|
|
c->pfn_data = lsn->pfn_data;
|
|
|
|
c->fn = lsn->fn;
|
|
|
|
c->fn_data = lsn->fn_data;
|
|
|
|
mg_call(c, MG_EV_OPEN, NULL);
|
|
|
|
mg_call(c, MG_EV_ACCEPT, NULL);
|
|
|
|
return c;
|
2022-06-05 21:59:50 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static void read_conn(struct mg_connection *c, struct pkt *pkt) {
|
|
|
|
struct tcpstate *s = (struct tcpstate *) (c + 1);
|
|
|
|
if (pkt->tcp->flags & TH_FIN) {
|
|
|
|
s->ack = mg_htonl(pkt->tcp->seq) + 1, s->seq = mg_htonl(pkt->tcp->ack);
|
|
|
|
c->is_closing = 1;
|
|
|
|
} else if (pkt->pay.len == 0) {
|
|
|
|
} else if (c->recv.size - c->recv.len < pkt->pay.len &&
|
|
|
|
!mg_iobuf_resize(&c->recv, c->recv.len + pkt->pay.len)) {
|
|
|
|
mg_error(c, "oom");
|
|
|
|
} else if (mg_ntohl(pkt->tcp->seq) != s->ack) {
|
|
|
|
mg_error(c, "oob: %x %x", mg_ntohl(pkt->tcp->seq), s->ack);
|
|
|
|
} else {
|
2022-06-12 01:54:32 +08:00
|
|
|
s->ack = (uint32_t) (mg_htonl(pkt->tcp->seq) + pkt->pay.len);
|
2022-06-12 00:29:45 +08:00
|
|
|
memcpy(&c->recv.buf[c->recv.len], pkt->pay.buf, pkt->pay.len);
|
|
|
|
c->recv.len += pkt->pay.len;
|
|
|
|
struct mg_str evd = mg_str_n((char *) pkt->pay.buf, pkt->pay.len);
|
|
|
|
mg_call(c, MG_EV_READ, &evd);
|
|
|
|
#if 0
|
|
|
|
// Send ACK immediately
|
|
|
|
tx_tcp(ifp, c->rem.ip, TH_ACK, c->loc.port, c->rem.port, mg_htonl(s->seq),
|
|
|
|
mg_htonl(s->ack), NULL, 0);
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
}
|
2021-01-17 06:48:43 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static void rx_tcp(struct mip_if *ifp, struct pkt *pkt) {
|
|
|
|
struct mg_connection *c = getpeer(ifp->mgr, pkt, false);
|
|
|
|
#if 0
|
|
|
|
MG_INFO(("%lu %hhu %d", c ? c->id : 0, pkt->tcp->flags, (int) pkt->pay.len));
|
|
|
|
#endif
|
|
|
|
if (c != NULL) {
|
|
|
|
#if 0
|
|
|
|
MG_DEBUG(("%lu %d %lx:%hx -> %lx:%hx", c->id, (int) pkt->raw.len,
|
|
|
|
pkt->ip->src, pkt->tcp->sport, pkt->ip->dst, pkt->tcp->dport));
|
|
|
|
hexdump(pkt->pay.buf, pkt->pay.len);
|
|
|
|
#endif
|
|
|
|
read_conn(c, pkt);
|
|
|
|
} else if ((c = getpeer(ifp->mgr, pkt, true)) == NULL) {
|
|
|
|
tx_tcp_pkt(ifp, pkt, TH_RST | TH_ACK, pkt->tcp->ack, NULL, 0);
|
|
|
|
} else if (pkt->tcp->flags & TH_SYN) {
|
|
|
|
// Use peer's source port as ISN, in order to recognise the handshake
|
|
|
|
uint32_t isn = mg_htonl((uint32_t) mg_ntohs(pkt->tcp->sport));
|
|
|
|
tx_tcp_pkt(ifp, pkt, TH_SYN | TH_ACK, isn, NULL, 0);
|
|
|
|
} else if (pkt->tcp->flags & TH_FIN) {
|
|
|
|
tx_tcp_pkt(ifp, pkt, TH_FIN | TH_ACK, pkt->tcp->ack, NULL, 0);
|
|
|
|
} else if (mg_htonl(pkt->tcp->ack) == mg_htons(pkt->tcp->sport) + 1U) {
|
|
|
|
accept_conn(c, pkt);
|
|
|
|
} else {
|
|
|
|
// MG_DEBUG(("dropped silently.."));
|
2021-08-04 18:38:32 +08:00
|
|
|
}
|
2016-11-09 19:15:06 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static void rx_ip(struct mip_if *ifp, struct pkt *pkt) {
|
|
|
|
// MG_DEBUG(("IP %d", (int) pkt->pay.len));
|
|
|
|
if (pkt->ip->proto == 1) {
|
|
|
|
pkt->icmp = (struct icmp *) (pkt->ip + 1);
|
|
|
|
if (pkt->pay.len < sizeof(*pkt->icmp)) return;
|
|
|
|
mkpay(pkt, pkt->icmp + 1);
|
|
|
|
rx_icmp(ifp, pkt);
|
|
|
|
} else if (pkt->ip->proto == 17) {
|
|
|
|
pkt->udp = (struct udp *) (pkt->ip + 1);
|
|
|
|
if (pkt->pay.len < sizeof(*pkt->udp)) return;
|
|
|
|
// MG_DEBUG((" UDP %u %u -> %u\n", len, NET16(udp->sport),
|
|
|
|
// NET16(udp->dport)));
|
|
|
|
mkpay(pkt, pkt->udp + 1);
|
|
|
|
if (pkt->udp->dport == NET16(68)) {
|
|
|
|
pkt->dhcp = (struct dhcp *) (pkt->udp + 1);
|
|
|
|
mkpay(pkt, pkt->dhcp + 1);
|
|
|
|
rx_dhcp(ifp, pkt);
|
|
|
|
} else {
|
|
|
|
rx_udp(ifp, pkt);
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
} else if (pkt->ip->proto == 6) {
|
|
|
|
pkt->tcp = (struct tcp *) (pkt->ip + 1);
|
|
|
|
if (pkt->pay.len < sizeof(*pkt->tcp)) return;
|
|
|
|
mkpay(pkt, pkt->tcp + 1);
|
|
|
|
uint16_t iplen = mg_ntohs(pkt->ip->len);
|
|
|
|
uint16_t off = (uint16_t) (sizeof(*pkt->ip) + ((pkt->tcp->off >> 4) * 4U));
|
|
|
|
if (iplen >= off) pkt->pay.len = (size_t) (iplen - off);
|
|
|
|
rx_tcp(ifp, pkt);
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static void rx_ip6(struct mip_if *ifp, struct pkt *pkt) {
|
|
|
|
// MG_DEBUG(("IP %d\n", (int) len));
|
|
|
|
if (pkt->ip6->proto == 1 || pkt->ip6->proto == 58) {
|
|
|
|
pkt->icmp = (struct icmp *) (pkt->ip6 + 1);
|
|
|
|
if (pkt->pay.len < sizeof(*pkt->icmp)) return;
|
|
|
|
mkpay(pkt, pkt->icmp + 1);
|
|
|
|
rx_icmp(ifp, pkt);
|
|
|
|
} else if (pkt->ip->proto == 17) {
|
|
|
|
pkt->udp = (struct udp *) (pkt->ip6 + 1);
|
|
|
|
if (pkt->pay.len < sizeof(*pkt->udp)) return;
|
|
|
|
// MG_DEBUG((" UDP %u %u -> %u\n", len, NET16(udp->sport),
|
|
|
|
// NET16(udp->dport)));
|
|
|
|
mkpay(pkt, pkt->udp + 1);
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static void mip_rx(struct mip_if *ifp, void *buf, size_t len) {
|
|
|
|
const uint8_t broadcast[] = {255, 255, 255, 255, 255, 255};
|
|
|
|
struct pkt pkt = {.raw = {.buf = (uint8_t *) buf, .len = len}};
|
|
|
|
pkt.eth = (struct eth *) buf;
|
|
|
|
if (pkt.raw.len < sizeof(*pkt.eth)) return; // Truncated - runt?
|
|
|
|
if (memcmp(pkt.eth->dst, ifp->mac, sizeof(pkt.eth->dst)) != 0 &&
|
|
|
|
memcmp(pkt.eth->dst, broadcast, sizeof(pkt.eth->dst)) != 0) {
|
|
|
|
// Not for us. Drop silently
|
|
|
|
} else if (pkt.eth->type == NET16(0x806)) {
|
|
|
|
pkt.arp = (struct arp *) (pkt.eth + 1);
|
|
|
|
if (sizeof(*pkt.eth) + sizeof(*pkt.arp) > pkt.raw.len) return; // Truncated
|
|
|
|
rx_arp(ifp, &pkt);
|
|
|
|
} else if (pkt.eth->type == NET16(0x86dd)) {
|
|
|
|
pkt.ip6 = (struct ip6 *) (pkt.eth + 1);
|
|
|
|
if (pkt.raw.len < sizeof(*pkt.eth) + sizeof(*pkt.ip6)) return; // Truncated
|
|
|
|
if ((pkt.ip6->ver >> 4) != 0x6) return; // Not IP
|
|
|
|
mkpay(&pkt, pkt.ip6 + 1);
|
|
|
|
rx_ip6(ifp, &pkt);
|
|
|
|
} else if (pkt.eth->type == NET16(0x800)) {
|
|
|
|
pkt.ip = (struct ip *) (pkt.eth + 1);
|
|
|
|
if (pkt.raw.len < sizeof(*pkt.eth) + sizeof(*pkt.ip)) return; // Truncated
|
|
|
|
if ((pkt.ip->ver >> 4) != 4) return; // Not IP
|
|
|
|
mkpay(&pkt, pkt.ip + 1);
|
|
|
|
rx_ip(ifp, &pkt);
|
2020-12-05 19:26:32 +08:00
|
|
|
} else {
|
2022-06-12 00:29:45 +08:00
|
|
|
MG_DEBUG((" Unknown eth type %x\n", NET16(pkt.eth->type)));
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static void mip_poll(struct mip_if *ifp, uint64_t uptime_ms) {
|
|
|
|
ifp->curtime = uptime_ms;
|
|
|
|
|
|
|
|
if (ifp->ip == 0 && uptime_ms > ifp->timer) {
|
|
|
|
tx_dhcp_discover(ifp); // If IP not configured, send DHCP
|
|
|
|
ifp->timer = uptime_ms + 1000; // with some interval
|
|
|
|
} else if (ifp->use_dhcp == false && uptime_ms > ifp->timer &&
|
|
|
|
arp_cache_find(ifp, ifp->gw) == NULL) {
|
|
|
|
arp_ask(ifp, ifp->gw); // If GW's MAC address in not in ARP cache
|
|
|
|
ifp->timer = uptime_ms + 1000; // send ARP who-has request
|
|
|
|
}
|
|
|
|
|
|
|
|
// Handle physical interface up/down status
|
|
|
|
if (ifp->driver->status) {
|
|
|
|
bool up = ifp->driver->status(ifp->driver->data);
|
|
|
|
bool current = ifp->state != MIP_STATE_DOWN;
|
|
|
|
if (up != current) {
|
|
|
|
ifp->state = up == false ? MIP_STATE_DOWN
|
|
|
|
: ifp->use_dhcp ? MIP_STATE_UP
|
|
|
|
: MIP_STATE_READY;
|
|
|
|
if (!up && ifp->use_dhcp) ifp->ip = 0;
|
|
|
|
onstatechange(ifp);
|
|
|
|
}
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
2021-08-01 21:10:21 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
// Read data from the network
|
|
|
|
for (;;) {
|
|
|
|
size_t len = ifp->queue.len > 0 ? q_read(&ifp->queue, ifp->rx.buf)
|
|
|
|
: ifp->driver->rx(ifp->rx.buf, ifp->rx.len,
|
|
|
|
ifp->driver->data);
|
|
|
|
if (len == 0) break;
|
|
|
|
mip_rx(ifp, ifp->rx.buf, len);
|
2016-11-09 06:29:07 +08:00
|
|
|
}
|
2021-08-01 21:10:21 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
// This function executes in interrupt context, thus it should copy data
|
|
|
|
// somewhere fast. Note that newlib's malloc is not thread safe, thus use
|
|
|
|
// our lock-free queue with preallocated buffer to copy data and return asap
|
|
|
|
static void on_rx(void *buf, size_t len, void *userdata) {
|
|
|
|
struct mip_if *ifp = (struct mip_if *) userdata;
|
|
|
|
if (!q_write(&ifp->queue, buf, len)) MG_ERROR(("dropped %d", (int) len));
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
2016-11-09 06:29:07 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
void mip_init(struct mg_mgr *mgr, struct mip_ipcfg *ipcfg,
|
|
|
|
struct mip_driver *driver) {
|
|
|
|
size_t maxpktsize = 1500, qlen = driver->rxcb ? 1024 * 16 : 0;
|
|
|
|
struct mip_if *ifp =
|
|
|
|
(struct mip_if *) calloc(1, sizeof(*ifp) + 2 * maxpktsize + qlen);
|
|
|
|
memcpy(ifp->mac, ipcfg->mac, sizeof(ifp->mac));
|
|
|
|
ifp->use_dhcp = ipcfg->ip == 0;
|
|
|
|
ifp->ip = ipcfg->ip, ifp->mask = ipcfg->mask, ifp->gw = ipcfg->gw;
|
|
|
|
ifp->rx.buf = (uint8_t *) (ifp + 1), ifp->rx.len = maxpktsize;
|
|
|
|
ifp->tx.buf = ifp->rx.buf + maxpktsize, ifp->tx.len = maxpktsize;
|
|
|
|
ifp->driver = driver;
|
|
|
|
ifp->mgr = mgr;
|
|
|
|
ifp->queue.buf = ifp->tx.buf + maxpktsize;
|
|
|
|
ifp->queue.len = qlen;
|
|
|
|
if (driver->init) driver->init(driver->data);
|
|
|
|
if (driver->rxcb) driver->rxcb(on_rx, ifp);
|
|
|
|
mgr->priv = ifp;
|
|
|
|
mgr->extraconnsize = sizeof(struct tcpstate);
|
|
|
|
}
|
2016-11-09 06:29:07 +08:00
|
|
|
|
2022-06-12 19:43:01 +08:00
|
|
|
int mg_mkpipe(struct mg_mgr *m, mg_event_handler_t fn, void *d, bool udp) {
|
|
|
|
(void) m, (void) fn, (void) d, (void) udp;
|
|
|
|
MG_ERROR(("Not implemented"));
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
void mg_connect_resolved(struct mg_connection *c) {
|
|
|
|
struct mip_if *ifp = (struct mip_if *) c->mgr->priv;
|
|
|
|
if (ifp->eport < MIP_ETHEMERAL_PORT) ifp->eport = MIP_ETHEMERAL_PORT;
|
|
|
|
if (c->is_udp) {
|
|
|
|
c->loc.ip = ifp->ip;
|
|
|
|
c->loc.port = mg_htons(ifp->eport++);
|
|
|
|
MG_DEBUG(("%lu %08lx.%hu->%08lx.%hu", c->id, mg_ntohl(c->loc.ip),
|
|
|
|
mg_ntohs(c->loc.port), mg_ntohl(c->rem.ip),
|
|
|
|
mg_ntohs(c->rem.port)));
|
|
|
|
mg_call(c, MG_EV_RESOLVE, NULL);
|
|
|
|
mg_call(c, MG_EV_CONNECT, NULL);
|
|
|
|
} else {
|
|
|
|
mg_error(c, "Not implemented");
|
|
|
|
}
|
|
|
|
c->is_resolving = 0;
|
|
|
|
}
|
2017-08-17 22:07:45 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
bool mg_open_listener(struct mg_connection *c, const char *url) {
|
|
|
|
c->loc.port = mg_htons(mg_url_port(url));
|
|
|
|
return true;
|
|
|
|
}
|
2021-08-27 17:25:24 +08:00
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static void write_conn(struct mg_connection *c) {
|
|
|
|
struct mip_if *ifp = (struct mip_if *) c->mgr->priv;
|
|
|
|
struct tcpstate *s = (struct tcpstate *) (c + 1);
|
|
|
|
size_t sent, n = c->send.len, hdrlen = 14 + 24 /*max IP*/ + 60 /*max TCP*/;
|
|
|
|
if (n + hdrlen > ifp->tx.len) n = ifp->tx.len - hdrlen;
|
|
|
|
sent = tx_tcp(ifp, c->rem.ip, TH_PUSH | TH_ACK, c->loc.port, c->rem.port,
|
|
|
|
mg_htonl(s->seq), mg_htonl(s->ack), c->send.buf, n);
|
|
|
|
if (sent > 0) {
|
|
|
|
mg_iobuf_del(&c->send, 0, n);
|
2022-06-12 01:54:32 +08:00
|
|
|
s->seq += (uint32_t) n;
|
2022-06-12 00:29:45 +08:00
|
|
|
mg_call(c, MG_EV_WRITE, &n);
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
2017-08-17 22:07:45 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
static void fin_conn(struct mg_connection *c) {
|
|
|
|
struct mip_if *ifp = (struct mip_if *) c->mgr->priv;
|
|
|
|
struct tcpstate *s = (struct tcpstate *) (c + 1);
|
|
|
|
tx_tcp(ifp, c->rem.ip, TH_FIN | TH_ACK, c->loc.port, c->rem.port,
|
|
|
|
mg_htonl(s->seq), mg_htonl(s->ack), NULL, 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
void mg_mgr_poll(struct mg_mgr *mgr, int ms) {
|
|
|
|
struct mg_connection *c, *tmp;
|
|
|
|
uint64_t now = mg_millis();
|
|
|
|
mip_poll((struct mip_if *) mgr->priv, now);
|
|
|
|
mg_timer_poll(&mgr->timers, now);
|
|
|
|
for (c = mgr->conns; c != NULL; c = tmp) {
|
|
|
|
tmp = c->next;
|
|
|
|
if (c->send.len > 0) write_conn(c);
|
|
|
|
if (c->is_draining && c->send.len == 0) c->is_closing = 1;
|
|
|
|
if (c->is_closing) {
|
|
|
|
if (c->is_udp == false && c->is_listening == false) fin_conn(c);
|
|
|
|
mg_close_conn(c);
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
(void) ms;
|
2017-08-17 22:07:45 +08:00
|
|
|
}
|
|
|
|
|
2022-06-12 00:29:45 +08:00
|
|
|
bool mg_send(struct mg_connection *c, const void *buf, size_t len) {
|
|
|
|
struct mip_if *ifp = (struct mip_if *) c->mgr->priv;
|
|
|
|
bool res = false;
|
|
|
|
if (ifp->ip == 0) {
|
|
|
|
mg_error(c, "net down");
|
|
|
|
} else if (c->is_udp) {
|
|
|
|
tx_udp(ifp, ifp->ip, c->loc.port, c->rem.ip, c->rem.port, buf, len);
|
|
|
|
res = true;
|
2021-08-04 06:37:50 +08:00
|
|
|
} else {
|
2022-06-12 00:29:45 +08:00
|
|
|
// tx_tdp(ifp, ifp->ip, c->loc.port, c->rem.ip, c->rem.port, buf, len);
|
|
|
|
return mg_iobuf_add(&c->send, c->send.len, buf, len, MG_IO_SIZE);
|
2021-01-17 06:48:43 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
return res;
|
2020-12-05 19:26:32 +08:00
|
|
|
}
|
2022-06-12 00:29:45 +08:00
|
|
|
#endif // MG_ENABLE_MIP
|