/**
* \brief Build the interpreter programs for each literal.
- *
- * Returns the total number of literal fragments.
*/
static
-u32 buildLiteralPrograms(RoseBuildImpl &build, build_context &bc) {
+void buildLiteralPrograms(RoseBuildImpl &build, build_context &bc) {
// Build a reverse mapping from fragment -> final_id.
map<u32, flat_set<u32>> frag_to_final_map;
for (const auto &m : build.final_to_frag_map) {
frag.lit_program_offset = litPrograms[frag.fragment_id];
frag.delay_program_offset = delayRebuildPrograms[frag.fragment_id];
}
-
- return num_fragments;
}
static
queue_count - leftfixBeginQueue, leftInfoTable,
&laggedRoseCount, &historyRequired);
- u32 litProgramCount = buildLiteralPrograms(*this, bc);
+ buildLiteralPrograms(*this, bc);
u32 delayProgramOffset = buildDelayPrograms(*this, bc);
u32 anchoredProgramOffset = buildAnchoredPrograms(*this, bc);
engine->needsCatchup = bc.needs_catchup ? 1 : 0;
- engine->literalCount = litProgramCount;
engine->reportProgramOffset = reportProgramOffset;
engine->reportProgramCount = reportProgramCount;
engine->delayProgramOffset = delayProgramOffset;
fprintf(f, "\n");
fprintf(f, "total literal count : %u\n", t->totalNumLiterals);
- fprintf(f, " prog table size : %u\n", t->literalCount);
fprintf(f, " delayed literals : %u\n", t->delay_count);
fprintf(f, "\n");
DUMP_U32(t, reportProgramCount);
DUMP_U32(t, delayProgramOffset);
DUMP_U32(t, anchoredProgramOffset);
- DUMP_U32(t, literalCount);
DUMP_U32(t, activeArrayCount);
DUMP_U32(t, activeLeftCount);
DUMP_U32(t, queueCount);
*/
u32 anchoredProgramOffset;
- /**
- * \brief Number of entries in the arrays pointed to by litProgramOffset,
- * litDelayRebuildProgramOffset.
- *
- * Note: NOT the total number of literals.
- */
- u32 literalCount;
-
u32 activeArrayCount; //number of nfas tracked in the active array
u32 activeLeftCount; //number of nfas tracked in the active rose array
u32 queueCount; /**< number of nfa queues */