HomeSort by relevance Sort by last modified time
    Searched refs:b2Alloc (Results 1 - 9 of 9) sorted by null

  /external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Collision/
b2BroadPhase.cpp 29 m_pairBuffer = (b2Pair*)b2Alloc(m_pairCapacity * sizeof(b2Pair));
33 m_moveBuffer = (int32*)b2Alloc(m_moveCapacity * sizeof(int32));
77 m_moveBuffer = (int32*)b2Alloc(m_moveCapacity * sizeof(int32));
111 m_pairBuffer = (b2Pair*)b2Alloc(m_pairCapacity * sizeof(b2Pair));
b2DynamicTree.cpp 31 m_nodes = (b2TreeNode*)b2Alloc(m_nodeCapacity * sizeof(b2TreeNode));
66 m_nodes = (b2TreeNode*)b2Alloc(m_nodeCapacity * sizeof(b2TreeNode));
699 int32* nodes = (int32*)b2Alloc(m_nodeCount * sizeof(int32));
  /external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Common/
b2Settings.cpp 27 void* b2Alloc(int32 size)
b2BlockAllocator.cpp 63 m_chunks = (b2Chunk*)b2Alloc(m_chunkSpace * sizeof(b2Chunk));
108 return b2Alloc(size);
126 m_chunks = (b2Chunk*)b2Alloc(m_chunkSpace * sizeof(b2Chunk));
133 chunk->blocks = (b2Block*)b2Alloc(b2_chunkSize);
b2GrowableStack.h 53 m_stack = (T*)b2Alloc(m_capacity * sizeof(T));
b2Settings.h 131 void* b2Alloc(int32 size);
133 /// If you implement b2Alloc, you should also implement this function.
b2StackAllocator.cpp 44 entry->data = (char*)b2Alloc(size);
  /external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Rope/
b2Rope.cpp 50 m_ps = (b2Vec2*)b2Alloc(m_count * sizeof(b2Vec2));
51 m_p0s = (b2Vec2*)b2Alloc(m_count * sizeof(b2Vec2));
52 m_vs = (b2Vec2*)b2Alloc(m_count * sizeof(b2Vec2));
53 m_ims = (float32*)b2Alloc(m_count * sizeof(float32));
74 m_Ls = (float32*)b2Alloc(count2 * sizeof(float32));
75 m_as = (float32*)b2Alloc(count3 * sizeof(float32));
  /external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Collision/Shapes/
b2ChainShape.cpp 50 m_vertices = (b2Vec2*)b2Alloc(m_count * sizeof(b2Vec2));
70 m_vertices = (b2Vec2*)b2Alloc(count * sizeof(b2Vec2));

Completed in 158 milliseconds