1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226
|
/*
* Copyright (C) 2004, 2006 Apple Computer, Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. 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.
*
* THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``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 APPLE COMPUTER, INC. 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 "config.h"
#if ENABLE(NETSCAPE_PLUGIN_API)
#include "npruntime_internal.h"
#include "npruntime_impl.h"
#include "npruntime_priv.h"
#include "c_utility.h"
#include <kjs/identifier.h>
#include <kjs/JSLock.h>
#include <wtf/Assertions.h>
#include <wtf/HashMap.h>
using namespace KJS::Bindings;
typedef HashMap<RefPtr<KJS::UString::Rep>, PrivateIdentifier*> StringIdentifierMap;
static StringIdentifierMap* getStringIdentifierMap()
{
static StringIdentifierMap* stringIdentifierMap = 0;
if (!stringIdentifierMap)
stringIdentifierMap = new StringIdentifierMap;
return stringIdentifierMap;
}
typedef HashMap<int, PrivateIdentifier*> IntIdentifierMap;
static IntIdentifierMap* getIntIdentifierMap()
{
static IntIdentifierMap* intIdentifierMap = 0;
if (!intIdentifierMap)
intIdentifierMap = new IntIdentifierMap;
return intIdentifierMap;
}
NPIdentifier _NPN_GetStringIdentifier(const NPUTF8* name)
{
ASSERT(name);
if (name) {
PrivateIdentifier* identifier = 0;
KJS::JSLock lock;
identifier = getStringIdentifierMap()->get(identifierFromNPIdentifier(name).ustring().rep());
if (identifier == 0) {
identifier = (PrivateIdentifier*)malloc(sizeof(PrivateIdentifier));
// We never release identifier names, so this dictionary will grow, as will
// the memory for the identifier name strings.
identifier->isString = true;
identifier->value.string = strdup(name);
getStringIdentifierMap()->set(identifierFromNPIdentifier(name).ustring().rep(), identifier);
}
return (NPIdentifier)identifier;
}
return 0;
}
void _NPN_GetStringIdentifiers(const NPUTF8** names, int32_t nameCount, NPIdentifier* identifiers)
{
ASSERT(names);
ASSERT(identifiers);
if (names && identifiers)
for (int i = 0; i < nameCount; i++)
identifiers[i] = _NPN_GetStringIdentifier(names[i]);
}
NPIdentifier _NPN_GetIntIdentifier(int32_t intid)
{
PrivateIdentifier* identifier;
if (intid == 0 || intid == -1) {
static PrivateIdentifier* negativeOneAndZeroIdentifiers[2];
identifier = negativeOneAndZeroIdentifiers[intid + 1];
if (!identifier) {
identifier = (PrivateIdentifier*)malloc(sizeof(PrivateIdentifier));
identifier->isString = false;
identifier->value.number = intid;
negativeOneAndZeroIdentifiers[intid + 1] = identifier;
}
} else {
identifier = getIntIdentifierMap()->get(intid);
if (!identifier) {
identifier = (PrivateIdentifier*)malloc(sizeof(PrivateIdentifier));
// We never release identifier names, so this dictionary will grow.
identifier->isString = false;
identifier->value.number = intid;
getIntIdentifierMap()->set(intid, identifier);
}
}
return (NPIdentifier)identifier;
}
bool _NPN_IdentifierIsString(NPIdentifier identifier)
{
PrivateIdentifier* i = (PrivateIdentifier*)identifier;
return i->isString;
}
NPUTF8 *_NPN_UTF8FromIdentifier(NPIdentifier identifier)
{
PrivateIdentifier* i = (PrivateIdentifier*)identifier;
if (!i->isString || !i->value.string)
return NULL;
return (NPUTF8 *)strdup(i->value.string);
}
int32_t _NPN_IntFromIdentifier(NPIdentifier identifier)
{
PrivateIdentifier* i = (PrivateIdentifier*)identifier;
if (i->isString)
return 0;
return i->value.number;
}
void NPN_InitializeVariantWithStringCopy(NPVariant* variant, const NPString* value)
{
variant->type = NPVariantType_String;
variant->value.stringValue.UTF8Length = value->UTF8Length;
variant->value.stringValue.UTF8Characters = (NPUTF8 *)malloc(sizeof(NPUTF8) * value->UTF8Length);
memcpy((void*)variant->value.stringValue.UTF8Characters, value->UTF8Characters, sizeof(NPUTF8) * value->UTF8Length);
}
void _NPN_ReleaseVariantValue(NPVariant* variant)
{
ASSERT(variant);
if (variant->type == NPVariantType_Object) {
_NPN_ReleaseObject(variant->value.objectValue);
variant->value.objectValue = 0;
} else if (variant->type == NPVariantType_String) {
free((void*)variant->value.stringValue.UTF8Characters);
variant->value.stringValue.UTF8Characters = 0;
variant->value.stringValue.UTF8Length = 0;
}
variant->type = NPVariantType_Void;
}
NPObject *_NPN_CreateObject(NPP npp, NPClass* aClass)
{
ASSERT(aClass);
if (aClass) {
NPObject* obj;
if (aClass->allocate != NULL)
obj = aClass->allocate(npp, aClass);
else
obj = (NPObject*)malloc(sizeof(NPObject));
obj->_class = aClass;
obj->referenceCount = 1;
return obj;
}
return 0;
}
NPObject* _NPN_RetainObject(NPObject* obj)
{
ASSERT(obj);
if (obj)
obj->referenceCount++;
return obj;
}
void _NPN_ReleaseObject(NPObject* obj)
{
ASSERT(obj);
ASSERT(obj->referenceCount >= 1);
if (obj && obj->referenceCount >= 1) {
if (--obj->referenceCount == 0)
_NPN_DeallocateObject(obj);
}
}
void _NPN_DeallocateObject(NPObject *obj)
{
ASSERT(obj);
if (obj) {
if (obj->_class->deallocate)
obj->_class->deallocate(obj);
else
free(obj);
}
}
#endif // ENABLE(NETSCAPE_PLUGIN_API)
|