mirror of
https://github.com/jart/cosmopolitan.git
synced 2025-01-31 11:37:35 +00:00
e16a7d8f3b
`et` means `expandtab`. ```sh rg 'vi: .* :vi' -l -0 | \ xargs -0 sed -i '' 's/vi: \(.*\) et\(.*\) :vi/vi: \1 xoet\2:vi/' rg 'vi: .* :vi' -l -0 | \ xargs -0 sed -i '' 's/vi: \(.*\)noet\(.*\):vi/vi: \1et\2 :vi/' rg 'vi: .* :vi' -l -0 | \ xargs -0 sed -i '' 's/vi: \(.*\)xoet\(.*\):vi/vi: \1noet\2:vi/' ```
55 lines
2.6 KiB
C
55 lines
2.6 KiB
C
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│
|
|
│ vi: set et ft=c ts=2 sts=2 sw=2 fenc=utf-8 :vi │
|
|
╞══════════════════════════════════════════════════════════════════════════════╡
|
|
│ Copyright 2022 Justine Alexandra Roberts Tunney │
|
|
│ │
|
|
│ 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. │
|
|
│ │
|
|
│ 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. │
|
|
╚─────────────────────────────────────────────────────────────────────────────*/
|
|
#include "tool/plinko/lib/cons.h"
|
|
#include "tool/plinko/lib/index.h"
|
|
#include "tool/plinko/lib/plinko.h"
|
|
|
|
void PlanFuncalls(int n, dword p, int x) {
|
|
int h;
|
|
if (x < 0 && (h = Car(x)) != kQuote && h != kClosure && h != kMacro) {
|
|
if (h == kLambda) {
|
|
if (!HasAtom(n, Cadr(x))) {
|
|
PlanFuncalls(n, p, Caddr(x));
|
|
}
|
|
} else if (h == kCond) {
|
|
while ((x = Cdr(x)) < 0) {
|
|
if ((h = Car(x)) < 0) {
|
|
PlanFuncalls(n, p, Car(h));
|
|
if ((h = Cdr(h)) < 0) {
|
|
PlanFuncalls(n, p, Car(h));
|
|
}
|
|
}
|
|
}
|
|
} else {
|
|
if (h == n) {
|
|
SetShadow(x, p);
|
|
}
|
|
while (x) {
|
|
if (x < 0) {
|
|
h = Car(x);
|
|
x = Cdr(x);
|
|
} else {
|
|
h = x;
|
|
x = 0;
|
|
}
|
|
PlanFuncalls(n, p, h);
|
|
}
|
|
}
|
|
}
|
|
}
|