1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006
|
/* Copyright 1994 NEC Corporation, Tokyo, Japan.
*
* Permission to use, copy, modify, distribute and sell this software
* and its documentation for any purpose is hereby granted without
* fee, provided that the above copyright notice appear in all copies
* and that both that copyright notice and this permission notice
* appear in supporting documentation, and that the name of NEC
* Corporation not be used in advertising or publicity pertaining to
* distribution of the software without specific, written prior
* permission. NEC Corporation makes no representations about the
* suitability of this software for any purpose. It is provided "as
* is" without express or implied warranty.
*
* NEC CORPORATION DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
* INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN
* NO EVENT SHALL NEC CORPORATION BE LIABLE FOR ANY SPECIAL, 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 TORTUOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
* PERFORMANCE OF THIS SOFTWARE.
*/
#if !defined(lint) && !defined(__CODECENTER__)
static char rcsid[]="$Id: context.c,v 1.5 2003/09/17 08:50:52 aida_s Exp $";
#endif
/*LINTLIBRARY*/
#include "RKintern.h"
#include "patchlevel.h"
#include <canna/jrkanji.h>
#include <errno.h>
#include <sys/stat.h>
static unsigned long now_context = 0L;
#define Calloc calloc
#define cx_gwt cx_extdata.ptr
#define STRCMP(d, s) strcmp((char *)(d), (char *)(s))
struct RkGram SG;
struct RkParam SX;
/* RkInitialize: Renbunsetsu Henkan shokika
* subeteno Renbunsetsu henkan kannsuu wo siyou suru maeni
* itido dake call suru koto.
* returns: -1/0
*/
static struct RkContext *CX;
#ifdef MMAP
/* If you compile with Visual C++, then please comment out the next 3 lines. */
#include <sys/types.h> /* mmap */
#include <sys/mman.h> /* mmap */
#include <fcntl.h> /* mmap */
int fd_dic = -1; /* mmap */
#endif
#ifdef WINDOWS_STYLE_FILENAME
#define DEFAULTGRAMDIC "/canna/fuzokugo.cbd"
#endif
#ifndef DEFAULTGRAMDIC
#define DEFAULTGRAMDIC "/canna/fuzokugo.d"
#endif
static int
_RkInitialize(ddhome, numCache)
char *ddhome;
int numCache;
{
int i = strlen(ddhome);
struct RkParam *sx = &SX;
struct DD *dd = &sx->dd;
char *gramdic, *path;
int con;
#ifdef __EMX__
struct stat statbuf;
#endif
#ifdef MMAP
if((fd_dic == -1) && (fd_dic = open("/dev/zero", O_RDWR)) < 0) {
con = -1;
goto return_con;
}
#endif
if (sx->flag & SX_INITED) {
con = -1;
goto return_con;
}
gramdic = malloc(strlen(DEFAULTGRAMDIC) + i + 1);
if (gramdic) {
strcpy(gramdic, ddhome);
strcat(gramdic, DEFAULTGRAMDIC);
SG.gramdic = RkOpenGram(gramdic);
(void)free(gramdic);
if (SG.gramdic) {
/* confirm user/ and group/ directory */
path = malloc(strlen(ddhome) + strlen(USER_DIC_DIR) + 2);
if (path) {
strcpy(path, ddhome);
strcat(path, "/");
strcat(path, USER_DIC_DIR);
if (mkdir(path, MKDIR_MODE) < 0 &&
errno != EEXIST) {
free(path);
}
else {
free(path);
path = malloc(strlen(ddhome) + strlen(GROUP_DIC_DIR) + 2);
if (path) {
strcpy(path, ddhome);
strcat(path, "/");
strcat(path, GROUP_DIC_DIR);
if (mkdir(path, MKDIR_MODE) < 0 &&
errno != EEXIST) {
free(path);
}
else {
free(path);
sx->word = (struct nword *)0;
dd->dd_next = dd->dd_prev = dd;
sx->ddhome = allocStr(ddhome);
if (sx->ddhome) {
SG.P_BB = RkGetGramNum(SG.gramdic, "BB");
SG.P_NN = RkGetGramNum(SG.gramdic, "NN");
SG.P_T00 = RkGetGramNum(SG.gramdic, "T00");
SG.P_T30 = RkGetGramNum(SG.gramdic, "T30");
SG.P_T35 = RkGetGramNum(SG.gramdic, "T35");
#ifdef LOGIC_HACK
SG.P_KJ = RkGetGramNum(SG.gramdic, "KJ");
#endif
SG.P_Ftte = RkGetGramNum(SG.gramdic, "Ftte");
CX = (struct RkContext *)
Calloc(INIT_CONTEXT, sizeof(struct RkContext));
if (CX) {
now_context += INIT_CONTEXT;
if (_RkInitializeCache(numCache) == 0) {
sx->ddpath = _RkCreateDDP(SYSTEM_DDHOME_NAME);
if (sx->ddpath) {
con = RkwCreateContext();
if (con >= 0) {
sx->flag |= SX_INITED;
goto return_con;
}
_RkFreeDDP(sx->ddpath);
sx->ddpath = (struct DD **)0;
}
_RkFinalizeCache();
}
free((char *)CX);
now_context = 0L;
}
free(sx->ddhome);
}
}
}
}
}
RkCloseGram(SG.gramdic);
}
}
con = -1;
return_con:
return con;
}
int
RkwInitialize(ddhome)
char *ddhome;
{
/*
* Word: ????
* Cache: 36B*512 = 20KB
* Heap: 30*1024B = 30KB
*/
return(ddhome ? _RkInitialize(ddhome, 512*10) : -1);
}
/* RkFinalize: Renbunsetu henkan shuuryou shori
*
*/
static void
_RkFinalizeWord() /* finalize free word list */
{
struct nword *w, *t;
/* dispose each page in list */
for (w = SX.page; w; w = t) {
t = w->nw_next;
(void)free((char *)w);
}
SX.word = (struct nword *)0;
SX.page = (struct nword *)0;
SX.word_in_use = 0;
SX.page_in_use = 0;
}
void
RkwFinalize()
{
struct RkParam *sx = &SX;
int i;
/* already initialized */
if (!(sx->flag & SX_INITED))
return;
/* houchi sareta context wo close */
for(i = 0; (unsigned long)i < now_context; i++)
if (IS_LIVECTX(&CX[i]))
RkwCloseContext(i);
(void)free((char *)CX);
now_context = 0L;
/* sonohoka no shuuryou shori */
_RkFinalizeWord();
_RkFinalizeCache();
(void)free((char *)sx->ddhome);
sx->ddhome = (char *)0;
_RkFreeDDP(sx->ddpath);
RkCloseGram(SG.gramdic);
sx->flag &= ~SX_INITED;
#ifdef MMAP
close(fd_dic);
fd_dic = -1;
#endif
return;
}
/* RkGetSystem: System heno pointer wo motomeru
*/
struct RkParam *
RkGetSystem()
{
return(&SX);
}
/* RkGetSystemDD: System heno pointer wo motomeru
*/
struct DD *
RkGetSystemDD()
{
struct RkParam *sx;
return(((sx = RkGetSystem()) && sx->ddpath) ? sx->ddpath[0] : (struct DD *)0);
}
/* RkGetContext: Context heno pointer wo motomeru
* -> RKintern.h
*/
struct RkContext *
RkGetContext(cx_num)
int cx_num;
{
return(IsLiveCxNum(cx_num) ? &CX[cx_num] : (struct RkContext *)0);
}
struct RkContext *
RkGetXContext(cx_num)
int cx_num;
{
struct RkContext *cx;
cx = RkGetContext(cx_num);
if (cx)
if (!IS_XFERCTX(cx))
cx = (struct RkContext *)0;
return(cx);
}
void
_RkEndBun(cx)
struct RkContext *cx;
{
struct DD **ddp = cx->ddpath;
int c;
cx->flags &= ~(CTX_XFER|CTX_XAUT);
cx->concmode &= ~(RK_CONNECT_WORD | RK_MAKE_WORD |
RK_MAKE_KANSUUJI | RK_MAKE_EISUUJI);
for (c = 0; c < 4; c++) {
struct MD *head, *md, *nd;
head = cx->md[c];
for (md = head->md_next; md != head; md = nd) {
struct DM *dm = md->md_dic;
struct DF *df = dm->dm_file;
struct DD *dd = df->df_direct;
nd = md->md_next;
if (md->md_flags & MD_MPEND) /* release pending */
md->md_flags &= ~MD_MPEND;
if (md->md_flags & MD_UPEND) /* unmount pending */
_RkUmountMD(cx, md);
else
if (!_RkIsInDDP(ddp, dd)) /* unreachable */
_RkUmountMD(cx, md);
};
};
}
/* RkSetDicPath
*
*/
int
RkwSetDicPath(cx_num, path)
int cx_num;
char *path;
{
struct RkContext *cx = RkGetContext(cx_num);
struct DD **new;
new = _RkCreateDDP(path);
if (new) {
_RkFreeDDP(cx->ddpath);
cx->ddpath = new;
return(0);
};
return(-1);
}
/*
fillContext -- ƥȹ¤ΤηޤäȤͤƤ롣
return value:
0 OK
-1
*/
static int
fillContext(cx_num)
int cx_num;
{
struct RkContext *cx = &CX[cx_num];
int i;
/* create mount list headers */
for (i = 0; i < 4; i++) {
struct MD *mh;
if (!(mh = (struct MD *)Calloc(1, sizeof(struct MD)))) {
int j;
for (j = 0 ; j < i; j++) {
free((char *)cx->md[i]);
}
return -1;
}
mh->md_next = mh->md_prev = mh;
mh->md_dic = (struct DM *)0;
mh->md_flags = 0;
cx->md[i] = mh;
}
cx->dmprev = (struct DM *)0;
cx->qmprev = (struct DM *)0;
cx->nv = (struct NV *)0;
cx->ddpath = (struct DD **)0;
cx->kouhomode = (unsigned long)0;
cx->concmode = 0;
cx->litmode = (unsigned long *)Calloc(MAXLIT, sizeof(unsigned long));
cx->gram = &SG;
if (cx->litmode) {
for (i = 0; i < MAXLIT; i++) {
cx->litmode[i] = 0x87654321;
}
cx->poss_cont = 0;
#ifdef EXTENSION_NEW
cx->cx_gwt = (pointer)Calloc(1, sizeof(struct _rec));
if (cx->cx_gwt) {
struct _rec *gwt = (struct _rec *)cx->cx_gwt;
gwt->gwt_cx = -1; /* means no GetWordTextdic context
is available */
gwt->gwt_dicname = (unsigned char *)0;
cx->flags = CTX_LIVE | CTX_NODIC;
return 0;
}
free((char *)cx->litmode);
#else
cx->flags = CTX_LIVE | CTX_NODIC;
return 0;
#endif
}
return -1;
}
int
RkwCreateContext()
{
int cx_num, i;
struct RkContext *newcx;
/* saisho no aki context wo mitsukeru */
for(cx_num = 0; cx_num < (int)now_context; cx_num++) {
if(!CX[cx_num].flags) {
/* create mount list headers */
if (fillContext(cx_num) == 0) {
return cx_num;
}
}
}
newcx = (RkContext *)realloc(CX, (size_t) sizeof(RkContext)
* (now_context+ADD_CONTEXT));
if (newcx) {
CX = newcx;
for (i = now_context ; i < (int)now_context + ADD_CONTEXT ; i++) {
CX[i].flags = (unsigned)0;
}
cx_num = now_context;
now_context += ADD_CONTEXT;
if (fillContext(cx_num) == 0) {
return cx_num;
}
}
return(-1);
}
int
RkwCloseContext(cx_num)
int cx_num;
{
struct RkContext *cx;
int i;
if (!(cx = RkGetContext(cx_num)))
return(-1);
/* terminate bunsetu henkan */
if (IS_XFERCTX(cx))
RkwEndBun(cx_num, 0);
_RkFreeDDP(cx->ddpath);
cx->ddpath = (struct DD **)0;
/* subete no jisho wo MD suru */
for (i = 0; i < 4; i++) {
struct MD *mh, *m, *n;
/* destroy mount list */
mh = cx->md[i];
if (mh) {
for (m = mh->md_next; m != mh; m = n) {
n = m->md_next;
(void)_RkUmountMD(cx, m);
};
(void)free((char *)mh);
cx->md[i] = (struct MD *)0;
};
};
cx->dmprev = (struct DM *)0;
cx->qmprev = (struct DM *)0;
/* convertion table */
if (cx->litmode) {
(void)free((char *)cx->litmode);
cx->litmode = (unsigned long *)0;
}
cx->flags = 0;
/* free grammatical dictionary */
cx->gram->refcount--;
if (cx->gram->refcount == 0 && cx->gram != &SG) {
RkCloseGram(cx->gram->gramdic);
free((char *)cx->gram);
}
cx->gram = (struct RkGram *)0;
#ifdef EXTENSION_NEW
if (cx->cx_gwt) {
struct _rec *gwt = (struct _rec *)cx->cx_gwt;
if (gwt) {
(void)RkwCloseContext(gwt->gwt_cx);
if (gwt->gwt_dicname)
(void)free((char *)gwt->gwt_dicname);
(void)free((char *)gwt);
};
cx->cx_gwt = (pointer)0;
};
freeTdn(cx);
#endif
return 0;
}
/* RkDuplicateContext
* onaji naiyou no context wo sakuseisuru
*/
int RkwDuplicateContext pro((int));
int
RkwDuplicateContext(cx_num)
int cx_num;
{
struct RkContext *sx;
int dup = -1;
dup = RkwCreateContext();
if (dup >= 0) {
int i;
struct RkContext *dx;
sx = RkGetContext(cx_num);
if (sx) {
dx = RkGetContext(dup);
/* use the same grammatical information */
dx->gram = sx->gram;
dx->gram->refcount++;
if (!(sx->flags & CTX_NODIC)) {
dx->flags &= ~CTX_NODIC;
}
/* copy the mount list */
for (i = 0; i < 4; i++) {
struct MD *mh, *md;
/* should mount dictionaries in reverse order */
mh = sx->md[i];
for (md = mh->md_prev; md != mh; md = md->md_prev)
(void)_RkMountMD(dx, md->md_dic, md->md_freq,
md->md_flags & MD_WRITE, 0);
};
dx->ddpath = _RkCopyDDP(sx->ddpath);
if (sx->litmode && dx->litmode)
for (i = 0; i < MAXLIT; i++)
dx->litmode[i] = sx->litmode[i];
} else {
RkwCloseContext(dup);
return -1;
}
}
return(dup);
}
/* RkMountDic: append the specified dictionary at the end of the mount list */
int
RkwMountDic(cx_num, name, mode)
int cx_num; /* context specified */
char *name; /* the name of dictonary */
int mode; /* mount mode */
{
struct RkContext *cx;
int firsttime;
if (!name)
return(-1);
cx = RkGetContext(cx_num);
if (cx) {
struct DM *dm, *qm;
firsttime = (cx->flags & CTX_NODIC) ? 1 : 0;
if (firsttime) { /* ǽ˥ޥ*褦*ߤ */
cx->flags &= ~CTX_NODIC;
}
dm = _RkSearchDicWithFreq(cx->ddpath, name, &qm);
if (dm) {
struct MD *mh = cx->md[dm->dm_class];
struct MD *md, *nd;
int count = 0;
/* search the dictionary */
for (md = mh->md_next; md != mh; md = nd) {
nd = md->md_next;
if (md->md_dic == dm) { /* already mounted */
/* cancel the previous unmount */
if (md->md_flags & MD_UPEND)
md->md_flags &= ~MD_UPEND;
count++;
};
};
if (!count) {
return _RkMountMD(cx, dm, qm, mode, firsttime);
}
}
}
return(-1);
}
/* RkUnmountDic: removes the specified dictionary from the mount list */
int
RkwUnmountDic(cx_num, name)
int cx_num;
char *name;
{
struct RkContext *cx;
int i;
if (!name)
return(-1);
cx = RkGetContext(cx_num);
if (cx) {
for (i = 0; i < 4; i++) {
struct MD *mh = cx->md[i];
struct MD *md, *nd;
for (md = mh->md_next; md != mh; md = nd) {
struct DM *dm = md->md_dic;
char *ename;
ename = md->md_freq ? md->md_freq->dm_nickname : dm->dm_nickname;
nd = md->md_next;
if (!STRCMP(ename, name)) {
_RkUmountMD(cx, md);
}
}
}
return(0);
}
return(-1);
}
/* RkRemountDic: relocate the specified dictionary among the mount list */
int
RkwRemountDic(cx_num, name, mode)
int cx_num; /* context specified */
char *name; /* the name of dictonary */
int mode; /* mount mode */
{
struct RkContext *cx;
int i, isfound = 0;
char *ename;
if (!name)
return(-1);
cx = RkGetContext(cx_num);
if (cx) {
for (i = 0; i < 4; i++) {
struct MD *mh = cx->md[i];
struct MD *md, *pd;
/* do in reverse order */
for (md = mh->md_prev; md != mh; md = pd) {
struct DM *dm = md->md_dic;
ename = md->md_freq ? md->md_freq->dm_nickname : dm->dm_nickname;
pd = md->md_prev;
if (!STRCMP(ename, name)) {
/* remove from mount list */
md->md_prev->md_next = md->md_next;
md->md_next->md_prev = md->md_prev;
/* insert according to the mode */
if (!mode) { /* sentou he */
md->md_next = mh->md_next;
md->md_prev = mh;
mh->md_next->md_prev = md;
mh->md_next = md;
} else { /* saigo he */
md->md_next = mh;
md->md_prev = mh->md_prev;
mh->md_prev->md_next = md;
mh->md_prev = md;
};
isfound++;
};
};
};
if (isfound)
return(0);
};
return(-1);
}
/* RkGetDicList: collects the names of the mounted dictionaies */
int
RkwGetMountList(cx_num, mdname, maxmdname)
int cx_num;
char *mdname;
int maxmdname;
{
struct RkContext *cx;
struct MD *mh, *md;
int p, i, j;
int count = -1;
cx = RkGetContext(cx_num);
if (cx) {
i = count = 0;
for (p = 0; p < 4; p++) {
mh = cx->md[p];
for (md = mh->md_next; md != mh; md = md->md_next) {
struct DM *dm = md->md_dic;
char *name;
if (md->md_flags & (MD_MPEND|MD_UPEND)) {
continue;
};
name = md->md_freq ? md->md_freq->dm_nickname : dm->dm_nickname;
j = i + strlen(name) + 1;
if (j + 1 < maxmdname) {
if (mdname) {
(void)strcpy(mdname + i, name);
}
i = j;
count++;
};
};
};
if (i + 1 < maxmdname && mdname)
mdname[i++] = (char)0;
};
return(count);
}
/* RkGetDicList: collects the names of dictionary */
struct dics {
char *nickname, *dicname;
int dictype;
};
static int diccmp pro((const struct dics *, const struct dics *));
static int
diccmp(a, b)
const struct dics *a, *b;
{
int res;
res = strcmp(a->nickname, b->nickname);
if (res == 0) {
res = strcmp(a->dicname, b->dicname);
if (res == 0) {
if (a->dictype == b->dictype) {
res = 0;
}
else if (a->dictype == DF_FREQDIC) {
res = -1;
}
else if (b->dictype == DF_FREQDIC) {
res = 1;
}
else if (a->dictype == DF_PERMDIC) {
res = -1;
}
else if (b->dictype == DF_PERMDIC) {
res = 1;
}
else {
res = 0;
}
}
}
return res;
}
int
RkwGetDicList(cx_num, mdname, maxmdname)
int cx_num;
char *mdname;
int maxmdname;
{
struct RkContext *cx;
struct DD **ddp, *dd;
struct DF *df, *fh;
struct DM *dm, *mh;
int i, j, k, n;
int count = -1;
struct dics *diclist;
/* ޤ */
if ((cx = RkGetContext(cx_num)) && (ddp = cx->ddpath)) {
count = 0;
for (i = 0; (dd = ddp[i]) != (struct DD *)0 ; i++) {
fh = &dd->dd_files;
for (df = fh->df_next; df != fh; df = df->df_next) {
mh = &df->df_members;
for (dm = mh->dm_next; dm != mh; dm = dm->dm_next) {
count++;
}
}
}
/* ꥹȤ malloc */
diclist = (struct dics *)malloc(count * sizeof(struct dics));
if (diclist) {
struct dics *dicp = diclist, *prevdicp = (struct dics *)0;
for (i = 0 ; (dd = ddp[i]) != (struct DD *)0 ; i++) {
fh = &dd->dd_files;
for (df = fh->df_next; df != fh; df = df->df_next) {
mh = &df->df_members;
for (dm = mh->dm_next; dm != mh; dm = dm->dm_next) {
dicp->nickname = dm->dm_nickname;
dicp->dicname = dm->dm_dicname;
dicp->dictype = df->df_type;
dicp++;
}
}
}
qsort(diclist, count, sizeof(struct dics),
(int (*) pro((const void *, const void *)))diccmp);
n = count;
for (i = j = 0, dicp = diclist ; i < n ; i++, dicp++) {
if (prevdicp && !strcmp(prevdicp->nickname, dicp->nickname)) {
/* prev ȺμȤ nickname פƤ */
count--;
}
else {
k = j + strlen(dicp->nickname) + 1;
if (k + 1 < maxmdname) {
if (mdname) {
(void)strcpy(mdname + j, dicp->nickname);
j = k;
}
}
prevdicp = dicp;
}
}
if (j + 1 < maxmdname && mdname) {
mdname[j++] = 0;
}
free((char *)diclist);
}
else {
count = -1; /* äѤΤʿʬʤä */
}
}
return(count);
}
/* RkGetDirList: collects the names of directories */
int
RkwGetDirList(cx_num, ddname, maxddname)
int cx_num;
char *ddname;
int maxddname;
{
struct RkContext *cx;
struct DD **ddp, *dd;
int p, i, j;
int count = -1;
if ((cx = RkGetContext(cx_num)) && (ddp = cx->ddpath)) {
i = count = 0;
for (p = 0; (dd = ddp[p]) != (struct DD *)0 ; p++) {
j = i + strlen(dd->dd_name) + 1;
if (j + 1 < maxddname) {
if (ddname)
(void)strcpy(ddname + i, dd->dd_name);
i = j;
count++;
};
};
if (i + 1 < maxddname && ddname)
ddname[i++] = (char)0;
};
return(count);
}
/* RkDefineDic
* mount the dictionary onto the specified context.
*/
int
RkwDefineDic(cx_num, name, word)
int cx_num;
char *name;
Wchar *word;
{
struct RkContext *cx;
int i;
if ((cx = RkGetContext(cx_num)) && word && name) {
char *prevname = (char *)0;
if (cx->dmprev)
prevname = cx->dmprev->dm_nickname;
if (cx->qmprev)
prevname = cx->qmprev->dm_nickname;
if (prevname && !STRCMP(prevname, name))
return(DST_CTL(cx->dmprev, cx->qmprev, DST_DoDefine, word,
cx->gram->gramdic));
else {
for (i = 0; i < 4; i++) {
struct MD *mh = cx->md[i];
struct MD *md, *nd;
for (md = mh->md_next; md != mh; md = nd) {
struct DM *dm = md->md_dic;
struct DM *qm = md->md_freq;
char *dname = (char *)0;
if (dm)
dname = dm->dm_nickname;
if (qm)
dname = qm->dm_nickname;
if (dname) {
if (!STRCMP(dname, name)) {
cx->dmprev = dm;
cx->qmprev = qm;
return(DST_CTL(dm, qm, DST_DoDefine, word, cx->gram->gramdic));
}
}
nd = md->md_next;
}
}
}
}
return(-1);
}
/* RkDeleteDic
* mount the dictionary onto the specified context.
*/
int
RkwDeleteDic(cx_num, name, word)
int cx_num;
char *name;
Wchar *word;
{
struct RkContext *cx;
int i;
if ((cx = RkGetContext(cx_num)) && name) {
char *prevname = (char *)0;
if (cx->dmprev)
prevname = cx->dmprev->dm_nickname;
if (cx->qmprev)
prevname = cx->qmprev->dm_nickname;
if (prevname && !STRCMP(prevname, name))
return(DST_CTL(cx->dmprev, cx->qmprev, DST_DoDelete, word,
cx->gram->gramdic));
else {
for (i = 0; i < 4; i++) {
struct MD *mh = cx->md[i];
struct MD *md, *nd;
for (md = mh->md_next; md != mh; md = nd) {
struct DM *dm = md->md_dic;
struct DM *qm = md->md_freq;
char *dname = (char *)0;
if (dm)
dname = dm->dm_nickname;
if (qm)
dname = qm->dm_nickname;
if (dname) {
if (!STRCMP(dname, name)) {
cx->dmprev = dm;
cx->qmprev = qm;
return(DST_CTL(dm, qm, DST_DoDelete, word, cx->gram->gramdic));
}
}
nd = md->md_next;
}
}
}
}
return(-1);
}
#ifdef STANDALONE /* The following code is as simulating the code in
lib/RKC API. In case STANDALONE, it becomes possible for libRK to be
linked with libcanna directly. */
int RkwSetAppName pro((int, char *));
int
RkwSetAppName(Context, name)
int Context;
char *name;
{
return 0;
}
char *RkwGetServerName pro((void));
char *
RkwGetServerName()
{
return (char *)NULL;
}
int RkwGetProtocolVersion pro((int *, int *));
int
RkwGetProtocolVersion(majorp, minorp)
int *majorp, *minorp;
{
*majorp = CANNA_MAJOR_MINOR / 1000;
*minorp = CANNA_MAJOR_MINOR % 1000;
return 0;
}
int RkwGetServerVersion(int *, int *);
int
RkwGetServerVersion(majorp, minorp)
int *majorp, *minorp;
{
*majorp = CANNA_MAJOR_MINOR / 1000;
*minorp = CANNA_MAJOR_MINOR % 1000;
return 0;
}
int
RkwSetUserInfo(user, group, topdir)
char *user, *group, *topdir;
{
return 1;
}
#endif /* STANDALONE */
|