1999-12-09 18:35:11 +00:00
|
|
|
/*
|
|
|
|
*******************************************************************************
|
|
|
|
* *
|
2001-03-21 20:44:20 +00:00
|
|
|
* Copyright (C) 1999-2001, International Business Machines Corporation *
|
|
|
|
* and others. All Rights Reserved. *
|
1999-12-09 18:35:11 +00:00
|
|
|
* *
|
|
|
|
*******************************************************************************
|
|
|
|
* file name: uresdata.c
|
|
|
|
* encoding: US-ASCII
|
|
|
|
* tab size: 8 (not used)
|
|
|
|
* indentation:4
|
|
|
|
*
|
|
|
|
* created on: 1999dec08
|
|
|
|
* created by: Markus W. Scherer
|
2000-06-20 23:42:20 +00:00
|
|
|
* Modification History:
|
|
|
|
*
|
|
|
|
* Date Name Description
|
|
|
|
* 06/20/2000 helena OS/400 port changes; mostly typecast.
|
1999-12-09 18:35:11 +00:00
|
|
|
*/
|
|
|
|
|
1999-12-28 23:39:02 +00:00
|
|
|
#include "unicode/utypes.h"
|
1999-12-09 18:35:11 +00:00
|
|
|
#include "cstring.h"
|
1999-12-28 23:39:02 +00:00
|
|
|
#include "unicode/udata.h"
|
1999-12-09 18:35:11 +00:00
|
|
|
#include "uresdata.h"
|
2000-05-15 18:39:17 +00:00
|
|
|
#include "uresimp.h"
|
1999-12-09 18:35:11 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Resource access helpers
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* get a const char* pointer to the key with the keyOffset byte offset from pRoot */
|
|
|
|
#define RES_GET_KEY(pRoot, keyOffset) ((const char *)(pRoot)+(keyOffset))
|
2000-05-26 02:02:42 +00:00
|
|
|
#define URESDATA_ITEM_NOT_FOUND 0xFFFF
|
1999-12-09 18:35:11 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* All the type-access functions assume that
|
|
|
|
* the resource is of the expected type.
|
|
|
|
*/
|
|
|
|
|
2000-05-18 21:25:51 +00:00
|
|
|
|
1999-12-09 18:35:11 +00:00
|
|
|
/*
|
|
|
|
* Array functions
|
|
|
|
*/
|
|
|
|
static Resource
|
2000-05-15 18:39:17 +00:00
|
|
|
_res_getArrayItem(Resource *pRoot, Resource res, int32_t indexR) {
|
1999-12-09 18:35:11 +00:00
|
|
|
int32_t *p=(int32_t *)RES_GET_POINTER(pRoot, res);
|
2000-05-15 18:39:17 +00:00
|
|
|
if(indexR<*p) {
|
|
|
|
return ((Resource *)(p))[1+indexR];
|
1999-12-09 18:35:11 +00:00
|
|
|
} else {
|
2000-05-15 18:39:17 +00:00
|
|
|
return RES_BOGUS; /* indexR>itemCount */
|
1999-12-09 18:35:11 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Table functions
|
|
|
|
*
|
|
|
|
* Important: the key offsets are 16-bit byte offsets from pRoot,
|
|
|
|
* and the itemCount is one more 16-bit, too.
|
|
|
|
* Thus, there are (count+1) uint16_t values.
|
|
|
|
* In order to 4-align the Resource item values, there is a padding
|
|
|
|
* word if count is even, i.e., there is exactly (~count&1)
|
|
|
|
* 16-bit padding words.
|
|
|
|
*/
|
|
|
|
static const char *
|
2000-05-15 18:39:17 +00:00
|
|
|
_res_getTableKey(const Resource *pRoot, const Resource res, uint16_t indexS) {
|
1999-12-09 18:35:11 +00:00
|
|
|
uint16_t *p=(uint16_t *)RES_GET_POINTER(pRoot, res);
|
2000-05-15 18:39:17 +00:00
|
|
|
if(indexS<*p) {
|
|
|
|
return RES_GET_KEY(pRoot, p[indexS+1]);
|
1999-12-09 18:35:11 +00:00
|
|
|
} else {
|
2000-05-15 18:39:17 +00:00
|
|
|
return NULL; /* indexS>itemCount */
|
1999-12-09 18:35:11 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static Resource
|
2000-05-15 18:39:17 +00:00
|
|
|
_res_getTableItem(const Resource *pRoot, const Resource res, uint16_t indexR) {
|
1999-12-09 18:35:11 +00:00
|
|
|
uint16_t *p=(uint16_t *)RES_GET_POINTER(pRoot, res);
|
|
|
|
uint16_t count=*p;
|
2000-05-15 18:39:17 +00:00
|
|
|
if(indexR<count) {
|
|
|
|
return ((Resource *)(p+1+count+(~count&1)))[indexR];
|
1999-12-09 18:35:11 +00:00
|
|
|
} else {
|
2000-05-15 18:39:17 +00:00
|
|
|
return RES_BOGUS; /* indexR>itemCount */
|
1999-12-09 18:35:11 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static Resource
|
2000-05-15 18:39:17 +00:00
|
|
|
_res_findTableItem(const Resource *pRoot, const Resource res, const char *key) {
|
1999-12-09 18:35:11 +00:00
|
|
|
uint16_t *p=(uint16_t *)RES_GET_POINTER(pRoot, res);
|
|
|
|
uint16_t i, start, limit;
|
|
|
|
|
|
|
|
limit=*p++; /* number of entries */
|
|
|
|
|
2001-04-17 19:11:56 +00:00
|
|
|
if(limit == 0) { /* this table is empty */
|
|
|
|
return RES_BOGUS;
|
|
|
|
}
|
|
|
|
|
1999-12-09 18:35:11 +00:00
|
|
|
/* do a binary search for the key */
|
|
|
|
start=0;
|
|
|
|
while(start<limit-1) {
|
2000-08-10 01:59:18 +00:00
|
|
|
i=(uint16_t)((start+limit)/2);
|
1999-12-28 23:39:02 +00:00
|
|
|
if(uprv_strcmp(key, RES_GET_KEY(pRoot, p[i]))<0) {
|
1999-12-09 18:35:11 +00:00
|
|
|
limit=i;
|
|
|
|
} else {
|
|
|
|
start=i;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* did we really find it? */
|
1999-12-28 23:39:02 +00:00
|
|
|
if(uprv_strcmp(key, RES_GET_KEY(pRoot, p[start]))==0) {
|
1999-12-09 18:35:11 +00:00
|
|
|
limit=*(p-1); /* itemCount */
|
|
|
|
return ((Resource *)(p+limit+(~limit&1)))[start];
|
|
|
|
} else {
|
|
|
|
return RES_BOGUS; /* not found */
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2000-05-15 18:39:17 +00:00
|
|
|
static uint16_t
|
|
|
|
_res_findTableIndex(const Resource *pRoot, const Resource res, const char *key) {
|
|
|
|
uint16_t *p=(uint16_t *)RES_GET_POINTER(pRoot, res);
|
|
|
|
uint16_t i, start, limit;
|
|
|
|
|
|
|
|
limit=*p++; /* number of entries */
|
|
|
|
|
2001-08-17 22:14:17 +00:00
|
|
|
if(limit == 0) { /* this table is empty */
|
|
|
|
return URESDATA_ITEM_NOT_FOUND;
|
|
|
|
}
|
|
|
|
|
2000-05-15 18:39:17 +00:00
|
|
|
/* do a binary search for the key */
|
|
|
|
start=0;
|
|
|
|
while(start<limit-1) {
|
2000-08-10 01:59:18 +00:00
|
|
|
i=(uint16_t)((start+limit)/2);
|
2000-05-15 18:39:17 +00:00
|
|
|
if(uprv_strcmp(key, RES_GET_KEY(pRoot, p[i]))<0) {
|
|
|
|
limit=i;
|
|
|
|
} else {
|
|
|
|
start=i;
|
|
|
|
}
|
|
|
|
}
|
2001-08-17 22:14:17 +00:00
|
|
|
|
2000-05-15 18:39:17 +00:00
|
|
|
/* did we really find it? */
|
|
|
|
if(uprv_strcmp(key, RES_GET_KEY(pRoot, p[start]))==0) {
|
|
|
|
limit=*(p-1); /* itemCount */
|
|
|
|
return start;
|
|
|
|
} else {
|
2000-05-26 02:02:42 +00:00
|
|
|
return URESDATA_ITEM_NOT_FOUND; /* not found */
|
2000-05-15 18:39:17 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
1999-12-09 18:35:11 +00:00
|
|
|
/* helper for res_load() ---------------------------------------------------- */
|
|
|
|
|
2000-05-18 22:08:39 +00:00
|
|
|
static UBool
|
1999-12-09 18:35:11 +00:00
|
|
|
isAcceptable(void *context,
|
|
|
|
const char *type, const char *name,
|
2000-05-03 23:15:02 +00:00
|
|
|
const UDataInfo *pInfo) {
|
2000-08-10 01:59:18 +00:00
|
|
|
return (UBool)(
|
1999-12-09 18:35:11 +00:00
|
|
|
pInfo->size>=20 &&
|
|
|
|
pInfo->isBigEndian==U_IS_BIG_ENDIAN &&
|
|
|
|
pInfo->charsetFamily==U_CHARSET_FAMILY &&
|
|
|
|
pInfo->sizeofUChar==U_SIZEOF_UCHAR &&
|
1999-12-10 01:45:15 +00:00
|
|
|
pInfo->dataFormat[0]==0x52 && /* dataFormat="ResB" */
|
|
|
|
pInfo->dataFormat[1]==0x65 &&
|
|
|
|
pInfo->dataFormat[2]==0x73 &&
|
|
|
|
pInfo->dataFormat[3]==0x42 &&
|
2000-08-10 01:59:18 +00:00
|
|
|
pInfo->formatVersion[0]==1);
|
1999-12-09 18:35:11 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* semi-public functions ---------------------------------------------------- */
|
|
|
|
|
2000-05-18 22:08:39 +00:00
|
|
|
U_CFUNC UBool
|
1999-12-09 18:35:11 +00:00
|
|
|
res_load(ResourceData *pResData,
|
|
|
|
const char *path, const char *name, UErrorCode *errorCode) {
|
|
|
|
/* load the ResourceBundle file */
|
|
|
|
pResData->data=udata_openChoice(path, "res", name, isAcceptable, NULL, errorCode);
|
|
|
|
if(U_FAILURE(*errorCode)) {
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* get its memory and root resource */
|
|
|
|
pResData->pRoot=(Resource *)udata_getMemory(pResData->data);
|
|
|
|
pResData->rootRes=*pResData->pRoot;
|
|
|
|
|
|
|
|
/* currently, we accept only resources that have a Table as their roots */
|
|
|
|
if(RES_GET_TYPE(pResData->rootRes)!=RES_TABLE) {
|
|
|
|
udata_close(pResData->data);
|
2000-05-15 18:39:17 +00:00
|
|
|
pResData->data=NULL;
|
1999-12-09 18:35:11 +00:00
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
|
|
|
|
return TRUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
U_CFUNC void
|
|
|
|
res_unload(ResourceData *pResData) {
|
|
|
|
if(pResData->data!=NULL) {
|
|
|
|
udata_close(pResData->data);
|
|
|
|
pResData->data=NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
U_CFUNC const UChar *
|
2000-05-15 18:39:17 +00:00
|
|
|
res_getString(const ResourceData *pResData, const Resource res, int32_t *pLength) {
|
1999-12-09 18:35:11 +00:00
|
|
|
if(res!=RES_BOGUS && RES_GET_TYPE(res)==RES_STRING) {
|
2001-07-27 17:15:30 +00:00
|
|
|
int32_t *p=(int32_t *)RES_GET_POINTER(pResData->pRoot, res);
|
|
|
|
*pLength=*p++;
|
|
|
|
return (UChar *)p;
|
1999-12-09 18:35:11 +00:00
|
|
|
} else {
|
|
|
|
*pLength=0;
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2000-05-18 21:25:51 +00:00
|
|
|
U_CFUNC const uint8_t *
|
|
|
|
res_getBinary(const ResourceData *pResData, const Resource res, int32_t *pLength) {
|
2001-08-27 18:51:43 +00:00
|
|
|
if(res!=RES_BOGUS) {
|
|
|
|
int32_t *p=(int32_t *)RES_GET_POINTER(pResData->pRoot, res);
|
|
|
|
*pLength=*p++;
|
|
|
|
if (*pLength == 0) {
|
|
|
|
p = NULL;
|
|
|
|
}
|
|
|
|
return (uint8_t *)p;
|
|
|
|
} else {
|
|
|
|
*pLength=0;
|
|
|
|
return NULL;
|
|
|
|
}
|
2000-05-18 21:25:51 +00:00
|
|
|
}
|
|
|
|
|
2001-08-01 17:08:07 +00:00
|
|
|
|
|
|
|
U_CFUNC const int32_t *
|
|
|
|
res_getIntVector(const ResourceData *pResData, const Resource res, int32_t *pLength) {
|
2001-08-27 18:51:43 +00:00
|
|
|
if(res!=RES_BOGUS && RES_GET_TYPE(res)==RES_INT_VECTOR) {
|
|
|
|
int32_t *p=(int32_t *)RES_GET_POINTER(pResData->pRoot, res);
|
|
|
|
*pLength=*p++;
|
|
|
|
if (*pLength == 0) {
|
|
|
|
p = NULL;
|
|
|
|
}
|
|
|
|
return (const int32_t *)p;
|
|
|
|
} else {
|
|
|
|
*pLength=0;
|
|
|
|
return NULL;
|
|
|
|
}
|
2001-08-01 17:08:07 +00:00
|
|
|
}
|
|
|
|
|
2000-05-15 18:39:17 +00:00
|
|
|
U_CFUNC int32_t
|
|
|
|
res_countArrayItems(const ResourceData *pResData, const Resource res) {
|
|
|
|
if(res!=RES_BOGUS) {
|
|
|
|
if(RES_GET_TYPE(res)==RES_STRING) {
|
|
|
|
return 1;
|
|
|
|
} else if(RES_GET_TYPE(res)==RES_ARRAY) {
|
|
|
|
Resource *p=RES_GET_POINTER(pResData->pRoot, res);
|
|
|
|
int32_t count=*(int32_t *)p;
|
|
|
|
return count;
|
|
|
|
} else if(RES_GET_TYPE(res)==RES_TABLE) {
|
|
|
|
return res_getTableSize(pResData, res);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
U_CFUNC Resource
|
|
|
|
res_getResource(const ResourceData *pResData, const char *key) {
|
|
|
|
return _res_findTableItem(pResData->pRoot, pResData->rootRes, key);
|
|
|
|
}
|
|
|
|
|
2001-08-17 22:14:17 +00:00
|
|
|
U_CFUNC Resource
|
|
|
|
res_getArrayItem(const ResourceData *pResData, const Resource array, const int32_t indexR) {
|
2000-05-15 18:39:17 +00:00
|
|
|
return _res_getArrayItem(pResData->pRoot, array, indexR);
|
|
|
|
}
|
|
|
|
|
2001-08-17 22:14:17 +00:00
|
|
|
U_CFUNC Resource
|
|
|
|
res_getTableItemByKey(const ResourceData *pResData, const Resource table, int32_t* indexR, const char* * key) {
|
2000-08-11 21:25:19 +00:00
|
|
|
uint16_t tempIndex;
|
2000-05-15 18:39:17 +00:00
|
|
|
if(key != NULL) {
|
2000-05-25 22:16:48 +00:00
|
|
|
tempIndex = _res_findTableIndex(pResData->pRoot, table, *key);
|
2000-08-11 21:25:19 +00:00
|
|
|
if(tempIndex != URESDATA_ITEM_NOT_FOUND) {
|
|
|
|
*key = _res_getTableKey(pResData->pRoot, table, tempIndex);
|
|
|
|
*indexR = tempIndex;
|
|
|
|
return _res_getTableItem(pResData->pRoot, table, tempIndex);
|
|
|
|
} else {
|
|
|
|
return RES_BOGUS;
|
|
|
|
}
|
2000-05-15 18:39:17 +00:00
|
|
|
} else {
|
|
|
|
return RES_BOGUS;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2001-08-17 22:14:17 +00:00
|
|
|
U_CFUNC Resource
|
|
|
|
res_getTableItemByIndex(const ResourceData *pResData, const Resource table, int32_t indexR, const char * * key) {
|
2000-05-15 18:39:17 +00:00
|
|
|
if(indexR>-1) {
|
|
|
|
if(key != NULL) {
|
|
|
|
*key = _res_getTableKey(pResData->pRoot, table, (uint16_t)indexR);
|
|
|
|
}
|
|
|
|
return _res_getTableItem(pResData->pRoot, table, (uint16_t)indexR);
|
|
|
|
} else {
|
|
|
|
return RES_BOGUS;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2001-08-17 22:14:17 +00:00
|
|
|
U_CFUNC int32_t
|
|
|
|
res_getTableSize(const ResourceData *pResData, Resource table) {
|
2000-05-15 18:39:17 +00:00
|
|
|
uint16_t *p=(uint16_t *)RES_GET_POINTER(pResData->pRoot, table);
|
|
|
|
return *p;
|
|
|
|
}
|
|
|
|
|