Files
dawnline/backend/disguise/disguise_test.go
T
Aemeath ac90575b0b
Build packages / CI (push) Blocked by required conditions
Build packages / Version (push) Waiting to run
CI / Web (format, types, tests, bundles) (push) Blocked by required conditions
CI / ShellCheck (push) Blocked by required conditions
CI / Backend (Go: vet, tests, a real ubusd and uhttpd) (push) Blocked by required conditions
CI / Package files (push) Blocked by required conditions
Dawnline 0.20.0
- **Backend rewritten in Go.** One daemon, `dawnlined`, replaces the whole ucode backend: the rpcd plugin, the agent, the CLI and the updater. The package no longer depends on ucode.
- **Per-architecture builds.** The release carries the backend for arm64, ARMv7, mips, mipsle and amd64; the router fetches its own after the package is installed and checks its sha256. Dawnline does not run on other architectures (older ARM, 32-bit x86, RISC-V).
- **Faster on the router.** A firewall sync takes 0.06 s instead of 0.9 s; a full apply takes about 300 ms. The portal is served by the daemon itself, without a CGI process per request.
- **Live pages.** The admin and the portal follow a live stream from the router instead of re-fetching the whole state every 30 seconds.
- **Admin redesigned in the portal's style.** Three sections (Overview · Log · Settings); a server is a page of its own with People, Places and Settings; a device opens as a dialog over its person.
- **Changes wait for «Apply».** Every setting, and a person's access, is staged in one dock before it reaches the router.
- **Configuration rollout.** After a change that makes devices fetch their configuration again, the admin shows how many have fetched it and who has not. Every setting shows beforehand (⟳N) how many devices it will touch.
- **Waiting for a decision.** Overview and People put first the people who need one (access ended, limit reached, a device that does not connect), each with its one action a tap away.
- **Bulk actions on people.** «Select» (or a long press on a card) picks several people to extend by a month, pause or resume at once.
- **Undo.** An action done from a card or a request is undone from its toast.
- **Update dialogs redesigned.** An update is one view from its question to its result; Dawnline's own update runs in it like every other, and the page reloads itself once the new version answers. Other versions are a list, each with its notes and Install on a page of its own.
- **Site to site: networks behind a router.** A router connected as a device can have networks behind it (up to eight, /16 to /30): the server routes them and applies the router's access to them. A network that shares addresses with a tunnel, the router's own networks or another site is refused by name.
- **Routers from the portal.** People can add a router and name its networks on their own page; the admin accepts or declines with a reason, or lets them through without asking.
- **Check access and Health know the networks behind routers.**
- **Usage limits reworked.** A monthly limit no longer follows the calendar. A person's month starts with their first traffic and ends a month later; the next one starts only when they connect again, so time away uses up none of it. Before, everyone's limit reset on the 1st.
- Extra data lasts until that person's month ends; «Reset usage» starts the month anew.
- A limit is for a month or for the whole term; the admin and the portal show when it resets.
- Charts that said «this month» show the last 30 days.
- After the update nobody loses what was counted: the month that was running becomes the person's first and ends on the 1st.
- **Access by time of day removed.** The Hours limit is gone from the admin, the portal and the backend; saved hours are dropped.
- **Expiry simplified.** An end date always stops access, with a heads-up three days before; the per-person choice is gone.
- **No false disconnects from sleeping phones.** A phone or a tablet stays online through ten minutes of silence.
- **Mobile Safari fixes.** Pressing a control no longer sends the page to its top; tab tracks that do not fit scroll; switches animate after a press.
2026-11-13 09:43:50 +03:00

108 lines
3.1 KiB
Go

package disguise
import (
"encoding/json"
"fmt"
"os"
"reflect"
"regexp"
"strings"
"testing"
)
// Each made-up set of values gets the sentences ucode gives it (testdata/trace.uc, scripts/ucode-golden.sh).
func TestUnsafeAsUcode(t *testing.T) {
raw, err := os.ReadFile("testdata/trace.json")
if err != nil {
t.Fatal(err)
}
var golden struct {
Sets []struct {
O map[string]string `json:"o"`
Errs []string `json:"errs"`
All []string `json:"all"`
} `json:"sets"`
}
if err := json.Unmarshal(raw, &golden); err != nil {
t.Fatal(err)
}
rows := golden.Sets
if len(rows) < 30 {
t.Fatalf("only %d rows", len(rows))
}
said := 0
for i, r := range rows {
got := Unsafe(r.O)
said += len(got)
if !reflect.DeepEqual(got, r.Errs) {
t.Errorf("row %d %v:\n go: %q\n ucode: %q", i, r.O, got, r.Errs)
}
if all := Errors(r.O); !reflect.DeepEqual(all, r.All) {
t.Errorf("row %d %v, with Dawnline's own bounds:\n go: %q\n ucode: %q", i, r.O, all, r.All)
}
}
if said < 40 {
t.Fatalf("the rows exercise too little: %d sentences", said)
}
}
// shape is a value with what the dice decide taken out: digits as 9, hex bytes of a tag as x.
func shape(key, v string) string {
if key == "header_protection_key" {
return fmt.Sprint("key of ", len(v))
}
v = regexp.MustCompile(`0x[0-9a-f]+`).ReplaceAllStringFunc(v, func(s string) string { return "0x" + strings.Repeat("x", len(s)-2) })
// how many digits a drawn number has is the dice's too
return regexp.MustCompile(`[0-9]+`).ReplaceAllString(v, "9")
}
// A preset made here has the names, the order and the shapes of the ones ucode makes, passes its own check,
// and ucode's presets pass it too.
func TestPresets(t *testing.T) {
raw, _ := os.ReadFile("testdata/presets.json")
var golden struct {
Presets map[string][]map[string]string `json:"presets"`
}
json.Unmarshal(raw, &golden)
for _, name := range Methods {
theirs := golden.Presets[name]
if len(theirs) == 0 {
t.Fatalf("the golden has no %s preset", name)
}
shapes := map[string]map[string]bool{}
for _, o := range theirs {
if errs := Errors(o); len(errs) != 0 {
t.Errorf("ucode's own %s preset is refused: %q", name, errs)
}
for k, v := range o {
if shapes[k] == nil {
shapes[k] = map[string]bool{}
}
shapes[k][shape(k, v)] = true
}
}
for i := 0; i < 200; i++ {
mine := Preset(name)
o := map[string]string{}
for _, p := range mine {
if _, twice := o[p.Key]; twice {
t.Fatalf("%s: %s twice", name, p.Key)
}
o[p.Key] = p.Value
if !shapes[p.Key][shape(p.Key, p.Value)] {
t.Fatalf("%s: %s = %q has a shape ucode never makes (%v)", name, p.Key, p.Value, shapes[p.Key])
}
}
if len(o) != len(theirs[0]) {
t.Fatalf("%s: %d values, ucode makes %d", name, len(o), len(theirs[0]))
}
if errs := Errors(o); len(errs) != 0 {
t.Fatalf("%s: a preset its own check refuses: %q\n%v", name, errs, o)
}
}
}
if !reflect.DeepEqual(Preset("off"), []Pair{{"jc", "0"}, {"jmin", "0"}, {"jmax", "0"}, {"s1", "0"}, {"s2", "0"}, {"h1", "1"}, {"h2", "2"}, {"h3", "3"}, {"h4", "4"}}) {
t.Fatal("no disguise is not what it was")
}
}