OLD | NEW |
| (Empty) |
1 /* | |
2 * Copyright (C) 2006, 2007, 2008, 2009 Google Inc. All rights reserved. | |
3 * | |
4 * Redistribution and use in source and binary forms, with or without | |
5 * modification, are permitted provided that the following conditions are | |
6 * met: | |
7 * | |
8 * * Redistributions of source code must retain the above copyright | |
9 * notice, this list of conditions and the following disclaimer. | |
10 * * Redistributions in binary form must reproduce the above | |
11 * copyright notice, this list of conditions and the following disclaimer | |
12 * in the documentation and/or other materials provided with the | |
13 * distribution. | |
14 * * Neither the name of Google Inc. nor the names of its | |
15 * contributors may be used to endorse or promote products derived from | |
16 * this software without specific prior written permission. | |
17 * | |
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
19 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
20 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | |
28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
29 */ | |
30 | |
31 #include "bindings/core/v8/V8Binding.h" | |
32 | |
33 #include "bindings/core/v8/V8BindingMacros.h" | |
34 | |
35 namespace blink { | |
36 | |
37 v8::Local<v8::Function> GetBoundFunction(v8::Local<v8::Function> function) { | |
38 v8::Local<v8::Value> bound_function = function->GetBoundFunction(); | |
39 return bound_function->IsFunction() | |
40 ? v8::Local<v8::Function>::Cast(bound_function) | |
41 : function; | |
42 } | |
43 | |
44 bool AddHiddenValueToArray(v8::Isolate* isolate, | |
45 v8::Local<v8::Object> object, | |
46 v8::Local<v8::Value> value, | |
47 int array_index) { | |
48 DCHECK(!value.IsEmpty()); | |
49 v8::Local<v8::Value> array_value = object->GetInternalField(array_index); | |
50 if (array_value->IsNull() || array_value->IsUndefined()) { | |
51 array_value = v8::Array::New(isolate); | |
52 object->SetInternalField(array_index, array_value); | |
53 } | |
54 | |
55 v8::Local<v8::Array> array = v8::Local<v8::Array>::Cast(array_value); | |
56 return V8CallBoolean(array->CreateDataProperty(isolate->GetCurrentContext(), | |
57 array->Length(), value)); | |
58 } | |
59 | |
60 void RemoveHiddenValueFromArray(v8::Isolate* isolate, | |
61 v8::Local<v8::Object> object, | |
62 v8::Local<v8::Value> value, | |
63 int array_index) { | |
64 v8::Local<v8::Value> array_value = object->GetInternalField(array_index); | |
65 if (!array_value->IsArray()) | |
66 return; | |
67 v8::Local<v8::Array> array = v8::Local<v8::Array>::Cast(array_value); | |
68 for (int i = array->Length() - 1; i >= 0; --i) { | |
69 v8::Local<v8::Value> item; | |
70 if (!array->Get(isolate->GetCurrentContext(), i).ToLocal(&item)) | |
71 return; | |
72 if (item->StrictEquals(value)) { | |
73 array->Delete(isolate->GetCurrentContext(), i).ToChecked(); | |
74 return; | |
75 } | |
76 } | |
77 } | |
78 | |
79 v8::Local<v8::Value> FreezeV8Object(v8::Local<v8::Value> value, | |
80 v8::Isolate* isolate) { | |
81 value.As<v8::Object>() | |
82 ->SetIntegrityLevel(isolate->GetCurrentContext(), | |
83 v8::IntegrityLevel::kFrozen) | |
84 .ToChecked(); | |
85 return value; | |
86 } | |
87 | |
88 } // namespace blink | |
OLD | NEW |