void encode_stepsize(int stepsize, int numbps, int *expn, int *mant)
{
int p, n;
p = floorlog2(stepsize) - 13;
n = 11 - floorlog2(stepsize);
*mant = (n < 0 ? stepsize >> -n : stepsize << n) & 0x7ff;
*expn = numbps - p;
}
int main (int argc, char * argv[]) {
char * linha, * palavra;
FILE * f = fopen (argv[1], "r");
int n, aux = 1, tamanho, altura;
arvore dic = NULL;
while (linha = lerLinha (f), linha != NULL) {
n = 0;
while (palavra = pegarPalavra (linha, &n), palavra != NULL) {
if (strlen (palavra) > 2 && isalpha (palavra[0]))
dic = inserenoh (dic, palavra, aux);
free (palavra);
}
free (linha);
aux++;
}
altura = alturaarvore (dic);
tamanho = tamanhoarvore (dic);
printf ("%d %d %d %f\n", tamanho, floorlog2 (tamanho), altura, (double) clock () / CLOCKS_PER_SEC);
imprimearvore (dic, fopen (argv[2], "w"));
destroiarvore (dic);
return 0;
}
int decide(__be16 port)
{
struct tcp_snoop *t;
struct tcp_snoop *temp;
int entropy_value = 0;
int c; /* calibrator */
int decision = 0;
int port_search_count=0;
total_seg++;
/* calibrator value determination */
for(c = 10; c <= (total_seg/10); c *= 10)
if((total_seg % c) >= 0)
continue;
if(snoop_ptr == NULL)
{
t = kmalloc(sizeof(struct tcp_snoop), GFP_KERNEL);
t->dest_port = port;
t->count = 1;
t->entropy = (((t->count * c)/ total_seg) * (floorlog2((t->count * c) / total_seg)));
entropy_value = t->entropy;
t->link = NULL;
snoop_ptr = t;
}
else
{
t = snoop_ptr;
while(1)
{
if(t->dest_port == port)
{
t->count++;
t->entropy = (((t->count * c)/ total_seg) * (floorlog2((t->count * c) / total_seg)));
entropy_value = t->entropy;
break;
}
else
port_search_count++;
if(t->link != NULL)
t = t->link;
else
break;
}
if(t->link == NULL && port_search_count > 0)
{
temp = kmalloc(sizeof(struct tcp_snoop), GFP_KERNEL);
temp->dest_port = port;
temp->count = 1;
temp->entropy = (((temp->count * c)/ total_seg) * (floorlog2((temp->count * c) / total_seg)));
entropy_value = temp->entropy;
temp->link = NULL;
t->link = temp;
}
}
if(entropy_value >= 4)
decision = 0; /* DROP */
else
decision = 1; /* OK */
return decision;
}
uint8 I8272_Write(const uint32 Addr, uint8 cData)
{
I8272_DRIVE_INFO *pDrive;
uint32 flags = 0;
uint32 readlen;
uint8 disk_read = 0;
int32 i;
pDrive = &i8272_info->drive[i8272_info->sel_drive];
if(pDrive->uptr == NULL) {
return 0xFF;
}
switch(Addr & 0x3) {
case I8272_FDC_MSR:
sim_debug(WR_DATA_MSG, &i8272_dev, "I8272: " ADDRESS_FORMAT
" WR Drive Select Reg=%02x\n", PCX, cData);
break;
case I8272_FDC_DATA:
i8272_info->fdc_msr &= 0xF0;
sim_debug(VERBOSE_MSG, &i8272_dev, "I8272: " ADDRESS_FORMAT
" WR Data, phase=%d, index=%d\n",
PCX, i8272_info->fdc_phase, i8272_info->cmd_index);
if(i8272_info->fdc_phase == CMD_PHASE) {
i8272_info->cmd[i8272_info->cmd_index] = cData;
if(i8272_info->cmd_index == 0) {
sim_debug(CMD_MSG, &i8272_dev, "I8272: " ADDRESS_FORMAT
" CMD=0x%02x[%s]\n", PCX, cData & 0x1F, messages[cData & 0x1F]);
I8272_Setup_Cmd(cData & 0x1F);
}
i8272_info->cmd_index ++;
if(i8272_info->cmd_len == i8272_info->cmd_index) {
i8272_info->cmd_index = 0;
i8272_info->fdc_phase = EXEC_PHASE;
}
}
if(i8272_info->fdc_phase == EXEC_PHASE) {
switch(i8272_info->cmd[0] & 0x1F) {
case I8272_READ_DATA:
case I8272_WRITE_DATA:
case I8272_READ_DELETED_DATA:
case I8272_WRITE_DELETED_DATA:
case I8272_READ_TRACK:
case I8272_SCAN_LOW_EQUAL:
case I8272_SCAN_HIGH_EQUAL:
case I8272_SCAN_EQUAL:
i8272_info->fdc_mt = (i8272_info->cmd[0] & 0x80) >> 7;
i8272_info->fdc_mfm = (i8272_info->cmd[0] & 0x40) >> 6;
i8272_info->fdc_sk = (i8272_info->cmd[0] & 0x20) >> 5;
i8272_info->fdc_hds = (i8272_info->cmd[1] & 0x04) >> 2;
i8272_info->sel_drive = (i8272_info->cmd[1] & 0x03);
pDrive = &i8272_info->drive[i8272_info->sel_drive];
if(pDrive->uptr == NULL) {
return 0xFF;
}
if(pDrive->track != i8272_info->cmd[2]) {
i8272_info->fdc_seek_end = 1;
} else {
i8272_info->fdc_seek_end = 0;
}
if(pDrive->track != i8272_info->cmd[2]) {
sim_debug(CMD_MSG, &i8272_dev, "I8272: " ADDRESS_FORMAT
" ERROR: CMD=0x%02x[%s]: Drive: %d, Command wants track %d, "
"but positioner is on track %d.\n",
PCX, i8272_info->cmd[0] & 0x1F,
messages[i8272_info->cmd[0] & 0x1F],
i8272_info->sel_drive, i8272_info->cmd[2], pDrive->track);
}
pDrive->track = i8272_info->cmd[2];
i8272_info->fdc_head = i8272_info->cmd[3] & 1; /* AGN mask to head 0 or 1 */
i8272_info->fdc_sector = i8272_info->cmd[4];
i8272_info->fdc_sec_len = i8272_info->cmd[5];
if(i8272_info->fdc_sec_len > I8272_MAX_N) {
sim_debug(ERROR_MSG, &i8272_dev, "I8272: " ADDRESS_FORMAT
" Illegal sector size %d [N=%d]. Reset to %d [N=%d].\n",
PCX, 128 << i8272_info->fdc_sec_len,
i8272_info->fdc_sec_len, 128 << I8272_MAX_N, I8272_MAX_N);
i8272_info->fdc_sec_len = I8272_MAX_N;
}
i8272_info->fdc_eot = i8272_info->cmd[6];
i8272_info->fdc_gpl = i8272_info->cmd[7];
i8272_info->fdc_dtl = i8272_info->cmd[8];
sim_debug(CMD_MSG, &i8272_dev, "I8272: " ADDRESS_FORMAT
" CMD=0x%02x[%s]: Drive: %d, %s %s, C=%d. H=%d. S=%d, N=%d, "
"EOT=%02x, GPL=%02x, DTL=%02x\n", PCX,
i8272_info->cmd[0] & 0x1F,
messages[i8272_info->cmd[0] & 0x1F],
i8272_info->sel_drive,
i8272_info->fdc_mt ? "Multi" : "Single",
i8272_info->fdc_mfm ? "MFM" : "FM",
pDrive->track,
i8272_info->fdc_head,
i8272_info->fdc_sector,
i8272_info->fdc_sec_len,
i8272_info->fdc_eot,
i8272_info->fdc_gpl,
i8272_info->fdc_dtl);
i8272_info->fdc_status[0] = (i8272_info->fdc_hds & 1) << 2;
i8272_info->fdc_status[0] |= (i8272_info->sel_drive & 0x03);
i8272_info->fdc_status[0] |= 0x40;
i8272_info->fdc_status[1] = 0;
i8272_info->fdc_status[2] = 0;
i8272_info->result[0] = i8272_info->fdc_status[0];
i8272_info->result[1] = i8272_info->fdc_status[1];
i8272_info->result[2] = i8272_info->fdc_status[2];
i8272_info->result[3] = pDrive->imd->track[pDrive->track][i8272_info->fdc_head].logicalCyl[i8272_info->fdc_sector]; /* AGN logicalCyl */
i8272_info->result[4] = pDrive->imd->track[pDrive->track][i8272_info->fdc_head].logicalHead[i8272_info->fdc_sector]; /* AGN logicalHead */
i8272_info->result[5] = i8272_info->fdc_sector;
i8272_info->result[6] = i8272_info->fdc_sec_len;
break;
case I8272_READ_ID: /* READ ID */
i8272_info->fdc_mfm = (i8272_info->cmd[0] & 0x40) >> 6;
i8272_info->fdc_hds = (i8272_info->cmd[1] & 0x04) >> 2;
i8272_info->sel_drive = (i8272_info->cmd[1] & 0x03);
pDrive = &i8272_info->drive[i8272_info->sel_drive];
if(pDrive->uptr == NULL) {
return 0xFF;
}
/* Compute the i8272 "N" value from the sectorsize of this */
/* disk's current track - i.e. N = log2(sectsize) - log2(128) */
/* The calculation also works for non-standard format disk images with */
/* sectorsizes of 2048, 4096 and 8192 bytes */
i8272_info->fdc_sec_len = floorlog2(
pDrive->imd->track[pDrive->track][i8272_info->fdc_hds].sectsize) - 7; /* AGN fix to use fdc_hds (was fdc_head)*/
/* For now always return the starting sector number */
/* but could return (say) a valid sector number based */
/* on elapsed time for a more "realistic" simulation. */
/* This would allow disk analysis programs that use */
/* READID to detect non-standard disk formats. */
i8272_info->fdc_sector = pDrive->imd->track[pDrive->track][i8272_info->fdc_hds].start_sector;
if((i8272_info->fdc_sec_len == 0xF8) || (i8272_info->fdc_sec_len > I8272_MAX_N)) { /* Error calculating N or N too large */
sim_debug(ERROR_MSG, &i8272_dev, "I8272: " ADDRESS_FORMAT
" Illegal sector size N=%d. Reset to 0.\n",
PCX, i8272_info->fdc_sec_len);
i8272_info->fdc_sec_len = 0;
return 0xFF;
}
i8272_info->fdc_status[0] = (i8272_info->fdc_hds & 1) << 2;
i8272_info->fdc_status[0] |= (i8272_info->sel_drive & 0x03);
i8272_info->fdc_status[1] = 0;
i8272_info->fdc_status[2] = 0;
i8272_info->result[0] = i8272_info->fdc_status[0];
i8272_info->result[1] = i8272_info->fdc_status[1];
i8272_info->result[2] = i8272_info->fdc_status[2];
i8272_info->result[3] = pDrive->imd->track[pDrive->track][i8272_info->fdc_hds].logicalCyl[i8272_info->fdc_sector]; /* AGN logicalCyl */
i8272_info->result[4] = pDrive->imd->track[pDrive->track][i8272_info->fdc_hds].logicalHead[i8272_info->fdc_sector]; /* AGN logicalHead */
i8272_info->result[5] = i8272_info->fdc_sector;
i8272_info->result[6] = i8272_info->fdc_sec_len;
break;
case I8272_RECALIBRATE: /* RECALIBRATE */
i8272_info->sel_drive = i8272_info->cmd[1] & 0x03;
pDrive = &i8272_info->drive[i8272_info->sel_drive];
if(pDrive->uptr == NULL) {
return 0xFF;
}
pDrive->track = 0;
i8272_info->fdc_phase = CMD_PHASE; /* No result phase */
i8272_info->fdc_seek_end = 1;
sim_debug(SEEK_MSG, &i8272_dev, "I8272: " ADDRESS_FORMAT
" Recalibrate: Drive 0x%02x\n",
PCX, i8272_info->sel_drive);
break;
case I8272_FORMAT_TRACK: /* FORMAT A TRACK */
i8272_info->fdc_mfm = (i8272_info->cmd[0] & 0x40) >> 6;
i8272_info->fdc_hds = (i8272_info->cmd[1] & 0x04) >> 2;
i8272_info->fdc_head = i8272_info->fdc_hds;
i8272_info->sel_drive = (i8272_info->cmd[1] & 0x03);
pDrive = &i8272_info->drive[i8272_info->sel_drive];
if(pDrive->uptr == NULL) {
return 0xFF;
}
if(pDrive->track != i8272_info->cmd[2]) {
i8272_info->fdc_seek_end = 1;
} else {
i8272_info->fdc_seek_end = 0;
}
i8272_info->fdc_sec_len = i8272_info->cmd[2];
if(i8272_info->fdc_sec_len > I8272_MAX_N) {
sim_debug(ERROR_MSG, &i8272_dev, "I8272: " ADDRESS_FORMAT
" Illegal sector size %d [N=%d]. Reset to %d [N=%d].\n",
PCX, 128 << i8272_info->fdc_sec_len,
i8272_info->fdc_sec_len, 128 << I8272_MAX_N, I8272_MAX_N);
i8272_info->fdc_sec_len = I8272_MAX_N;
}
i8272_info->fdc_sc = i8272_info->cmd[3];
i8272_info->fdc_gpl = i8272_info->cmd[4];
i8272_info->fdc_fillbyte = i8272_info->cmd[5];
sim_debug(FMT_MSG, &i8272_dev, "I8272: " ADDRESS_FORMAT
" Format Drive: %d, %s, C=%d. H=%d. N=%d, SC=%d, GPL=%02x, FILL=%02x\n",
PCX,
i8272_info->sel_drive,
i8272_info->fdc_mfm ? "MFM" : "FM",
pDrive->track,
i8272_info->fdc_head,
i8272_info->fdc_sec_len,
i8272_info->fdc_sc,
i8272_info->fdc_gpl,
i8272_info->fdc_fillbyte);
i8272_info->fdc_status[0] = (i8272_info->fdc_hds & 1) << 2;
i8272_info->fdc_status[0] |= (i8272_info->sel_drive & 0x03);
i8272_info->fdc_status[1] = 0;
i8272_info->fdc_status[2] = 0;
i8272_info->fdc_sectorcount = 0;
i8272_info->result[0] = i8272_info->fdc_status[0];
i8272_info->result[1] = i8272_info->fdc_status[1];
i8272_info->result[2] = i8272_info->fdc_status[2];
i8272_info->result[3] = pDrive->track;
i8272_info->result[4] = i8272_info->fdc_head; /* AGN for now we cannot format with logicalHead */
i8272_info->result[5] = i8272_info->fdc_sector; /* AGN ditto for logicalCyl */
i8272_info->result[6] = i8272_info->fdc_sec_len;
break;
case I8272_SENSE_INTR_STATUS: /* SENSE INTERRUPT STATUS */
sim_debug(CMD_MSG, &i8272_dev, "I8272: " ADDRESS_FORMAT
" Sense Interrupt Status\n", PCX);
i8272_info->result[0] = i8272_info->fdc_seek_end ? 0x20 : 0x00; /* SEEK_END */
i8272_info->result[0] |= i8272_info->sel_drive;
i8272_info->result[1] = pDrive->track;
i8272_irq = 0;
break;
case I8272_SPECIFY: /* SPECIFY */
i8272_info->fdc_srt = 16 - ((i8272_info->cmd[1] & 0xF0) >> 4);
i8272_info->fdc_hut = (i8272_info->cmd[1] & 0x0F) * 16;
i8272_info->fdc_hlt = ((i8272_info->cmd[2] & 0xFE) >> 1) * 2;
i8272_info->fdc_nd = (i8272_info->cmd[2] & 0x01);
i8272_info->fdc_phase = CMD_PHASE; /* No result phase */
sim_debug(CMD_MSG, &i8272_dev, "I8272: " ADDRESS_FORMAT
" Specify: SRT=%d, HUT=%d, HLT=%d, ND=%s\n",
PCX, i8272_info->fdc_srt,
i8272_info->fdc_hut,
i8272_info->fdc_hlt,
i8272_info->fdc_nd ? "NON-DMA" : "DMA");
break;
case I8272_SENSE_DRIVE_STATUS: /* Setup Status3 Byte */
i8272_info->fdc_hds = (i8272_info->cmd[1] & 0x04) >> 2;
i8272_info->sel_drive = (i8272_info->cmd[1] & 0x03);
pDrive = &i8272_info->drive[i8272_info->sel_drive];
if(pDrive->uptr == NULL) {
return 0xFF;
}
i8272_info->result[0] = (pDrive->ready) ? DRIVE_STATUS_READY : 0; /* Drive Ready */
if(imdGetSides(pDrive->imd) == 2) {
i8272_info->result[0] |= DRIVE_STATUS_TWO_SIDED; /* Two-sided? */
}
if(imdIsWriteLocked(pDrive->imd)) {
i8272_info->result[0] |= DRIVE_STATUS_WP; /* Write Protected? */
}
i8272_info->result[0] |= (i8272_info->fdc_hds & 1) << 2;
i8272_info->result[0] |= (i8272_info->sel_drive & 0x03);
i8272_info->result[0] |= (pDrive->track == 0) ? DRIVE_STATUS_TRACK0 : 0x00; /* Track 0 */
sim_debug(CMD_MSG, &i8272_dev, "I8272: " ADDRESS_FORMAT
" Sense Drive Status = 0x%02x\n", PCX, i8272_info->result[0]);
break;
case I8272_SEEK: /* SEEK */
i8272_info->fdc_mt = (i8272_info->cmd[0] & 0x80) >> 7;
i8272_info->fdc_mfm = (i8272_info->cmd[0] & 0x40) >> 6;
i8272_info->fdc_sk = (i8272_info->cmd[0] & 0x20) >> 5;
i8272_info->fdc_hds = (i8272_info->cmd[1] & 0x04) >> 2;
i8272_info->sel_drive = (i8272_info->cmd[1] & 0x03);
pDrive = &i8272_info->drive[i8272_info->sel_drive];
if(pDrive->uptr == NULL) {
return 0xFF;
}
pDrive->track = i8272_info->cmd[2];
i8272_info->fdc_head = i8272_info->fdc_hds; /*AGN seek should save the head */
i8272_info->fdc_seek_end = 1;
sim_debug(SEEK_MSG, &i8272_dev, "I8272: " ADDRESS_FORMAT
" Seek Drive: %d, %s %s, C=%d. Skip Deleted Data=%s Head Select=%s\n",
PCX,
i8272_info->sel_drive,
i8272_info->fdc_mt ? "Multi" : "Single",
i8272_info->fdc_mfm ? "MFM" : "FM",
i8272_info->cmd[2],
i8272_info->fdc_sk ? "True" : "False",
i8272_info->fdc_hds ? "True" : "False");
break;
default: /* INVALID */
break;
}
if(i8272_info->fdc_phase == EXEC_PHASE) {
switch(i8272_info->cmd[0] & 0x1F) {
case I8272_READ_TRACK:
printf("I8272: " ADDRESS_FORMAT " Read a track (untested.)" NLP, PCX);
i8272_info->fdc_sector = 1; /* Read entire track from sector 1...eot */
case I8272_READ_DATA:
case I8272_READ_DELETED_DATA:
disk_read = 1;
case I8272_WRITE_DATA:
case I8272_WRITE_DELETED_DATA:
for(;i8272_info->fdc_sector<=i8272_info->fdc_eot;i8272_info->fdc_sector++) {
sim_debug(RD_DATA_MSG, &i8272_dev, "I8272: " ADDRESS_FORMAT
" %s Data, sector: %d sector len=%d\n",
PCX, disk_read ? "RD" : "WR",
i8272_info->fdc_sector,
128 << i8272_info->fdc_sec_len);
if(pDrive->imd == NULL) {
printf(".imd is NULL!" NLP);
}
if(disk_read) { /* Read sector */
sectRead(pDrive->imd,
pDrive->track,
i8272_info->fdc_head,
i8272_info->fdc_sector,
sdata.raw,
128 << i8272_info->fdc_sec_len,
&flags,
&readlen);
for(i=0;i<(128 << i8272_info->fdc_sec_len);i++) {
PutByteDMA(i8272_info->fdc_dma_addr, sdata.raw[i]);
i8272_info->fdc_dma_addr++;
}
sim_debug(RD_DATA_MSG, &i8272_dev, "I8272: " ADDRESS_FORMAT
" T:%d/H:%d/S:%d/L:%4d: Data transferred to RAM at 0x%06x\n",
PCX, pDrive->track,
i8272_info->fdc_head,
i8272_info->fdc_sector,
128 << i8272_info->fdc_sec_len,
i8272_info->fdc_dma_addr - i);
} else { /* Write */
for(i=0;i<(128 << i8272_info->fdc_sec_len);i++) {
sdata.raw[i] = GetByteDMA(i8272_info->fdc_dma_addr);
i8272_info->fdc_dma_addr++;
}
sim_debug(WR_DATA_MSG, &i8272_dev, "I8272: " ADDRESS_FORMAT
" Data transferred from RAM at 0x%06x\n",
PCX, i8272_info->fdc_dma_addr);
sectWrite(pDrive->imd,
pDrive->track,
i8272_info->fdc_head,
i8272_info->fdc_sector,
sdata.raw,
128 << i8272_info->fdc_sec_len,
&flags,
&readlen);
}
i8272_info->result[5] = i8272_info->fdc_sector;
i8272_info->result[1] = 0x80;
}
break;
case I8272_FORMAT_TRACK: /* FORMAT A TRACK */
for(i8272_info->fdc_sector = 1;i8272_info->fdc_sector<=i8272_info->fdc_sc;i8272_info->fdc_sector++) {
sim_debug(CMD_MSG, &i8272_dev, "I8272: " ADDRESS_FORMAT
" Format Track %d, Sector=%d, len=%d\n", PCX, pDrive->track, i8272_info->fdc_sector, 128 << i8272_info->fdc_sec_len);
if(i8272_info->fdc_sectorcount >= I8272_MAX_SECTOR) {
sim_debug(ERROR_MSG, &i8272_dev, "I8272: " ADDRESS_FORMAT
" Illegal sector count\n", PCX);
i8272_info->fdc_sectorcount = 0;
}
i8272_info->fdc_sectormap[i8272_info->fdc_sectorcount] = i8272_info->fdc_sector;
i8272_info->fdc_sectorcount++;
if(i8272_info->fdc_sectorcount == i8272_info->fdc_sc) {
trackWrite(pDrive->imd,
pDrive->track,
i8272_info->fdc_head,
i8272_info->fdc_sc,
128 << i8272_info->fdc_sec_len,
i8272_info->fdc_sectormap,
i8272_info->fdc_mfm ? 3 : 0,
i8272_info->fdc_fillbyte,
&flags);
/* Recalculate disk size */
pDrive->uptr->capac = sim_fsize(pDrive->uptr->fileref);
}
}
break;
case I8272_SCAN_LOW_EQUAL: /* SCAN LOW OR EQUAL */
case I8272_SCAN_HIGH_EQUAL: /* SCAN HIGH OR EQUAL */
case I8272_SCAN_EQUAL: /* SCAN EQUAL */
sim_debug(CMD_MSG, &i8272_dev, "I8272: " ADDRESS_FORMAT
" Scan Data\n", PCX);
sim_debug(ERROR_MSG, &i8272_dev, "I8272: " ADDRESS_FORMAT
" ERROR: Scan not implemented.\n", PCX);
break;
case I8272_READ_ID: /* READ ID */
sim_debug(CMD_MSG, &i8272_dev, "I8272: " ADDRESS_FORMAT
" READ ID Drive %d result ST0=%02x ST1=%02x ST2=%02x "
"C=%d H=%d R=%02x N=%d\n", PCX,
i8272_info->sel_drive,
i8272_info->result[0], i8272_info->result[1],
i8272_info->result[2], i8272_info->result[3],
i8272_info->result[4], i8272_info->result[5],
i8272_info->result[6]);
break;
default:
break;
}
}
if(i8272_info->result_len != 0) {
i8272_info->fdc_phase ++;
} else {
i8272_info->fdc_phase = CMD_PHASE;
}
i8272_info->result_index = 0;
if((i8272_info->cmd[0] & 0x1F) != I8272_SENSE_INTR_STATUS) {
raise_i8272_interrupt();
}
}
break;
}
cData = 0x00;
return (cData);
}
Iterator query(Iterator range_begin, Iterator range_end) {
// find superblocks fully contained within range
index_t begin_idx = std::distance(_begin, range_begin);
index_t end_idx = std::distance(_begin, range_end);
assert(begin_idx < end_idx);
assert(end_idx <= n);
// round up to next superblock
index_t left_sb = (begin_idx - 1) / superblock_size + 1;
if (begin_idx == 0)
left_sb = 0;
// round down to prev superblock
index_t right_sb = end_idx / superblock_size;
// init result
Iterator min_pos = range_begin;
// if there is at least one superblock
if (left_sb < right_sb) {
// get largest power of two that doesn't exceed the number of
// superblocks from (left,right)
index_t n_sb = right_sb - left_sb;
unsigned int dist = floorlog2(n_sb);
assert(dist < superblock_mins.size() && left_sb < superblock_mins[dist].size());
min_pos = _begin + superblock_mins[dist][left_sb];
assert(dist < superblock_mins.size() && right_sb - (1<<dist) < superblock_mins[dist].size());
Iterator right_sb_min = _begin + superblock_mins[dist][right_sb - (1 << dist)];
if (*min_pos > *right_sb_min) {
min_pos = right_sb_min;
}
}
// go to left -> blocks -> sub-block
if (left_sb <= right_sb && left_sb != 0 && begin_idx != left_sb*superblock_size) {
index_t left_b = (begin_idx - 1) / block_size + 1;
index_t left_b_gidx = left_b * block_size;
left_b -= (left_sb - 1)*n_blocks_per_superblock;
index_t n_b = n_blocks_per_superblock - left_b;
if (n_b > 0) {
unsigned int level = ceillog2(n_b);
index_t sb_offset = (left_sb-1)*(n_blocks_per_superblock - (1<<level)/2);
Iterator block_min_it = _begin + block_mins[level][left_b + sb_offset] + (left_sb-1)*superblock_size;
if (*block_min_it < *min_pos)
min_pos = block_min_it;
}
// go left into remaining block, if elements left
if (left_b_gidx > begin_idx) {
// linearly search (at most block_size elements)
Iterator inblock_min_it = std::min_element(range_begin, _begin + left_b_gidx);
if (*inblock_min_it < *min_pos) {
min_pos = inblock_min_it;
}
}
}
// go to right -> blocks -> sub-block
if (left_sb <= right_sb && right_sb != n_superblocks && end_idx != right_sb*superblock_size) {
index_t left_b = right_sb*n_blocks_per_superblock;
index_t right_b = end_idx / block_size;
index_t n_b = right_b - left_b;
if (n_b > 0) {
unsigned int dist = floorlog2(n_b);
index_t sb_offset = right_sb*((1<<dist)/2);
Iterator block_min_it = _begin + block_mins[dist][left_b - sb_offset] + (right_sb)*superblock_size;
if (*block_min_it < *min_pos)
min_pos = block_min_it;
block_min_it = _begin + block_mins[dist][right_b - sb_offset - (1<<dist)] + (right_sb)*superblock_size;
if (*block_min_it < *min_pos)
min_pos = block_min_it;
}
// go right into remaining block, if elements left
index_t left_gl_idx = right_b*block_size;
if (left_gl_idx < end_idx) {
// linearly search (at most block_size elements)
Iterator inblock_min_it = std::min_element(_begin + left_gl_idx, range_end);
if (*inblock_min_it < *min_pos) {
min_pos = inblock_min_it;
}
}
}
// if there are no superblocks covered (both indeces in same superblock)
if (left_sb > right_sb) {
index_t left_b = (begin_idx - 1) / block_size + 1;
if (begin_idx == 0)
left_b = 0;
index_t right_b = end_idx / block_size;
if (left_b < right_b) {
// if blocks are in between: get mins of blocks in range
// NOTE: there was a while if-else block here to handle the
// case if blocks would span accross the boundary of two
// superblocks, this should however never happen
// git blame this line to find where this code was removed
// assert blocks lie in the same superblock
assert(left_b / n_blocks_per_superblock == right_b / n_blocks_per_superblock);
unsigned int dist = floorlog2(right_b - left_b);
index_t sb_offset = 0;
index_t sb_size_offset = 0;
if (left_sb > 1) {
sb_offset = (left_sb-1)*((1<<dist)/2);
sb_size_offset = (left_sb-1)*superblock_size;
}
Iterator block_min_it = _begin + block_mins[dist][left_b - sb_offset] + sb_size_offset;
if (*block_min_it < *min_pos)
min_pos = block_min_it;
block_min_it = _begin + block_mins[dist][right_b - sb_offset - (1<<dist)] + sb_size_offset;
if (*block_min_it < *min_pos)
min_pos = block_min_it;
// remaining inblock
if (begin_idx < left_b*block_size) {
Iterator inblock_min_it = std::min_element(range_begin, _begin + left_b*block_size);
if (*inblock_min_it < *min_pos) {
min_pos = inblock_min_it;
}
}
if (end_idx > right_b*block_size) {
Iterator inblock_min_it = std::min_element(_begin + right_b*block_size, range_end);
if (*inblock_min_it < *min_pos) {
min_pos = inblock_min_it;
}
}
} else {
// no blocks at all
Iterator inblock_min_it = std::min_element(range_begin, range_end);
if (*inblock_min_it < *min_pos) {
min_pos = inblock_min_it;
}
}
}
// return the minimum found
return min_pos;
}
