-
-
Notifications
You must be signed in to change notification settings - Fork 7.5k
fix: add bounds check to prevent out-of-range access in sparse table #2963
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
base: master
Are you sure you want to change the base?
Changes from all commits
File filter
Filter by extension
Conversations
Jump to
Diff view
Diff view
There are no files selected for viewing
Original file line number | Diff line number | Diff line change | ||||
---|---|---|---|---|---|---|
|
@@ -83,10 +83,19 @@ std::vector<std::vector<T> > buildTable(const std::vector<T>& A, | |||||
template <typename T> | ||||||
int getMinimum(int beg, int end, const std::vector<T>& logs, | ||||||
const std::vector<std::vector<T> >& table) { | ||||||
if(beg<0||end<<beg||end>=(int)table[0].size()){ | ||||||
cout<<"Error:querry range ["<<beg<<","<<end<<"] is invalid."<<endl; | ||||||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more.
Suggested change
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. we can also force beg > 0 by using unsigned integer instead preferably uint32_t |
||||||
return -1; | ||||||
} | ||||||
int p = logs[end - beg + 1]; | ||||||
int pLen = 1 << p; | ||||||
if (p >= (int)table.size() || beg >= (int)table[p].size() || (end - pLen + 1) >= (int)table[p].size()) { | ||||||
std::cerr << "Error: index out of bounds when accessing sparse table." << std::endl; | ||||||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. throw an error instead |
||||||
return -1; | ||||||
} | ||||||
return std::min(table[p][beg], table[p][end - pLen + 1]); | ||||||
} | ||||||
|
||||||
} // namespace sparse_table | ||||||
} // namespace range_queries | ||||||
|
||||||
|
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
also why are we left shifting end by beg?
shouldnt it be