mirror of
https://github.com/jart/cosmopolitan.git
synced 2025-02-12 01:08:00 +00:00
7b26b42769
This makes breaking changes to add underscores to many non-standard
function names provided by the c library. MODE=tiny is now tinier and
we now use smaller locks that are better for tiny apps in this mode.
Some headers have been renamed to be in the same folder as the build
package, so it'll be easier to know which build dependency is needed.
Certain old misguided interfaces have been removed. Intel intrinsics
headers are now listed in libc/isystem (but not in the amalgamation)
to help further improve open source compatibility. Header complexity
has also been reduced. Lastly, more shell scripts are now available.
Compared to 6f7d0cb1c3, some tiny corrections were made in libc/intrin/g_fds.c and libc/zipos/open.c including double semi colons and incorrect indentation for existing vista changes that were manually pulled from this commit previously.
96 lines
2.8 KiB
C
96 lines
2.8 KiB
C
#if 0
|
|
/*─────────────────────────────────────────────────────────────────╗
|
|
│ To the extent possible under law, Justine Tunney has waived │
|
|
│ all copyright and related or neighboring rights to this file, │
|
|
│ as it is written in the following disclaimers: │
|
|
│ • http://unlicense.org/ │
|
|
│ • http://creativecommons.org/publicdomain/zero/1.0/ │
|
|
╚─────────────────────────────────────────────────────────────────*/
|
|
#endif
|
|
#include "libc/calls/calls.h"
|
|
#include "libc/calls/struct/dirent.h"
|
|
#include "libc/calls/struct/stat.h"
|
|
#include "libc/calls/struct/timespec.h"
|
|
#include "libc/intrin/safemacros.internal.h"
|
|
#include "libc/log/check.h"
|
|
#include "libc/mem/alg.h"
|
|
#include "libc/mem/arraylist2.internal.h"
|
|
#include "libc/mem/mem.h"
|
|
#include "libc/mem/gc.h"
|
|
#include "libc/stdio/stdio.h"
|
|
#include "libc/sysv/consts/dt.h"
|
|
#include "libc/x/x.h"
|
|
#include "libc/x/xiso8601.h"
|
|
|
|
struct stat st;
|
|
struct Files {
|
|
size_t i, n;
|
|
struct File {
|
|
struct timespec mt;
|
|
char *path;
|
|
} * p;
|
|
} g_files;
|
|
|
|
int CompareFiles(struct File *a, struct File *b) {
|
|
if (a->mt.tv_sec > b->mt.tv_sec) return 1;
|
|
if (a->mt.tv_sec < b->mt.tv_sec) return -1;
|
|
if (a->mt.tv_nsec > b->mt.tv_nsec) return 1;
|
|
if (a->mt.tv_nsec < b->mt.tv_nsec) return -1;
|
|
return strcmp(a->path, b->path);
|
|
}
|
|
|
|
void WalkPaths(const char *dirpath) {
|
|
DIR *d;
|
|
char *path;
|
|
struct File f;
|
|
struct dirent *e;
|
|
CHECK((d = opendir(dirpath)));
|
|
while ((e = readdir(d))) {
|
|
if (strcmp(e->d_name, ".") == 0) continue;
|
|
if (strcmp(e->d_name, "..") == 0) continue;
|
|
path = xjoinpaths(dirpath, e->d_name);
|
|
if (strcmp(e->d_name, "o") == 0) continue;
|
|
if (strcmp(e->d_name, ".git") == 0) continue;
|
|
if (e->d_type == DT_DIR) {
|
|
WalkPaths(_gc(path));
|
|
} else {
|
|
CHECK_NE(-1, lstat(path, &st), "%s", path);
|
|
f.mt = st.st_mtim;
|
|
f.path = path;
|
|
APPEND(&g_files.p, &g_files.i, &g_files.n, &f);
|
|
}
|
|
}
|
|
closedir(d);
|
|
}
|
|
|
|
void SortPaths(void) {
|
|
qsort(g_files.p, g_files.i, sizeof(*g_files.p), (void *)CompareFiles);
|
|
}
|
|
|
|
void PrintPaths(void) {
|
|
long i;
|
|
char *ts;
|
|
for (i = 0; i < g_files.i; ++i) {
|
|
ts = xiso8601(&g_files.p[i].mt);
|
|
printf("%s %s\n", ts, g_files.p[i].path);
|
|
free(ts);
|
|
}
|
|
}
|
|
|
|
void FreePaths(void) {
|
|
long i;
|
|
for (i = 0; i < g_files.i; ++i) free(g_files.p[i].path);
|
|
g_files.i = 0;
|
|
}
|
|
|
|
void LsTime(void) {
|
|
WalkPaths(".");
|
|
SortPaths();
|
|
PrintPaths();
|
|
FreePaths();
|
|
}
|
|
|
|
int main(int argc, char *argv[]) {
|
|
LsTime();
|
|
return 0;
|
|
}
|