2011-03-31 18:46:35 -07:00
|
|
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*-
|
|
|
|
* vim: set ts=8 sw=4 et tw=99 ft=cpp:
|
|
|
|
*
|
|
|
|
* ***** BEGIN LICENSE BLOCK *****
|
|
|
|
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
|
|
|
|
*
|
|
|
|
* The contents of this file are subject to the Mozilla Public License Version
|
|
|
|
* 1.1 (the "License"); you may not use this file except in compliance with
|
|
|
|
* the License. You may obtain a copy of the License at:
|
|
|
|
* http://www.mozilla.org/MPL/
|
|
|
|
*
|
|
|
|
* Software distributed under the License is distributed on an "AS IS" basis,
|
|
|
|
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
|
|
|
|
* for the specific language governing rights and limitations under the
|
|
|
|
* License.
|
|
|
|
*
|
|
|
|
* The Original Code is Mozilla Code.
|
|
|
|
*
|
|
|
|
* The Initial Developer of the Original Code is
|
|
|
|
* The Mozilla Foundation
|
2011-06-06 11:02:34 -07:00
|
|
|
* Portions created by the Initial Developer are Copyright (C) 2011
|
2011-03-31 18:46:35 -07:00
|
|
|
* the Initial Developer. All Rights Reserved.
|
|
|
|
*
|
|
|
|
* Contributor(s):
|
|
|
|
*
|
|
|
|
* Alternatively, the contents of this file may be used under the terms of
|
|
|
|
* either the GNU General Public License Version 2 or later (the "GPL"), or
|
|
|
|
* the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
|
|
|
|
* in which case the provisions of the GPL or the LGPL are applicable instead
|
|
|
|
* of those above. If you wish to allow use of your version of this file only
|
|
|
|
* under the terms of either the GPL or the LGPL, and not to allow others to
|
|
|
|
* use your version of this file under the terms of the MPL, indicate your
|
|
|
|
* decision by deleting the provisions above and replace them with the notice
|
|
|
|
* and other provisions required by the GPL or the LGPL. If you do not delete
|
|
|
|
* the provisions above, a recipient may use your version of this file under
|
|
|
|
* the terms of any one of the MPL, the GPL or the LGPL.
|
|
|
|
*
|
|
|
|
* ***** END LICENSE BLOCK ***** */
|
|
|
|
|
|
|
|
#ifndef mozilla_Util_h_
|
|
|
|
#define mozilla_Util_h_
|
|
|
|
|
2011-04-28 15:48:52 -07:00
|
|
|
#include "mozilla/Types.h"
|
|
|
|
|
|
|
|
/*
|
|
|
|
* XXX: we're cheating here in order to avoid creating object files
|
|
|
|
* for mfbt /just/ to provide a function like FatalError() to be used
|
|
|
|
* by MOZ_ASSERT(). (It'll happen eventually, but for just ASSERT()
|
|
|
|
* it isn't worth the pain.) JS_Assert(), although unfortunately
|
|
|
|
* named, is part of SpiderMonkey's stable, external API, so this
|
|
|
|
* isn't quite as bad as it seems.
|
|
|
|
*
|
|
|
|
* Once mfbt needs object files, this unholy union with JS_Assert()
|
|
|
|
* will be broken.
|
2011-05-16 16:17:19 -07:00
|
|
|
*
|
|
|
|
* JS_Assert is present even in release builds, for the benefit of applications
|
|
|
|
* that build DEBUG and link against a non-DEBUG SpiderMonkey library.
|
2011-04-28 15:48:52 -07:00
|
|
|
*/
|
|
|
|
MOZ_BEGIN_EXTERN_C
|
|
|
|
|
|
|
|
extern MFBT_API(void)
|
|
|
|
JS_Assert(const char *s, const char *file, JSIntn ln);
|
|
|
|
|
|
|
|
MOZ_END_EXTERN_C
|
|
|
|
|
|
|
|
/*
|
|
|
|
* MOZ_ASSERT() is a "strong" assertion of state, like libc's
|
|
|
|
* assert(). If a MOZ_ASSERT() fails in a debug build, the process in
|
|
|
|
* which it fails will stop running in a loud and dramatic way.
|
|
|
|
*/
|
|
|
|
#ifdef DEBUG
|
|
|
|
|
|
|
|
# define MOZ_ASSERT(expr_) \
|
|
|
|
((expr_) ? (void)0 : JS_Assert(#expr_, __FILE__, __LINE__))
|
|
|
|
|
|
|
|
#else
|
|
|
|
|
|
|
|
# define MOZ_ASSERT(expr_) ((void)0)
|
|
|
|
|
2011-05-03 10:24:01 -07:00
|
|
|
#endif /* DEBUG */
|
2011-04-28 15:48:52 -07:00
|
|
|
|
2011-06-06 11:02:34 -07:00
|
|
|
/*
|
|
|
|
* MOZ_INLINE is a macro which expands to tell the compiler that the method
|
|
|
|
* decorated with it should be inlined. This macro is usable from C and C++
|
|
|
|
* code, even though C89 does not support the |inline| keyword. The compiler
|
|
|
|
* may ignore this directive if it chooses.
|
|
|
|
*/
|
|
|
|
#ifndef MOZ_INLINE
|
|
|
|
# if defined __cplusplus
|
|
|
|
# define MOZ_INLINE inline
|
|
|
|
# elif defined _MSC_VER
|
|
|
|
# define MOZ_INLINE __inline
|
|
|
|
# elif defined __GNUC__
|
|
|
|
# define MOZ_INLINE __inline__
|
|
|
|
# else
|
|
|
|
# define MOZ_INLINE inline
|
|
|
|
# endif
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/*
|
|
|
|
* MOZ_ALWAYS_INLINE is a macro which expands to tell the compiler that the
|
|
|
|
* method decorated with it must be inlined, even if the compiler thinks
|
|
|
|
* otherwise. This is only a (much) stronger version of the MOZ_INLINE hint:
|
|
|
|
* compilers are not guaranteed to respect it (although they're much more likely
|
|
|
|
* to do so).
|
|
|
|
*/
|
|
|
|
#ifndef MOZ_ALWAYS_INLINE
|
|
|
|
# if defined DEBUG
|
|
|
|
# define MOZ_ALWAYS_INLINE MOZ_INLINE
|
|
|
|
# elif defined _MSC_VER
|
|
|
|
# define MOZ_ALWAYS_INLINE __forceinline
|
|
|
|
# elif defined __GNUC__
|
|
|
|
# define MOZ_ALWAYS_INLINE __attribute__((always_inline)) MOZ_INLINE
|
|
|
|
# else
|
|
|
|
# define MOZ_ALWAYS_INLINE MOZ_INLINE
|
|
|
|
# endif
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/*
|
|
|
|
* MOZ_NEVER_INLINE is a macro which expands to tell the compiler that the
|
|
|
|
* method decorated with it must never be inlined, even if the compiler would
|
|
|
|
* otherwise choose to inline the method. Compilers aren't absolutely
|
|
|
|
* guaranteed to support this, but most do.
|
|
|
|
*/
|
|
|
|
#ifndef MOZ_NEVER_INLINE
|
|
|
|
# if defined _MSC_VER
|
|
|
|
# define MOZ_NEVER_INLINE __declspec(noinline)
|
|
|
|
# elif defined __GNUC__
|
|
|
|
# define MOZ_NEVER_INLINE __attribute__((noinline))
|
|
|
|
# else
|
|
|
|
# define MOZ_NEVER_INLINE
|
|
|
|
# endif
|
|
|
|
#endif
|
|
|
|
|
2011-04-20 16:27:30 -07:00
|
|
|
#ifdef __cplusplus
|
|
|
|
|
2011-03-31 18:46:35 -07:00
|
|
|
namespace mozilla {
|
|
|
|
|
2011-03-31 18:46:35 -07:00
|
|
|
/**
|
|
|
|
* DebugOnly contains a value of type T, but only in debug builds. In
|
|
|
|
* release builds, it does not contain a value. This helper is
|
|
|
|
* intended to be used along with ASSERT()-style macros, allowing one
|
|
|
|
* to write
|
|
|
|
*
|
|
|
|
* DebugOnly<bool> check = Func();
|
|
|
|
* ASSERT(check);
|
|
|
|
*
|
|
|
|
* more concisely than declaring |check| conditional on #ifdef DEBUG,
|
|
|
|
* but also without allocating storage space for |check| in release
|
|
|
|
* builds.
|
|
|
|
*
|
|
|
|
* DebugOnly instances can only be coerced to T in debug builds; in
|
|
|
|
* release builds, they don't have a value so type coercion is not
|
|
|
|
* well defined.
|
|
|
|
*/
|
|
|
|
template <typename T>
|
|
|
|
struct DebugOnly
|
|
|
|
{
|
|
|
|
#ifdef DEBUG
|
|
|
|
T value;
|
|
|
|
|
|
|
|
DebugOnly() {}
|
|
|
|
DebugOnly(const T& other) : value(other) {}
|
|
|
|
DebugOnly& operator=(const T& rhs) {
|
|
|
|
value = rhs;
|
|
|
|
return *this;
|
|
|
|
}
|
2011-09-07 11:32:35 -07:00
|
|
|
void operator++(int) {
|
|
|
|
value++;
|
|
|
|
}
|
|
|
|
void operator--(int) {
|
|
|
|
value--;
|
|
|
|
}
|
2011-03-31 18:46:35 -07:00
|
|
|
|
|
|
|
operator T&() { return value; }
|
|
|
|
operator const T&() const { return value; }
|
|
|
|
|
2011-05-10 14:56:49 -07:00
|
|
|
T& operator->() { return value; }
|
|
|
|
|
2011-09-22 13:22:30 -07:00
|
|
|
bool operator<(const T& other) { return value < other; }
|
|
|
|
|
2011-03-31 18:46:35 -07:00
|
|
|
#else
|
|
|
|
DebugOnly() {}
|
|
|
|
DebugOnly(const T&) {}
|
2011-09-04 05:58:00 -07:00
|
|
|
DebugOnly& operator=(const T&) { return *this; }
|
2011-09-07 11:32:35 -07:00
|
|
|
void operator++(int) {}
|
|
|
|
void operator--(int) {}
|
2011-09-22 13:22:30 -07:00
|
|
|
bool operator<(const T&) { return false; }
|
2011-03-31 18:46:35 -07:00
|
|
|
#endif
|
|
|
|
|
2011-04-20 16:27:30 -07:00
|
|
|
/*
|
|
|
|
* DebugOnly must always have a destructor or else it will
|
|
|
|
* generate "unused variable" warnings, exactly what it's intended
|
|
|
|
* to avoid!
|
|
|
|
*/
|
2011-03-31 18:46:35 -07:00
|
|
|
~DebugOnly() {}
|
|
|
|
};
|
|
|
|
|
2011-04-28 15:48:52 -07:00
|
|
|
|
|
|
|
/*
|
|
|
|
* This utility pales in comparison to Boost's aligned_storage. The utility
|
2011-06-24 14:22:30 -07:00
|
|
|
* simply assumes that uint64 is enough alignment for anyone. This may need
|
2011-04-28 15:48:52 -07:00
|
|
|
* to be extended one day...
|
|
|
|
*
|
|
|
|
* As an important side effect, pulling the storage into this template is
|
|
|
|
* enough obfuscation to confuse gcc's strict-aliasing analysis into not giving
|
|
|
|
* false negatives when we cast from the char buffer to whatever type we've
|
|
|
|
* constructed using the bytes.
|
|
|
|
*/
|
|
|
|
template <size_t nbytes>
|
|
|
|
struct AlignedStorage
|
|
|
|
{
|
|
|
|
union U {
|
|
|
|
char bytes[nbytes];
|
|
|
|
uint64 _;
|
|
|
|
} u;
|
|
|
|
|
|
|
|
const void *addr() const { return u.bytes; }
|
|
|
|
void *addr() { return u.bytes; }
|
|
|
|
};
|
|
|
|
|
|
|
|
template <class T>
|
|
|
|
struct AlignedStorage2
|
|
|
|
{
|
|
|
|
union U {
|
|
|
|
char bytes[sizeof(T)];
|
|
|
|
uint64 _;
|
|
|
|
} u;
|
|
|
|
|
|
|
|
const T *addr() const { return (const T *)u.bytes; }
|
2011-06-17 12:59:47 -07:00
|
|
|
T *addr() { return (T *)(void *)u.bytes; }
|
2011-04-28 15:48:52 -07:00
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Small utility for lazily constructing objects without using dynamic storage.
|
|
|
|
* When a Maybe<T> is constructed, it is |empty()|, i.e., no value of T has
|
|
|
|
* been constructed and no T destructor will be called when the Maybe<T> is
|
|
|
|
* destroyed. Upon calling |construct|, a T object will be constructed with the
|
|
|
|
* given arguments and that object will be destroyed when the owning Maybe<T>
|
|
|
|
* is destroyed.
|
|
|
|
*
|
|
|
|
* N.B. GCC seems to miss some optimizations with Maybe and may generate extra
|
|
|
|
* branches/loads/stores. Use with caution on hot paths.
|
|
|
|
*/
|
|
|
|
template <class T>
|
|
|
|
class Maybe
|
|
|
|
{
|
|
|
|
AlignedStorage2<T> storage;
|
|
|
|
bool constructed;
|
|
|
|
|
|
|
|
T &asT() { return *storage.addr(); }
|
|
|
|
|
|
|
|
explicit Maybe(const Maybe &other);
|
|
|
|
const Maybe &operator=(const Maybe &other);
|
|
|
|
|
|
|
|
public:
|
|
|
|
Maybe() { constructed = false; }
|
|
|
|
~Maybe() { if (constructed) asT().~T(); }
|
|
|
|
|
|
|
|
bool empty() const { return !constructed; }
|
|
|
|
|
|
|
|
void construct() {
|
|
|
|
MOZ_ASSERT(!constructed);
|
|
|
|
new(storage.addr()) T();
|
|
|
|
constructed = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class T1>
|
|
|
|
void construct(const T1 &t1) {
|
|
|
|
MOZ_ASSERT(!constructed);
|
|
|
|
new(storage.addr()) T(t1);
|
|
|
|
constructed = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class T1, class T2>
|
|
|
|
void construct(const T1 &t1, const T2 &t2) {
|
|
|
|
MOZ_ASSERT(!constructed);
|
|
|
|
new(storage.addr()) T(t1, t2);
|
|
|
|
constructed = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class T1, class T2, class T3>
|
|
|
|
void construct(const T1 &t1, const T2 &t2, const T3 &t3) {
|
|
|
|
MOZ_ASSERT(!constructed);
|
|
|
|
new(storage.addr()) T(t1, t2, t3);
|
|
|
|
constructed = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class T1, class T2, class T3, class T4>
|
|
|
|
void construct(const T1 &t1, const T2 &t2, const T3 &t3, const T4 &t4) {
|
|
|
|
MOZ_ASSERT(!constructed);
|
|
|
|
new(storage.addr()) T(t1, t2, t3, t4);
|
|
|
|
constructed = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
T *addr() {
|
|
|
|
MOZ_ASSERT(constructed);
|
|
|
|
return &asT();
|
|
|
|
}
|
|
|
|
|
|
|
|
T &ref() {
|
|
|
|
MOZ_ASSERT(constructed);
|
|
|
|
return asT();
|
|
|
|
}
|
|
|
|
|
2011-06-24 14:22:30 -07:00
|
|
|
const T &ref() const {
|
|
|
|
MOZ_ASSERT(constructed);
|
|
|
|
return const_cast<Maybe *>(this)->asT();
|
|
|
|
}
|
|
|
|
|
2011-04-28 15:48:52 -07:00
|
|
|
void destroy() {
|
|
|
|
ref().~T();
|
|
|
|
constructed = false;
|
|
|
|
}
|
|
|
|
|
|
|
|
void destroyIfConstructed() {
|
|
|
|
if (!empty())
|
|
|
|
destroy();
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2011-06-06 11:02:34 -07:00
|
|
|
/*
|
|
|
|
* Safely subtract two pointers when it is known that end >= begin. This avoids
|
|
|
|
* the common compiler bug that if (size_t(end) - size_t(begin)) has the MSB
|
|
|
|
* set, the unsigned subtraction followed by right shift will produce -1, or
|
|
|
|
* size_t(-1), instead of the real difference.
|
|
|
|
*/
|
|
|
|
template <class T>
|
|
|
|
MOZ_ALWAYS_INLINE size_t
|
|
|
|
PointerRangeSize(T* begin, T* end)
|
|
|
|
{
|
|
|
|
MOZ_ASSERT(end >= begin);
|
|
|
|
return (size_t(end) - size_t(begin)) / sizeof(T);
|
|
|
|
}
|
|
|
|
|
2011-04-20 16:27:30 -07:00
|
|
|
} /* namespace mozilla */
|
|
|
|
|
|
|
|
#endif /* __cplusplus */
|
2011-03-31 18:46:35 -07:00
|
|
|
|
2011-04-20 16:27:30 -07:00
|
|
|
#endif /* mozilla_Util_h_ */
|