Compare commits

..

7 Commits

Author SHA1 Message Date
884ba56619 optimize rendering 2026-02-08 18:10:21 +09:00
9afad8e4ff add bench 2026-02-08 17:57:23 +09:00
64d50afc6b fix kouho selection. 2026-02-08 17:43:26 +09:00
b887972fb2 vietnamese telex input 2026-02-08 16:57:52 +09:00
d06cef6575 add lang dispatch, korean hangul input 2026-02-08 16:52:08 +09:00
5653298bb1 use trie for map lookup 2026-02-08 16:36:59 +09:00
97f897755f rename hnode fields, functions. 2026-02-08 16:29:29 +09:00
21 changed files with 1021 additions and 13884 deletions

View File

@ -1,12 +1,12 @@
CC = 9c
LD = 9l
CFLAGS = -Wall -Wextra -O2
CFLAGS = -Wall -Wextra -O2 -g
PROG = strans
SRCS = $(wildcard *.c)
OBJS = $(SRCS:.c=.o)
all: $(PROG)
all: $(PROG) xim bench
$(PROG): $(OBJS)
$(LD) -o $@ $(OBJS) -lthread -lString -lbio -lxcb -lm
@ -15,5 +15,13 @@ $(OBJS): dat.h fn.h ipc.h
clean:
rm -f $(OBJS) $(PROG)
make -C xim/ clean
make -C bench/ clean
.PHONY: all clean
xim:
make -C xim/
bench:
make -C bench/
.PHONY: all clean xim bench

23
bench.sh Executable file
View File

@ -0,0 +1,23 @@
#!/bin/sh
pkill strans
pkill strans-xim
sleep 1
./strans map font &
sleep 1
# warm up glyph cache
./bench/bench bench/bench.keys 100
echo "cache warmed up"
STRANS_PID=$(pgrep -x strans)
perf record -g -o bench/perf.data -p "$STRANS_PID" &
PERF_PID=$!
sleep 1
./bench/bench bench/bench.keys 100
kill -INT $PERF_PID
wait $PERF_PID 2>/dev/null
pkill strans

8
bench/Makefile Normal file
View File

@ -0,0 +1,8 @@
CC = cc
CFLAGS = -Wall -O2
bench: main.c
$(CC) $(CFLAGS) -o $@ main.c
clean:
rm -f bench

BIN
bench/bench Executable file

Binary file not shown.

30
bench/bench.keys Normal file
View File

@ -0,0 +1,30 @@
^ntoukyounotenki^Ryoidesu^R
konpyuutanopuroguramu^B^B^Bgramu^R
nihongowobenkyoushiteimasu^R
sakuranoshanohana^B^B^B^Bhanagasaiteiru^R
kaigi^Ekyounokaigi^R
ashitahaiitenkininarudeshou^R
^sdkssudgktpdy^Rgksrmfekfqnxm^R
vmfhrrh^Btprtmxm^Rdufrlavldml^R
dmlrlwkekfwprtm^R
gksrnl^B^B^Bdlfp^R
answkd^Eanswkd^R
qkrtlwkf^B^B^Bwkfgkf^R
^thello world^R
the quick brown fox jumps over the lazy dog^R
programming is fun^R
^vVietNam^Rxinchaobancokhoekhong^R
toidilambaitap^B^B^Bbaitap^R
hoctiengviet^R
^nkaishanitsuutomeshiteimasu^R
tanaboraguukoudesu^B^B^B^B^Bkoudesu^R
^srhksrnrdlTkfgkwl^R
answkddkssud^B^Bdkssud^R
wnsdydgktpdy^R
^vtoidenlopcuahang^R
motngaymoiconduong^R
^thigh performance input method^R
^nnyuuryokuhouhou^R
tesutonosuuretsu^R
^sxkfldzmsdml^R
qhfmfjxm^R

168
bench/main.c Normal file
View File

@ -0,0 +1,168 @@
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <time.h>
#include <sys/socket.h>
#include <sys/un.h>
enum {
Kback = 0xf008,
Kret = 0xf00d,
Kesc = 0xf01b,
Mctrl = 1<<2,
};
typedef struct Key Key;
struct Key {
int k;
int mod;
};
static Key *keys;
static int nkeys;
static int fd;
static void
die(char *msg)
{
perror(msg);
exit(1);
}
static void
addkey(int k, int mod)
{
static int cap;
if(nkeys >= cap){
cap = cap ? cap * 2 : 256;
keys = realloc(keys, cap * sizeof(Key));
if(!keys)
die("realloc");
}
keys[nkeys].k = k;
keys[nkeys].mod = mod;
nkeys++;
}
static void
loadkeys(char *file)
{
FILE *f;
int c;
f = fopen(file, "r");
if(!f)
die(file);
while((c = fgetc(f)) != EOF){
if(c == '\n' || c == '\r')
continue;
if(c != '^'){
addkey(c, 0);
continue;
}
c = fgetc(f);
if(c == EOF)
break;
switch(c){
case 'B':
addkey(Kback, 0);
break;
case 'R':
addkey(Kret, 0);
break;
case 'E':
addkey(Kesc, 0);
break;
default:
addkey(c, Mctrl);
break;
}
}
fclose(f);
}
static void
dial(void)
{
struct sockaddr_un addr;
fd = socket(AF_UNIX, SOCK_STREAM, 0);
if(fd < 0)
die("socket");
memset(&addr, 0, sizeof(addr));
addr.sun_family = AF_UNIX;
snprintf(addr.sun_path, sizeof(addr.sun_path),
"/tmp/strans.%d", getuid());
if(connect(fd, (struct sockaddr*)&addr, sizeof(addr)) < 0)
die("connect");
}
static void
sendkey(int key, int mod)
{
unsigned char req[4];
req[0] = 0;
req[1] = mod;
req[2] = key & 0xff;
req[3] = (key >> 8) & 0xff;
if(write(fd, req, 4) != 4)
die("write");
}
static int
readresp(void)
{
unsigned char buf[256];
int n;
if(read(fd, buf, 2) != 2)
return -1;
n = buf[1];
if(n > 0 && read(fd, buf + 2, n) != n)
return -1;
return 0;
}
static double
now(void)
{
struct timespec ts;
clock_gettime(CLOCK_MONOTONIC, &ts);
return ts.tv_sec + ts.tv_nsec * 1e-9;
}
int
main(int argc, char **argv)
{
int i, j, niter;
double t0, t1, dt;
if(argc < 2){
fprintf(stderr, "usage: bench file [niter]\n");
exit(1);
}
loadkeys(argv[1]);
niter = argc > 2 ? atoi(argv[2]) : 1000;
dial();
t0 = now();
for(i = 0; i < niter; i++)
for(j = 0; j < nkeys; j++){
sendkey(keys[j].k, keys[j].mod);
if(readresp() < 0){
fprintf(stderr, "failed at iter %d key %d\n", i, j);
exit(1);
}
}
t1 = now();
dt = t1 - t0;
printf("%d iters x %d keys = %d keys\n", niter, nkeys, niter * nkeys);
printf("%.3f ms total, %.3f us/key, %.3f us/iter\n",
dt * 1000, dt * 1e6 / (niter * nkeys), dt * 1e6 / niter);
close(fd);
return 0;
}

BIN
bench/perf.data Normal file

Binary file not shown.

BIN
bench/perf.data.old Normal file

Binary file not shown.

33
dat.h
View File

@ -45,7 +45,6 @@ typedef struct Emit Emit;
struct Emit
{
int eat;
int flush;
Str s;
Str next;
Str dict;
@ -58,8 +57,27 @@ struct Hnode
int next;
char *key;
int klen;
char *kana;
int kanalen;
char *val;
int vlen;
};
typedef struct Tnode Tnode;
struct Tnode
{
int child;
int sibling;
char c;
char *val;
int vlen;
};
typedef struct Trie Trie;
struct Trie
{
int root;
Tnode *nodes;
int n;
int cap;
};
typedef struct Hmap Hmap;
@ -79,7 +97,10 @@ struct Lang
int lang;
char *mapname;
char *dictname;
Hmap *map;
Emit (*trans)(Im*, Rune);
void (*back)(Im*);
void (*dictq)(Im*);
Trie *map;
Hmap *dict;
};
@ -95,8 +116,8 @@ struct Im
typedef struct Drawcmd Drawcmd;
struct Drawcmd
{
Str preedit;
Str kouho[Maxkouho];
Str pre;
Str kouho[Maxdisp];
int nkouho;
int sel;
};

14
dict.c
View File

@ -2,7 +2,7 @@
#include "fn.h"
static void
dictlkup(Dictreq *req, Dictres *res)
dictlookup(Dictreq *req, Dictres *res)
{
Lang *l;
Hmap *dict;
@ -18,10 +18,10 @@ dictlkup(Dictreq *req, Dictres *res)
if(dict == nil)
return;
n = hmapget(dict, &req->key);
if(n == nil || n->kanalen == 0)
if(n == nil || n->vlen == 0)
return;
p = n->kana;
e = p + n->kanalen;
p = n->val;
e = p + n->vlen;
while(res->nkouho < Maxkouho && p < e){
sp = p;
while(p < e && *p != ' ')
@ -46,14 +46,14 @@ dictthread(void*)
break;
while(channbrecv(dictreqc, &req) > 0)
;
dictlkup(&req, &res);
dictlookup(&req, &res);
res.key = req.pre;
chansend(dictresc, &res);
}
}
static Hmap*
opendict(char *path)
dictopen(char *path)
{
Hmap *h;
Biobuf *b;
@ -96,7 +96,7 @@ dictinit(char *dir)
if(langs[i].dictname == nil)
continue;
snprint(path, sizeof(path), "%s/%s.dict", dir, langs[i].dictname);
langs[i].dict = opendict(path);
langs[i].dict = dictopen(path);
}
}

12
fn.h
View File

@ -12,7 +12,11 @@ Rune slastr(Str*);
Hmap* hmapalloc(int, int);
int hmapset(Hmap**, Str*, Str*);
Hnode* hmapget(Hmap*, Str*);
int mapget(Hmap*, Str*, Str*);
int mapget(Trie*, Str*, Str*);
Trie* trieopen(char*);
char* trieget(Trie*, char*, int, int*);
int trielookup(Trie*, char*, int, char**, int*);
Lang* getlang(int);
void mapinit(char*);
@ -22,7 +26,11 @@ void dictthread(void*);
void drawthread(void*);
void imthread(void*);
Emit trans(Im*, Rune);
Emit transmap(Im*, Rune);
Emit transko(Im*, Rune);
Emit transvi(Im*, Rune);
void backko(Im*);
void dictsend(Im*, Str*);
void srvthread(void*);

22
font.c
View File

@ -99,7 +99,8 @@ void
putfont(u32int *buf, int w, int h, int px, int py, Rune r)
{
Glyph *g;
int i, j, x, y, a, sel, f;
int i, j, a, sel, f;
int y0, j0, j1, x0, i0, i1;
u32int *p;
if(r >= Nglyphs)
@ -116,17 +117,18 @@ putfont(u32int *buf, int w, int h, int px, int py, Rune r)
if(g->bmp == nil)
return;
}
for(j = 0; j < g->h; j++){
y = py + j + g->oy + Fontsz - Fontbase;
if(y < 0 || y >= h)
continue;
for(i = 0; i < g->w; i++){
x = px + i + g->ox;
if(x < 0 || x >= w)
continue;
y0 = py + g->oy + Fontsz - Fontbase;
j0 = y0 < 0 ? -y0 : 0;
j1 = y0 + g->h > h ? h - y0 : g->h;
x0 = px + g->ox;
i0 = x0 < 0 ? -x0 : 0;
i1 = x0 + g->w > w ? w - x0 : g->w;
for(j = j0; j < j1; j++){
for(i = i0; i < i1; i++){
a = g->bmp[j * g->w + i];
if(a > 0){
p = &buf[y * w + x];
p = &buf[(y0 + j) * w + x0 + i];
sel = (*p == Colsel) ? 1 : 0;
*p = blendtab[sel][a];
}

12
hash.c
View File

@ -65,7 +65,7 @@ hmapget(Hmap *h, Str *key)
}
static char*
str2dup(Str *s)
sdup(Str *s)
{
char buf[256];
char *p;
@ -79,7 +79,7 @@ str2dup(Str *s)
}
int
hmapset(Hmap **store, Str *key, Str *kana)
hmapset(Hmap **store, Str *key, Str *val)
{
Hnode *n;
uchar *v;
@ -116,14 +116,14 @@ hmapset(Hmap **store, Str *key, Str *kana)
n = (Hnode*)v;
replace:
if(n->filled == 0){
n->key = str2dup(key);
n->key = sdup(key);
n->klen = strlen(n->key);
n->filled = 1;
}
n->next = next;
if(kana->n > 0){
n->kana = str2dup(kana);
n->kanalen = strlen(n->kana);
if(val->n > 0){
n->val = sdup(val);
n->vlen = strlen(n->val);
}
return 0;
}

327
ko.c Normal file
View File

@ -0,0 +1,327 @@
#include "dat.h"
#include "fn.h"
enum
{
Sbase = 0xAC00,
Jbase = 0x3131,
Jrange = 51,
Ncho = 19,
Njung = 21,
Njong = 28,
};
static Rune cho[] = {
L'', L'', L'', L'', L'',
L'', L'', L'', L'', L'',
L'', L'', L'', L'', L'',
L'', L'', L'', L'',
};
static Rune jung[] = {
L'', L'', L'', L'', L'',
L'', L'', L'', L'', L'',
L'', L'', L'', L'', L'',
L'', L'', L'', L'', L'',
L'',
};
static Rune jong[] = {
0, L'', L'', L'', L'',
L'', L'', L'', L'', L'',
L'', L'', L'', L'', L'',
L'', L'', L'', L'', L'',
L'', L'', L'', L'', L'',
L'', L'', L'',
};
static int choidx[Jrange] = {
[L''-Jbase] = 1, [L''-Jbase] = 2, [L''-Jbase] = 3,
[L''-Jbase] = 4, [L''-Jbase] = 5, [L''-Jbase] = 6,
[L''-Jbase] = 7, [L''-Jbase] = 8, [L''-Jbase] = 9,
[L''-Jbase] = 10, [L''-Jbase] = 11, [L''-Jbase] = 12,
[L''-Jbase] = 13, [L''-Jbase] = 14, [L''-Jbase] = 15,
[L''-Jbase] = 16, [L''-Jbase] = 17, [L''-Jbase] = 18,
[L''-Jbase] = 19,
};
static int jungidx[Jrange] = {
[L''-Jbase] = 1, [L''-Jbase] = 2, [L''-Jbase] = 3,
[L''-Jbase] = 4, [L''-Jbase] = 5, [L''-Jbase] = 6,
[L''-Jbase] = 7, [L''-Jbase] = 8, [L''-Jbase] = 9,
[L''-Jbase] = 10, [L''-Jbase] = 11, [L''-Jbase] = 12,
[L''-Jbase] = 13, [L''-Jbase] = 14, [L''-Jbase] = 15,
[L''-Jbase] = 16, [L''-Jbase] = 17, [L''-Jbase] = 18,
[L''-Jbase] = 19, [L''-Jbase] = 20, [L''-Jbase] = 21,
};
static int jongidx[Jrange] = {
[L''-Jbase] = 2, [L''-Jbase] = 3, [L''-Jbase] = 4,
[L''-Jbase] = 5, [L''-Jbase] = 6, [L''-Jbase] = 7,
[L''-Jbase] = 8, [L''-Jbase] = 9, [L''-Jbase] = 10,
[L''-Jbase] = 11, [L''-Jbase] = 12, [L''-Jbase] = 13,
[L''-Jbase] = 14, [L''-Jbase] = 15, [L''-Jbase] = 16,
[L''-Jbase] = 17, [L''-Jbase] = 18, [L''-Jbase] = 19,
[L''-Jbase] = 20, [L''-Jbase] = 21, [L''-Jbase] = 22,
[L''-Jbase] = 23, [L''-Jbase] = 24, [L''-Jbase] = 25,
[L''-Jbase] = 26, [L''-Jbase] = 27, [L''-Jbase] = 28,
};
#define Choidx(r) (choidx[(r) - Jbase] - 1)
#define Jungidx(r) (jungidx[(r) - Jbase] - 1)
#define Jongidx(r) (jongidx[(r) - Jbase] - 1)
static Rune jamomap[128] = {
['r'] = L'', ['R'] = L'',
['s'] = L'', ['S'] = L'',
['e'] = L'', ['E'] = L'',
['f'] = L'', ['F'] = L'',
['a'] = L'', ['A'] = L'',
['q'] = L'', ['Q'] = L'',
['t'] = L'', ['T'] = L'',
['d'] = L'', ['D'] = L'',
['w'] = L'', ['W'] = L'',
['c'] = L'', ['C'] = L'',
['z'] = L'', ['Z'] = L'',
['x'] = L'', ['X'] = L'',
['v'] = L'', ['V'] = L'',
['g'] = L'', ['G'] = L'',
['k'] = L'', ['K'] = L'',
['o'] = L'', ['O'] = L'',
['i'] = L'', ['I'] = L'',
['j'] = L'', ['J'] = L'',
['p'] = L'', ['P'] = L'',
['u'] = L'', ['U'] = L'',
['h'] = L'', ['H'] = L'',
['y'] = L'', ['Y'] = L'',
['n'] = L'', ['N'] = L'',
['b'] = L'', ['B'] = L'',
['m'] = L'', ['M'] = L'',
['l'] = L'', ['L'] = L'',
};
typedef struct Cpair Cpair;
struct Cpair
{
Rune b;
Rune a;
Rune r;
};
static Cpair cvow[] = {
{L'', L'', L''},
{L'', L'', L''},
{L'', L'', L''},
{L'', L'', L''},
{L'', L'', L''},
{L'', L'', L''},
{L'', L'', L''},
};
static Cpair cjong[] = {
{L'', L'', L''},
{L'', L'', L''},
{L'', L'', L''},
{L'', L'', L''},
{L'', L'', L''},
{L'', L'', L''},
{L'', L'', L''},
{L'', L'', L''},
{L'', L'', L''},
{L'', L'', L''},
{L'', L'', L''},
};
static Rune
keytojamo(int c)
{
if(c >= 0 && c < 128)
return jamomap[c];
return 0;
}
static Rune
combine(Cpair *t, int n, Rune b, Rune a)
{
int i;
for(i = 0; i < n; i++)
if(t[i].b == b && t[i].a == a)
return t[i].r;
return 0;
}
static int
splitpair(Cpair *t, int n, Rune c, Rune *stay, Rune *next)
{
int i;
for(i = 0; i < n; i++){
if(t[i].r == c){
*stay = t[i].b;
*next = t[i].a;
return 1;
}
}
return 0;
}
static Rune
compose(int c, int j, int jo)
{
return Sbase + c*Njung*Njong + j*Njong + jo;
}
static void
decompose(Rune s, int *c, int *j, int *jo)
{
int i;
i = s - Sbase;
*c = i / (Njung * Njong);
*j = (i / Njong) % Njung;
*jo = i % Njong;
}
static int
issyl(Rune r)
{
return r >= Sbase && r < Sbase + Ncho*Njung*Njong;
}
Emit
transko(Im *im, Rune c)
{
Emit e;
Rune jm, jc, last, comb, stay, next;
int ci, ji, joi, ni, si, vi;
memset(&e, 0, sizeof e);
jm = keytojamo(c);
if(jm == 0){
if(im->pre.n > 0){
e.s = im->pre;
sclear(&im->pre);
}
sputr(&e.s, c);
return e;
}
e.eat = 1;
last = slastr(&im->pre);
if(last == 0){
sputr(&e.next, jm);
return e;
}
if(!issyl(last)){
ci = Choidx(last);
ji = Jungidx(jm);
if(ci >= 0 && ji >= 0){
spopr(&im->pre);
sputr(&e.next, compose(ci, ji, 0));
return e;
}
if(Jungidx(last) >= 0 && ji >= 0){
comb = combine(cvow, nelem(cvow), last, jm);
if(comb){
spopr(&im->pre);
sputr(&e.next, comb);
return e;
}
}
e.s = im->pre;
sputr(&e.next, jm);
return e;
}
decompose(last, &ci, &ji, &joi);
if(joi == 0){
ni = Jongidx(jm);
if(ni > 0){
spopr(&im->pre);
sputr(&e.next, compose(ci, ji, ni));
return e;
}
vi = Jungidx(jm);
if(vi >= 0){
comb = combine(cvow, nelem(cvow), jung[ji], jm);
if(comb){
ni = Jungidx(comb);
spopr(&im->pre);
sputr(&e.next, compose(ci, ni, 0));
return e;
}
}
}
if(joi > 0){
comb = combine(cjong, nelem(cjong), jong[joi], jm);
if(comb){
ni = Jongidx(comb);
if(ni > 0){
spopr(&im->pre);
sputr(&e.next, compose(ci, ji, ni));
return e;
}
}
vi = Jungidx(jm);
if(vi >= 0){
jc = jong[joi];
if(splitpair(cjong, nelem(cjong), jc, &stay, &next)){
si = Jongidx(stay);
ni = Choidx(next);
spopr(&im->pre);
sputr(&e.s, compose(ci, ji, si));
sputr(&e.next, compose(ni, vi, 0));
return e;
}
ni = Choidx(jc);
if(ni >= 0){
spopr(&im->pre);
sputr(&e.s, compose(ci, ji, 0));
sputr(&e.next, compose(ni, vi, 0));
return e;
}
}
}
e.s = im->pre;
sputr(&e.next, jm);
return e;
}
void
backko(Im *im)
{
Rune last;
int c, j, jo;
Rune stay, next;
last = slastr(&im->pre);
if(!issyl(last)){
if(splitpair(cvow, nelem(cvow), last, &stay, &next)){
spopr(&im->pre);
sputr(&im->pre, stay);
return;
}
spopr(&im->pre);
return;
}
decompose(last, &c, &j, &jo);
spopr(&im->pre);
if(jo > 0 && splitpair(cjong, nelem(cjong), jong[jo], &stay, &next)){
sputr(&im->pre, compose(c, j, Jongidx(stay)));
return;
}
if(jo > 0){
sputr(&im->pre, compose(c, j, 0));
return;
}
if(splitpair(cvow, nelem(cvow), jung[j], &stay, &next)){
sputr(&im->pre, compose(c, Jungidx(stay), 0));
return;
}
sputr(&im->pre, cho[c]);
}

2
main.c
View File

@ -61,7 +61,7 @@ threadmain(int argc, char **argv)
usage();
fontdir = argv[2];
drawc = chancreate(sizeof(Drawcmd), 0);
drawc = chancreate(sizeof(Drawcmd), 4);
keyc = chancreate(sizeof(Keyreq), 0);
dictreqc = chancreate(sizeof(Dictreq), 4);
dictresc = chancreate(sizeof(Dictres), 0);

File diff suppressed because it is too large Load Diff

File diff suppressed because it is too large Load Diff

194
strans.c
View File

@ -2,14 +2,21 @@
#include "fn.h"
static Im im;
static void dictqmap(Im*);
static void
backmap(Im *im)
{
spopr(&im->pre);
}
Lang langs[] = {
{LangEN, "english", nil, nil, nil},
{LangJP, "hira", "kanji", nil, nil},
{LangJPK, "kata", "kanji", nil, nil},
{LangKO, "hangul", nil, nil, nil},
{LangEMOJI, "emoji", "emoji", nil, nil},
{LangVI, "telex", nil, nil, nil},
{LangEN, "english", nil, transmap, backmap, dictqmap, nil, nil},
{LangJP, "hira", "kanji", transmap, backmap, dictqmap, nil, nil},
{LangJPK, "kata", "kanji", transmap, backmap, dictqmap, nil, nil},
{LangKO, "hangul", nil, transko, backko, dictqmap, nil, nil},
{LangEMOJI, "emoji", "emoji", transmap, backmap, dictqmap, nil, nil},
{LangVI, "telex", nil, transvi, backmap, dictqmap, nil, nil},
};
int nlang = nelem(langs);
@ -17,7 +24,7 @@ static void
clearkouho(void)
{
im.nkouho = 0;
im.sel = 0;
im.sel = -1;
}
static void
@ -36,15 +43,18 @@ static void
show(void)
{
Drawcmd dc;
int i;
int i, first, n;
sclear(&dc.preedit);
if(!mapget(im.l->map, &im.pre, &dc.preedit))
dc.preedit = im.pre;
dc.nkouho = im.nkouho;
dc.sel = im.sel;
for(i = 0; i < dc.nkouho; i++)
dc.kouho[i] = im.kouho[i];
sclear(&dc.pre);
if(!mapget(im.l->map, &im.pre, &dc.pre))
dc.pre = im.pre;
first = im.sel >= Maxdisp ? im.sel - Maxdisp + 1 : 0;
n = im.nkouho - first;
if(n > Maxdisp) n = Maxdisp;
dc.nkouho = n;
dc.sel = im.sel >= 0 ? im.sel - first : -1;
for(i = 0; i < n; i++)
dc.kouho[i] = im.kouho[first + i];
chansend(drawc, &dc);
}
@ -56,25 +66,32 @@ reset(void)
show();
}
static void
dictq(void)
void
dictsend(Im *im, Str *key)
{
Str dict;
Dictreq req;
if(!mapget(im.l->map, &im.pre, &dict)){
req.key = *key;
req.lang = im->l->lang;
req.pre = im->pre;
channbsend(dictreqc, &req);
}
static void
dictqmap(Im *im)
{
Str dict;
if(!mapget(im->l->map, &im->pre, &dict)){
clearkouho();
show();
return;
}
req.key = dict;
req.lang = im.l->lang;
req.pre = im.pre;
channbsend(dictreqc, &req);
dictsend(im, &dict);
}
static int
checklang(int c)
setlang(int c)
{
Lang *l;
@ -88,10 +105,10 @@ checklang(int c)
static void
commit(Str *com)
{
Str kana;
Str val;
if(mapget(im.l->map, &im.pre, &kana))
sappend(com, &kana);
if(mapget(im.l->map, &im.pre, &val))
sappend(com, &val);
else
sappend(com, &im.pre);
sclear(&im.pre);
@ -103,7 +120,7 @@ dotrans(Rune c, Str *com)
Emit e;
Dictreq req;
e = trans(&im, c);
e = im.l->trans(&im, c);
if(e.s.n > 0)
sappend(com, &e.s);
sclear(&im.pre);
@ -128,55 +145,49 @@ getlang(int lang)
return nil;
}
static int
maplookup(Trie *t, Str *key, Str *out)
{
char buf[256], *v;
int klen, vlen;
if(key->n == 0)
return 0;
v = nil;
vlen = 0;
klen = stoutf(key, buf, sizeof(buf));
if(!trielookup(t, buf, klen, &v, &vlen))
return 0;
if(out != nil && v != nil)
sinit(out, v, vlen);
return 1;
}
Emit
trans(Im *im, Rune c)
transmap(Im *im, Rune c)
{
Emit e = {0};
Str key, kana;
Hmap *h;
Rune last;
Str key;
Trie *t;
h = im->l->map;
t = im->l->map;
key = im->pre;
sputr(&key, c);
if(hmapget(h, &key)){
if(maplookup(t, &key, &e.dict)){
e.eat = 1;
e.next = key;
mapget(h, &key, &e.dict);
return e;
}
last = slastr(&im->pre);
if(last == 0)
goto flush;
key = im->pre;
key.n--;
if(mapget(h, &key, &kana)){
sclear(&key);
sputr(&key, last);
sputr(&key, c);
if(hmapget(h, &key)){
e.eat = 1;
e.s = kana;
sputr(&e.next, last);
sputr(&e.next, c);
mapget(h, &e.next, &e.dict);
return e;
}
}
flush:
if(!mapget(h, &im->pre, &e.s))
if(!mapget(t, &im->pre, &e.s))
e.s = im->pre;
sclear(&key);
sputr(&key, c);
if(hmapget(h, &key) == nil){
e.flush = 1;
if(!maplookup(t, &key, &e.dict)){
sputr(&e.s, c);
return e;
}
e.eat = 1;
sputr(&e.next, c);
mapget(h, &e.next, &e.dict);
return e;
}
@ -192,7 +203,7 @@ keystroke(u32int ks, u32int mod, Str *com)
return 0;
if(ks == Kdown && im.sel < im.nkouho - 1)
im.sel++;
if(ks == Kup && im.sel > 0)
if(ks == Kup && im.sel >= 0)
im.sel--;
show();
return 1;
@ -222,12 +233,12 @@ keystroke(u32int ks, u32int mod, Str *com)
if(ks == Kback){
if(im.pre.n == 0)
return 0;
spopr(&im.pre);
im.l->back(&im);
if(im.pre.n == 0){
reset();
return 1;
}
dictq();
im.l->dictq(&im);
return 1;
}
if(ks == Kesc){
@ -245,10 +256,15 @@ keystroke(u32int ks, u32int mod, Str *com)
reset();
if(ks >= 'a' && ks <= 'z')
ks -= 'a' - 1;
if(checklang(ks))
if(setlang(ks))
return 1;
return 0;
}
if(ks == '0' && im.nkouho > 0){
commit(com);
reset();
return 1;
}
if(ks > 0x7f || ks == ' '){
commit(com);
sputr(com, ks);
@ -309,57 +325,21 @@ imthread(void*)
}
int
mapget(Hmap *h, Str *key, Str *out)
mapget(Trie *t, Str *key, Str *out)
{
Hnode *n;
char buf[256], *v;
int klen, vlen;
if(key->n == 0)
return 0;
n = hmapget(h, key);
if(n == nil || n->kanalen == 0)
klen = stoutf(key, buf, sizeof(buf));
v = trieget(t, buf, klen, &vlen);
if(v == nil)
return 0;
sinit(out, n->kana, n->kanalen);
sinit(out, v, vlen);
return 1;
}
static Hmap*
openmap(char *path)
{
Hmap *h;
Biobuf *b;
Str key, val, empty;
char *line, *tab;
int i, klen;
b = Bopen(path, OREAD);
if(b == nil)
die("can't open: %s", path);
h = hmapalloc(1024, 0);
sclear(&empty);
while((line = Brdstr(b, '\n', 1)) != nil){
if(line[0] == '\0'){
free(line);
continue;
}
tab = strchr(line, '\t');
if(tab == nil || tab[1] == '\0')
die("malformed map: %s", path);
*tab = '\0';
klen = strlen(line);
sinit(&key, line, klen);
sinit(&val, tab+1, strlen(tab+1));
hmapset(&h, &key, &val);
for(i = 1; i < klen; i++){
sinit(&key, line, i);
if(hmapget(h, &key) == nil)
hmapset(&h, &key, &empty);
}
free(line);
}
Bterm(b);
return h;
}
void
mapinit(char *dir)
{
@ -370,7 +350,7 @@ mapinit(char *dir)
if(langs[i].mapname == nil)
continue;
snprint(path, sizeof(path), "%s/%s.map", dir, langs[i].mapname);
langs[i].map = openmap(path);
langs[i].map = trieopen(path);
}
}

130
trie.c Normal file
View File

@ -0,0 +1,130 @@
#include "dat.h"
#include "fn.h"
static int
newnode(Trie *t)
{
int i;
if(t->n >= t->cap){
t->cap *= 2;
t->nodes = erealloc(t->nodes, t->cap * sizeof(Tnode));
}
i = t->n++;
memset(&t->nodes[i], 0, sizeof(Tnode));
t->nodes[i].child = -1;
t->nodes[i].sibling = -1;
return i;
}
static int
find(Trie *t, int ni, char c)
{
int pi;
for(pi = t->nodes[ni].child; pi >= 0; pi = t->nodes[pi].sibling)
if(t->nodes[pi].c == c)
return pi;
return -1;
}
static int
add(Trie *t, int ni, char c)
{
int pi;
pi = newnode(t);
t->nodes[pi].c = c;
t->nodes[pi].sibling = t->nodes[ni].child;
t->nodes[ni].child = pi;
return pi;
}
static void
insert(Trie *t, char *key, int klen, char *val, int vlen)
{
int ni, ci;
int i;
ni = t->root;
for(i = 0; i < klen; i++){
ci = find(t, ni, key[i]);
if(ci < 0)
ci = add(t, ni, key[i]);
ni = ci;
}
t->nodes[ni].val = val;
t->nodes[ni].vlen = vlen;
}
Trie*
trieopen(char *path)
{
Trie *t;
Biobuf *b;
char *line, *tab, *key, *val;
int klen, vlen;
b = Bopen(path, OREAD);
if(b == nil)
die("can't open: %s", path);
t = emalloc(sizeof(*t));
t->cap = 1024;
t->nodes = emalloc(t->cap * sizeof(Tnode));
t->n = 0;
t->root = newnode(t);
while((line = Brdstr(b, '\n', 1)) != nil){
if(line[0] == '\0'){
free(line);
continue;
}
tab = strchr(line, '\t');
if(tab == nil || tab[1] == '\0')
die("malformed map: %s", path);
*tab = '\0';
key = line;
klen = tab - line;
val = tab + 1;
vlen = strlen(val);
insert(t, key, klen, val, vlen);
}
Bterm(b);
return t;
}
char*
trieget(Trie *t, char *key, int klen, int *vlen)
{
int ni;
int i;
ni = t->root;
for(i = 0; i < klen; i++){
ni = find(t, ni, key[i]);
if(ni < 0)
return nil;
}
if(t->nodes[ni].val == nil)
return nil;
*vlen = t->nodes[ni].vlen;
return t->nodes[ni].val;
}
int
trielookup(Trie *t, char *key, int klen, char **val, int *vlen)
{
int ni;
int i;
ni = t->root;
for(i = 0; i < klen; i++){
ni = find(t, ni, key[i]);
if(ni < 0)
return 0;
}
if(val != nil && t->nodes[ni].val != nil){
*val = t->nodes[ni].val;
*vlen = t->nodes[ni].vlen;
}
return 1;
}

160
vi.c Normal file
View File

@ -0,0 +1,160 @@
#include "dat.h"
#include "fn.h"
static struct {
Rune base;
Rune tone[5]; /* s f r x j */
} vitone[] = {
{L'a', {L'á', L'à', L'', L'ã', L''}},
{L'â', {L'', L'', L'', L'', L''}},
{L'ă', {L'', L'', L'', L'', L''}},
{L'e', {L'é', L'è', L'', L'', L''}},
{L'ê', {L'ế', L'', L'', L'', L''}},
{L'i', {L'í', L'ì', L'', L'ĩ', L''}},
{L'o', {L'ó', L'ò', L'', L'õ', L''}},
{L'ô', {L'', L'', L'', L'', L''}},
{L'ơ', {L'', L'', L'', L'', L''}},
{L'u', {L'ú', L'ù', L'', L'ũ', L''}},
{L'ư', {L'', L'', L'', L'', L''}},
{L'y', {L'ý', L'', L'', L'', L''}},
{L'A', {L'Á', L'À', L'', L'Ã', L''}},
{L'Â', {L'', L'', L'', L'', L''}},
{L'Ă', {L'', L'', L'', L'', L''}},
{L'E', {L'É', L'È', L'', L'', L''}},
{L'Ê', {L'', L'', L'', L'', L''}},
{L'I', {L'Í', L'Ì', L'', L'Ĩ', L''}},
{L'O', {L'Ó', L'Ò', L'', L'Õ', L''}},
{L'Ô', {L'', L'', L'', L'', L''}},
{L'Ơ', {L'', L'', L'', L'', L''}},
{L'U', {L'Ú', L'Ù', L'', L'Ũ', L''}},
{L'Ư', {L'', L'', L'', L'', L''}},
{L'Y', {L'Ý', L'', L'', L'', L''}},
};
static int
istone(Rune c)
{
return c == 's' || c == 'f' || c == 'r' || c == 'x' || c == 'j';
}
static int
toneidx(Rune c)
{
switch(c){
case 's': return 0;
case 'f': return 1;
case 'r': return 2;
case 'x': return 3;
case 'j': return 4;
}
return -1;
}
static int
isvowel(Rune c)
{
int i;
for(i = 0; i < nelem(vitone); i++)
if(vitone[i].base == c)
return 1;
return 0;
}
static Rune
removetone(Rune c)
{
int i, j;
for(i = 0; i < nelem(vitone); i++){
if(vitone[i].base == c)
return c;
for(j = 0; j < 5; j++)
if(vitone[i].tone[j] == c)
return vitone[i].base;
}
return c;
}
static Rune
applytone(Rune c, int tidx)
{
int i;
Rune base;
base = removetone(c);
for(i = 0; i < nelem(vitone); i++)
if(vitone[i].base == base)
return vitone[i].tone[tidx];
return c;
}
Emit
transvi(Im *im, Rune c)
{
Emit e;
Str mapped, pre;
int i, tidx, vi, last, penult;
Rune v, b1, b2;
if(!istone(c) && c != 'z')
return transmap(im, c);
memset(&e, 0, sizeof e);
if(im->pre.n == 0){
sputr(&e.s, c);
return e;
}
if(im->pre.r[im->pre.n - 1] == '\\'){
pre = im->pre;
pre.n--;
if(!mapget(im->l->map, &pre, &mapped))
mapped = pre;
sputr(&mapped, c);
e.eat = 1;
e.s = mapped;
return e;
}
if(!mapget(im->l->map, &im->pre, &mapped))
mapped = im->pre;
last = -1;
penult = -1;
for(i = 0; i < mapped.n; i++){
v = removetone(mapped.r[i]);
if(isvowel(v)){
penult = last;
last = i;
}
}
vi = -1;
if(last >= 0){
if(last < mapped.n - 1 || penult < 0)
vi = last;
else{
b1 = removetone(mapped.r[penult]);
b2 = removetone(mapped.r[last]);
if((b1 == 'o' || b1 == 'O') && (b2 == 'a' || b2 == 'A' || b2 == 'e' || b2 == 'E'))
vi = last;
else if((b1 == 'u' || b1 == 'U') && (b2 == 'y' || b2 == 'Y'))
vi = last;
else
vi = penult;
}
}
if(vi < 0){
e.eat = 1;
e.s = mapped;
sputr(&e.s, c);
return e;
}
if(c == 'z')
mapped.r[vi] = removetone(mapped.r[vi]);
else{
tidx = toneidx(c);
mapped.r[vi] = applytone(mapped.r[vi], tidx);
}
e.eat = 1;
e.next = mapped;
return e;
}

21
win.c
View File

@ -71,9 +71,11 @@ drawkouho(Drawcmd *dc, int first, int n, int w, int h)
Str *s;
memset(img, (uchar)Colbg, w * h * sizeof(u32int));
drawstr(img, 0, 0, dc->preedit.r, dc->preedit.n, w, h);
sely = Fontsz + (dc->sel - first) * Fontsz;
drawstr(img, 0, 0, dc->pre.r, dc->pre.n, w, h);
if(dc->sel >= 0){
sely = Fontsz + dc->sel * Fontsz;
memset(img + sely * w, (uchar)Colsel, Fontsz * w * sizeof(u32int));
}
for(i = 0, y = Fontsz; i < n; i++, y += Fontsz){
s = &dc->kouho[first+i];
putfont(img, w, h, 0, y, '1' + i + Asciitofull);
@ -99,17 +101,16 @@ winhide(void)
static void
winshow(Drawcmd *dc)
{
int px, py, w, h, i, n, first, maxw;
int px, py, w, h, i, n, maxw;
u32int vals[4];
xcb_query_pointer_reply_t *ptr;
xcb_query_pointer_cookie_t cookie;
cookie = xcb_query_pointer(conn, scr->root);
first = dc->sel >= Maxdisp ? dc->sel - Maxdisp + 1 : 0;
n = min(dc->nkouho - first, Maxdisp);
maxw = dc->preedit.n;
n = dc->nkouho;
maxw = dc->pre.n;
for(i = 0; i < n; i++)
maxw = max(maxw, dc->kouho[first+i].n);
maxw = max(maxw, dc->kouho[i].n);
ptr = xcb_query_pointer_reply(conn, cookie, nil);
if(ptr == nil)
die("xcb_query_pointer");
@ -125,7 +126,7 @@ winshow(Drawcmd *dc)
XCB_CONFIG_WINDOW_WIDTH | XCB_CONFIG_WINDOW_HEIGHT,
vals);
xcb_map_window(conn, win);
drawkouho(dc, first, n, w, h);
drawkouho(dc, 0, n, w, h);
putimage(w, h);
}
@ -137,7 +138,9 @@ drawthread(void*)
threadsetname("draw");
wininit();
while(chanrecv(drawc, &dc) > 0){
if(dc.nkouho == 0 && dc.preedit.n == 0)
while(channbrecv(drawc, &dc) > 0)
;
if(dc.nkouho == 0 && dc.pre.n == 0)
winhide();
else
winshow(&dc);