comparison audioDB.cpp @ 224:3a81da6fb1d7

Fixes from refactoring branch:

* make O2_MAXFILES twice as big (for KSA_CHARM 1s features);
* read data even when track shorter than sequence.

       }
     }
 
     trackIndexOffset=trackOffset/dbH->dim; // numVectors offset
 
+    if (trackTable[track] * sizeof(double) * dbH->dim > data_buffer_size) {
+      if(data_buffer) {
+	free(data_buffer);
+      }
+      { 
+	data_buffer_size = trackTable[track] * sizeof(double) * dbH->dim;
+	void *tmp = malloc(data_buffer_size);
+	if (tmp == NULL) {
+	  error("error allocating data buffer");
+	}
+	data_buffer = (double *) tmp;
+      }
+    }
+    
+    read(dbfid, data_buffer, trackTable[track] * sizeof(double) * dbH->dim);
+
     if(sequenceLength<=trackTable[track]){  // test for short sequences
       
       if(verbosity>7) {
 	cerr << track << "." << trackIndexOffset << "." << trackTable[track] << " | ";cerr.flush();
       }

       // Matched filter matrix
       for(j=0; j<numVectors;j++){
 	DD[j]=new double[trackTable[track]];
 	assert(DD[j]);
       }
-
-      if (trackTable[track] * sizeof(double) * dbH->dim > data_buffer_size) {
-	if(data_buffer) {
-	  free(data_buffer);
-	}
-	{ 
-	  data_buffer_size = trackTable[track] * sizeof(double) * dbH->dim;
-	  void *tmp = malloc(data_buffer_size);
-	  if (tmp == NULL) {
-	    error("error allocating data buffer");
-	  }
-	  data_buffer = (double *) tmp;
-	}
-      }
-
-      read(dbfid, data_buffer, trackTable[track] * sizeof(double) * dbH->dim);
 
       // Dot product
       for(j=0; j<numVectors; j++)
 	for(k=0; k<trackTable[track]; k++){
 	  qp=query+j*dbH->dim;

       }
     }
 
     trackIndexOffset=trackOffset/dbH->dim; // numVectors offset
 
+    if (trackTable[track] * sizeof(double) * dbH->dim > data_buffer_size) {
+      if(data_buffer) {
+	free(data_buffer);
+      }
+      { 
+	data_buffer_size = trackTable[track] * sizeof(double) * dbH->dim;
+	void *tmp = malloc(data_buffer_size);
+	if (tmp == NULL) {
+	  error("error allocating data buffer");
+	}
+	data_buffer = (double *) tmp;
+      }
+    }
+    
+    read(dbfid, data_buffer, trackTable[track] * sizeof(double) * dbH->dim);
+
     if(sequenceLength<=trackTable[track]){  // test for short sequences
       
       if(verbosity>7) {
 	cerr << track << "." << trackIndexOffset << "." << trackTable[track] << " | ";cerr.flush();
       }

       // Matched filter matrix
       for(j=0; j<numVectors;j++){
 	DD[j]=new double[trackTable[track]];
 	assert(DD[j]);
       }
-
-      if (trackTable[track] * sizeof(double) * dbH->dim > data_buffer_size) {
-	if(data_buffer) {
-	  free(data_buffer);
-	}
-	{ 
-	  data_buffer_size = trackTable[track] * sizeof(double) * dbH->dim;
-	  void *tmp = malloc(data_buffer_size);
-	  if (tmp == NULL) {
-	    error("error allocating data buffer");
-	  }
-	  data_buffer = (double *) tmp;
-	}
-      }
-
-      read(dbfid, data_buffer, trackTable[track] * sizeof(double) * dbH->dim);
 
       // Dot product
       for(j=0; j<numVectors; j++)
 	for(k=0; k<trackTable[track]; k++){
 	  qp=query+j*dbH->dim;