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

365 linhas
11 KiB
C++

/*
+----------------------------------------------------------------------+
| HipHop for PHP |
+----------------------------------------------------------------------+
| Copyright (c) 2010-2013 Facebook, Inc. (http://www.facebook.com) |
+----------------------------------------------------------------------+
| This source file is subject to version 3.01 of the PHP 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.php.net/license/3_01.txt |
| If you did not receive a copy of the PHP license and are unable to |
| obtain it through the world-wide-web, please send a note to |
| license@php.net so we can mail you a copy immediately. |
+----------------------------------------------------------------------+
*/
#ifndef incl_HPHP_ARRAY_INLINE_H_
#define incl_HPHP_ARRAY_INLINE_H_
#include "hphp/runtime/base/array_data.h"
#include "hphp/runtime/base/complex_types.h"
namespace HPHP {
///////////////////////////////////////////////////////////////////////////////
namespace {
inline bool isIntKey(const Cell* cell) {
return IS_INT_KEY_TYPE(cell->m_type);
}
inline int64_t getIntKey(const Cell* cell) {
assert(cell->m_type == KindOfInt64);
return cell->m_data.num;
}
inline StringData* getStringKey(const Cell* cell) {
assert(IS_STRING_TYPE(cell->m_type));
return cell->m_data.pstr;
}
}
inline bool ArrayData::exists(CStrRef k) const {
assert(IsValidKey(k));
return exists(k.get());
}
inline bool ArrayData::exists(CVarRef k) const {
assert(IsValidKey(k));
auto const cell = k.asCell();
return isIntKey(cell) ? exists(getIntKey(cell))
: exists(getStringKey(cell));
}
inline CVarRef ArrayData::get(CStrRef k, bool error) const {
assert(IsValidKey(k));
return get(k.get(), error);
}
inline CVarRef ArrayData::get(int64_t k, bool error) const {
auto tv = nvGet(k);
return tv ? tvAsCVarRef(tv) : getNotFound(k, error);
}
inline CVarRef ArrayData::get(const StringData* k, bool error) const {
auto tv = nvGet(k);
return tv ? tvAsCVarRef(tv) : getNotFound(k, error);
}
inline ArrayData* ArrayData::lval(CStrRef k, Variant *&ret, bool copy) {
assert(IsValidKey(k));
return lval(k.get(), ret, copy);
}
inline ArrayData* ArrayData::lval(CVarRef k, Variant *&ret, bool copy) {
assert(IsValidKey(k));
auto const cell = k.asCell();
return isIntKey(cell) ? lval(getIntKey(cell), ret, copy)
: lval(getStringKey(cell), ret, copy);
}
inline ArrayData* ArrayData::set(CStrRef k, CVarRef v, bool copy) {
assert(IsValidKey(k));
return set(k.get(), v, copy);
}
inline ArrayData* ArrayData::set(CVarRef k, CVarRef v, bool copy) {
assert(IsValidKey(k));
auto const cell = k.asCell();
return isIntKey(cell) ? set(getIntKey(cell), v, copy)
: set(getStringKey(cell), v, copy);
}
inline ArrayData* ArrayData::setRef(CStrRef k, CVarRef v, bool copy) {
assert(IsValidKey(k));
return setRef(k.get(), v, copy);
}
inline ArrayData* ArrayData::setRef(CVarRef k, CVarRef v, bool copy) {
assert(IsValidKey(k));
auto const cell = k.asCell();
return isIntKey(cell) ? setRef(getIntKey(cell), v, copy)
: setRef(getStringKey(cell), v, copy);
}
inline ArrayData* ArrayData::add(CStrRef k, CVarRef v, bool copy) {
assert(IsValidKey(k));
return add(k.get(), v, copy);
}
inline ArrayData* ArrayData::add(CVarRef k, CVarRef v, bool copy) {
assert(IsValidKey(k));
auto const cell = k.asCell();
return isIntKey(cell) ? add(getIntKey(cell), v, copy)
: add(getStringKey(cell), v, copy);
}
inline ArrayData* ArrayData::addLval(CStrRef k, Variant *&ret, bool copy) {
assert(IsValidKey(k));
return addLval(k.get(), ret, copy);
}
inline ArrayData* ArrayData::addLval(CVarRef k, Variant *&ret, bool copy) {
assert(IsValidKey(k));
auto const cell = k.asCell();
return isIntKey(cell) ? addLval(getIntKey(cell), ret, copy)
: addLval(getStringKey(cell), ret, copy);
}
inline ArrayData* ArrayData::remove(CStrRef k, bool copy) {
assert(IsValidKey(k));
return remove(k.get(), copy);
}
inline ArrayData* ArrayData::remove(CVarRef k, bool copy) {
assert(IsValidKey(k));
auto const cell = k.asCell();
return isIntKey(cell) ? remove(getIntKey(cell), copy)
: remove(getStringKey(cell), copy);
}
inline Variant ArrayData::getValue(ssize_t pos) const {
return getValueRef(pos);
}
inline TypedValue* ArrayData::nvGetValueRef(ssize_t pos) {
return const_cast<TypedValue*>(getValueRef(pos).asTypedValue());
}
inline Variant ArrayData::getKey(ssize_t pos) const {
TypedValue tv;
nvGetKey(&tv, pos);
return std::move(tvAsVariant(&tv));
}
///////////////////////////////////////////////////////////////////////////////
inline void ArrayData::release() {
return g_array_funcs.release[m_kind](this);
}
inline ArrayData* ArrayData::append(CVarRef v, bool copy) {
return g_array_funcs.append[m_kind](this, v, copy);
}
inline ArrayData* ArrayData::appendRef(CVarRef v, bool copy) {
return g_array_funcs.appendRef[m_kind](this, v, copy);
}
inline ArrayData* ArrayData::appendWithRef(CVarRef v, bool copy) {
return g_array_funcs.appendWithRef[m_kind](this, v, copy);
}
inline TypedValue* ArrayData::nvGet(int64_t ikey) const {
return g_array_funcs.nvGetInt[m_kind](this, ikey);
}
inline TypedValue* ArrayData::nvGet(const StringData* skey) const {
return g_array_funcs.nvGetStr[m_kind](this, skey);
}
inline void ArrayData::nvGetKey(TypedValue* out, ssize_t pos) const {
g_array_funcs.nvGetKey[m_kind](this, out, pos);
}
inline ArrayData* ArrayData::set(int64_t k, CVarRef v, bool copy) {
return g_array_funcs.setInt[m_kind](this, k, v, copy);
}
inline ArrayData* ArrayData::set(StringData* k, CVarRef v, bool copy) {
return g_array_funcs.setStr[m_kind](this, k, v, copy);
}
inline size_t ArrayData::vsize() const {
return g_array_funcs.vsize[m_kind](this);
}
inline CVarRef ArrayData::getValueRef(ssize_t pos) const {
return g_array_funcs.getValueRef[m_kind](this, pos);
}
inline bool ArrayData::noCopyOnWrite() const {
return g_array_funcs.noCopyOnWrite[m_kind];
}
inline bool ArrayData::isVectorData() const {
return g_array_funcs.isVectorData[m_kind](this);
}
inline bool ArrayData::exists(int64_t k) const {
return g_array_funcs.existsInt[m_kind](this, k);
}
inline bool ArrayData::exists(const StringData* k) const {
return g_array_funcs.existsStr[m_kind](this, k);
}
inline ArrayData* ArrayData::lval(int64_t k, Variant*& ret, bool copy) {
return g_array_funcs.lvalInt[m_kind](this, k, ret, copy);
}
inline ArrayData* ArrayData::lval(StringData* k, Variant*& ret, bool copy) {
return g_array_funcs.lvalStr[m_kind](this, k, ret, copy);
}
inline ArrayData* ArrayData::lvalNew(Variant*& ret, bool copy) {
return g_array_funcs.lvalNew[m_kind](this, ret, copy);
}
inline ArrayData* ArrayData::setRef(int64_t k, CVarRef v, bool copy) {
return g_array_funcs.setRefInt[m_kind](this, k, v, copy);
}
inline ArrayData* ArrayData::setRef(StringData* k, CVarRef v, bool copy) {
return g_array_funcs.setRefStr[m_kind](this, k, v, copy);
}
inline ArrayData* ArrayData::add(int64_t k, CVarRef v, bool copy) {
return g_array_funcs.addInt[m_kind](this, k, v, copy);
}
inline ArrayData* ArrayData::add(StringData* k, CVarRef v, bool copy) {
return g_array_funcs.addStr[m_kind](this, k, v, copy);
}
inline ArrayData* ArrayData::addLval(int64_t k, Variant *&ret, bool copy) {
return g_array_funcs.addLvalInt[m_kind](this, k, ret, copy);
}
inline ArrayData* ArrayData::addLval(StringData* k, Variant *&ret, bool copy) {
return g_array_funcs.addLvalStr[m_kind](this, k, ret, copy);
}
inline ArrayData* ArrayData::remove(int64_t k, bool copy) {
return g_array_funcs.removeInt[m_kind](this, k, copy);
}
inline ArrayData* ArrayData::remove(const StringData* k, bool copy) {
return g_array_funcs.removeStr[m_kind](this, k, copy);
}
inline ssize_t ArrayData::iter_begin() const {
return g_array_funcs.iterBegin[m_kind](this);
}
inline ssize_t ArrayData::iter_end() const {
return g_array_funcs.iterEnd[m_kind](this);
}
inline ssize_t ArrayData::iter_advance(ssize_t pos) const {
return g_array_funcs.iterAdvance[m_kind](this, pos);
}
inline ssize_t ArrayData::iter_rewind(ssize_t pos) const {
return g_array_funcs.iterRewind[m_kind](this, pos);
}
inline bool ArrayData::validFullPos(const FullPos& fp) const {
return g_array_funcs.validFullPos[m_kind](this, fp);
}
inline bool ArrayData::advanceFullPos(FullPos& fp) {
return g_array_funcs.advanceFullPos[m_kind](this, fp);
}
inline ArrayData* ArrayData::escalateForSort() {
return g_array_funcs.escalateForSort[m_kind](this);
}
inline void ArrayData::ksort(int sort_flags, bool ascending) {
return g_array_funcs.ksort[m_kind](this, sort_flags, ascending);
}
inline void ArrayData::sort(int sort_flags, bool ascending) {
return g_array_funcs.sort[m_kind](this, sort_flags, ascending);
}
inline void ArrayData::asort(int sort_flags, bool ascending) {
return g_array_funcs.asort[m_kind](this, sort_flags, ascending);
}
inline void ArrayData::uksort(CVarRef compare) {
return g_array_funcs.uksort[m_kind](this, compare);
}
inline void ArrayData::usort(CVarRef compare) {
return g_array_funcs.usort[m_kind](this, compare);
}
inline void ArrayData::uasort(CVarRef compare) {
return g_array_funcs.uasort[m_kind](this, compare);
}
inline ArrayData* ArrayData::copy() const {
return g_array_funcs.copy[m_kind](this);
}
inline ArrayData* ArrayData::copyWithStrongIterators() const {
return g_array_funcs.copyWithStrongIterators[m_kind](this);
}
inline ArrayData* ArrayData::nonSmartCopy() const {
return g_array_funcs.nonSmartCopy[m_kind](this);
}
inline ArrayData* ArrayData::pop(Variant& value) {
return g_array_funcs.pop[m_kind](this, value);
}
inline ArrayData* ArrayData::dequeue(Variant& value) {
return g_array_funcs.dequeue[m_kind](this, value);
}
inline ArrayData* ArrayData::prepend(CVarRef value, bool copy) {
return g_array_funcs.prepend[m_kind](this, value, copy);
}
inline void ArrayData::renumber() {
return g_array_funcs.renumber[m_kind](this);
}
inline void ArrayData::onSetEvalScalar() {
return g_array_funcs.onSetEvalScalar[m_kind](this);
}
inline ArrayData* ArrayData::escalate() const {
return g_array_funcs.escalate[m_kind](this);
}
inline ArrayData* ArrayData::plus(const ArrayData* elms, bool copy) {
return g_array_funcs.plus[m_kind](this, elms, copy);
}
inline ArrayData* ArrayData::merge(const ArrayData* elms, bool copy) {
return g_array_funcs.merge[m_kind](this, elms, copy);
}
inline SharedVariant* ArrayData::getSharedVariant() {
return g_array_funcs.getSharedVariant[m_kind](this);
}
///////////////////////////////////////////////////////////////////////////////
}
#endif // incl_HPHP_ARRAY_INLINE_H_