Lines Matching full:items
398 items=NULL;
429 if(items[idx].isDataOwned) {
430 free(items[idx].data);
434 uprv_free((void*)items);
547 fprintf(stderr, "icupkg: too many items, maximum is %d\n", itemMax);
574 memset(items, 0, itemCount*sizeof(Item));
577 * Get the common prefix of the items.
646 items[i].name=s+prefixLength;
649 items[i].data=(uint8_t *)inBytes+ds->readUInt32(inEntries[i].dataOffset);
651 items[i-1].length=(int32_t)(items[i].data-items[i-1].data);
654 typeEnum=getTypeEnumForInputData(items[i-1].data, items[i-1].length, &errorCode);
656 fprintf(stderr, "icupkg: not an ICU data file: item \"%s\" in \"%s\"\n", items[i-1].name, filename);
659 items[i-1].type=makeTypeLetter(typeEnum);
661 items[i].isDataOwned=FALSE;
664 items[itemCount-1].length=length-ds->readUInt32(inEntries[itemCount-1].dataOffset);
667 typeEnum=getTypeEnumForInputData(items[itemCount-1].data, items[itemCount-1].length, &errorCode);
669 fprintf(stderr, "icupkg: not an ICU data file: item \"%s\" in \"%s\"\n", items[i-1].name, filename);
672 items[itemCount-1].type=makeTypeLetter(typeEnum);
803 length=(int32_t)strlen(items[i].name);
806 memcpy(name+prefixLength, items[i].name, length+1);
807 items[i].name=name;
810 // calculate offsets for item names and items, pad to 16-align items
839 entry.nameOffset=(uint32_t)(basenameOffset+(items[i].name-outStrings));
854 length=items[i].length;
868 // write the items
869 for(pItem=items, i=0; i<itemCount; ++pItem, ++i) {
911 result=strncmp(name, items[i].name, length);
913 result=strcmp(name, items[i].name);
923 while(i>0 && 0==strncmp(name, items[i-1].name, length)) {
985 name=items[idx].name;
1015 items
1038 // move the following items down
1041 memmove(items+idx+1, items+idx, (itemCount-idx)*sizeof(Item));
1046 memset(items+idx, 0, sizeof(Item));
1049 items[idx].name=allocString(TRUE, strlen(name));
1050 strcpy(items[idx].name, name);
1051 pathToTree(items[idx].name);
1054 if(items[idx].isDataOwned) {
1055 free(items[idx].data);
1062 items[idx].data=data;
1063 items[idx].length=length;
1064 items[idx].isDataOwned=isDataOwned;
1065 items[idx].type=type;
1084 for(pItem=listPkg.items, i=0; i<listPkg.itemCount; ++pItem, ++i) {
1093 if(items[idx].isDataOwned) {
1094 free(items[idx].data);
1097 // move the following items up
1099 memmove(items+idx, items+idx+1, (itemCount-(idx+1))*sizeof(Item));
1124 for(pItem=listPkg.items, i=0; i<listPkg.itemCount; ++pItem, ++i) {
1142 pItem=items+idx;
1189 extractItem(filesPath, items[idx].name, idx, outType);
1207 for(pItem=listPkg.items, i=0; i<listPkg.itemCount; ++pItem, ++i) {
1220 return &items[idx];
1247 enumDependencies(items+i, context, check);
1280 uprv_sortArray(items, itemCount, (int32_t)sizeof(Item), compareItems, NULL, FALSE, &errorCode);
1292 Item *newItems = (Item*)uprv_malloc(max * sizeof(items[0]));
1293 Item *oldItems = items;
1295 fprintf(stderr, "icupkg: Out of memory trying to allocate %lu bytes for %d items\n",
1296 (unsigned long)max*sizeof(items[0]), max);
1299 if(items && itemCount>0) {
1300 uprv_memcpy(newItems, items, itemCount*sizeof(items[0]));
1303 items = newItems;
