 |
Shadowrun: Awakened 29 September 2011 - Build 871
|
|
Shadowrun: Awakened 29 September 2011 - Build 871
|
#include "RakNetDefinesOverrides.h"
Include dependency graph for RakNetDefines.h: This graph shows which files directly or indirectly include this file:Go to the source code of this file.
| #define __GET_TIME_64BIT 1 |
Define __GET_TIME_64BIT to have RakNet::TimeMS use a 64, rather than 32 bit value. A 32 bit value will overflow after about 5 weeks. However, this doubles the bandwidth use for sending times, so don't do it unless you have a reason to. Comment out if you are using the iPod Touch TG. See http://www.jenkinssoftware.com/forum/index.php?topic=2717.0 This must be the same on all systems, or they won't connect
Definition at line 13 of file RakNetDefines.h.
| #define _FILE_AND_LINE_ __FILE__,__LINE__ |
Definition at line 18 of file RakNetDefines.h.
Referenced by DataStructures::CircularLinkedList< CircularLinkedListType >::Add(), DataStructures::AVLBalancedBinarySearchTree< BinarySearchTreeType >::Add(), DataStructures::OrderedChannelHeap< channel_key_type, heap_data_type, channel_key_comparison_func >::AddChannel(), DataStructures::Tree< TreeType >::AddChild(), ThreadPool< InputType, OutputType >::AddInput(), DataStructures::WeightedGraph< node_type, weight_type, allow_unlinkedNodes >::AddNode(), ThreadPool< InputType, OutputType >::AddOutput(), DataStructures::BinarySearchTree< BinarySearchTreeType >::BinarySearchTree(), DataStructures::CircularLinkedList< CircularLinkedListType >::CircularLinkedList(), ThreadPool< InputType, OutputType >::Clear(), DataStructures::SingleProducerConsumer< SingleProducerConsumerType >::Clear(), DataStructures::WeightedGraph< node_type, weight_type, allow_unlinkedNodes >::Clear(), DataStructures::RangeList< range_type >::Clear(), DataStructures::QueueLinkedList< QueueType >::Clear(), DataStructures::OrderedChannelHeap< channel_key_type, heap_data_type, channel_key_comparison_func >::Clear(), DataStructures::Map< key_type, data_type, key_comparison_func >::Clear(), DataStructures::CircularLinkedList< CircularLinkedListType >::Clear(), DataStructures::BPlusTree< KeyType, DataType, order >::Clear(), DataStructures::WeightedGraph< node_type, weight_type, allow_unlinkedNodes >::ClearDijkstra(), ThreadPool< InputType, OutputType >::ClearInput(), ThreadPool< InputType, OutputType >::ClearOutput(), RakNet::RakNetSmartPtr< RakNetSocket >::Clone(), DataStructures::Multilist< _MultilistType, _DataType, _KeyType, _IndexType >::CopySource(), DataStructures::CircularLinkedList< CircularLinkedListType >::Del(), DataStructures::AVLBalancedBinarySearchTree< BinarySearchTreeType >::Del(), DataStructures::BPlusTree< KeyType, DataType, order >::Delete(), DataStructures::Tree< TreeType >::DeleteDecendants(), RefCountedObj::Deref(), DataStructures::RangeList< range_type >::Deserialize(), DataStructures::Multilist< _MultilistType, _DataType, _KeyType, _IndexType >::FindIntersection(), DataStructures::BPlusTree< KeyType, DataType, order >::FixUnderflow(), DataStructures::BPlusTree< KeyType, DataType, order >::FreePages(), DataStructures::WeightedGraph< node_type, weight_type, allow_unlinkedNodes >::GenerateDisjktraMatrix(), DataStructures::WeightedGraph< node_type, weight_type, allow_unlinkedNodes >::GetShortestPath(), DataStructures::WeightedGraph< node_type, weight_type, allow_unlinkedNodes >::GetSpanningTree(), DataStructures::RangeList< range_type >::Insert(), DataStructures::CircularLinkedList< CircularLinkedListType >::Insert(), DataStructures::BPlusTree< KeyType, DataType, order >::Insert(), DataStructures::BPlusTree< KeyType, DataType, order >::InsertIntoNode(), DataStructures::Tree< TreeType >::LevelOrderTraversal(), DataStructures::LinkedList< LinkedListType >::LinkedList(), DataStructures::List< list_type >::List(), RakNet::RakNetSmartPtr< RakNetSocket >::operator=(), DataStructures::WeightedGraph< node_type, weight_type, allow_unlinkedNodes >::operator=(), DataStructures::Queue< queue_type >::operator=(), DataStructures::List< list_type >::operator=(), DataStructures::CircularLinkedList< CircularLinkedListType >::operator=(), DataStructures::LinkedList< LinkedListType >::operator=(), DataStructures::BinarySearchTree< BinarySearchTreeType >::operator=(), DataStructures::BPlusTree< KeyType, DataType, order >::PrintGraph(), DataStructures::ThreadsafeAllocatingQueue< structureType >::Push(), RakNet::BPSTracker::Push1(), DataStructures::Queue< queue_type >::Queue(), RakNet::RakNetSmartPtr< RakNetSocket >::RakNetSmartPtr(), DataStructures::OrderedChannelHeap< channel_key_type, heap_data_type, channel_key_comparison_func >::RemoveChannel(), DataStructures::WeightedGraph< node_type, weight_type, allow_unlinkedNodes >::RemoveNode(), RakNet::RemoteClient::Reset(), DataStructures::Map< key_type, data_type, key_comparison_func >::Set(), DataStructures::Multilist< _MultilistType, _DataType, _KeyType, _IndexType >::SetMultilistType(), DataStructures::Map< key_type, data_type, key_comparison_func >::SetNew(), RakNet::RakNetSmartPtr< RakNetSocket >::SetNull(), DataStructures::SingleProducerConsumer< SingleProducerConsumerType >::SingleProducerConsumer(), DataStructures::WeightedGraph< node_type, weight_type, allow_unlinkedNodes >::WeightedGraph(), WorkerThread(), DataStructures::SingleProducerConsumer< SingleProducerConsumerType >::WriteLock(), RakNet::VariableListDeltaTracker::WriteVar(), DataStructures::AVLBalancedBinarySearchTree< BinarySearchTreeType >::~AVLBalancedBinarySearchTree(), DataStructures::BinarySearchTree< BinarySearchTreeType >::~BinarySearchTree(), DataStructures::List< list_type >::~List(), DataStructures::MemoryPool< MemoryBlockType >::~MemoryPool(), DataStructures::Multilist< _MultilistType, _DataType, _KeyType, _IndexType >::~Multilist(), DataStructures::OrderedList< key_type, data_type, default_comparison_function >::~OrderedList(), DataStructures::Queue< queue_type >::~Queue(), RakNet::RakNetSmartPtr< RakNetSocket >::~RakNetSmartPtr(), and DataStructures::SingleProducerConsumer< SingleProducerConsumerType >::~SingleProducerConsumer().
| #define _USE_RAK_MEMORY_OVERRIDE 0 |
Uncomment to use RakMemoryOverride for custom memory tracking See RakMemoryOverride.h.
Definition at line 41 of file RakNetDefines.h.
| #define BITSTREAM_STACK_ALLOCATION_SIZE 256 |
Threshold at which to do a malloc / free rather than pushing data onto a fixed stack for the bitstream class Arbitrary size, just picking something likely to be larger than most packets
Definition at line 56 of file RakNetDefines.h.
| #define DATAGRAM_MESSAGE_ID_ARRAY_LENGTH 512 |
This controls the amount of memory used per connection. This many datagrams are tracked by datagramNumber. If more than this many datagrams are sent, then an ack for an older datagram would be ignored This results in an unnecessary resend in that case
Definition at line 86 of file RakNetDefines.h.
| #define GET_TIME_SPIKE_LIMIT 0 |
Workaround for http://support.microsoft.com/kb/274323 If two calls between RakNet::GetTime() happen farther apart than this time in microseconds, this delta will be returned instead Note: This will cause ID_TIMESTAMP to be temporarily inaccurate if you set a breakpoint that pauses the UpdateNetworkLoop() thread in RakPeer Define in RakNetDefinesOverrides.h to enable (non-zero) or disable (0)
Definition at line 105 of file RakNetDefines.h.
| #define MAX_ALLOCA_STACK_ALLOCATION 1048576 |
Define __BITSTREAM_NATIVE_END to NOT support endian swapping in the BitStream class. This is faster and is what you should use unless you actually plan to have different endianness systems connect to each other Enabled by default.
Definition at line 28 of file RakNetDefines.h.
| #define MAXIMUM_NUMBER_OF_INTERNAL_IDS 10 |
Definition at line 66 of file RakNetDefines.h.
| #define OPEN_SSL_CLIENT_SUPPORT 0 |
If defined, OpenSSL is enabled for the class TCPInterface This is necessary to use the SendEmail class with Google POP servers Note that OpenSSL carries its own license restrictions that you should be aware of. If you don't agree, don't enable this define This also requires that you enable header search paths to DependentExtensions\openssl-0.9.8g
Definition at line 50 of file RakNetDefines.h.
| #define PREALLOCATE_LARGE_MESSAGES 0 |
Definition at line 116 of file RakNetDefines.h.
| #define RakAssert | ( | x | ) |
Definition at line 77 of file RakNetDefines.h.
Referenced by DataStructures::MemoryPool< MemoryBlockType >::Allocate(), RakNet::BitStream::BitStream(), DataStructures::BPlusTree< KeyType, DataType, order >::BPlusTree(), DataStructures::SingleProducerConsumer< SingleProducerConsumerType >::CancelReadLock(), DataStructures::SingleProducerConsumer< SingleProducerConsumerType >::Clear(), DataStructures::Multilist< _MultilistType, _DataType, _KeyType, _IndexType >::DeleteShiftArrayLeft(), DataStructures::Map< key_type, data_type, key_comparison_func >::Get(), DataStructures::OrderedList< key_type, data_type, default_comparison_function >::GetElementFromKey(), DataStructures::Map< key_type, data_type, key_comparison_func >::GetIndexAtKey(), DataStructures::Multilist< _MultilistType, _DataType, _KeyType, _IndexType >::GetIndexFromKeyInSortedList(), DataStructures::Multilist< _MultilistType, _DataType, _KeyType, _IndexType >::GetIndexOf(), DataStructures::BPlusTree< KeyType, DataType, order >::GetIndexOf(), DataStructures::Multilist< _MultilistType, _DataType, _KeyType, _IndexType >::GetInsertionIndex(), DataStructures::OrderedList< key_type, data_type, default_comparison_function >::Insert(), DataStructures::List< list_type >::Insert(), DataStructures::BPlusTree< KeyType, DataType, order >::Insert(), DataStructures::BPlusTree< KeyType, DataType, order >::InsertBranchDown(), DataStructures::Multilist< _MultilistType, _DataType, _KeyType, _IndexType >::InsertInOrderedList(), DataStructures::BPlusTree< KeyType, DataType, order >::InsertIntoNode(), DataStructures::Multilist< _MultilistType, _DataType, _KeyType, _IndexType >::InsertShiftArrayRight(), RakNet::operator>>(), DataStructures::Queue< queue_type >::operator[](), DataStructures::Multilist< _MultilistType, _DataType, _KeyType, _IndexType >::operator[](), DataStructures::List< list_type >::operator[](), DataStructures::Heap< weight_type, data_type, isMaxHeap >::Parent(), DataStructures::Queue< queue_type >::Peek(), DataStructures::Multilist< _MultilistType, _DataType, _KeyType, _IndexType >::Peek(), DataStructures::Multilist< _MultilistType, _DataType, _KeyType, _IndexType >::PeekOpposite(), DataStructures::Queue< queue_type >::PeekTail(), DataStructures::Queue< queue_type >::Pop(), DataStructures::OrderedChannelHeap< channel_key_type, heap_data_type, channel_key_comparison_func >::Pop(), DataStructures::Multilist< _MultilistType, _DataType, _KeyType, _IndexType >::Pop(), DataStructures::Map< key_type, data_type, key_comparison_func >::Pop(), DataStructures::List< list_type >::Pop(), DataStructures::Multilist< _MultilistType, _DataType, _KeyType, _IndexType >::PopOpposite(), DataStructures::Queue< queue_type >::Push(), DataStructures::Multilist< _MultilistType, _DataType, _KeyType, _IndexType >::Push(), DataStructures::Queue< queue_type >::PushAtHead(), DataStructures::OrderedChannelHeap< channel_key_type, heap_data_type, channel_key_comparison_func >::PushAtHead(), DataStructures::Multilist< _MultilistType, _DataType, _KeyType, _IndexType >::PushOpposite(), RakNet::BitStream::ReadBitsFromIntegerRange(), DataStructures::SingleProducerConsumer< SingleProducerConsumerType >::ReadUnlock(), DataStructures::MemoryPool< MemoryBlockType >::Release(), DataStructures::OrderedList< key_type, data_type, default_comparison_function >::Remove(), DataStructures::Queue< queue_type >::RemoveAtIndex(), DataStructures::Multilist< _MultilistType, _DataType, _KeyType, _IndexType >::RemoveAtIndex(), DataStructures::List< list_type >::RemoveAtIndex(), DataStructures::List< list_type >::RemoveAtIndexFast(), DataStructures::Multilist< _MultilistType, _DataType, _KeyType, _IndexType >::RemoveAtKey(), DataStructures::List< list_type >::RemoveFromEnd(), DataStructures::List< list_type >::Replace(), DataStructures::RangeList< range_type >::Serialize(), DataStructures::Map< key_type, data_type, key_comparison_func >::SetExisting(), DataStructures::Multilist< _MultilistType, _DataType, _KeyType, _IndexType >::SetMultilistType(), DataStructures::Map< key_type, data_type, key_comparison_func >::SetNew(), DataStructures::SingleProducerConsumer< SingleProducerConsumerType >::SingleProducerConsumer(), DataStructures::BPlusTree< KeyType, DataType, order >::ValidateTreeRecursive(), RakNet::BitStream::WriteBitsFromIntegerRange(), RakNet::BitStream::WriteCompressed(), DataStructures::SingleProducerConsumer< SingleProducerConsumerType >::WriteLock(), RakNet::BitStream::WriteNormVector(), and DataStructures::SingleProducerConsumer< SingleProducerConsumerType >::WriteUnlock().
| #define RAKNET_DEBUG_PRINTF printf |
| #define RAKNET_SUPPORT_IPV6 0 |
Definition at line 120 of file RakNetDefines.h.
| #define RAKSTRING_TYPE RakString |
Definition at line 138 of file RakNetDefines.h.
| #define RAKSTRING_TYPE_IS_UNICODE 0 |
Definition at line 139 of file RakNetDefines.h.
| #define RESEND_BUFFER_ARRAY_LENGTH 512 |
This is the maximum number of reliable user messages that can be on the wire at a time If this is too low, then high ping connections with a large throughput will be underutilized This will be evident because RakNetStatistics::messagesInSend buffer will increase over time, yet at the same time the outgoing bandwidth per second is less than your connection supports
Definition at line 93 of file RakNetDefines.h.
| #define RESEND_BUFFER_ARRAY_MASK 511 |
Definition at line 94 of file RakNetDefines.h.
| #define RPC4_GLOBAL_REGISTRATION_MAX_FUNCTION_NAME_LENGTH 32 |
Definition at line 148 of file RakNetDefines.h.
| #define RPC4_GLOBAL_REGISTRATION_MAX_FUNCTIONS 16 |
Definition at line 144 of file RakNetDefines.h.
| #define USE_SLIDING_WINDOW_CONGESTION_CONTROL 1 |
Definition at line 110 of file RakNetDefines.h.
| #define USE_WAIT_FOR_MULTIPLE_EVENTS |
Definition at line 35 of file RakNetDefines.h.
| #define XBOX_BYPASS_SECURITY 1 |
Definition at line 152 of file RakNetDefines.h.
Copyright © 2007-2010 by The Shadowrun: Awakened Team. This work is licensed under the GNU Lesser General Public License 3.
 |
