mirror of https://github.com/axmolengine/axmol.git
commit
e54f7314ec
|
@ -0,0 +1,122 @@
|
||||||
|
// Protocol Buffers - Google's data interchange format
|
||||||
|
// Copyright 2012 Google Inc. All rights reserved.
|
||||||
|
// http://code.google.com/p/protobuf/
|
||||||
|
//
|
||||||
|
// Redistribution and use in source and binary forms, with or without
|
||||||
|
// modification, are permitted provided that the following conditions are
|
||||||
|
// met:
|
||||||
|
//
|
||||||
|
// * Redistributions of source code must retain the above copyright
|
||||||
|
// notice, this list of conditions and the following disclaimer.
|
||||||
|
// * 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.
|
||||||
|
// * Neither the name of Google Inc. nor the names of its
|
||||||
|
// contributors may be used to endorse or promote products derived from
|
||||||
|
// this software without specific prior written permission.
|
||||||
|
//
|
||||||
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||||||
|
// "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 THE COPYRIGHT
|
||||||
|
// OWNER 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.
|
||||||
|
|
||||||
|
// This file is an internal atomic implementation, use atomicops.h instead.
|
||||||
|
|
||||||
|
#ifndef GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_ATOMICWORD_COMPAT_H_
|
||||||
|
#define GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_ATOMICWORD_COMPAT_H_
|
||||||
|
|
||||||
|
// AtomicWord is a synonym for intptr_t, and Atomic32 is a synonym for int32,
|
||||||
|
// which in turn means int. On some LP32 platforms, intptr_t is an int, but
|
||||||
|
// on others, it's a long. When AtomicWord and Atomic32 are based on different
|
||||||
|
// fundamental types, their pointers are incompatible.
|
||||||
|
//
|
||||||
|
// This file defines function overloads to allow both AtomicWord and Atomic32
|
||||||
|
// data to be used with this interface.
|
||||||
|
//
|
||||||
|
// On LP64 platforms, AtomicWord and Atomic64 are both always long,
|
||||||
|
// so this problem doesn't occur.
|
||||||
|
|
||||||
|
#if !defined(GOOGLE_PROTOBUF_ARCH_64_BIT)
|
||||||
|
|
||||||
|
namespace google {
|
||||||
|
namespace protobuf {
|
||||||
|
namespace internal {
|
||||||
|
|
||||||
|
inline AtomicWord NoBarrier_CompareAndSwap(volatile AtomicWord* ptr,
|
||||||
|
AtomicWord old_value,
|
||||||
|
AtomicWord new_value) {
|
||||||
|
return NoBarrier_CompareAndSwap(
|
||||||
|
reinterpret_cast<volatile Atomic32*>(ptr), old_value, new_value);
|
||||||
|
}
|
||||||
|
|
||||||
|
inline AtomicWord NoBarrier_AtomicExchange(volatile AtomicWord* ptr,
|
||||||
|
AtomicWord new_value) {
|
||||||
|
return NoBarrier_AtomicExchange(
|
||||||
|
reinterpret_cast<volatile Atomic32*>(ptr), new_value);
|
||||||
|
}
|
||||||
|
|
||||||
|
inline AtomicWord NoBarrier_AtomicIncrement(volatile AtomicWord* ptr,
|
||||||
|
AtomicWord increment) {
|
||||||
|
return NoBarrier_AtomicIncrement(
|
||||||
|
reinterpret_cast<volatile Atomic32*>(ptr), increment);
|
||||||
|
}
|
||||||
|
|
||||||
|
inline AtomicWord Barrier_AtomicIncrement(volatile AtomicWord* ptr,
|
||||||
|
AtomicWord increment) {
|
||||||
|
return Barrier_AtomicIncrement(
|
||||||
|
reinterpret_cast<volatile Atomic32*>(ptr), increment);
|
||||||
|
}
|
||||||
|
|
||||||
|
inline AtomicWord Acquire_CompareAndSwap(volatile AtomicWord* ptr,
|
||||||
|
AtomicWord old_value,
|
||||||
|
AtomicWord new_value) {
|
||||||
|
return Acquire_CompareAndSwap(
|
||||||
|
reinterpret_cast<volatile Atomic32*>(ptr), old_value, new_value);
|
||||||
|
}
|
||||||
|
|
||||||
|
inline AtomicWord Release_CompareAndSwap(volatile AtomicWord* ptr,
|
||||||
|
AtomicWord old_value,
|
||||||
|
AtomicWord new_value) {
|
||||||
|
return Release_CompareAndSwap(
|
||||||
|
reinterpret_cast<volatile Atomic32*>(ptr), old_value, new_value);
|
||||||
|
}
|
||||||
|
|
||||||
|
inline void NoBarrier_Store(volatile AtomicWord *ptr, AtomicWord value) {
|
||||||
|
NoBarrier_Store(reinterpret_cast<volatile Atomic32*>(ptr), value);
|
||||||
|
}
|
||||||
|
|
||||||
|
inline void Acquire_Store(volatile AtomicWord* ptr, AtomicWord value) {
|
||||||
|
return Acquire_Store(reinterpret_cast<volatile Atomic32*>(ptr), value);
|
||||||
|
}
|
||||||
|
|
||||||
|
inline void Release_Store(volatile AtomicWord* ptr, AtomicWord value) {
|
||||||
|
return Release_Store(reinterpret_cast<volatile Atomic32*>(ptr), value);
|
||||||
|
}
|
||||||
|
|
||||||
|
inline AtomicWord NoBarrier_Load(volatile const AtomicWord *ptr) {
|
||||||
|
return NoBarrier_Load(reinterpret_cast<volatile const Atomic32*>(ptr));
|
||||||
|
}
|
||||||
|
|
||||||
|
inline AtomicWord Acquire_Load(volatile const AtomicWord* ptr) {
|
||||||
|
return Acquire_Load(reinterpret_cast<volatile const Atomic32*>(ptr));
|
||||||
|
}
|
||||||
|
|
||||||
|
inline AtomicWord Release_Load(volatile const AtomicWord* ptr) {
|
||||||
|
return Release_Load(reinterpret_cast<volatile const Atomic32*>(ptr));
|
||||||
|
}
|
||||||
|
|
||||||
|
} // namespace internal
|
||||||
|
} // namespace protobuf
|
||||||
|
} // namespace google
|
||||||
|
|
||||||
|
#endif // !defined(GOOGLE_PROTOBUF_ARCH_64_BIT)
|
||||||
|
|
||||||
|
#endif // GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_ATOMICWORD_COMPAT_H_
|
|
@ -0,0 +1,225 @@
|
||||||
|
// Protocol Buffers - Google's data interchange format
|
||||||
|
// Copyright 2012 Google Inc. All rights reserved.
|
||||||
|
// http://code.google.com/p/protobuf/
|
||||||
|
//
|
||||||
|
// Redistribution and use in source and binary forms, with or without
|
||||||
|
// modification, are permitted provided that the following conditions are
|
||||||
|
// met:
|
||||||
|
//
|
||||||
|
// * Redistributions of source code must retain the above copyright
|
||||||
|
// notice, this list of conditions and the following disclaimer.
|
||||||
|
// * 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.
|
||||||
|
// * Neither the name of Google Inc. nor the names of its
|
||||||
|
// contributors may be used to endorse or promote products derived from
|
||||||
|
// this software without specific prior written permission.
|
||||||
|
//
|
||||||
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||||||
|
// "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 THE COPYRIGHT
|
||||||
|
// OWNER 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.
|
||||||
|
|
||||||
|
// This file is an internal atomic implementation, use atomicops.h instead.
|
||||||
|
|
||||||
|
#ifndef GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_MACOSX_H_
|
||||||
|
#define GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_MACOSX_H_
|
||||||
|
|
||||||
|
#include <libkern/OSAtomic.h>
|
||||||
|
|
||||||
|
namespace google {
|
||||||
|
namespace protobuf {
|
||||||
|
namespace internal {
|
||||||
|
|
||||||
|
inline Atomic32 NoBarrier_CompareAndSwap(volatile Atomic32* ptr,
|
||||||
|
Atomic32 old_value,
|
||||||
|
Atomic32 new_value) {
|
||||||
|
Atomic32 prev_value;
|
||||||
|
do {
|
||||||
|
if (OSAtomicCompareAndSwap32(old_value, new_value,
|
||||||
|
const_cast<Atomic32*>(ptr))) {
|
||||||
|
return old_value;
|
||||||
|
}
|
||||||
|
prev_value = *ptr;
|
||||||
|
} while (prev_value == old_value);
|
||||||
|
return prev_value;
|
||||||
|
}
|
||||||
|
|
||||||
|
inline Atomic32 NoBarrier_AtomicExchange(volatile Atomic32* ptr,
|
||||||
|
Atomic32 new_value) {
|
||||||
|
Atomic32 old_value;
|
||||||
|
do {
|
||||||
|
old_value = *ptr;
|
||||||
|
} while (!OSAtomicCompareAndSwap32(old_value, new_value,
|
||||||
|
const_cast<Atomic32*>(ptr)));
|
||||||
|
return old_value;
|
||||||
|
}
|
||||||
|
|
||||||
|
inline Atomic32 NoBarrier_AtomicIncrement(volatile Atomic32* ptr,
|
||||||
|
Atomic32 increment) {
|
||||||
|
return OSAtomicAdd32(increment, const_cast<Atomic32*>(ptr));
|
||||||
|
}
|
||||||
|
|
||||||
|
inline Atomic32 Barrier_AtomicIncrement(volatile Atomic32* ptr,
|
||||||
|
Atomic32 increment) {
|
||||||
|
return OSAtomicAdd32Barrier(increment, const_cast<Atomic32*>(ptr));
|
||||||
|
}
|
||||||
|
|
||||||
|
inline void MemoryBarrier() {
|
||||||
|
OSMemoryBarrier();
|
||||||
|
}
|
||||||
|
|
||||||
|
inline Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,
|
||||||
|
Atomic32 old_value,
|
||||||
|
Atomic32 new_value) {
|
||||||
|
Atomic32 prev_value;
|
||||||
|
do {
|
||||||
|
if (OSAtomicCompareAndSwap32Barrier(old_value, new_value,
|
||||||
|
const_cast<Atomic32*>(ptr))) {
|
||||||
|
return old_value;
|
||||||
|
}
|
||||||
|
prev_value = *ptr;
|
||||||
|
} while (prev_value == old_value);
|
||||||
|
return prev_value;
|
||||||
|
}
|
||||||
|
|
||||||
|
inline Atomic32 Release_CompareAndSwap(volatile Atomic32* ptr,
|
||||||
|
Atomic32 old_value,
|
||||||
|
Atomic32 new_value) {
|
||||||
|
return Acquire_CompareAndSwap(ptr, old_value, new_value);
|
||||||
|
}
|
||||||
|
|
||||||
|
inline void NoBarrier_Store(volatile Atomic32* ptr, Atomic32 value) {
|
||||||
|
*ptr = value;
|
||||||
|
}
|
||||||
|
|
||||||
|
inline void Acquire_Store(volatile Atomic32* ptr, Atomic32 value) {
|
||||||
|
*ptr = value;
|
||||||
|
MemoryBarrier();
|
||||||
|
}
|
||||||
|
|
||||||
|
inline void Release_Store(volatile Atomic32* ptr, Atomic32 value) {
|
||||||
|
MemoryBarrier();
|
||||||
|
*ptr = value;
|
||||||
|
}
|
||||||
|
|
||||||
|
inline Atomic32 NoBarrier_Load(volatile const Atomic32* ptr) {
|
||||||
|
return *ptr;
|
||||||
|
}
|
||||||
|
|
||||||
|
inline Atomic32 Acquire_Load(volatile const Atomic32* ptr) {
|
||||||
|
Atomic32 value = *ptr;
|
||||||
|
MemoryBarrier();
|
||||||
|
return value;
|
||||||
|
}
|
||||||
|
|
||||||
|
inline Atomic32 Release_Load(volatile const Atomic32* ptr) {
|
||||||
|
MemoryBarrier();
|
||||||
|
return *ptr;
|
||||||
|
}
|
||||||
|
|
||||||
|
#ifdef __LP64__
|
||||||
|
|
||||||
|
// 64-bit implementation on 64-bit platform
|
||||||
|
|
||||||
|
inline Atomic64 NoBarrier_CompareAndSwap(volatile Atomic64* ptr,
|
||||||
|
Atomic64 old_value,
|
||||||
|
Atomic64 new_value) {
|
||||||
|
Atomic64 prev_value;
|
||||||
|
do {
|
||||||
|
if (OSAtomicCompareAndSwap64(old_value, new_value,
|
||||||
|
reinterpret_cast<volatile int64_t*>(ptr))) {
|
||||||
|
return old_value;
|
||||||
|
}
|
||||||
|
prev_value = *ptr;
|
||||||
|
} while (prev_value == old_value);
|
||||||
|
return prev_value;
|
||||||
|
}
|
||||||
|
|
||||||
|
inline Atomic64 NoBarrier_AtomicExchange(volatile Atomic64* ptr,
|
||||||
|
Atomic64 new_value) {
|
||||||
|
Atomic64 old_value;
|
||||||
|
do {
|
||||||
|
old_value = *ptr;
|
||||||
|
} while (!OSAtomicCompareAndSwap64(old_value, new_value,
|
||||||
|
reinterpret_cast<volatile int64_t*>(ptr)));
|
||||||
|
return old_value;
|
||||||
|
}
|
||||||
|
|
||||||
|
inline Atomic64 NoBarrier_AtomicIncrement(volatile Atomic64* ptr,
|
||||||
|
Atomic64 increment) {
|
||||||
|
return OSAtomicAdd64(increment, reinterpret_cast<volatile int64_t*>(ptr));
|
||||||
|
}
|
||||||
|
|
||||||
|
inline Atomic64 Barrier_AtomicIncrement(volatile Atomic64* ptr,
|
||||||
|
Atomic64 increment) {
|
||||||
|
return OSAtomicAdd64Barrier(increment,
|
||||||
|
reinterpret_cast<volatile int64_t*>(ptr));
|
||||||
|
}
|
||||||
|
|
||||||
|
inline Atomic64 Acquire_CompareAndSwap(volatile Atomic64* ptr,
|
||||||
|
Atomic64 old_value,
|
||||||
|
Atomic64 new_value) {
|
||||||
|
Atomic64 prev_value;
|
||||||
|
do {
|
||||||
|
if (OSAtomicCompareAndSwap64Barrier(
|
||||||
|
old_value, new_value, reinterpret_cast<volatile int64_t*>(ptr))) {
|
||||||
|
return old_value;
|
||||||
|
}
|
||||||
|
prev_value = *ptr;
|
||||||
|
} while (prev_value == old_value);
|
||||||
|
return prev_value;
|
||||||
|
}
|
||||||
|
|
||||||
|
inline Atomic64 Release_CompareAndSwap(volatile Atomic64* ptr,
|
||||||
|
Atomic64 old_value,
|
||||||
|
Atomic64 new_value) {
|
||||||
|
// The lib kern interface does not distinguish between
|
||||||
|
// Acquire and Release memory barriers; they are equivalent.
|
||||||
|
return Acquire_CompareAndSwap(ptr, old_value, new_value);
|
||||||
|
}
|
||||||
|
|
||||||
|
inline void NoBarrier_Store(volatile Atomic64* ptr, Atomic64 value) {
|
||||||
|
*ptr = value;
|
||||||
|
}
|
||||||
|
|
||||||
|
inline void Acquire_Store(volatile Atomic64* ptr, Atomic64 value) {
|
||||||
|
*ptr = value;
|
||||||
|
MemoryBarrier();
|
||||||
|
}
|
||||||
|
|
||||||
|
inline void Release_Store(volatile Atomic64* ptr, Atomic64 value) {
|
||||||
|
MemoryBarrier();
|
||||||
|
*ptr = value;
|
||||||
|
}
|
||||||
|
|
||||||
|
inline Atomic64 NoBarrier_Load(volatile const Atomic64* ptr) {
|
||||||
|
return *ptr;
|
||||||
|
}
|
||||||
|
|
||||||
|
inline Atomic64 Acquire_Load(volatile const Atomic64* ptr) {
|
||||||
|
Atomic64 value = *ptr;
|
||||||
|
MemoryBarrier();
|
||||||
|
return value;
|
||||||
|
}
|
||||||
|
|
||||||
|
inline Atomic64 Release_Load(volatile const Atomic64* ptr) {
|
||||||
|
MemoryBarrier();
|
||||||
|
return *ptr;
|
||||||
|
}
|
||||||
|
|
||||||
|
#endif // defined(__LP64__)
|
||||||
|
|
||||||
|
} // namespace internal
|
||||||
|
} // namespace protobuf
|
||||||
|
} // namespace google
|
||||||
|
|
||||||
|
#endif // GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_MACOSX_H_
|
|
@ -133,7 +133,7 @@ xcopy /Y /Q "$(EngineRoot)external\websockets\prebuilt\win32\*.*" "$(OutDir)"</C
|
||||||
<PreprocessorDefinitions>WIN32;_WINDOWS;STRICT;_CRT_SECURE_NO_WARNINGS;_SCL_SECURE_NO_WARNINGSNDEBUG;GLFW_EXPOSE_NATIVE_WIN32;GLFW_EXPOSE_NATIVE_WGL;%(PreprocessorDefinitions)</PreprocessorDefinitions>
|
<PreprocessorDefinitions>WIN32;_WINDOWS;STRICT;_CRT_SECURE_NO_WARNINGS;_SCL_SECURE_NO_WARNINGSNDEBUG;GLFW_EXPOSE_NATIVE_WIN32;GLFW_EXPOSE_NATIVE_WGL;%(PreprocessorDefinitions)</PreprocessorDefinitions>
|
||||||
<DisableSpecificWarnings>4267;4251;4244;%(DisableSpecificWarnings)</DisableSpecificWarnings>
|
<DisableSpecificWarnings>4267;4251;4244;%(DisableSpecificWarnings)</DisableSpecificWarnings>
|
||||||
<MultiProcessorCompilation>true</MultiProcessorCompilation>
|
<MultiProcessorCompilation>true</MultiProcessorCompilation>
|
||||||
<ProgramDataBaseFileName>$(ProjectDir)../../../runtime/win32/$(PlatformToolsetVersion).pdb</ProgramDataBaseFileName>
|
<ProgramDataBaseFileName>$(IntDir)vc$(PlatformToolsetVersion).pdb</ProgramDataBaseFileName>
|
||||||
</ClCompile>
|
</ClCompile>
|
||||||
<Link>
|
<Link>
|
||||||
<SubSystem>Windows</SubSystem>
|
<SubSystem>Windows</SubSystem>
|
||||||
|
|
Loading…
Reference in New Issue