Lines Matching refs:itemCount
393 itemCount=0;
425 for(idx=0; idx<itemCount; ++idx) {
500 /* check that the itemCount fits, then the ToC table, then at least the header of the last item */
503 /* itemCount does not fit */
506 itemCount=udata_readInt32(ds, *(const int32_t *)inBytes);
507 setItemCapacity(itemCount); /* resize so there's space */
508 if(itemCount==0) {
510 } else if(length<(4+8*itemCount)) {
515 offset=20+(int32_t)ds->readUInt32(inEntries[itemCount-1].dataOffset);
525 if(itemCount>0) {
530 if(itemCount>itemMax) {
536 stringsOffset=4+8*itemCount;
558 memset(items, 0, itemCount*sizeof(Item));
588 for(i=0; i<itemCount; ++i) {
616 items[itemCount-1].length=length-ds->readUInt32(inEntries[itemCount-1].dataOffset);
619 typeEnum=getTypeEnumForInputData(items[itemCount-1].data, items[itemCount-1].length, &errorCode);
624 items[itemCount-1].type=makeTypeLetter(typeEnum);
745 for(i=0; i<itemCount; ++i) {
755 basenameOffset=4+8*itemCount;
764 // first the itemCount
765 outInt32=itemCount;
781 for(i=0; i<itemCount; ++i) {
812 for(pItem=items, i=0; i<itemCount; ++pItem, ++i) {
850 limit=itemCount;
926 while(findNextIndex<itemCount) {
983 if(idx<itemCount) {
984 memmove(items+idx+1, items+idx, (itemCount-idx)*sizeof(Item));
986 ++itemCount;
1027 for(pItem=listPkg.items, i=0; i<listPkg.itemCount; ++pItem, ++i) {
1041 if((idx+1)<itemCount) {
1042 memmove(items+idx, items+idx+1, (itemCount-(idx+1))*sizeof(Item));
1044 --itemCount;
1067 for(pItem=listPkg.items, i=0; i<listPkg.itemCount; ++pItem, ++i) {
1082 if(idx<0 || itemCount<=idx) {
1150 for(pItem=listPkg.items, i=0; i<listPkg.itemCount; ++pItem, ++i) {
1157 return itemCount;
1162 if (0 <= idx && idx < itemCount) {
1189 for(i=0; i<itemCount; ++i) {
1223 uprv_sortArray(items, itemCount, (int32_t)sizeof(Item), compareItems, NULL, FALSE, &errorCode);
1241 if(items && itemCount>0) {
1242 uprv_memcpy(newItems, items, itemCount*sizeof(items[0]));
1251 if((itemCount+1)>itemMax) {
1252 setItemCapacity(itemCount+kItemsChunk);
