GenCondSpace *CodeGenData::findCondSpace( Key lowKey, Key highKey )
{
for ( CondSpaceList::Iter cs = condSpaceList; cs.lte(); cs++ ) {
Key csHighKey = cs->baseKey;
csHighKey += keyOps->alphSize() * (1 << cs->condSet.length());
if ( lowKey >= cs->baseKey && highKey <= csHighKey )
return cs;
}
return 0;
}
void OCamlTabCodeGen::COND_TRANSLATE()
{
out <<
" _widec = " << GET_KEY() << ";\n"
" _klen = " << CL() << "[" << vCS() << "];\n"
" _keys = " << CAST(keysType) << " ("<< CO() << "[" << vCS() << "]*2);\n"
" if ( _klen > 0 ) {\n"
" " << signedKeysType << " _lower = _keys;\n"
" " << signedKeysType << " _mid;\n"
" " << signedKeysType << " _upper = " << CAST(signedKeysType) <<
" (_keys + (_klen<<1) - 2);\n"
" while (true) {\n"
" if ( _upper < _lower )\n"
" break;\n"
"\n"
" _mid = " << CAST(signedKeysType) <<
" (_lower + (((_upper-_lower) >> 1) & ~1));\n"
" if ( " << GET_WIDE_KEY() << " < " << CK() << "[_mid] )\n"
" _upper = " << CAST(signedKeysType) << " (_mid - 2);\n"
" else if ( " << GET_WIDE_KEY() << " > " << CK() << "[_mid+1] )\n"
" _lower = " << CAST(signedKeysType) << " (_mid + 2);\n"
" else {\n"
" switch ( " << C() << "[" << CO() << "[" << vCS() << "]"
" + ((_mid - _keys)>>1)] ) {\n";
for ( CondSpaceList::Iter csi = condSpaceList; csi.lte(); csi++ ) {
GenCondSpace *condSpace = csi;
out << " case " << condSpace->condSpaceId << ": {\n";
out << TABS(2) << "_widec = " << CAST(WIDE_ALPH_TYPE()) << "(" <<
KEY(condSpace->baseKey) << " + (" << GET_KEY() <<
" - " << KEY(keyOps->minKey) << "));\n";
for ( GenCondSet::Iter csi = condSpace->condSet; csi.lte(); csi++ ) {
out << TABS(2) << "if ( ";
CONDITION( out, *csi );
Size condValOffset = ((1 << csi.pos()) * keyOps->alphSize());
out << " ) _widec += " << condValOffset << ";\n";
}
out <<
" break;\n"
" }\n";
}
SWITCH_DEFAULT();
out <<
" }\n"
" break;\n"
" }\n"
" }\n"
" }\n"
"\n";
}
void TabCodeGen::COND_TRANSLATE()
{
out <<
" _widec = " << GET_KEY() << ";\n"
" _klen = " << CL() << "[" << vCS() << "];\n"
" _keys = " << ARR_OFF( CK(), "(" + CO() + "[" + vCS() + "]*2)" ) << ";\n"
" if ( _klen > 0 ) {\n"
" " << PTR_CONST() << WIDE_ALPH_TYPE() << PTR_CONST_END() << POINTER() << "_lower = _keys;\n"
" " << PTR_CONST() << WIDE_ALPH_TYPE() << PTR_CONST_END() << POINTER() << "_mid;\n"
" " << PTR_CONST() << WIDE_ALPH_TYPE() << PTR_CONST_END() << POINTER() << "_upper = _keys + (_klen<<1) - 2;\n"
" while (1) {\n"
" if ( _upper < _lower )\n"
" break;\n"
"\n"
" _mid = _lower + (((_upper-_lower) >> 1) & ~1);\n"
" if ( " << GET_WIDE_KEY() << " < _mid[0] )\n"
" _upper = _mid - 2;\n"
" else if ( " << GET_WIDE_KEY() << " > _mid[1] )\n"
" _lower = _mid + 2;\n"
" else {\n"
" switch ( " << C() << "[" << CO() << "[" << vCS() << "]"
" + ((_mid - _keys)>>1)] ) {\n";
for ( CondSpaceList::Iter csi = condSpaceList; csi.lte(); csi++ ) {
GenCondSpace *condSpace = csi;
out << " case " << condSpace->condSpaceId << ": {\n";
out << TABS(2) << "_widec = " << CAST(WIDE_ALPH_TYPE()) << "(" <<
KEY(condSpace->baseKey) << " + (" << GET_KEY() <<
" - " << KEY(keyOps->minKey) << "));\n";
for ( GenCondSet::Iter csi = condSpace->condSet; csi.lte(); csi++ ) {
out << TABS(2) << "if ( ";
CONDITION( out, *csi );
Size condValOffset = ((1 << csi.pos()) * keyOps->alphSize());
out << " ) _widec += " << condValOffset << ";\n";
}
out <<
" break;\n"
" }\n";
}
SWITCH_DEFAULT();
out <<
" }\n"
" break;\n"
" }\n"
" }\n"
" }\n"
"\n";
}
void RubyTabCodeGen::COND_TRANSLATE()
{
out <<
" _widec = " << GET_KEY() << "\n"
" _keys = " << CO() << "[" << vCS() << "]*2\n"
" _klen = " << CL() << "[" << vCS() << "]\n"
" if _klen > 0\n"
" _lower = _keys\n"
" _upper = _keys + (_klen<<1) - 2\n"
" loop do\n"
" break if _upper < _lower\n"
" _mid = _lower + (((_upper-_lower) >> 1) & ~1)\n"
" if " << GET_WIDE_KEY() << " < " << CK() << "[_mid]\n"
" _upper = _mid - 2\n"
" elsif " << GET_WIDE_KEY() << " > " << CK() << "[_mid+1]\n"
" _lower = _mid + 2\n"
" else\n"
" case " << C() << "[" << CO() << "[" << vCS() << "]"
" + ((_mid - _keys)>>1)]\n";
for ( CondSpaceList::Iter csi = condSpaceList; csi.lte(); csi++ ) {
GenCondSpace *condSpace = csi;
out << " when " << condSpace->condSpaceId << " then" ;
out << " _widec = " << KEY(condSpace->baseKey) <<
"+ (" << GET_KEY() << " - " << KEY(keyOps->minKey) << ")\n";
for ( GenCondSet::Iter csi = condSpace->condSet; csi.lte(); csi++ ) {
Size condValOffset = ((1 << csi.pos()) * keyOps->alphSize());
out << " _widec += " << condValOffset << " if ( ";
CONDITION( out, *csi );
out << " )\n";
}
}
out <<
" end # case\n"
" end\n"
" end # loop\n"
" end\n";
}
void FlatCodeGen::COND_TRANSLATE()
{
out <<
" _widec = " << GET_KEY() << ";\n";
out <<
" _keys = " << ARR_OFF( CK(), "(" + vCS() + "<<1)" ) << ";\n"
" _conds = " << ARR_OFF( C(), CO() + "[" + vCS() + "]" ) << ";\n"
"\n"
" _slen = " << CSP() << "[" << vCS() << "];\n"
" _cond = _slen > 0 && _keys[0] <=" << GET_WIDE_KEY() << " &&\n"
" " << GET_WIDE_KEY() << " <= _keys[1] ?\n"
" _conds[" << GET_WIDE_KEY() << " - _keys[0]] : 0;\n"
"\n";
out <<
" switch ( _cond ) {\n";
for ( CondSpaceList::Iter csi = condSpaceList; csi.lte(); csi++ ) {
GenCondSpace *condSpace = csi;
out << " case " << condSpace->condSpaceId + 1 << ": {\n";
out << TABS(2) << "_widec = " << CAST(WIDE_ALPH_TYPE()) << "(" <<
KEY(condSpace->baseKey) << " + (" << GET_KEY() <<
" - " << KEY(keyOps->minKey) << "));\n";
for ( GenCondSet::Iter csi = condSpace->condSet; csi.lte(); csi++ ) {
out << TABS(2) << "if ( ";
CONDITION( out, *csi );
Size condValOffset = ((1 << csi.pos()) * keyOps->alphSize());
out << " ) _widec += " << condValOffset << ";\n";
}
out << " }\n";
out << " break;\n";
}
SWITCH_DEFAULT();
out <<
" }\n";
}
void CodeGenData::setValueLimits()
{
redFsm->maxSingleLen = 0;
redFsm->maxRangeLen = 0;
redFsm->maxKeyOffset = 0;
redFsm->maxIndexOffset = 0;
redFsm->maxActListId = 0;
redFsm->maxActionLoc = 0;
redFsm->maxActArrItem = 0;
redFsm->maxSpan = 0;
redFsm->maxCondSpan = 0;
redFsm->maxFlatIndexOffset = 0;
redFsm->maxCondOffset = 0;
redFsm->maxCondLen = 0;
redFsm->maxCondSpaceId = 0;
redFsm->maxCondIndexOffset = 0;
/* In both of these cases the 0 index is reserved for no value, so the max
* is one more than it would be if they started at 0. */
redFsm->maxIndex = redFsm->transSet.length();
redFsm->maxCond = condSpaceList.length();
/* The nextStateId - 1 is the last state id assigned. */
redFsm->maxState = redFsm->nextStateId - 1;
for ( CondSpaceList::Iter csi = condSpaceList; csi.lte(); csi++ ) {
if ( csi->condSpaceId > redFsm->maxCondSpaceId )
redFsm->maxCondSpaceId = csi->condSpaceId;
}
for ( RedStateList::Iter st = redFsm->stateList; st.lte(); st++ ) {
/* Maximum cond length. */
if ( st->stateCondList.length() > redFsm->maxCondLen )
redFsm->maxCondLen = st->stateCondList.length();
/* Maximum single length. */
if ( st->outSingle.length() > redFsm->maxSingleLen )
redFsm->maxSingleLen = st->outSingle.length();
/* Maximum range length. */
if ( st->outRange.length() > redFsm->maxRangeLen )
redFsm->maxRangeLen = st->outRange.length();
/* The key offset index offset for the state after last is not used, skip it.. */
if ( ! st.last() ) {
redFsm->maxCondOffset += st->stateCondList.length();
redFsm->maxKeyOffset += st->outSingle.length() + st->outRange.length()*2;
redFsm->maxIndexOffset += st->outSingle.length() + st->outRange.length() + 2;
}
/* Max cond span. */
if ( st->condList != 0 ) {
unsigned long long span = keyOps->span( st->condLowKey, st->condHighKey );
if ( span > redFsm->maxCondSpan )
redFsm->maxCondSpan = span;
}
/* Max key span. */
if ( st->transList != 0 ) {
unsigned long long span = keyOps->span( st->lowKey, st->highKey );
if ( span > redFsm->maxSpan )
redFsm->maxSpan = span;
}
/* Max cond index offset. */
if ( ! st.last() ) {
if ( st->condList != 0 )
redFsm->maxCondIndexOffset += keyOps->span( st->condLowKey, st->condHighKey );
}
/* Max flat index offset. */
if ( ! st.last() ) {
if ( st->transList != 0 )
redFsm->maxFlatIndexOffset += keyOps->span( st->lowKey, st->highKey );
redFsm->maxFlatIndexOffset += 1;
}
}
for ( GenActionTableMap::Iter at = redFsm->actionMap; at.lte(); at++ ) {
/* Maximum id of action lists. */
if ( at->actListId+1 > redFsm->maxActListId )
redFsm->maxActListId = at->actListId+1;
/* Maximum location of items in action array. */
if ( at->location+1 > redFsm->maxActionLoc )
redFsm->maxActionLoc = at->location+1;
/* Maximum values going into the action array. */
if ( at->key.length() > redFsm->maxActArrItem )
redFsm->maxActArrItem = at->key.length();
for ( GenActionTable::Iter item = at->key; item.lte(); item++ ) {
if ( item->value->actionId > redFsm->maxActArrItem )
redFsm->maxActArrItem = item->value->actionId;
}
}
}