2020-06-15 14:18:57 +00:00
|
|
|
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│
|
|
|
|
│vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi│
|
|
|
|
╞══════════════════════════════════════════════════════════════════════════════╡
|
|
|
|
│ Copyright 2020 Justine Alexandra Roberts Tunney │
|
|
|
|
│ │
|
2020-12-28 01:18:44 +00:00
|
|
|
│ Permission to use, copy, modify, and/or distribute this software for │
|
|
|
|
│ any purpose with or without fee is hereby granted, provided that the │
|
|
|
|
│ above copyright notice and this permission notice appear in all copies. │
|
2020-06-15 14:18:57 +00:00
|
|
|
│ │
|
2020-12-28 01:18:44 +00:00
|
|
|
│ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL │
|
|
|
|
│ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED │
|
|
|
|
│ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE │
|
|
|
|
│ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL │
|
|
|
|
│ DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR │
|
|
|
|
│ PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER │
|
|
|
|
│ TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR │
|
|
|
|
│ PERFORMANCE OF THIS SOFTWARE. │
|
2020-06-15 14:18:57 +00:00
|
|
|
╚─────────────────────────────────────────────────────────────────────────────*/
|
2020-11-28 20:01:51 +00:00
|
|
|
#include "libc/str/str.h"
|
|
|
|
#include "net/http/http.h"
|
2020-06-15 14:18:57 +00:00
|
|
|
|
2021-04-21 02:14:21 +00:00
|
|
|
#define MAXIMUM (1024L * 1024L * 1024L * 1024L)
|
|
|
|
|
2021-03-25 09:21:13 +00:00
|
|
|
/**
|
|
|
|
* Parses Content-Length header.
|
|
|
|
*
|
2021-04-21 02:14:21 +00:00
|
|
|
* @param size is byte length and -1 implies strlen
|
2021-03-25 09:21:13 +00:00
|
|
|
* @return -1 on invalid or overflow, otherwise >=0 value
|
|
|
|
*/
|
2021-04-21 02:14:21 +00:00
|
|
|
int64_t ParseContentLength(const char *s, size_t n) {
|
|
|
|
size_t i;
|
|
|
|
int64_t r;
|
|
|
|
if (n == -1) n = s ? strlen(s) : 0;
|
|
|
|
if (!n) return -1;
|
|
|
|
for (r = i = 0; i < n; ++i) {
|
|
|
|
if (s[i] == ',' && i > 0) break;
|
2021-03-25 09:21:13 +00:00
|
|
|
if (!isdigit(s[i])) return -1;
|
2021-04-21 02:14:21 +00:00
|
|
|
r *= 10;
|
|
|
|
r += s[i] - '0';
|
|
|
|
if (r >= MAXIMUM) return -1;
|
2020-06-15 14:18:57 +00:00
|
|
|
}
|
2021-03-25 09:21:13 +00:00
|
|
|
return r;
|
2020-06-15 14:18:57 +00:00
|
|
|
}
|