github_mirrors/vectorscan
3
0
Fork 1
mirror of https://github.com/VectorCamp/vectorscan.git synced 2025-06-28 16:41:01 +03:00
Code Issues Packages Projects Releases Wiki Activity

rose: remove now-unused anchored_base_id

Browse Source
This commit is contained in:
Justin Viiret 2017-02-14 10:23:53 +11:00 committed by Matthew Barr
parent c426d2dc7d
commit dc8220648c
5 changed files with 0 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
src/rose/rose_build_bytecode.cpp
View File

@ -5293,7 +5293,6 @@ void allocateFinalLiteralId(RoseBuildImpl &build, build_context &bc) {
allocateFinalIdToSet(build, bc, norm, &next_final_id); allocateFinalIdToSet(build, bc, norm, &next_final_id);
/* next anchored stuff */ /* next anchored stuff */
build.anchored_base_id = next_final_id;
allocateFinalIdToSet(build, bc, anch, &next_final_id); allocateFinalIdToSet(build, bc, anch, &next_final_id);
/* delayed ids come last */ /* delayed ids come last */
@ -5716,7 +5715,6 @@ aligned_unique_ptr<RoseEngine> RoseBuildImpl::buildFinalEngine(u32 minWidth) {
verify_u32(bc.final_id_to_literal.size() - delay_base_id); verify_u32(bc.final_id_to_literal.size() - delay_base_id);
engine->delay_fatbit_size = fatbit_size(engine->delay_count); engine->delay_fatbit_size = fatbit_size(engine->delay_count);
engine->delay_base_id = delay_base_id; engine->delay_base_id = delay_base_id;
engine->anchored_base_id = anchored_base_id;
engine->anchored_count = bc.anchored_programs.size(); engine->anchored_count = bc.anchored_programs.size();
engine->anchored_fatbit_size = fatbit_size(engine->anchored_count); engine->anchored_fatbit_size = fatbit_size(engine->anchored_count);

1
src/rose/rose_build_dump.cpp
View File

@ -1821,7 +1821,6 @@ void roseDumpStructRaw(const RoseEngine *t, FILE *f) {
DUMP_U32(t, delay_base_id); DUMP_U32(t, delay_base_id);
DUMP_U32(t, anchored_count); DUMP_U32(t, anchored_count);
DUMP_U32(t, anchored_fatbit_size); DUMP_U32(t, anchored_fatbit_size);
DUMP_U32(t, anchored_base_id);
DUMP_U32(t, maxFloatingDelayedMatch); DUMP_U32(t, maxFloatingDelayedMatch);
DUMP_U32(t, delayRebuildLength); DUMP_U32(t, delayRebuildLength);
DUMP_U32(t, stateOffsets.history); DUMP_U32(t, stateOffsets.history);

2
src/rose/rose_build_impl.h
View File

@ -578,8 +578,6 @@ public:
std::map<u32, std::set<u32> > group_to_literal; std::map<u32, std::set<u32> > group_to_literal;
u32 group_end; u32 group_end;
u32 anchored_base_id;
u32 ematcher_region_size; /**< number of bytes the eod table runs over */ u32 ematcher_region_size; /**< number of bytes the eod table runs over */
/** \brief Mapping from leftfix to queue ID (used in dump code). */ /** \brief Mapping from leftfix to queue ID (used in dump code). */

1
src/rose/rose_build_misc.cpp
View File

@ -78,7 +78,6 @@ RoseBuildImpl::RoseBuildImpl(ReportManager &rm_in,
delay_base_id(MO_INVALID_IDX), delay_base_id(MO_INVALID_IDX),
hasSom(false), hasSom(false),
group_end(0), group_end(0),
anchored_base_id(MO_INVALID_IDX),
ematcher_region_size(0), ematcher_region_size(0),
eod_event_literal_id(MO_INVALID_IDX), eod_event_literal_id(MO_INVALID_IDX),
max_rose_anchored_floating_overlap(0), max_rose_anchored_floating_overlap(0),

2
src/rose/rose_internal.h
View File

@ -421,8 +421,6 @@ struct RoseEngine {
* delayed literal ids are contiguous */ * delayed literal ids are contiguous */
u32 anchored_count; /* number of anchored literal ids */ u32 anchored_count; /* number of anchored literal ids */
u32 anchored_fatbit_size; //!< size of each anch fatbit in scratch (bytes) u32 anchored_fatbit_size; //!< size of each anch fatbit in scratch (bytes)
u32 anchored_base_id; /* literal id of the first literal in the A table.
* anchored literal ids are contiguous */
u32 maxFloatingDelayedMatch; /* max offset that a delayed literal can u32 maxFloatingDelayedMatch; /* max offset that a delayed literal can
* usefully be reported */ * usefully be reported */
u32 delayRebuildLength; /* length of the history region which needs to be u32 delayRebuildLength; /* length of the history region which needs to be