linke-cli 0.1.0 → 0.2.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
package/README.md CHANGED
@@ -10,19 +10,25 @@ skill 说明书(`skills/linke/SKILL.md`),一条命令装入 agent 的 skil
10
10
 
11
11
  ```bash
12
12
  npm install -g linke-cli # 或 npx linke-cli <命令>
13
- linke config # 交互式录入学号/密码(输入不回显)
13
+ linke login # 首选配置:本机起登录页,自动打开浏览器(手机填写加 --qr)
14
14
  linke schedule # 直接用,登录全自动
15
15
  ```
16
16
 
17
17
  要求 Node.js ≥ 18.14,零运行时依赖。
18
18
 
19
+ `linke login` 的登录页由本机 CLI 提供(仅绑 127.0.0.1 随机端口,页面
20
+ 随 npm 包分发可审计);`--qr` 模式额外在终端展示局域网 URL 二维码
21
+ (含一次性令牌,用后即失效),手机同 Wi-Fi 扫码填写。凭据只落本机,
22
+ 不经任何云端。`linke config` 保留为非 TTY / SSH 场景的终端兜底。
23
+
19
24
  ## 命令
20
25
 
21
26
  | 命令 | 说明 |
22
27
  |---|---|
23
- | `linke config [--clear]` | 录入/清除教务凭据(存 `~/.linke-cli/config.json`,权限 600) |
28
+ | `linke login [--qr]` | 网页配置凭据(首选);`--qr` 出局域网二维码供手机填写 |
29
+ | `linke config [--clear]` | 终端录入/清除凭据(非 TTY 兜底;存 `~/.linke-cli/`,权限 600) |
30
+ | `linke verify` | 验证已存凭据(自动登录教务并显示身份) |
24
31
  | `linke status` | 配置与会话状态(JSON) |
25
- | `linke login` | 强制重登(平时自动,排障用) |
26
32
  | `linke scores [--term 2025-2026-1]` | 成绩(缺省全部学期,JSON) |
27
33
  | `linke schedule [--term ...] [--week 3]` | 课表(缺省当前学期全部周,JSON) |
28
34
  | `linke schools` | 列出学校适配器 |
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "linke-cli",
3
- "version": "0.1.0",
3
+ "version": "0.2.0",
4
4
  "description": "林课 CLI:把山财教务能力(课表/成绩只读查询)封装为本机命令行工具,供用户 agent 通过 shell 调用。登录请求从本机直发教务系统,验证码识别调用林课云端无状态 OCR 接口。",
5
5
  "type": "module",
6
6
  "bin": {
@@ -1,6 +1,6 @@
1
1
  ---
2
2
  name: linke
3
- version: 0.1.0
3
+ version: 0.2.0
4
4
  description: "林课教务查询 CLI(山东财经大学正方教务):查课表、查成绩、看教务登录状态。当用户问「我这学期课表」「今天有什么课」「我的成绩/绩点」「挂了什么课」「教务登录状态」等教务只读信息时使用。登录全自动(验证码云端识别),无需用户介入。"
5
5
  metadata:
6
6
  requires:
@@ -20,8 +20,9 @@ linke status
20
20
  ```
21
21
 
22
22
  - `configured: false` → 用户还没配置凭据。**引导用户本人**在终端运行
23
- `linke config`(交互式录入学号密码,输入不回显)。**你不代输密码、
24
- 不把密码写进任何命令**——凭据只经用户本人的终端进入 `~/.linke-cli/`。
23
+ `linke login`(本机起登录页并自动打开浏览器,手机填写加 `--qr` 出
24
+ 局域网二维码;凭据只存本机 `~/.linke-cli/`)。**你不代输密码、
25
+ 不把密码写进任何命令**——凭据只经用户本人的网页/终端进入本机。
25
26
  - `configured: true` 即可用,无需关心登录:每个命令内置鉴权状态机,
26
27
  session 过期自动重登,只有凭据失效才需要人介入。
27
28
 
@@ -29,13 +30,15 @@ linke status
29
30
 
30
31
  | 需求 | 命令 |
31
32
  |---|---|
33
+ | 配置凭据(用户本人执行) | `linke login`(网页输入;`--qr` 手机扫码填写) |
34
+ | 终端配置(非 TTY / SSH 兜底) | `linke config` |
35
+ | 验证已存凭据 | `linke verify` |
32
36
  | 本学期课表(全部周) | `linke schedule` |
33
37
  | 指定学期课表 | `linke schedule --term 2025-2026-1` |
34
38
  | 单周课表 | `linke schedule --week 3` |
35
39
  | 全部成绩 | `linke scores` |
36
40
  | 指定学期成绩 | `linke scores --term 2025-2026-1` |
37
41
  | 登录/配置状态 | `linke status` |
38
- | 强制重登(排障用) | `linke login` |
39
42
 
40
43
  ## 输出契约
41
44
 
@@ -53,11 +56,11 @@ linke status
53
56
  | exit code | 含义 | 你的动作 |
54
57
  |---|---|---|
55
58
  | 0 | 成功 | 解析 stdout |
56
- | 2 | 凭据失效(教务报密码错误) | 引导用户本人重新运行 `linke config`,不要自行重试 |
59
+ | 2 | 凭据失效(教务报密码错误) | 引导用户本人重新运行 `linke login`,不要自行重试 |
57
60
  | 3 | 验证码自动识别连续未通过 | 直接重试一次同一命令;仍失败告知用户稍后再试 |
58
61
  | 4 | 网络不可达(教务或云端识别) | 告知用户检查网络后重试 |
59
62
  | 5 | 解析失败(教务页面改版) | 告知用户到 linke-cli 仓库提 issue,不要反复重试 |
60
- | 6 | 未配置凭据 | 引导用户本人运行 `linke config` |
63
+ | 6 | 未配置凭据 | 引导用户本人运行 `linke login`(网页输入;SSH 场景 `linke config`) |
61
64
 
62
65
  stderr 末行「提示:」是面向用户的自救说明,可直接转述。
63
66
 
@@ -68,7 +71,8 @@ stderr 末行「提示:」是面向用户的自救说明,可直接转述。
68
71
  不要尝试用任何方式绕过。
69
72
  2. **凭据纪律**:密码只存在于用户本机 `~/.linke-cli/`(权限 600)。
70
73
  不询问、不存储、不转发用户密码;需要录入时只引导用户本人跑
71
- `linke config`。
74
+ `linke login`(或 SSH 场景 `linke config`)。`linke login` 起的
75
+ 网页服务只绑本机/局域网且带一次性令牌,凭据不经过任何云端。
72
76
  3. **频次纪律**:教务系统对高频请求有风控,连续查询之间保持间隔,
73
77
  不做轮询;一次问答内同一命令不重复执行超过 2 次。
74
78
  4. 数据口径:成绩/课表数据实时来自教务系统,如与预期不符先用
package/src/bin.js CHANGED
@@ -15,20 +15,25 @@ import {
15
15
  import { installSkill, skillSourceDir } from './skill.js'
16
16
  import { ask, askPassword } from './prompt.js'
17
17
  import { emitJson, progress } from './util.js'
18
+ import { startLoginServer } from './loginserver.js'
19
+ import { buildQr, renderTerminal } from './qr.js'
20
+ import { exec } from 'node:child_process'
18
21
 
19
22
  const USAGE = `linke —— 林课教务 CLI(只读查询,供 agent / 人类使用)
20
23
 
21
24
  用法:
22
- linke config [--school sdufe] [--api-base URL] 交互式录入学号/密码(存 ~/.linke-cli/,权限 600)
23
- linke config --clear 清除本机凭据
24
- linke status 配置与教务会话状态(JSON)
25
- linke login 强制重新登录(状态机平时自动做)
26
- linke scores [--term 2025-2026-1] 成绩查询(缺省=全部学期)
27
- linke schedule [--term 2025-2026-1] [--week 3] 课表查询(缺省=当前学期全部周)
28
- linke schools 列出可用学校适配器
29
- linke skill install [--path ~/.agents/skills] 安装 agent skill 说明书
30
- linke logout 清除本机教务 session(保留凭据)
31
- linke help 本帮助
25
+ linke login [--qr] 网页配置凭据(首选):本机起登录页自动开浏览器;
26
+ --qr 额外展示局域网二维码,手机同 Wi-Fi 填写
27
+ linke config [--school sdufe] [--api-base URL] 终端录入凭据(非 TTY / SSH 兜底)
28
+ linke config --clear 清除本机凭据
29
+ linke verify 验证已存凭据(自动登录教务并显示身份)
30
+ linke status 配置与教务会话状态(JSON)
31
+ linke scores [--term 2025-2026-1] 成绩查询(缺省=全部学期)
32
+ linke schedule [--term 2025-2026-1] [--week 3] 课表查询(缺省=当前学期全部周)
33
+ linke schools 列出可用学校适配器
34
+ linke skill install [--path ~/.agents/skills] 安装 agent skill 说明书
35
+ linke logout 清除本机教务 session(保留凭据)
36
+ linke help 本帮助
32
37
 
33
38
  说明:
34
39
  登录请求从本机直发教务系统;验证码图片仅用于云端识别(传图返文字)。
@@ -90,7 +95,7 @@ async function cmdConfig(flags) {
90
95
  }
91
96
  saveConfig({ school, userId, password, apiBase })
92
97
  clearSession() // 凭据变更后旧 session 一律作废
93
- progress(`已保存到 ~/.linke-cli/config.json(权限 600)。运行 linke login 验证,或直接运行任意查询命令。`)
98
+ progress(`已保存到 ~/.linke-cli/config.json(权限 600)。建议运行 linke verify 验证凭据,或直接运行任意查询命令。`)
94
99
  return 0
95
100
  }
96
101
 
@@ -112,7 +117,62 @@ async function cmdStatus() {
112
117
  return 0
113
118
  }
114
119
 
115
- async function cmdLogin() {
120
+ function openBrowser(url) {
121
+ const platform = process.platform
122
+ const cmd =
123
+ platform === 'darwin' ? `open ${JSON.stringify(url)}` :
124
+ platform === 'win32' ? `start "" ${JSON.stringify(url)}` :
125
+ `xdg-open ${JSON.stringify(url)}`
126
+ exec(cmd, () => {}) // 打开失败不致命:终端已打印 URL
127
+ }
128
+
129
+ async function cmdLogin(flags) {
130
+ const qr = flags.qr === true
131
+ let settle
132
+ const submitted = new Promise((resolve) => {
133
+ settle = resolve
134
+ })
135
+ const handle = await startLoginServer({ qr, onSubmit: settle })
136
+ progress('登录页已就绪(5 分钟内有效,成功或超时后自动关闭)')
137
+ progress(`本机访问: ${handle.urls.local}`)
138
+ if (qr && handle.urls.lan.length > 0) {
139
+ progress('局域网访问(含一次性令牌,勿转发他人):')
140
+ for (const lan of handle.urls.lan) {
141
+ progress(` ${lan}`)
142
+ const { modules } = buildQr(Buffer.from(lan, 'utf8'))
143
+ process.stderr.write('\n' + renderTerminal(modules, 2) + '\n\n')
144
+ }
145
+ } else if (qr) {
146
+ progress('未探测到局域网 IPv4 地址,二维码不可用(本机访问不受影响)')
147
+ } else {
148
+ progress('提示:手机填写请改用 linke login --qr(展示局域网二维码)')
149
+ }
150
+ progress('正在打开浏览器...')
151
+ openBrowser(handle.urls.local)
152
+ process.on('SIGINT', () => {
153
+ handle.close()
154
+ progress('已取消,凭据未保存')
155
+ process.exit(130)
156
+ })
157
+
158
+ const result = await submitted
159
+ if (!result.ok) {
160
+ progress('超时未提交,凭据未保存;可重新运行 linke login')
161
+ return 1
162
+ }
163
+ progress(`凭据已保存(学号 ${result.userId}),正在验证教务登录...`)
164
+ // 复用 verify 逻辑:网页配置后立即做一次真实登录验证。
165
+ // 验证失败不影响已保存的凭据(多为验证码偶发),提示后以非零码退出。
166
+ try {
167
+ return await cmdVerify()
168
+ } catch (err) {
169
+ progress(`凭据已保存,但本次自动验证未通过:${err.message || err}`)
170
+ progress('稍后运行任意查询命令(如 linke scores)会自动重试登录')
171
+ return err instanceof LinkeError ? err.exitCode : 1
172
+ }
173
+ }
174
+
175
+ async function cmdVerify() {
116
176
  const config = requireConfig()
117
177
  const adapter = getAdapter(config.school)
118
178
  const session = await forceLogin(adapter, config)
@@ -198,7 +258,9 @@ async function dispatch(argv) {
198
258
  case 'status':
199
259
  return cmdStatus()
200
260
  case 'login':
201
- return cmdLogin()
261
+ return cmdLogin(flags)
262
+ case 'verify':
263
+ return cmdVerify()
202
264
  case 'scores':
203
265
  return cmdScores(flags)
204
266
  case 'schedule':
@@ -0,0 +1,182 @@
1
+ /**
2
+ * 本地登录服务(T6):`linke login` 在用户本机起内置登录页。
3
+ *
4
+ * 安全口径(T6 验收 1-4):
5
+ * - 本地模式仅绑 127.0.0.1 随机端口;二维码模式(--qr)绑 0.0.0.0
6
+ * 供局域网手机访问,URL 强制携带一次性令牌;
7
+ * - 令牌一次性:提交成功(无论凭据是否有效)立即失效;
8
+ * - 凭据只经 POST /submit 进入本进程 → saveConfig 落盘(0600),
9
+ * 不写任何日志、不打印;
10
+ * - Host 头必须是 IP 字面量(防 DNS rebinding);Origin 头存在时
11
+ * 必须同源(防跨站提交);页面为随包分发的静态文件(可审计),
12
+ * 不从云端拉取任何内容;
13
+ * - 服务在提交成功或超时(默认 5 分钟)后自动关闭。
14
+ */
15
+ import http from 'node:http'
16
+ import crypto from 'node:crypto'
17
+ import fs from 'node:fs'
18
+ import path from 'node:path'
19
+ import os from 'node:os'
20
+ import { fileURLToPath } from 'node:url'
21
+ import { saveConfig, DEFAULT_SCHOOL, DEFAULT_API_BASE } from './config.js'
22
+ import { clearSession } from './session.js'
23
+
24
+ const DEFAULT_TIMEOUT_MS = 5 * 60 * 1000
25
+ const MAX_BODY_BYTES = 64 * 1024
26
+
27
+ function loginPageHtml() {
28
+ const here = path.dirname(fileURLToPath(import.meta.url))
29
+ return fs.readFileSync(path.join(here, 'web', 'login.html'), 'utf8')
30
+ }
31
+
32
+ /** 枚举本机局域网 IPv4(排除回环/内网虚拟网段由调用方展示时全列) */
33
+ export function lanAddresses() {
34
+ const result = []
35
+ const interfaces = os.networkInterfaces()
36
+ for (const name of Object.keys(interfaces)) {
37
+ for (const info of interfaces[name] || []) {
38
+ if (info.family !== 'IPv4' || info.internal) continue
39
+ result.push({ name, address: info.address })
40
+ }
41
+ }
42
+ return result
43
+ }
44
+
45
+ function isIpLiteralHost(host) {
46
+ const hostname = String(host || '').split(':')[0]
47
+ if (!hostname) return false
48
+ return /^(\d{1,3}\.){3}\d{1,3}$/.test(hostname) || hostname === '[::1]' || hostname === '::1'
49
+ }
50
+
51
+ /**
52
+ * 起本地登录服务。
53
+ * @param {object} options
54
+ * @param {boolean} options.qr 二维码模式:绑 0.0.0.0(含 127.0.0.1);默认仅 127.0.0.1
55
+ * @param {(result: {ok: boolean, userId?: string, error?: string}) => void} options.onSubmit 凭据落盘回调
56
+ * @param {number} options.timeoutMs 超时自动关闭
57
+ * @returns {Promise<{server, port, token, urls: {local: string, lan: string[]}, close: () => void}>}
58
+ */
59
+ export function startLoginServer({ qr = false, timeoutMs = DEFAULT_TIMEOUT_MS, onSubmit } = {}) {
60
+ return new Promise((resolve, reject) => {
61
+ const token = crypto.randomBytes(16).toString('hex')
62
+ const pageHtml = loginPageHtml()
63
+ let tokenUsed = false
64
+ let closed = false
65
+
66
+ const server = http.createServer((req, res) => {
67
+ const url = new URL(req.url, 'http://placeholder')
68
+ const sendJson = (status, payload) => {
69
+ res.writeHead(status, { 'Content-Type': 'application/json;charset=utf-8' })
70
+ res.end(JSON.stringify(payload))
71
+ }
72
+
73
+ // 防 DNS rebinding:Host 必须是 IP 字面量
74
+ if (!isIpLiteralHost(req.headers.host)) {
75
+ sendJson(403, { ok: false, error: '非法 Host' })
76
+ return
77
+ }
78
+
79
+ if (req.method === 'GET' && url.pathname === '/') {
80
+ if (tokenUsed || url.searchParams.get('t') !== token) {
81
+ res.writeHead(403, { 'Content-Type': 'text/html;charset=utf-8' })
82
+ res.end('<meta charset="utf-8"><p>链接无效或已使用:请回到终端重新运行 linke login。</p>')
83
+ return
84
+ }
85
+ res.writeHead(200, { 'Content-Type': 'text/html;charset=utf-8' })
86
+ res.end(pageHtml)
87
+ return
88
+ }
89
+
90
+ if (req.method === 'POST' && url.pathname === '/submit') {
91
+ // 防 CSRF:浏览器提交必带 Origin,存在则必须同源
92
+ const origin = req.headers.origin
93
+ if (origin) {
94
+ const host = req.headers.host
95
+ if (origin !== `http://${host}`) {
96
+ sendJson(403, { ok: false, error: '非法来源' })
97
+ return
98
+ }
99
+ }
100
+ const chunks = []
101
+ let size = 0
102
+ req.on('data', (chunk) => {
103
+ size += chunk.length
104
+ if (size > MAX_BODY_BYTES) {
105
+ req.destroy()
106
+ return
107
+ }
108
+ chunks.push(chunk)
109
+ })
110
+ req.on('end', () => {
111
+ if (tokenUsed) {
112
+ sendJson(403, { ok: false, error: '令牌已使用,请重新运行 linke login' })
113
+ return
114
+ }
115
+ let body
116
+ try {
117
+ body = JSON.parse(Buffer.concat(chunks).toString('utf8'))
118
+ } catch {
119
+ sendJson(400, { ok: false, error: '请求体不是合法 JSON' })
120
+ return
121
+ }
122
+ if (body.token !== token) {
123
+ sendJson(403, { ok: false, error: '令牌错误' })
124
+ return
125
+ }
126
+ const userId = String(body.userId || '').trim()
127
+ const password = String(body.password || '')
128
+ if (!userId || !password) {
129
+ sendJson(400, { ok: false, error: '学号与密码均不能为空' })
130
+ return
131
+ }
132
+ // 令牌一次性:无论后续结果如何,本令牌立即作废
133
+ tokenUsed = true
134
+ saveConfig({
135
+ school: DEFAULT_SCHOOL,
136
+ userId,
137
+ password,
138
+ apiBase: DEFAULT_API_BASE,
139
+ })
140
+ clearSession() // 凭据变更后旧 session 作废
141
+ // 注意:此处不打印/记录 body 任何内容(凭据红线)
142
+ sendJson(200, { ok: true })
143
+ onSubmit && onSubmit({ ok: true, userId })
144
+ closeServer()
145
+ })
146
+ return
147
+ }
148
+
149
+ sendJson(404, { ok: false, error: 'Not Found' })
150
+ })
151
+
152
+ const closeServer = () => {
153
+ if (closed) return
154
+ closed = true
155
+ clearTimeout(timeoutHandle)
156
+ // keep-alive 空闲连接会阻止 close 生效,强制断开
157
+ if (typeof server.closeAllConnections === 'function') server.closeAllConnections()
158
+ server.close()
159
+ }
160
+
161
+ const timeoutHandle = setTimeout(() => {
162
+ closeServer()
163
+ onSubmit && onSubmit({ ok: false, error: 'timeout' })
164
+ }, timeoutMs)
165
+
166
+ server.on('error', reject)
167
+ server.listen(0, qr ? '0.0.0.0' : '127.0.0.1', () => {
168
+ const port = server.address().port
169
+ const urls = {
170
+ local: `http://127.0.0.1:${port}/?t=${token}`,
171
+ lan: qr ? lanAddresses().map((i) => `http://${i.address}:${port}/?t=${token}`) : [],
172
+ }
173
+ resolve({
174
+ server,
175
+ port,
176
+ token,
177
+ urls,
178
+ close: closeServer,
179
+ })
180
+ })
181
+ })
182
+ }
package/src/qr.js ADDED
@@ -0,0 +1,390 @@
1
+ /**
2
+ * 精简 QR Code 编码器(Model 2,byte mode,纠错级 L,version 1-6)。
3
+ * 为守住「零依赖」架构决策(T3)手写实现:局域网 URL ≈ 60-100 字节,
4
+ * v6-L 容量 136 字节已覆盖;version ≤ 6 无需 version info 块,复杂度可控。
5
+ *
6
+ * 结构:
7
+ * buildQr(bytes) → { size, modules }(布尔矩阵,true=黑)
8
+ * renderTerminal(matrix, quietZone) → 终端半块字符文本
9
+ *
10
+ * 正确性由 test/qr.test.mjs 与系统 qrencode 逐模块对拍保障。
11
+ */
12
+
13
+ // ---- version 参数表(L 级)----
14
+ // blocks: [ [totalCodewords, dataCodewords], ... ] 每块
15
+ const VERSION_PARAMS = {
16
+ 1: { size: 21, blocks: [[26, 19]] },
17
+ 2: { size: 25, blocks: [[44, 34]] },
18
+ 3: { size: 29, blocks: [[70, 55]] },
19
+ 4: { size: 33, blocks: [[100, 80]] },
20
+ 5: { size: 37, blocks: [[134, 108]] },
21
+ 6: { size: 41, blocks: [[86, 68], [86, 68]] },
22
+ }
23
+
24
+ // alignment pattern 中心坐标候选(仅右下角组合不与 finder 重叠,v2-6)
25
+ const ALIGN_POS = { 1: [], 2: [6, 18], 3: [6, 22], 4: [6, 26], 5: [6, 30], 6: [6, 34] }
26
+
27
+ // ---- GF(256),本原多项式 0x11d ----
28
+ const GF_EXP = new Uint8Array(512)
29
+ const GF_LOG = new Uint8Array(256)
30
+ ;(function buildGf() {
31
+ let x = 1
32
+ for (let i = 0; i < 255; i++) {
33
+ GF_EXP[i] = x
34
+ GF_LOG[x] = i
35
+ x <<= 1
36
+ if (x & 0x100) x ^= 0x11d
37
+ }
38
+ for (let i = 255; i < 512; i++) GF_EXP[i] = GF_EXP[i - 255]
39
+ })()
40
+
41
+ function gfMul(a, b) {
42
+ if (a === 0 || b === 0) return 0
43
+ return GF_EXP[GF_LOG[a] + GF_LOG[b]]
44
+ }
45
+
46
+ /** RS 生成多项式 g(x) = ∏(x - α^i),系数最高次在前 */
47
+ function rsGeneratorPoly(degree) {
48
+ let poly = [1]
49
+ for (let i = 0; i < degree; i++) {
50
+ const next = new Array(poly.length + 1).fill(0)
51
+ for (let j = 0; j < poly.length; j++) {
52
+ next[j] ^= poly[j]
53
+ next[j + 1] ^= gfMul(poly[j], GF_EXP[i])
54
+ }
55
+ poly = next
56
+ }
57
+ return poly
58
+ }
59
+
60
+ /** 求数据多项式的 RS 纠错码字(systematic 编码) */
61
+ function rsEncode(data, ecLen) {
62
+ const gen = rsGeneratorPoly(ecLen)
63
+ const rem = new Array(data.length + ecLen).fill(0)
64
+ for (let i = 0; i < data.length; i++) rem[i] = data[i]
65
+ for (let i = 0; i < data.length; i++) {
66
+ const factor = rem[i]
67
+ if (factor === 0) continue
68
+ for (let j = 0; j < gen.length; j++) {
69
+ rem[i + j] ^= gfMul(gen[j], factor)
70
+ }
71
+ }
72
+ return rem.slice(data.length)
73
+ }
74
+
75
+ // ---- 数据位流 ----
76
+
77
+ /** 按最小可用 version 编码为总码字流(含块交织);导出供测试分层验证 */
78
+ export function encodeCodewords(bytes) {
79
+ const len = bytes.length
80
+ let version = 0
81
+ for (let v = 1; v <= 6; v++) {
82
+ const dataCap = VERSION_PARAMS[v].blocks.reduce((sum, [t, d]) => sum + d, 0)
83
+ // byte mode 头部开销:mode 4bit + 计数 8bit
84
+ if (len + 2 <= dataCap) {
85
+ version = v
86
+ break
87
+ }
88
+ }
89
+ if (!version) {
90
+ throw new Error(`内容过长(${len} 字节),超出 v6-L 容量`)
91
+ }
92
+ const { blocks } = VERSION_PARAMS[version]
93
+ const dataCap = blocks.reduce((sum, [t, d]) => sum + d, 0)
94
+
95
+ // 位流:mode(0100) + 8bit 计数 + 数据 + 终止符 + 填充
96
+ const bits = []
97
+ const push = (value, count) => {
98
+ for (let i = count - 1; i >= 0; i--) bits.push((value >> i) & 1)
99
+ }
100
+ push(0b0100, 4)
101
+ push(len, 8)
102
+ for (const byte of bytes) push(byte, 8)
103
+ const capacityBits = dataCap * 8
104
+ push(0, Math.min(4, capacityBits - bits.length))
105
+ while (bits.length % 8 !== 0) bits.push(0)
106
+ const stream = []
107
+ for (let i = 0; i < bits.length; i += 8) {
108
+ let byte = 0
109
+ for (let j = 0; j < 8; j++) byte = (byte << 1) | bits[i + j]
110
+ stream.push(byte)
111
+ }
112
+ const padBytes = [0xec, 0x11]
113
+ let padIdx = 0
114
+ while (stream.length < dataCap) stream.push(padBytes[padIdx++ % 2])
115
+
116
+ // 分块 + 各块纠错 + 交织(数据列优先,纠错随后)
117
+ const dataBlocks = []
118
+ const ecBlocks = []
119
+ let offset = 0
120
+ for (const [, dataLen] of blocks) {
121
+ const chunk = stream.slice(offset, offset + dataLen)
122
+ offset += dataLen
123
+ dataBlocks.push(chunk)
124
+ ecBlocks.push(rsEncode(chunk, blocks[0][0] - blocks[0][1]))
125
+ }
126
+ const maxData = Math.max(...dataBlocks.map((b) => b.length))
127
+ const maxEc = Math.max(...ecBlocks.map((b) => b.length))
128
+ const codewords = []
129
+ for (let i = 0; i < maxData; i++) {
130
+ for (const block of dataBlocks) if (i < block.length) codewords.push(block[i])
131
+ }
132
+ for (let i = 0; i < maxEc; i++) {
133
+ for (const block of ecBlocks) if (i < block.length) codewords.push(block[i])
134
+ }
135
+ return { version, codewords }
136
+ }
137
+
138
+ // ---- 矩阵 ----
139
+
140
+ function makeMatrices(size) {
141
+ const modules = Array.from({ length: size }, () => new Array(size).fill(false))
142
+ const reserved = Array.from({ length: size }, () => new Array(size).fill(false))
143
+ return { modules, reserved }
144
+ }
145
+
146
+ function reserveFinder(modules, reserved, row, col) {
147
+ for (let r = -1; r <= 7; r++) {
148
+ for (let c = -1; c <= 7; c++) {
149
+ const rr = row + r
150
+ const cc = col + c
151
+ if (rr < 0 || rr >= modules.length || cc < 0 || cc >= modules.length) continue
152
+ const inRing =
153
+ (r >= 0 && r <= 6 && (c === 0 || c === 6)) ||
154
+ (c >= 0 && c <= 6 && (r === 0 || r === 6)) ||
155
+ (r >= 2 && r <= 4 && c >= 2 && c <= 4)
156
+ modules[rr][cc] = inRing
157
+ reserved[rr][cc] = true
158
+ }
159
+ }
160
+ }
161
+
162
+ function reserveAlignment(modules, reserved, centers, size) {
163
+ for (const [row, col] of centers) {
164
+ for (let r = -2; r <= 2; r++) {
165
+ for (let c = -2; c <= 2; c++) {
166
+ const rr = row + r
167
+ const cc = col + c
168
+ if (rr < 0 || rr >= size || cc < 0 || cc >= size) continue
169
+ if (reserved[rr][cc]) continue
170
+ const isRing = Math.max(Math.abs(r), Math.abs(c)) !== 1
171
+ modules[rr][cc] = isRing
172
+ reserved[rr][cc] = true
173
+ }
174
+ }
175
+ }
176
+ }
177
+
178
+ /** format info 的两份副本共 30 个固定位置(值由 placeFormat 填充) */
179
+ function formatPositions(size) {
180
+ return [
181
+ [8, 0], [8, 1], [8, 2], [8, 3], [8, 4], [8, 5], [8, 7], [8, 8],
182
+ [7, 8], [5, 8], [4, 8], [3, 8], [2, 8], [1, 8], [0, 8],
183
+ [size - 1, 8], [size - 2, 8], [size - 3, 8], [size - 4, 8],
184
+ [size - 5, 8], [size - 6, 8], [size - 7, 8],
185
+ [8, size - 8], [8, size - 7], [8, size - 6], [8, size - 5], [8, size - 4],
186
+ [8, size - 3], [8, size - 2], [8, size - 1],
187
+ ]
188
+ }
189
+
190
+ function buildFunctionPatterns(version) {
191
+ const { size } = VERSION_PARAMS[version]
192
+ const { modules, reserved } = makeMatrices(size)
193
+ // finder + separator(三个角)
194
+ reserveFinder(modules, reserved, 0, 0)
195
+ reserveFinder(modules, reserved, 0, size - 7)
196
+ reserveFinder(modules, reserved, size - 7, 0)
197
+ // timing
198
+ for (let i = 8; i < size - 8; i++) {
199
+ modules[6][i] = i % 2 === 0
200
+ reserved[6][i] = true
201
+ modules[i][6] = i % 2 === 0
202
+ reserved[i][6] = true
203
+ }
204
+ // alignment(跳过与 finder 保留区重叠的组合——v2-6 实际仅右下一个)
205
+ const centers = []
206
+ const pos = ALIGN_POS[version]
207
+ for (const r of pos) {
208
+ for (const c of pos) {
209
+ if (reserved[r] && reserved[r][c]) continue
210
+ centers.push([r, c])
211
+ }
212
+ }
213
+ reserveAlignment(modules, reserved, centers, size)
214
+ // format info 区预留(数据放置须跳过,值由 placeFormat 填充)
215
+ for (const [r, c] of formatPositions(size)) reserved[r][c] = true
216
+ // dark module
217
+ modules[4 * version + 9][8] = true
218
+ reserved[4 * version + 9][8] = true
219
+ return { modules, reserved }
220
+ }
221
+
222
+ const MASK_FUNCS = [
223
+ (r, c) => (r + c) % 2 === 0,
224
+ (r) => r % 2 === 0,
225
+ (r, c) => c % 3 === 0,
226
+ (r, c) => (r + c) % 3 === 0,
227
+ (r, c) => (Math.floor(r / 2) + Math.floor(c / 3)) % 2 === 0,
228
+ (r, c) => ((r * c) % 2) + ((r * c) % 3) === 0,
229
+ (r, c) => (((r * c) % 2) + ((r * c) % 3)) % 2 === 0,
230
+ (r, c) => (((r + c) % 2) + ((r * c) % 3)) % 2 === 0,
231
+ ]
232
+
233
+ /** 把码字按蛇形顺序放置并用 mask 翻转(功能模块不动) */
234
+ function placeData(modules, reserved, codewords, maskFn) {
235
+ const size = modules.length
236
+ const bits = []
237
+ for (const byte of codewords) {
238
+ for (let i = 7; i >= 0; i--) bits.push((byte >> i) & 1)
239
+ }
240
+ let bitIdx = 0
241
+ const takeBit = () => (bitIdx < bits.length ? bits[bitIdx++] : 0)
242
+ let col = size - 1
243
+ let upward = true
244
+ while (col > 0) {
245
+ if (col === 6) col -= 1
246
+ for (let i = 0; i < size; i++) {
247
+ const row = upward ? size - 1 - i : i
248
+ for (const cc of [col, col - 1]) {
249
+ if (reserved[row][cc]) continue
250
+ let bit = takeBit()
251
+ if (maskFn(row, cc)) bit ^= 1
252
+ modules[row][cc] = bit === 1
253
+ }
254
+ }
255
+ col -= 2
256
+ upward = !upward
257
+ }
258
+ return modules
259
+ }
260
+
261
+ /** BCH(15,5) 计算 format 信息(未异或 mask 前的 15 bit) */
262
+ function formatBits(mask) {
263
+ const data = (0b01 << 3) | mask // L = 01
264
+ let rem = data
265
+ for (let i = 0; i < 10; i++) {
266
+ rem = (rem << 1) ^ ((rem >> 9) * 0x537)
267
+ }
268
+ return ((data << 10) | (rem & 0x3ff)) ^ 0x5412
269
+ }
270
+
271
+ function placeFormat(modules, mask) {
272
+ const size = modules.length
273
+ const bits = formatBits(mask)
274
+ const bitAt = (i) => ((bits >> i) & 1) === 1 // i: 14..0
275
+ const seq = formatPositions(size)
276
+ seq.forEach(([r, c], idx) => {
277
+ modules[r][c] = bitAt(idx < 15 ? 14 - idx : 14 - (idx - 15))
278
+ })
279
+ }
280
+
281
+ // ---- penalty(标准 4 规则,用于选最优掩码)----
282
+
283
+ function penaltyFor(modules) {
284
+ const size = modules.length
285
+ let penalty = 0
286
+
287
+ // N1/N3:行、列两个方向
288
+ for (const horizontal of [true, false]) {
289
+ for (let i = 0; i < size; i++) {
290
+ let run = 1
291
+ const cells = []
292
+ for (let j = 0; j < size; j++) {
293
+ cells.push(horizontal ? modules[i][j] : modules[j][i])
294
+ }
295
+ for (let j = 1; j < size; j++) {
296
+ if (cells[j] === cells[j - 1]) run++
297
+ else {
298
+ if (run >= 5) penalty += 3 + (run - 5)
299
+ run = 1
300
+ }
301
+ }
302
+ if (run >= 5) penalty += 3 + (run - 5)
303
+ const line = cells.map((v) => (v ? '1' : '0')).join('')
304
+ let from = 0
305
+ while (true) {
306
+ const idx1 = line.indexOf('10111010000', from)
307
+ const idx2 = line.indexOf('00001011101', from)
308
+ if (idx1 === -1 && idx2 === -1) break
309
+ penalty += 40
310
+ from = (idx1 === -1 ? idx2 : idx1) + 1
311
+ }
312
+ }
313
+ }
314
+
315
+ // N2:2×2 同色块
316
+ for (let r = 0; r < size - 1; r++) {
317
+ for (let c = 0; c < size - 1; c++) {
318
+ if (
319
+ modules[r][c] === modules[r][c + 1] &&
320
+ modules[r][c] === modules[r + 1][c] &&
321
+ modules[r][c] === modules[r + 1][c + 1]
322
+ ) {
323
+ penalty += 3
324
+ }
325
+ }
326
+ }
327
+
328
+ // N4:暗模块比例偏离 50%
329
+ let dark = 0
330
+ for (const row of modules) for (const v of row) if (v) dark++
331
+ const percent = (dark * 100) / (size * size)
332
+ penalty += Math.floor(Math.abs(percent - 50) / 5) * 10
333
+ return penalty
334
+ }
335
+
336
+ /**
337
+ * 编码入口:返回带掩码的完整矩阵。
338
+ * @param {Uint8Array|number[]} bytes byte mode 内容
339
+ */
340
+ export function buildQr(bytes) {
341
+ const { version, codewords } = encodeCodewords(Array.from(bytes))
342
+ let best = null
343
+ let bestPenalty = Infinity
344
+ let bestMask = 0
345
+ for (let mask = 0; mask < 8; mask++) {
346
+ const { modules, reserved } = buildFunctionPatterns(version)
347
+ placeData(modules, reserved, codewords, MASK_FUNCS[mask])
348
+ placeFormat(modules, mask)
349
+ const penalty = penaltyFor(modules)
350
+ if (penalty < bestPenalty) {
351
+ bestPenalty = penalty
352
+ best = modules
353
+ bestMask = mask
354
+ }
355
+ }
356
+ return { size: best.length, modules: best, mask: bestMask, version }
357
+ }
358
+
359
+ /** 按指定掩码构建(测试对拍用) */
360
+ export function buildQrWithMask(bytes, mask) {
361
+ const { version, codewords } = encodeCodewords(Array.from(bytes))
362
+ const { modules, reserved } = buildFunctionPatterns(version)
363
+ placeData(modules, reserved, codewords, MASK_FUNCS[mask])
364
+ placeFormat(modules, mask)
365
+ return { size: modules.length, modules, mask, version }
366
+ }
367
+
368
+ /** 终端渲染:半块字符,每字符 1 模块宽 × 2 模块高,含 quiet zone */
369
+ export function renderTerminal(matrix, quietZone = 4) {
370
+ const size = matrix.length
371
+ const total = size + quietZone * 2
372
+ const grid = Array.from({ length: total }, () => new Array(total).fill(false))
373
+ for (let r = 0; r < size; r++) {
374
+ for (let c = 0; c < size; c++) grid[r + quietZone][c + quietZone] = matrix[r][c]
375
+ }
376
+ const lines = []
377
+ for (let r = 0; r < total; r += 2) {
378
+ let line = ''
379
+ for (let c = 0; c < total; c++) {
380
+ const top = grid[r][c]
381
+ const bottom = grid[r + 1] ? grid[r + 1][c] : false
382
+ if (top && bottom) line += '█'
383
+ else if (top) line += '▀'
384
+ else if (bottom) line += '▄'
385
+ else line += ' '
386
+ }
387
+ lines.push(line)
388
+ }
389
+ return lines.join('\n')
390
+ }
@@ -0,0 +1,94 @@
1
+ <!DOCTYPE html>
2
+ <html lang="zh-CN">
3
+ <head>
4
+ <meta charset="utf-8">
5
+ <meta name="viewport" content="width=device-width, initial-scale=1">
6
+ <title>linke · 教务账号配置</title>
7
+ <style>
8
+ :root { color-scheme: light dark; }
9
+ * { box-sizing: border-box; }
10
+ body {
11
+ margin: 0; min-height: 100vh; display: flex; align-items: center; justify-content: center;
12
+ font-family: -apple-system, "PingFang SC", "Microsoft YaHei", sans-serif;
13
+ background: #f5f6f8; color: #1f2328; padding: 24px;
14
+ }
15
+ @media (prefers-color-scheme: dark) { body { background: #14171a; color: #e2e6ea; } }
16
+ .card {
17
+ width: 100%; max-width: 380px; background: #fff; border-radius: 12px;
18
+ padding: 28px 24px; box-shadow: 0 4px 24px rgba(0,0,0,.08);
19
+ }
20
+ @media (prefers-color-scheme: dark) { .card { background: #1d2126; } }
21
+ h1 { font-size: 18px; margin: 0 0 4px; }
22
+ .sub { font-size: 13px; color: #6a737d; margin-bottom: 20px; line-height: 1.6; }
23
+ @media (prefers-color-scheme: dark) { .sub { color: #9aa4af; } }
24
+ label { display: block; font-size: 13px; margin: 14px 0 6px; }
25
+ input {
26
+ width: 100%; padding: 10px 12px; font-size: 16px; border: 1px solid #d0d7de;
27
+ border-radius: 8px; background: transparent; color: inherit;
28
+ }
29
+ @media (prefers-color-scheme: dark) { input { border-color: #3a4149; } }
30
+ input:focus { outline: 2px solid #4c8dff; border-color: transparent; }
31
+ button {
32
+ width: 100%; margin-top: 22px; padding: 11px; font-size: 15px; border: 0;
33
+ border-radius: 8px; background: #2da44e; color: #fff; cursor: pointer;
34
+ }
35
+ button:disabled { opacity: .6; cursor: default; }
36
+ .msg { margin-top: 16px; font-size: 13px; line-height: 1.7; display: none; }
37
+ .msg.ok { display: block; color: #1a7f37; }
38
+ .msg.err { display: block; color: #cf222e; }
39
+ </style>
40
+ </head>
41
+ <body>
42
+ <main class="card">
43
+ <h1>林课 linke · 教务账号配置</h1>
44
+ <p class="sub">此页面由<strong>你本机的 linke CLI</strong> 提供,密码只保存在本机
45
+ (~/.linke-cli/,权限 600),不会发送到任何服务器。</p>
46
+ <form id="form">
47
+ <label for="userId">学号</label>
48
+ <input id="userId" name="userId" autocomplete="username" inputmode="numeric" required>
49
+ <label for="password">教务密码</label>
50
+ <input id="password" name="password" type="password" autocomplete="current-password" required>
51
+ <button id="btn" type="submit">保存到本机</button>
52
+ </form>
53
+ <p id="msg" class="msg"></p>
54
+ </main>
55
+ <script>
56
+ const params = new URLSearchParams(location.search)
57
+ const token = params.get('t') || ''
58
+ const form = document.getElementById('form')
59
+ const btn = document.getElementById('btn')
60
+ const msg = document.getElementById('msg')
61
+ form.addEventListener('submit', async (e) => {
62
+ e.preventDefault()
63
+ msg.className = 'msg'
64
+ btn.disabled = true
65
+ btn.textContent = '保存中...'
66
+ try {
67
+ const res = await fetch('/submit', {
68
+ method: 'POST',
69
+ headers: { 'Content-Type': 'application/json' },
70
+ body: JSON.stringify({
71
+ token,
72
+ userId: document.getElementById('userId').value.trim(),
73
+ password: document.getElementById('password').value
74
+ })
75
+ })
76
+ const data = await res.json()
77
+ if (data.ok) {
78
+ msg.className = 'msg ok'
79
+ msg.textContent = '已保存到本机 ~/.linke-cli/config.json(权限 600)。' +
80
+ '本页面服务已自动关闭,可以关闭此标签页;回到终端查看验证结果。'
81
+ form.style.display = 'none'
82
+ } else {
83
+ throw new Error(data.error || '保存失败')
84
+ }
85
+ } catch (err) {
86
+ msg.className = 'msg err'
87
+ msg.textContent = '保存失败:' + err.message + '。请回终端重新运行 linke login 后重试。'
88
+ btn.disabled = false
89
+ btn.textContent = '保存到本机'
90
+ }
91
+ })
92
+ </script>
93
+ </body>
94
+ </html>