mozilla
/
gecko-dev
зеркало из https://github.com/mozilla/gecko-dev.git
1
0
Форкнуть 0
Код Задачи Пакеты Проекты Релизы Вики Активность

Assertion: "tree->root == tree" and crash while loading a website, r=gal.

This commit is contained in:
Graydon Hoare 2009-03-04 13:35:28 -08:00
Родитель e2cd593c99
Коммит ed52368a8f
1 изменённых файлов: 5 добавлений и 5 удалений
Показать статистику Скачать Patch файл Скачать Diff файл Показать все файлы Свернуть все файлы

10
js/src/jstracer.cpp
Просмотреть файл

@ -2458,7 +2458,7 @@ TraceRecorder::compile(JSTraceMonitor* tm)
Fragmento* fragmento = tm->fragmento; Fragmento* fragmento = tm->fragmento;
if (treeInfo->maxNativeStackSlots >= MAX_NATIVE_STACK_SLOTS) { if (treeInfo->maxNativeStackSlots >= MAX_NATIVE_STACK_SLOTS) {
debug_only_v(printf("Blacklist: excessive stack use.\n")); debug_only_v(printf("Blacklist: excessive stack use.\n"));
js_Blacklist(fragment); js_Blacklist(fragment->root);
return; return;
} }
if (anchor && anchor->exitType != CASE_EXIT) if (anchor && anchor->exitType != CASE_EXIT)
@ -2472,7 +2472,7 @@ TraceRecorder::compile(JSTraceMonitor* tm)
return; return;
if (fragmento->assm()->error() != nanojit::None) { if (fragmento->assm()->error() != nanojit::None) {
debug_only_v(printf("Blacklisted: error during compilation\n");) debug_only_v(printf("Blacklisted: error during compilation\n");)
js_Blacklist(fragment); js_Blacklist(fragment->root);
return; return;
} }
if (anchor) { if (anchor) {
@ -2536,7 +2536,7 @@ TraceRecorder::closeLoop(JSTraceMonitor* tm, bool& demote)
if (callDepth != 0) { if (callDepth != 0) {
debug_only_v(printf("Blacklisted: stack depth mismatch, possible recursion.\n");) debug_only_v(printf("Blacklisted: stack depth mismatch, possible recursion.\n");)
js_Blacklist(fragment); js_Blacklist(fragment->root);
trashSelf = true; trashSelf = true;
return false; return false;
} }
@ -2717,7 +2717,7 @@ TraceRecorder::endLoop(JSTraceMonitor* tm)
if (callDepth != 0) { if (callDepth != 0) {
debug_only_v(printf("Blacklisted: stack depth mismatch, possible recursion.\n");) debug_only_v(printf("Blacklisted: stack depth mismatch, possible recursion.\n");)
js_Blacklist(fragment); js_Blacklist(fragment->root);
trashSelf = true; trashSelf = true;
return; return;
} }
@ -4270,7 +4270,7 @@ js_MonitorLoopEdge(JSContext* cx, uintN& inlineCallCount)
/* If we hit the max peers ceiling, don't try to lookup fragments all the time. Thats /* If we hit the max peers ceiling, don't try to lookup fragments all the time. Thats
expensive. This must be a rather type-unstable loop. */ expensive. This must be a rather type-unstable loop. */
debug_only_v(printf("Blacklisted: too many peer trees.\n");) debug_only_v(printf("Blacklisted: too many peer trees.\n");)
js_Blacklist(f); js_Blacklist(f->root);
return false; return false;
} }