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│
|
|
|
|
╞══════════════════════════════════════════════════════════════════════════════╡
|
2022-04-23 01:55:28 +00:00
|
|
|
│ Copyright 2021 Justine Alexandra Roberts Tunney │
|
2020-06-15 14:18:57 +00:00
|
|
|
│ │
|
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
|
|
|
╚─────────────────────────────────────────────────────────────────────────────*/
|
2022-04-23 01:55:28 +00:00
|
|
|
#include "libc/fmt/itoa.h"
|
2020-11-25 16:19:00 +00:00
|
|
|
|
2020-06-15 14:18:57 +00:00
|
|
|
/**
|
2022-04-23 01:55:28 +00:00
|
|
|
* Converts unsigned 64-bit integer to octal string.
|
|
|
|
*
|
2022-04-29 13:06:23 +00:00
|
|
|
* @param p needs at least 24 bytes
|
2022-04-23 01:55:28 +00:00
|
|
|
* @param z ensures it starts with zero
|
|
|
|
* @return pointer to nul byte
|
2020-06-15 14:18:57 +00:00
|
|
|
*/
|
2022-04-23 01:55:28 +00:00
|
|
|
char *FormatOctal64(char p[hasatleast 24], uint64_t x, bool z) {
|
|
|
|
char t;
|
|
|
|
size_t i, a, b;
|
|
|
|
i = 0;
|
|
|
|
z = x && z;
|
|
|
|
do {
|
|
|
|
p[i++] = x % 8 + '0';
|
|
|
|
x = x / 8;
|
|
|
|
} while (x > 0);
|
|
|
|
if (z) p[i++] = '0';
|
|
|
|
p[i] = '\0';
|
|
|
|
if (i) {
|
|
|
|
for (a = 0, b = i - 1; a < b; ++a, --b) {
|
|
|
|
t = p[a];
|
|
|
|
p[a] = p[b];
|
|
|
|
p[b] = t;
|
2022-04-15 06:39:48 +00:00
|
|
|
}
|
2020-06-15 14:18:57 +00:00
|
|
|
}
|
2022-04-23 01:55:28 +00:00
|
|
|
return p + i;
|
2020-06-15 14:18:57 +00:00
|
|
|
}
|