[apple/javascriptcore.git] / runtime / RegExpCache.h

/*
 * Copyright (C) 2010 University of Szeged
 * Copyright (C) 2010 Renata Hodovan (hodovan@inf.u-szeged.hu)
 * 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 "RegExp.h"
#include "RegExpKey.h"
#include "Strong.h"
#include "UString.h"
#include "Weak.h"
#include <wtf/FixedArray.h>
#include <wtf/HashMap.h>

#ifndef RegExpCache_h
#define RegExpCache_h

namespace JSC {

class RegExpCache : private WeakHandleOwner {
friend class RegExp;
typedef HashMap<RegExpKey, Weak<RegExp> > RegExpCacheMap;

public:
    RegExpCache(JSGlobalData* globalData);
    void invalidateCode();

private:
    
    static const unsigned maxStrongCacheablePatternLength = 256;

    static const int maxStrongCacheableEntries = 32;

    virtual void finalize(Handle<Unknown>, void* context);

    RegExp* lookupOrCreate(const UString& patternString, RegExpFlags);
    void addToStrongCache(RegExp*);
    RegExpCacheMap m_weakCache; // Holds all regular expressions currently live.
    int m_nextEntryInStrongCache;
    WTF::FixedArray<Strong<RegExp>, maxStrongCacheableEntries> m_strongCache; // Holds a select few regular expressions that have compiled and executed
    JSGlobalData* m_globalData;
};

} // namespace JSC

#endif // RegExpCache_h
Commit	Line	Data
b37bf2e1	1	/*
4e4e5a6f A	2	* Copyright (C) 2010 University of Szeged
	3	* Copyright (C) 2010 Renata Hodovan (hodovan@inf.u-szeged.hu)
	4	* All rights reserved.
b37bf2e1 A	5	*
	6	* Redistribution and use in source and binary forms, with or without
	7	* modification, are permitted provided that the following conditions
	8	* are met:
	9	* 1. Redistributions of source code must retain the above copyright
	10	* notice, this list of conditions and the following disclaimer.
	11	* 2. Redistributions in binary form must reproduce the above copyright
	12	* notice, this list of conditions and the following disclaimer in the
	13	* documentation and/or other materials provided with the distribution.
	14	*
4e4e5a6f	15	* THIS SOFTWARE IS PROVIDED BY UNIVERSITY OF SZEGED ``AS IS'' AND ANY
b37bf2e1 A	16	* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
b37bf2e1 A	17	* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
4e4e5a6f	18	* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL UNIVERSITY OF SZEGED OR
b37bf2e1 A	19	* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
	20	* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
	21	* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
	22	* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
	23	* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
	24	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
4e4e5a6f	25	* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
b37bf2e1 A	26	*/
b37bf2e1 A	27
4e4e5a6f A	28	#include "RegExp.h"
4e4e5a6f A	29	#include "RegExpKey.h"
14957cd0	30	#include "Strong.h"
4e4e5a6f	31	#include "UString.h"
14957cd0 A	32	#include "Weak.h"
	33	#include <wtf/FixedArray.h>
	34	#include <wtf/HashMap.h>
b37bf2e1	35
4e4e5a6f A	36	#ifndef RegExpCache_h
4e4e5a6f A	37	#define RegExpCache_h
b37bf2e1	38
9dae56ea	39	namespace JSC {
9dae56ea	40
14957cd0 A	41	class RegExpCache : private WeakHandleOwner {
	42	friend class RegExp;
	43	typedef HashMap<RegExpKey, Weak<RegExp> > RegExpCacheMap;
	44
4e4e5a6f	45	public:
4e4e5a6f	46	RegExpCache(JSGlobalData* globalData);
14957cd0	47	void invalidateCode();
9dae56ea	48
4e4e5a6f	49	private:
14957cd0 A	50
	51	static const unsigned maxStrongCacheablePatternLength = 256;
	52
	53	static const int maxStrongCacheableEntries = 32;
	54
	55	virtual void finalize(Handle<Unknown>, void* context);
9dae56ea	56
14957cd0 A	57	RegExp* lookupOrCreate(const UString& patternString, RegExpFlags);
	58	void addToStrongCache(RegExp*);
	59	RegExpCacheMap m_weakCache; // Holds all regular expressions currently live.
	60	int m_nextEntryInStrongCache;
	61	WTF::FixedArray<Strong<RegExp>, maxStrongCacheableEntries> m_strongCache; // Holds a select few regular expressions that have compiled and executed
4e4e5a6f	62	JSGlobalData* m_globalData;
4e4e5a6f	63	};
9dae56ea	64
4e4e5a6f	65	} // namespace JSC
9dae56ea	66
4e4e5a6f	67	#endif // RegExpCache_h