Home | History | Annotate | Download | only in runtime
      1 /*
      2  * Copyright (C) 2010 University of Szeged
      3  * Copyright (C) 2010 Renata Hodovan (hodovan (at) inf.u-szeged.hu)
      4  * All rights reserved.
      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  *
     15  * THIS SOFTWARE IS PROVIDED BY UNIVERSITY OF SZEGED ``AS IS'' AND ANY
     16  * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     17  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
     18  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL UNIVERSITY OF SZEGED OR
     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
     25  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
     26  */
     27 
     28 #include "RegExp.h"
     29 #include "RegExpKey.h"
     30 #include "UString.h"
     31 #include <wtf/FixedArray.h>
     32 #include <wtf/HashMap.h>
     33 
     34 #ifndef RegExpCache_h
     35 #define RegExpCache_h
     36 
     37 namespace JSC {
     38 
     39 class RegExpCache {
     40 
     41 typedef HashMap<RegExpKey, RefPtr<RegExp> > RegExpCacheMap;
     42 
     43 public:
     44     PassRefPtr<RegExp> lookupOrCreate(const UString& patternString, RegExpFlags);
     45     PassRefPtr<RegExp> create(const UString& patternString, RegExpFlags, RegExpCacheMap::iterator);
     46     RegExpCache(JSGlobalData* globalData);
     47 
     48 private:
     49     static const unsigned maxCacheablePatternLength = 256;
     50 
     51 #if PLATFORM(IOS)
     52     // The RegExpCache can currently hold onto multiple Mb of memory;
     53     // as a short-term fix some embedded platforms may wish to reduce the cache size.
     54     static const int maxCacheableEntries = 32;
     55 #else
     56     static const int maxCacheableEntries = 256;
     57 #endif
     58 
     59     FixedArray<RegExpKey, maxCacheableEntries> patternKeyArray;
     60     RegExpCacheMap m_cacheMap;
     61     JSGlobalData* m_globalData;
     62     int m_nextKeyToEvict;
     63     bool m_isFull;
     64 };
     65 
     66 } // namespace JSC
     67 
     68 #endif // RegExpCache_h
     69