long rc[] = new long[nrClusters];
int i; int entryIndex = -1;  for (i = lastFreeCluster; i < entries.length; i++) { if (isFreeCluster(entries[i])) { entryIndex=i; break; } } if(entryIndex<0){ for(i = 2; i < lastFreeCluster;i++){ if (isFreeCluster(entries[i])) { entryIndex=i; break; } } } if(entryIndex < 0){ throw new IOException("FAT Full (" + entries.length + ", " + i + ")"); } entries[entryIndex] = eofMarker; lastFreeCluster = entryIndex+1; this.dirty      = true;
	public synchronized long[] allocNew(int nrClusters) throws IOException {		long rc[] = new long[nrClusters];		rc[0] = allocNew();		for (int i = 1; i < nrClusters; i++) {			rc[i] = allocAppend(rc[i - 1]);		}		return rc;	}