efb53e1499
The order by name is maintained as secondary order by using unused bits in the property details. This is preliminary work towards sharing descriptors arrays. The change allows us - to get rid of the LastAdded bits in the map, binding it to the number of valid descriptors for the given map - to avoid resorting by enumeration index to create the cache - (maybe in the future, depending on performance) to get rid of the enumeration cache altogether. Although generally the number_of_descriptors equals the NumberOfOwnDescriptors in the current version, this is preliminary work towards sharing descriptors, where maps may have more descriptors than are valid for the map. Review URL: https://chromiumcodereview.appspot.com/10879013 git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@12385 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
123 lines
3.9 KiB
C++
123 lines
3.9 KiB
C++
// Copyright 2012 the V8 project authors. All rights reserved.
|
|
// Redistribution and use in source and binary forms, with or without
|
|
// modification, are permitted provided that the following conditions are
|
|
// met:
|
|
//
|
|
// * Redistributions of source code must retain the above copyright
|
|
// notice, this list of conditions and the following disclaimer.
|
|
// * Redistributions in binary form must reproduce the above
|
|
// copyright notice, this list of conditions and the following
|
|
// disclaimer in the documentation and/or other materials provided
|
|
// with the distribution.
|
|
// * Neither the name of Google Inc. nor the names of its
|
|
// contributors may be used to endorse or promote products derived
|
|
// from this software without specific prior written permission.
|
|
//
|
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
#include "v8.h"
|
|
|
|
namespace v8 {
|
|
namespace internal {
|
|
|
|
|
|
void LookupResult::Iterate(ObjectVisitor* visitor) {
|
|
LookupResult* current = this; // Could be NULL.
|
|
while (current != NULL) {
|
|
visitor->VisitPointer(BitCast<Object**>(¤t->holder_));
|
|
current = current->next_;
|
|
}
|
|
}
|
|
|
|
|
|
#ifdef OBJECT_PRINT
|
|
void LookupResult::Print(FILE* out) {
|
|
if (!IsFound()) {
|
|
PrintF(out, "Not Found\n");
|
|
return;
|
|
}
|
|
|
|
PrintF(out, "LookupResult:\n");
|
|
PrintF(out, " -cacheable = %s\n", IsCacheable() ? "true" : "false");
|
|
PrintF(out, " -attributes = %x\n", GetAttributes());
|
|
switch (type()) {
|
|
case NORMAL:
|
|
PrintF(out, " -type = normal\n");
|
|
PrintF(out, " -entry = %d", GetDictionaryEntry());
|
|
break;
|
|
case CONSTANT_FUNCTION:
|
|
PrintF(out, " -type = constant function\n");
|
|
PrintF(out, " -function:\n");
|
|
GetConstantFunction()->Print(out);
|
|
PrintF(out, "\n");
|
|
break;
|
|
case FIELD:
|
|
PrintF(out, " -type = field\n");
|
|
PrintF(out, " -index = %d", GetFieldIndex());
|
|
PrintF(out, "\n");
|
|
break;
|
|
case CALLBACKS:
|
|
PrintF(out, " -type = call backs\n");
|
|
PrintF(out, " -callback object:\n");
|
|
GetCallbackObject()->Print(out);
|
|
break;
|
|
case HANDLER:
|
|
PrintF(out, " -type = lookup proxy\n");
|
|
break;
|
|
case INTERCEPTOR:
|
|
PrintF(out, " -type = lookup interceptor\n");
|
|
break;
|
|
case TRANSITION:
|
|
switch (GetTransitionDetails().type()) {
|
|
case FIELD:
|
|
PrintF(out, " -type = map transition\n");
|
|
PrintF(out, " -map:\n");
|
|
GetTransitionMap()->Print(out);
|
|
PrintF(out, "\n");
|
|
return;
|
|
case CONSTANT_FUNCTION:
|
|
PrintF(out, " -type = constant property transition\n");
|
|
PrintF(out, " -map:\n");
|
|
GetTransitionMap()->Print(out);
|
|
PrintF(out, "\n");
|
|
return;
|
|
case CALLBACKS:
|
|
PrintF(out, " -type = callbacks transition\n");
|
|
PrintF(out, " -callback object:\n");
|
|
GetCallbackObject()->Print(out);
|
|
return;
|
|
default:
|
|
UNREACHABLE();
|
|
return;
|
|
}
|
|
case NONEXISTENT:
|
|
UNREACHABLE();
|
|
break;
|
|
}
|
|
}
|
|
|
|
|
|
void Descriptor::Print(FILE* out) {
|
|
PrintF(out, "Descriptor ");
|
|
GetKey()->ShortPrint(out);
|
|
PrintF(out, " @ ");
|
|
GetValue()->ShortPrint(out);
|
|
PrintF(out, " %d\n", GetDetails().descriptor_index());
|
|
}
|
|
|
|
|
|
#endif
|
|
|
|
|
|
} } // namespace v8::internal
|