Arquivos
hhvm/hphp/runtime/base/shared_map.h
T
2013-07-23 11:44:12 -07:00

144 linhas
5.3 KiB
C++

/*
+----------------------------------------------------------------------+
| HipHop for PHP |
+----------------------------------------------------------------------+
| Copyright (c) 2010-2013 Facebook, Inc. (http://www.facebook.com) |
| Copyright (c) 1998-2010 Zend Technologies Ltd. (http://www.zend.com) |
+----------------------------------------------------------------------+
| This source file is subject to version 2.00 of the Zend license, |
| that is bundled with this package in the file LICENSE, and is |
| available through the world-wide-web at the following url: |
| http://www.zend.com/license/2_00.txt. |
| If you did not receive a copy of the Zend license and are unable to |
| obtain it through the world-wide-web, please send a note to |
| license@zend.com so we can mail you a copy immediately. |
+----------------------------------------------------------------------+
*/
#ifndef incl_HPHP_SHARED_MAP_H_
#define incl_HPHP_SHARED_MAP_H_
#include "hphp/util/shared_memory_allocator.h"
#include "hphp/runtime/base/shared_variant.h"
#include "hphp/runtime/base/array_data.h"
#include "hphp/runtime/base/complex_types.h"
#include "hphp/runtime/base/builtin_functions.h"
namespace HPHP {
///////////////////////////////////////////////////////////////////////////////
/**
* Wrapper for a shared memory map.
*/
class SharedMap : public ArrayData, Sweepable {
public:
explicit SharedMap(SharedVariant* source)
: ArrayData(kSharedKind)
, m_arr(source)
, m_localCache(nullptr) {
m_size = m_arr->arrSize();
source->incRef();
}
~SharedMap();
static SharedVariant *GetSharedVariant(const ArrayData* ad);
// these using directives ensure the full set of overloaded functions
// are visible in this class, to avoid triggering implicit conversions
// from a CVarRef key to int64.
using ArrayData::exists;
using ArrayData::lval;
using ArrayData::lvalNew;
using ArrayData::set;
using ArrayData::setRef;
using ArrayData::add;
using ArrayData::addLval;
using ArrayData::remove;
Variant getKey(ssize_t pos) const {
return m_arr->getKey(pos);
}
CVarRef getValueRef(ssize_t pos) const;
static CVarRef GetValueRef(const ArrayData* ad, ssize_t pos);
static bool ExistsInt(const ArrayData* ad, int64_t k);
static bool ExistsStr(const ArrayData* ad, const StringData* k);
static ArrayData* LvalInt(ArrayData*, int64_t k, Variant *&ret,
bool copy);
static ArrayData* LvalStr(ArrayData*, StringData* k, Variant *&ret,
bool copy);
static ArrayData* LvalNew(ArrayData*, Variant *&ret, bool copy);
static ArrayData* SetInt(ArrayData*, int64_t k, CVarRef v, bool copy);
static ArrayData* SetStr(ArrayData*, StringData* k, CVarRef v, bool copy);
static ArrayData* SetRefInt(ArrayData*, int64_t k, CVarRef v, bool copy);
static ArrayData* SetRefStr(ArrayData*, StringData* k, CVarRef v, bool copy);
static ArrayData* AddLvalInt(ArrayData*, int64_t k, Variant *&ret,
bool copy);
static ArrayData* AddLvalStr(ArrayData*, StringData* k, Variant *&ret,
bool copy);
static ArrayData *RemoveInt(ArrayData* ad, int64_t k, bool copy);
static ArrayData *RemoveStr(ArrayData* ad, const StringData* k, bool copy);
static ArrayData* Copy(const ArrayData*);
/**
* Copy (escalate) the SharedMap without triggering local cache.
*/
static ArrayData* Append(ArrayData* a, CVarRef v, bool copy);
static ArrayData* AppendRef(ArrayData*, CVarRef v, bool copy);
static ArrayData* AppendWithRef(ArrayData*, CVarRef v, bool copy);
static ArrayData* Plus(ArrayData*, const ArrayData *elems, bool copy);
static ArrayData* Merge(ArrayData*, const ArrayData *elems, bool copy);
static ArrayData* Prepend(ArrayData*, CVarRef v, bool copy);
/**
* Non-Variant methods that override ArrayData
*/
static TypedValue* NvGetInt(const ArrayData*, int64_t k);
static TypedValue* NvGetStr(const ArrayData*, const StringData* k);
static void NvGetKey(const ArrayData*, TypedValue* out, ssize_t pos);
static bool IsVectorData(const ArrayData* ad);
static ssize_t IterBegin(const ArrayData*);
static ssize_t IterEnd(const ArrayData*);
static ssize_t IterAdvance(const ArrayData*, ssize_t prev);
static ssize_t IterRewind(const ArrayData*, ssize_t prev);
static bool ValidFullPos(const ArrayData*, const FullPos& fp);
static bool AdvanceFullPos(ArrayData*, FullPos& fp);
/**
* Memory allocator methods.
*/
DECLARE_SMART_ALLOCATION(SharedMap);
static void Release(ArrayData*);
static ArrayData* Escalate(const ArrayData*);
static ArrayData* EscalateForSort(ArrayData*);
// implements Sweepable.sweep()
void sweep() { m_arr->decRef(); }
private:
ssize_t getIndex(int64_t k) const;
ssize_t getIndex(const StringData* k) const;
static SharedMap* asSharedMap(ArrayData* ad);
static const SharedMap* asSharedMap(const ArrayData* ad);
public:
void getChildren(std::vector<TypedValue *> &out);
SharedVariant *m_arr;
mutable TypedValue* m_localCache;
};
///////////////////////////////////////////////////////////////////////////////
}
#endif // incl_HPHP_SHARED_MAP_H_