Don't use alloca.

It leads to compability hell, and the amount of memory we need is bounded,
anyway. Added a few more assertions on the way.

Review URL: https://chromiumcodereview.appspot.com/10808029

git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@12137 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
parent f99dda8d
...@@ -3503,11 +3503,11 @@ void Map::set_instance_descriptors(DescriptorArray* value, ...@@ -3503,11 +3503,11 @@ void Map::set_instance_descriptors(DescriptorArray* value,
void Map::InitializeDescriptors(DescriptorArray* descriptors) { void Map::InitializeDescriptors(DescriptorArray* descriptors) {
int len = descriptors->number_of_descriptors(); int len = descriptors->number_of_descriptors();
ASSERT(len <= DescriptorArray::kMaxNumberOfDescriptors);
SLOW_ASSERT(descriptors->IsSortedNoDuplicates()); SLOW_ASSERT(descriptors->IsSortedNoDuplicates());
#ifdef DEBUG #ifdef DEBUG
bool* used_indices = bool used_indices[DescriptorArray::kMaxNumberOfDescriptors];
reinterpret_cast<bool*>(alloca(sizeof(*used_indices) * len));
for (int i = 0; i < len; ++i) used_indices[i] = false; for (int i = 0; i < len; ++i) used_indices[i] = false;
// Ensure that all enumeration indexes between 1 and length occur uniquely in // Ensure that all enumeration indexes between 1 and length occur uniquely in
...@@ -3515,6 +3515,7 @@ void Map::InitializeDescriptors(DescriptorArray* descriptors) { ...@@ -3515,6 +3515,7 @@ void Map::InitializeDescriptors(DescriptorArray* descriptors) {
for (int i = 0; i < len; ++i) { for (int i = 0; i < len; ++i) {
int enum_index = descriptors->GetDetails(i).index() - int enum_index = descriptors->GetDetails(i).index() -
PropertyDetails::kInitialIndex; PropertyDetails::kInitialIndex;
ASSERT(0 <= enum_index && enum_index < len);
ASSERT(!used_indices[enum_index]); ASSERT(!used_indices[enum_index]);
used_indices[enum_index] = true; used_indices[enum_index] = true;
} }
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment