AuroraMiddleware/v8
1
0
Fork 0
Code Issues 2 Pull Requests Releases Wiki Activity

Fix ASAN after r23404.

Browse Source 
TBR=vogelheim@chromium.org

Review URL: https://codereview.chromium.org/501403002

git-svn-id: https://v8.googlecode.com/svn/branches/bleeding_edge@23407 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
This commit is contained in:
ulan@chromium.org 2014-08-26 14:35:54 +00:00
parent 5becf4b20d
commit 102b3bdad4
2 changed files with 14 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
src/compiler/generic-algorithm.h
View File

@ -43,7 +43,6 @@ class GenericGraphVisit {
typedef typename Traits::Node Node;
typedef typename Traits::Iterator Iterator;
typedef std::pair<Iterator, Iterator> NodeState;
typedef zone_allocator<NodeState> ZoneNodeStateAllocator;
typedef std::stack<NodeState, ZoneDeque<NodeState>> NodeStateStack;
NodeStateStack stack((ZoneDeque<NodeState>(zone)));
BoolVector visited(Traits::max_id(graph), false, zone);

21
test/cctest/test-spaces.cc
View File

@ -215,13 +215,20 @@ TEST(Regress3540) {
CodeRange* code_range = new CodeRange(isolate);
const size_t code_range_size = 4 * MB;
if (!code_range->SetUp(code_range_size)) return;
size_t allocated_size;
Address result;
for (int i = 0; i < 5; i++) {
result = code_range->AllocateRawMemory(
code_range_size - MB, code_range_size - MB, &allocated_size);
CHECK((result != NULL) == (i == 0));
}
Address address;
size_t size;
address = code_range->AllocateRawMemory(code_range_size - MB,
code_range_size - MB, &size);
CHECK(address != NULL);
Address null_address;
size_t null_size;
null_address = code_range->AllocateRawMemory(
code_range_size - MB, code_range_size - MB, &null_size);
CHECK(null_address == NULL);
code_range->FreeRawMemory(address, size);
delete code_range;
memory_allocator->TearDown();
delete memory_allocator;
}