Format source code

This commit is contained in:
Nishi 2026-06-18 13:40:14 +09:00
commit d0be6165c0
165 changed files with 30306 additions and 33687 deletions

View file

@ -1,6 +1,6 @@
/*
* Copyright (c) 1991-1994 Sony Corporation
*
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
@ -8,10 +8,10 @@
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
@ -19,7 +19,7 @@
* DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
* OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR
* THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
*
* Except as contained in this notice, the name of Sony Corporation
* shall not be used in advertising or otherwise to promote the sale, use
* or other dealings in this Software without prior written authorization
@ -28,31 +28,28 @@
*/
/*
* $SonyRCSfile: mkjiritu.c,v $
* $SonyRevision: 1.1 $
* $SonyRCSfile: mkjiritu.c,v $
* $SonyRevision: 1.1 $
* $SonyDate: 1994/06/03 08:02:03 $
*
* $Id$
*/
#include <sys/types.h>
#include <string.h>
#include "sj_kcnv.h"
#include "kanakan.h"
int srchhead();
int srchhead();
static void dic_mu(int mode);
static void dic_cl(void);
void
mkjiritu(int mode)
{
unsigned char chkind1;
unsigned char chkind2;
JREC *jrec;
unsigned char *stb;
void mkjiritu(int mode) {
unsigned char chkind1;
unsigned char chkind2;
JREC* jrec;
unsigned char* stb;
headcode = headlen = 0;
@ -60,25 +57,25 @@ mkjiritu(int mode)
chkind1 = Chrtbl[*cnvstart];
if (chkind1 & DICTOP) {
if(chkind1 & DICTOP) {
dic_mu(mode);
}
if (mode & DO_CLSTUDY) dic_cl();
if(mode & DO_CLSTUDY) dic_cl();
srchnum();
if (srchhead() && cnvlen != headlen) {
if(srchhead() && cnvlen != headlen) {
cnvstart += headlen;
cnvlen -= headlen;
chkind2 = Chrtbl[*cnvstart];
if (chkind2 & DICTOP) {
if(chkind2 & DICTOP) {
dic_mu(mode);
}
if (headcode == SETTOU_DAI) {
if(headcode == SETTOU_DAI) {
srchnum();
}
@ -86,111 +83,106 @@ mkjiritu(int mode)
cnvlen += headlen;
}
for (jrec = maxjptr ; jrec ; jrec = jrec -> jsort) {
if ((stb = getstb(jrec -> hinsi)) != NULL)
for(jrec = maxjptr; jrec; jrec = jrec->jsort) {
if((stb = getstb(jrec->hinsi)) != NULL)
setubi(jrec, stb);
}
}
static void
dic_mu(int mode)
{
unsigned char *tagp;
DICTL *dp;
dic_mu(int mode) {
unsigned char* tagp;
DICTL* dp;
for (dp = dictlist ; dp ; dp = dp -> next) {
curdict = dp -> dict;
dicinl = 1;
for(dp = dictlist; dp; dp = dp->next) {
curdict = dp->dict;
dicinl = 1;
dicsaml = 0;
prevseg = -1;
while ((tagp = srchdict(tagp)) != NULL) setjrec(tagp, mode);
while((tagp = srchdict(tagp)) != NULL) setjrec(tagp, mode);
}
}
JREC*
argjrec(int len, JREC* rec)
{
JREC *ptr;
JREC *jrec;
JREC *child;
JREC* argjrec(int len, JREC* rec) {
JREC* ptr;
JREC* jrec;
JREC* child;
jrec = alloc_jrec();
if (!jrec) {
if (!maxjptr) return NULL;
if(!jrec) {
if(!maxjptr) return NULL;
ptr = NULL;
ptr = NULL;
jrec = maxjptr;
while ((child = jrec -> jsort) != NULL) {
while((child = jrec->jsort) != NULL) {
ptr = jrec;
jrec = child;
}
if (len <= (int) jrec -> jlen) return NULL;
if(len <= (int)jrec->jlen) return NULL;
if (ptr)
ptr -> jsort = NULL;
if(ptr)
ptr->jsort = NULL;
else
maxjptr = NULL;
}
if (rec)
if(rec)
memcpy((unsigned char*)rec, (unsigned char*)jrec, sizeof(JREC));
else
memset((unsigned char*)jrec, 0, sizeof(*jrec));
jrec -> jlen = (unsigned char)len;
jrec->jlen = (unsigned char)len;
if (!maxjptr) {
maxjptr = jrec;
jrec -> jsort = NULL;
if(!maxjptr) {
maxjptr = jrec;
jrec->jsort = NULL;
return jrec;
}
ptr = maxjptr;
if ((int)ptr -> jlen < len) {
jrec -> jsort = maxjptr;
maxjptr = jrec;
if((int)ptr->jlen < len) {
jrec->jsort = maxjptr;
maxjptr = jrec;
return jrec;
}
while ((child = ptr -> jsort) != NULL) {
if ((int)child -> jlen < len) break;
while((child = ptr->jsort) != NULL) {
if((int)child->jlen < len) break;
ptr = child;
}
ptr -> jsort = jrec;
jrec -> jsort = child;
ptr->jsort = jrec;
jrec->jsort = child;
return jrec;
}
static void
dic_cl(void)
{
unsigned char *p;
unsigned short pos;
int len;
int cmp;
dic_cl(void) {
unsigned char* p;
unsigned short pos;
int len;
int cmp;
if (!StudyExist()) return;
if(!StudyExist()) return;
if ((pos = ClStudyIdx[(short) *cnvstart / ClStudyStep]) != (unsigned short)-1) {
if((pos = ClStudyIdx[(short)*cnvstart / ClStudyStep]) != (unsigned short)-1) {
for (p = ClStudyDict + pos ; !iseocl(p) ; p = ClNextTag(p)) {
for(p = ClStudyDict + pos; !iseocl(p); p = ClNextTag(p)) {
cmp = strncmp(cnvstart, (unsigned char*)ClYomiPos(p),
len = ClYomiLen(p));
len = ClYomiLen(p));
if (cmp == MATCH) {
if (!isdpnd(*(cnvstart + len))) {
if(cmp == MATCH) {
if(!isdpnd(*(cnvstart + len))) {
setcrec(p);
}
}
else if (cmp == OVER)
else if(cmp == OVER)
break;
}
}
}