mirror of
https://github.com/darlinghq/darling-JavaScriptCore.git
synced 2024-11-26 21:50:53 +00:00
97 lines
3.2 KiB
C++
97 lines
3.2 KiB
C++
/*
|
|
* Copyright (C) 2010 University of Szeged
|
|
* Copyright (C) 2010 Renata Hodovan (hodovan@inf.u-szeged.hu)
|
|
* Copyright (C) 2012 Apple Inc. All rights reserved.
|
|
* 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 UNIVERSITY OF SZEGED ``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 UNIVERSITY OF SZEGED 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"
|
|
#include "RegExpCache.h"
|
|
|
|
#include "StrongInlines.h"
|
|
|
|
namespace JSC {
|
|
|
|
RegExp* RegExpCache::lookupOrCreate(const String& patternString, OptionSet<Yarr::Flags> flags)
|
|
{
|
|
RegExpKey key(flags, patternString);
|
|
if (RegExp* regExp = m_weakCache.get(key))
|
|
return regExp;
|
|
|
|
RegExp* regExp = RegExp::createWithoutCaching(*m_vm, patternString, flags);
|
|
#if ENABLE(REGEXP_TRACING)
|
|
m_vm->addRegExpToTrace(regExp);
|
|
#endif
|
|
|
|
weakAdd(m_weakCache, key, Weak<RegExp>(regExp, this));
|
|
return regExp;
|
|
}
|
|
|
|
RegExpCache::RegExpCache(VM* vm)
|
|
: m_nextEntryInStrongCache(0)
|
|
, m_vm(vm)
|
|
{
|
|
}
|
|
|
|
RegExp* RegExpCache::ensureEmptyRegExpSlow(VM& vm)
|
|
{
|
|
RegExp* regExp = RegExp::create(vm, "", { });
|
|
m_emptyRegExp.set(vm, regExp);
|
|
return regExp;
|
|
}
|
|
|
|
void RegExpCache::finalize(Handle<Unknown> handle, void*)
|
|
{
|
|
RegExp* regExp = static_cast<RegExp*>(handle.get().asCell());
|
|
weakRemove(m_weakCache, regExp->key(), regExp);
|
|
}
|
|
|
|
void RegExpCache::addToStrongCache(RegExp* regExp)
|
|
{
|
|
String pattern = regExp->pattern();
|
|
if (pattern.length() > maxStrongCacheablePatternLength)
|
|
return;
|
|
m_strongCache[m_nextEntryInStrongCache].set(*m_vm, regExp);
|
|
m_nextEntryInStrongCache++;
|
|
if (m_nextEntryInStrongCache == maxStrongCacheableEntries)
|
|
m_nextEntryInStrongCache = 0;
|
|
}
|
|
|
|
void RegExpCache::deleteAllCode()
|
|
{
|
|
for (int i = 0; i < maxStrongCacheableEntries; i++)
|
|
m_strongCache[i].clear();
|
|
m_nextEntryInStrongCache = 0;
|
|
|
|
RegExpCacheMap::iterator end = m_weakCache.end();
|
|
for (RegExpCacheMap::iterator it = m_weakCache.begin(); it != end; ++it) {
|
|
RegExp* regExp = it->value.get();
|
|
if (!regExp) // Skip zombies.
|
|
continue;
|
|
regExp->deleteCode();
|
|
}
|
|
}
|
|
|
|
}
|