static struct annoRow *asdNextRow(struct annoStreamer *vSelf, char *minChrom, uint minEnd,
struct lm *callerLm)
/* Perform sql query if we haven't already and return a single
* annoRow, or NULL if there are no more items. */
{
struct annoStreamDb *self = (struct annoStreamDb *)vSelf;
if (self->needQuery)
self->doQuery(self, minChrom, minEnd);
if (self->mergeBins)
{
struct annoRow *aRow = nextRowMergeBins(self, minChrom, minEnd, callerLm);
if (aRow == NULL && self->needQuery && !self->eof)
// Recurse: query, then get next merged/filtered row:
return asdNextRow(vSelf, minChrom, minEnd, callerLm);
else
return aRow;
}
boolean rightFail = FALSE;
char **row = nextRowFiltered(self, &rightFail, minChrom, minEnd);
if (row == NULL)
{
if (self->needQuery && !self->eof)
// Recurse: query, then get next merged/filtered row:
return asdNextRow(vSelf, minChrom, minEnd, callerLm);
else
return NULL;
}
return rowToAnnoRow(self, row, rightFail, callerLm);
}
static struct annoRow *nextRowMergeBins(struct annoStreamDb *self, char *minChrom, uint minEnd,
struct lm *callerLm)
/* Fetch the next filtered row from mysql, merge-sorting coarse-bin items into finest-bin
* items to maintain chromStart ordering. */
{
assert(self->mergeBins && self->hasBin);
if (self->smallItemQueue)
// In this case we have already begun merge-sorting; don't pull a new row from mysql,
// use the queues. This should keep smallItemQueue's max depth at 1.
return nextQueuedRow(self, callerLm);
else
{
// We might need to collect initial coarse-bin items, or might already be merge-sorting.
boolean rightFail = FALSE;
char **row = nextRowFiltered(self, &rightFail, minChrom, minEnd);
if (row && !self->gotFinestBin)
{
// We are just starting -- queue up coarse-bin items, if any, until we get the first
// finest-bin item.
row = getFinestBinItem(self, row, &rightFail, minChrom, minEnd);
}
// Time to merge-sort finest-bin items from mysql with coarse-bin items from queue.
if (row != NULL)
{
struct annoRow *aRow = rowToAnnoRow(self, row, rightFail, self->qLm);
return mergeRow(self, aRow, callerLm);
}
else
{
struct annoRow *qRow = slPopHead(&(self->bigItemQueue));
enum annoRowType rowType = self->streamer.rowType;
int numCols = self->streamer.numCols;
return annoRowClone(qRow, rowType, numCols, callerLm);
}
}
}