/****************************************************************************
**
** Copyright (C) 2013 Digia Plc and/or its subsidiary(-ies).
** Contact: http://www.qt-project.org/legal
**
** This file is part of the QtQml module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance with the commercial license agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and Digia.  For licensing terms and
** conditions see http://qt.digia.com/licensing.  For further information
** use the contact form at http://qt.digia.com/contact-us.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 2.1 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL included in the
** packaging of this file.  Please review the following information to
** ensure the GNU Lesser General Public License version 2.1 requirements
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Digia gives you certain additional
** rights.  These rights are described in the Digia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 3.0 as published by the Free Software
** Foundation and appearing in the file LICENSE.GPL included in the
** packaging of this file.  Please review the following information to
** ensure the GNU General Public License version 3.0 requirements will be
** met: http://www.gnu.org/copyleft/gpl.html.
**
**
** $QT_END_LICENSE$
**
****************************************************************************/

#include "qv4regexp_p.h"
#include "qv4engine_p.h"
#include "qv4scopedvalue_p.h"

using namespace QV4;

RegExpCache::~RegExpCache()
{
    for (RegExpCache::Iterator it = begin(), e = end();
         it != e; ++it)
        it.value()->m_cache = 0;
    clear();
}

DEFINE_MANAGED_VTABLE(RegExp);

uint RegExp::match(const QString &string, int start, uint *matchOffsets)
{
    if (!isValid())
        return JSC::Yarr::offsetNoMatch;

    WTF::String s(string);

#if ENABLE(YARR_JIT)
    if (!m_jitCode.isFallBack() && m_jitCode.has16BitCode())
        return m_jitCode.execute(s.characters16(), start, s.length(), (int*)matchOffsets).start;
#endif

    return JSC::Yarr::interpret(m_byteCode.get(), s.characters16(), string.length(), start, matchOffsets);
}

RegExp* RegExp::create(ExecutionEngine* engine, const QString& pattern, bool ignoreCase, bool multiline)
{
    RegExpCacheKey key(pattern, ignoreCase, multiline);

    RegExpCache *cache = engine->regExpCache;
    if (cache) {
        if (RegExp *result = cache->value(key))
            return result;
    }

    RegExp *result = new (engine->memoryManager) RegExp(engine, pattern, ignoreCase, multiline);

    if (!cache)
        cache = engine->regExpCache = new RegExpCache;

    result->m_cache = cache;
    cache->insert(key, result);

    return result;
}

RegExp::RegExp(ExecutionEngine* engine, const QString &pattern, bool ignoreCase, bool multiline)
    : Managed(engine->regExpValueClass)
    , m_pattern(pattern)
    , m_cache(0)
    , m_subPatternCount(0)
    , m_ignoreCase(ignoreCase)
    , m_multiLine(multiline)
{
    if (!engine)
        return;
    const char* error = 0;
    JSC::Yarr::YarrPattern yarrPattern(WTF::String(pattern), ignoreCase, multiline, &error);
    if (error)
        return;
    m_subPatternCount = yarrPattern.m_numSubpatterns;
    m_byteCode = JSC::Yarr::byteCompile(yarrPattern, engine->bumperPointerAllocator);
#if ENABLE(YARR_JIT)
    if (!yarrPattern.m_containsBackreferences && engine->iselFactory->jitCompileRegexps()) {
        JSC::JSGlobalData dummy(engine->regExpAllocator);
        JSC::Yarr::jitCompile(yarrPattern, JSC::Yarr::Char16, &dummy, m_jitCode);
    }
#endif
}

RegExp::~RegExp()
{
    if (m_cache) {
        RegExpCacheKey key(this);
        m_cache->remove(key);
    }
    _data = 0;
}

void RegExp::destroy(Managed *that)
{
    static_cast<RegExp*>(that)->~RegExp();
}

void RegExp::markObjects(Managed *that, ExecutionEngine *e)
{
    Q_UNUSED(that);
    Q_UNUSED(e);
}

ReturnedValue RegExp::get(Managed *, const StringRef, bool *)
{
    return Encode::undefined();
}

ReturnedValue RegExp::getIndexed(Managed *m, uint index, bool *hasProperty)
{
    Q_UNUSED(m);
    Q_UNUSED(index);
    Q_UNUSED(hasProperty);

    return Encode::undefined();
}

void RegExp::put(Managed *m, const StringRef name, const ValueRef value)
{
    Q_UNUSED(m);
    Q_UNUSED(name);
    Q_UNUSED(value);
}

void RegExp::putIndexed(Managed *m, uint index, const ValueRef value)
{
    Q_UNUSED(m);
    Q_UNUSED(index);
    Q_UNUSED(value);
}

PropertyAttributes RegExp::query(const Managed *m, StringRef name)
{
    Q_UNUSED(m);
    Q_UNUSED(name);

    return Attr_Invalid;
}

PropertyAttributes RegExp::queryIndexed(const Managed *m, uint index)
{
    Q_UNUSED(m);
    Q_UNUSED(index);

    return Attr_Invalid;
}

bool RegExp::deleteProperty(Managed *, const StringRef)
{
    return false;
}

bool RegExp::deleteIndexedProperty(Managed *m, uint index)
{
    Q_UNUSED(m);
    Q_UNUSED(index);

    return false;
}

void RegExp::advanceIterator(Managed *m, ObjectIterator *it, StringRef name, uint *index, Property *, PropertyAttributes *attributes)
{
    Q_UNUSED(m);
    Q_UNUSED(it);
    Q_UNUSED(name);
    Q_UNUSED(index);
    Q_UNUSED(attributes);

    return;
}