2 * Copyright (c) 2015 Samsung Electronics Co., Ltd.
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
8 * http://www.apache.org/licenses/LICENSE-2.0
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
18 #include "renderer-factory-cache.h"
21 #include <dali/devel-api/common/hash.h>
24 #include <dali-toolkit/internal/controls/renderers/color/color-renderer.h>
25 #include <dali-toolkit/internal/controls/renderers/svg/svg-renderer.h>
36 RendererFactoryCache::RendererFactoryCache()
37 : mSvgRasterizeThread( NULL )
41 RendererFactoryCache::~RendererFactoryCache()
43 SvgRasterizeThread::TerminateThread( mSvgRasterizeThread );
46 Geometry RendererFactoryCache::GetGeometry( GeometryType type )
48 return mGeometry[type];
51 void RendererFactoryCache::SaveGeometry( GeometryType type, Geometry geometry )
53 mGeometry[type] = geometry;
56 Shader RendererFactoryCache::GetShader( ShaderType type )
61 void RendererFactoryCache::SaveShader( ShaderType type, Shader shader )
63 mShader[type] = shader;
66 int RendererFactoryCache::FindRenderer( const std::string& key ) const
68 int hash = Dali::CalculateHash( key );
70 HashVector::Iterator startIt = mRendererHashes.Begin();
71 HashVector::Iterator it;
75 it = std::find( startIt, mRendererHashes.End(), hash );
76 if( it != mRendererHashes.End() )
78 int index = it - mRendererHashes.Begin();
79 const CachedRenderer* cachedRenderer = mRenderers[ index ];
81 if( cachedRenderer && cachedRenderer->mKey == key )
96 Renderer RendererFactoryCache::GetRenderer( const std::string& key ) const
98 int index = FindRenderer( key );
101 return mRenderers[ index ]->mRenderer.GetHandle();
109 void RendererFactoryCache::SaveRenderer( const std::string& key, Renderer& renderer )
111 int hash = Dali::CalculateHash( key );
112 const CachedRenderer* cachedRenderer = new CachedRenderer( key, renderer );
114 CachedRenderers::Iterator it = std::find( mRenderers.Begin(), mRenderers.End(), static_cast< CachedRenderer* >( NULL ) );
115 if( it != mRenderers.End() )
117 *it = cachedRenderer;
118 int index = it - mRenderers.Begin();
119 mRendererHashes[ index ] = hash;
123 mRendererHashes.PushBack( hash );
124 mRenderers.PushBack( cachedRenderer );
128 bool RendererFactoryCache::CleanRendererCache( const std::string& key )
130 int index = FindRenderer( key );
133 const CachedRenderer*& cachedRenderer = mRenderers[ index ];
134 if( !cachedRenderer->mRenderer.GetHandle() )
136 mRendererHashes[ index ] = Dali::INITIAL_HASH_VALUE;
138 delete cachedRenderer;
139 cachedRenderer = NULL;
146 void RendererFactoryCache::CacheDebugRenderer( Renderer& renderer )
148 mDebugRenderer = renderer;
151 Renderer RendererFactoryCache::GetDebugRenderer()
153 return mDebugRenderer;
156 SvgRasterizeThread* RendererFactoryCache::GetSVGRasterizationThread()
158 if( !mSvgRasterizeThread )
160 mSvgRasterizeThread = new SvgRasterizeThread( new EventThreadCallback( MakeCallback( this, &RendererFactoryCache::ApplyRasterizedSVGToSampler ) ) );
161 mSvgRasterizeThread->Start();
163 return mSvgRasterizeThread;
166 void RendererFactoryCache::ApplyRasterizedSVGToSampler()
168 while( RasterizingTaskPtr task = mSvgRasterizeThread->NextCompletedTask() )
170 task->GetSvgRenderer()->ApplyRasterizedImage( task->GetPixelData() );
174 Geometry RendererFactoryCache::CreateGridGeometry( Uint16Pair gridSize )
176 uint16_t gridWidth = gridSize.GetWidth();
177 uint16_t gridHeight = gridSize.GetHeight();
180 Vector< Vector2 > vertices;
181 vertices.Reserve( ( gridWidth + 1 ) * ( gridHeight + 1 ) );
183 for( int y = 0; y < gridHeight + 1; ++y )
185 for( int x = 0; x < gridWidth + 1; ++x )
187 vertices.PushBack( Vector2( (float)x/gridWidth - 0.5f, (float)y/gridHeight - 0.5f) );
192 Vector< unsigned short > indices;
193 indices.Reserve( (gridWidth+2)*gridHeight*2 - 2);
195 for( unsigned int row = 0u; row < gridHeight; ++row )
197 unsigned int rowStartIndex = row*(gridWidth+1u);
198 unsigned int nextRowStartIndex = rowStartIndex + gridWidth +1u;
200 if( row != 0u ) // degenerate index on non-first row
202 indices.PushBack( rowStartIndex );
205 for( unsigned int column = 0u; column < gridWidth+1u; column++) // main strip
207 indices.PushBack( rowStartIndex + column);
208 indices.PushBack( nextRowStartIndex + column);
211 if( row != gridHeight-1u ) // degenerate index on non-last row
213 indices.PushBack( nextRowStartIndex + gridWidth );
217 Property::Map vertexFormat;
218 vertexFormat[ "aPosition" ] = Property::VECTOR2;
219 PropertyBuffer vertexPropertyBuffer = PropertyBuffer::New( vertexFormat );
220 if( vertices.Size() > 0 )
222 vertexPropertyBuffer.SetData( &vertices[ 0 ], vertices.Size() );
225 Property::Map indexFormat;
226 indexFormat[ "indices" ] = Property::INTEGER;
227 PropertyBuffer indexPropertyBuffer = PropertyBuffer::New( indexFormat );
230 // Create the geometry object
231 Geometry geometry = Geometry::New();
232 geometry.AddVertexBuffer( vertexPropertyBuffer );
233 if( indices.Size() > 0 )
235 geometry.SetIndexBuffer( &indices[ 0 ], indices.Size() );
238 geometry.SetGeometryType( Geometry::TRIANGLE_STRIP );
243 } // namespace Internal
245 } // namespace Toolkit