sj4/lib/sj4core/getrank.c

162 lines
3.4 KiB
C
Raw Normal View History

2008-01-11 11:57:08 +00:00
/*
* Copyright (c) 1991-1994 Sony Corporation
2026-06-19 01:49:53 +09:00
*
2008-01-11 11:57:08 +00:00
* 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
* without limitation the rights to use, copy, modify, merge, publish,
* 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:
2026-06-19 01:49:53 +09:00
*
2008-01-11 11:57:08 +00:00
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
2026-06-19 01:49:53 +09:00
*
2008-01-11 11:57:08 +00:00
* 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.
* IN NO EVENT SHALL SONY CORPORATION BE LIABLE FOR ANY CLAIM,
* 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.
2026-06-19 01:49:53 +09:00
*
2008-01-11 11:57:08 +00:00
* 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
* from Sony Corporation.
*
*/
#include "sj_kcnv.h"
#include "sj_kanakan.h"
2026-06-20 02:12:04 +09:00
static void setstynum(SJ4_CONTEXT2), setnspr(SJ4_CONTEXT KHREC*, STDYIN*), regetrank(SJ4_CONTEXT2);
2026-06-19 01:49:53 +09:00
2026-06-20 02:12:04 +09:00
void getrank(SJ4_CONTEXT2) {
2008-01-11 11:57:08 +00:00
trank = nrank = 1;
2026-06-20 02:12:04 +09:00
setstynum(SJ4_CONTEXT_PASS2);
2008-01-11 11:57:08 +00:00
2026-06-20 02:12:04 +09:00
regetrank(SJ4_CONTEXT_PASS2);
2008-01-11 11:57:08 +00:00
}
static void
2026-06-20 02:12:04 +09:00
setstynum(SJ4_CONTEXT2) {
2026-06-19 01:49:53 +09:00
KHREC* kptr;
STDYIN* sptr;
2008-01-11 11:57:08 +00:00
int count;
2026-06-19 01:49:53 +09:00
for(kptr = kouhotbl, count = khcount; count--; kptr++) {
2008-01-11 11:57:08 +00:00
2026-06-20 02:12:04 +09:00
sptr = srchstdy(SJ4_CONTEXT_PASS kptr->clrec->jnode->jseg, kptr->offs,
2026-06-19 01:49:53 +09:00
kptr->clrec->jnode->dicid);
2008-01-11 11:57:08 +00:00
2026-06-19 01:49:53 +09:00
if(!sptr) continue;
2026-06-20 02:12:04 +09:00
setnspr(SJ4_CONTEXT_PASS kptr, sptr);
2008-01-11 11:57:08 +00:00
}
}
static void
2026-06-20 02:12:04 +09:00
setnspr(SJ4_CONTEXT KHREC* kptr, STDYIN* sptr) {
2026-06-19 01:49:53 +09:00
KHREC* ptr;
int keepnm;
TypeStyNum styno;
2008-01-11 11:57:08 +00:00
2026-06-19 01:49:53 +09:00
styno = kptr->styno = sptr->styno;
2008-01-11 11:57:08 +00:00
keepnm = trank;
2026-06-19 01:49:53 +09:00
for(ptr = kouhotbl; ptr < kptr; ptr++) {
2008-01-11 11:57:08 +00:00
2026-06-19 01:49:53 +09:00
if(styno < ptr->styno) {
ptr->rank++;
2008-01-11 11:57:08 +00:00
keepnm--;
}
2026-06-19 01:49:53 +09:00
else if(styno == ptr->styno) {
if(kptr->sttfg && kptr->ka_fg) {
2008-01-11 11:57:08 +00:00
2026-06-19 01:49:53 +09:00
if((sptr->sttkj == kptr->sttkj) &&
(sptr->ka_kj == kptr->ka_kj)) {
ptr->rank++;
2008-01-11 11:57:08 +00:00
keepnm--;
}
}
2026-06-19 01:49:53 +09:00
else if(kptr->sttfg) {
if(sptr->sttkj == kptr->sttkj) {
ptr->rank++;
2008-01-11 11:57:08 +00:00
keepnm--;
}
}
2026-06-19 01:49:53 +09:00
else if(kptr->ka_fg) {
if(sptr->ka_kj == kptr->ka_kj) {
ptr->rank++;
2008-01-11 11:57:08 +00:00
keepnm--;
}
}
}
}
2026-06-19 01:49:53 +09:00
kptr->rank = (u_char)keepnm;
2008-01-11 11:57:08 +00:00
trank++;
2026-06-19 01:49:53 +09:00
if(keepnm <= nrank) nrank++;
2008-01-11 11:57:08 +00:00
2026-06-19 01:49:53 +09:00
if(sptr->nmflg && (nrank > keepnm)) nrank = keepnm;
2008-01-11 11:57:08 +00:00
}
static void
2026-06-20 02:12:04 +09:00
regetrank(SJ4_CONTEXT2) {
2026-06-19 01:49:53 +09:00
KHREC* kptr;
int count;
int tmp;
if(nrank < trank) {
2008-01-11 11:57:08 +00:00
tmp = nrank;
trank += nkhcount;
}
2026-06-19 01:49:53 +09:00
2008-01-11 11:57:08 +00:00
else {
nkhcount = tmp = 0;
}
2026-06-19 01:49:53 +09:00
for(count = khcount, kptr = kouhotbl; count--; kptr++) {
if(!(kptr->rank)) {
if(tmp && kptr->mode && !(kptr->offs)) {
kptr->rank = (u_char)tmp++;
2026-06-24 12:33:17 +09:00
}
2008-01-11 11:57:08 +00:00
}
2026-06-19 01:49:53 +09:00
else if((short)kptr->rank >= nrank)
kptr->rank += (u_char)nkhcount;
2008-01-11 11:57:08 +00:00
}
2026-06-24 12:33:17 +09:00
2026-06-24 12:27:46 +09:00
while(1) {
KHREC* best = NULL;
for(count = khcount, kptr = kouhotbl; count--; kptr++) {
if(kptr->rank != 0) continue;
if(best == NULL || kptr->cost < best->cost) {
best = kptr;
}
}
if(best == NULL) break;
2026-06-24 12:33:17 +09:00
best->rank = (u_char)trank++;
2026-06-24 12:27:46 +09:00
}
2008-01-11 11:57:08 +00:00
}