Lines Matching refs:itemCount
396 itemCount=0;
428 for(idx=0; idx<itemCount; ++idx) {
512 /* check that the itemCount fits, then the ToC table, then at least the header of the last item */
515 /* itemCount does not fit */
518 itemCount=udata_readInt32(ds, *(const int32_t *)inBytes);
519 setItemCapacity(itemCount); /* resize so there's space */
520 if(itemCount==0) {
522 } else if(length<(4+8*itemCount)) {
527 offset=20+(int32_t)ds->readUInt32(inEntries[itemCount-1].dataOffset);
537 if(itemCount<=0) {
546 if(itemCount>itemMax) {
552 int32_t stringsOffset=4+8*itemCount;
574 memset(items, 0, itemCount*sizeof(Item));
636 for(i=0; i<itemCount; ++i) {
664 items[itemCount-1].length=length-ds->readUInt32(inEntries[itemCount-1].dataOffset);
667 typeEnum=getTypeEnumForInputData(items[itemCount-1].data, items[itemCount-1].length, &errorCode);
672 items[itemCount-1].type=makeTypeLetter(typeEnum);
802 for(i=0; i<itemCount; ++i) {
812 basenameOffset=4+8*itemCount;
821 // first the itemCount
822 outInt32=itemCount;
838 for(i=0; i<itemCount; ++i) {
869 for(pItem=items, i=0; i<itemCount; ++pItem, ++i) {
907 limit=itemCount;
983 while(findNextIndex<itemCount) {
1040 if(idx<itemCount) {
1041 memmove(items+idx+1, items+idx, (itemCount-idx)*sizeof(Item));
1043 ++itemCount;
1084 for(pItem=listPkg.items, i=0; i<listPkg.itemCount; ++pItem, ++i) {
1098 if((idx+1)<itemCount) {
1099 memmove(items+idx, items+idx+1, (itemCount-(idx+1))*sizeof(Item));
1101 --itemCount;
1124 for(pItem=listPkg.items, i=0; i<listPkg.itemCount; ++pItem, ++i) {
1139 if(idx<0 || itemCount<=idx) {
1207 for(pItem=listPkg.items, i=0; i<listPkg.itemCount; ++pItem, ++i) {
1214 return itemCount;
1219 if (0 <= idx && idx < itemCount) {
1246 for(i=0; i<itemCount; ++i) {
1280 uprv_sortArray(items, itemCount, (int32_t)sizeof(Item), compareItems, NULL, FALSE, &errorCode);
1299 if(items && itemCount>0) {
1300 uprv_memcpy(newItems, items, itemCount*sizeof(items[0]));
1309 if((itemCount+1)>itemMax) {
1310 setItemCapacity(itemCount+kItemsChunk);
