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

more fixes

Browse Source
This commit is contained in:
gtsoul-tech 2024-05-13 12:41:40 +03:00
parent 6830ce21ef
commit 0b8e863282
2 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
src/rose/rose_build_merge.cpp
View File

@ -1345,7 +1345,7 @@ insertion_ordered_map<left_id, vector<RoseVertex>> get_eng_verts(const RoseGraph
if (!left) {
continue;
}
assert(contains(all_reports(left), left.leftfix_report));
assert(contains(all_reports(left_id(left)), left.leftfix_report));
eng_verts[left_id(left)].emplace_back(v);
}

8
src/rose/rose_build_misc.cpp
View File

@ -513,8 +513,8 @@ bool roseHasTops(const RoseBuildImpl &build, RoseVertex v) {
graph_tops.insert(g[e].rose_top);
}
}
return is_subset_of(graph_tops, all_tops(g[v].left));
return is_subset_of(graph_tops, all_tops(left_id(g[v].left)));
}
#endif
@ -1006,14 +1006,14 @@ bool hasOrphanedTops(const RoseBuildImpl &build) {
if (g[v].left) {
if (!build.isRootSuccessor(v)) {
// Tops for infixes come from the in-edges.
set<u32> &tops = leftfixes[g[v].left];
set<u32> &tops = leftfixes[left_id(g[v].left)];
for (const auto &e : in_edges_range(v, g)) {
tops.insert(g[e].rose_top);
}
}
}
if (g[v].suffix) {
suffixes[g[v].suffix].insert(g[v].suffix.top);
suffixes[suffix_id(g[v].suffix)].insert(g[v].suffix.top);
}
}