Project

General

Profile

Download (14.5 KB) Statistics
| Branch: | Revision:

library / src / main / java / org / distorted / library / DistortedTree.java @ 421c2728

1
///////////////////////////////////////////////////////////////////////////////////////////////////
2
// Copyright 2016 Leszek Koltunski                                                               //
3
//                                                                                               //
4
// This file is part of Distorted.                                                               //
5
//                                                                                               //
6
// Distorted is free software: you can redistribute it and/or modify                             //
7
// it under the terms of the GNU General Public License as published by                          //
8
// the Free Software Foundation, either version 2 of the License, or                             //
9
// (at your option) any later version.                                                           //
10
//                                                                                               //
11
// Distorted is distributed in the hope that it will be useful,                                  //
12
// but WITHOUT ANY WARRANTY; without even the implied warranty of                                //
13
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the                                 //
14
// GNU General Public License for more details.                                                  //
15
//                                                                                               //
16
// You should have received a copy of the GNU General Public License                             //
17
// along with Distorted.  If not, see <http://www.gnu.org/licenses/>.                            //
18
///////////////////////////////////////////////////////////////////////////////////////////////////
19

    
20
package org.distorted.library;
21

    
22
import java.util.ArrayList;
23
import java.util.HashMap;
24

    
25
import android.opengl.GLES20;
26

    
27
///////////////////////////////////////////////////////////////////////////////////////////////////
28
/**
29
 * Class which represents a Node in a Tree of (Texture,EffectQueue,Grid) set.
30
 *  
31
 * Having organized such sets into a Tree, we can then render any Node to any Framebuffer.
32
 * That recursively renders the set held in the Node and all its children.
33
 */
34
public class DistortedTree
35
  {
36
  private static HashMap<ArrayList<Long>,NodeData> mMapNodeID = new HashMap<>();
37
  private static long mNextNodeID =0;
38

    
39
  private GridObject mGrid;
40
  private DistortedEffects mQueues;
41
  private DistortedTexture mTexture;
42
  private NodeData mData;
43

    
44
  private DistortedTree mParent;
45
  private ArrayList<DistortedTree> mChildren;
46
  private int[] mNumChildren;  // ==mChildren.length(), but we only create mChildren if the first one gets added
47

    
48
  private class NodeData
49
    {
50
    long ID;
51
    int numPointingNodes;
52
    DistortedFramebuffer mDF;
53
    int numRendered;
54

    
55
    NodeData(long id)
56
      {
57
      ID              = id;
58
      numPointingNodes= 1;
59
      mDF             = null;
60
      numRendered     = 0;
61
      }
62
    }
63
 
64
///////////////////////////////////////////////////////////////////////////////////////////////////
65

    
66
  static synchronized void onDestroy()
67
    {
68
    mNextNodeID = 0;
69
    mMapNodeID.clear();
70
    }
71

    
72
///////////////////////////////////////////////////////////////////////////////////////////////////
73
  
74
  private void drawRecursive(long currTime, DistortedFramebuffer df)
75
    {
76
    mTexture.createTexture();
77

    
78
    if( mNumChildren[0]<=0 )
79
      {
80
      GLES20.glBindTexture(GLES20.GL_TEXTURE_2D, mTexture.mTextureDataH[0]);
81
      }
82
    else
83
      {
84
      mData.mDF.createFBO();
85

    
86
      if( mData.numRendered==0 )
87
        {
88
        GLES20.glBindFramebuffer(GLES20.GL_FRAMEBUFFER, mData.mDF.fboIds[0]);
89

    
90
        GLES20.glClearColor(0.0f, 0.0f, 0.0f, 0.0f);
91
        GLES20.glClear( GLES20.GL_DEPTH_BUFFER_BIT | GLES20.GL_COLOR_BUFFER_BIT);
92
      
93
        if( mTexture.mBitmapSet[0] )
94
          {
95
          GLES20.glBindTexture(GLES20.GL_TEXTURE_2D, mTexture.mTextureDataH[0]);
96
          mQueues.drawNoEffectsPriv(mTexture, mGrid, mData.mDF);
97
          }
98
      
99
        synchronized(this)
100
          {
101
          for(int i=0; i<mNumChildren[0]; i++)
102
            {
103
            mChildren.get(i).drawRecursive(currTime, mData.mDF);
104
            }
105
          }
106
        }
107

    
108
      mData.numRendered++;
109
      mData.numRendered %= mData.numPointingNodes;
110

    
111
      GLES20.glBindFramebuffer(GLES20.GL_FRAMEBUFFER, df.fboIds[0]);
112
      GLES20.glBindTexture(GLES20.GL_TEXTURE_2D, mData.mDF.texIds[0]);
113
      }
114
    
115
    mQueues.drawPriv(currTime, mTexture, mGrid, df);
116
    }
117
  
118
///////////////////////////////////////////////////////////////////////////////////////////////////
119
// tree isomorphism
120
  
121
  private void RecomputeNodeID(ArrayList<Long> prev)
122
    {
123
    ArrayList<Long> curr = generateIDList();
124
     
125
    if( mParent==null )
126
      {
127
      adjustNodeData(prev,curr);
128
      }
129
    else
130
      {
131
      ArrayList<Long> parentPrev = mParent.generateIDList();
132
      adjustNodeData(prev,curr);
133
      mParent.RecomputeNodeID(parentPrev);
134
      }
135
    }
136

    
137
///////////////////////////////////////////////////////////////////////////////////////////////////
138

    
139
  private ArrayList<Long> generateIDList()
140
    {
141
    ArrayList<Long> ret = new ArrayList<>();
142
     
143
    ret.add( mTexture.getID() );
144
    DistortedTree node;
145
   
146
    for(int i=0; i<mNumChildren[0]; i++)
147
      {
148
      node = mChildren.get(i);
149
      ret.add(node.mData.ID);
150
      }
151
   
152
    return ret;
153
    }
154

    
155
///////////////////////////////////////////////////////////////////////////////////////////////////
156

    
157
  private void adjustNodeData(ArrayList<Long> oldList, ArrayList<Long> newList)
158
    {
159
    boolean otherNodesPoint = (mData.numPointingNodes>1);
160

    
161
    if( otherNodesPoint ) mData.numPointingNodes--;
162
    else                  mMapNodeID.remove(oldList);
163

    
164
    NodeData newData = mMapNodeID.get(newList);
165
    
166
    if( newData==null )
167
      {
168
      if( otherNodesPoint )  mData = new NodeData(++mNextNodeID);
169
      else                   mData.ID = ++mNextNodeID;  // numPointingNodes must be 1 already
170

    
171
      if( newList.size()>1 )
172
        {
173
        if( mData.mDF==null )
174
          mData.mDF = new DistortedFramebuffer(mTexture.getWidth(), mTexture.getHeight());
175
        }
176
      else
177
        {
178
        if( mData.mDF!=null )
179
          {
180
          mData.mDF.markForDeletion();
181
          mData.mDF = null;
182
          }
183
        else
184
          {
185
          android.util.Log.e("DistortedTree", "adjustNodeData: impossible situation??");
186
          }
187
        }
188

    
189
      mMapNodeID.put(newList, mData);
190
      }
191
    else
192
      {
193
      newData.numPointingNodes++;
194
      mData = newData;
195
      }
196
    }
197

    
198
///////////////////////////////////////////////////////////////////////////////////////////////////  
199
// this will be called on startup and every time OpenGL context has been lost
200

    
201
  static void reset()
202
    {
203
    NodeData tmp;   
204
     
205
    for(ArrayList<Long> key: mMapNodeID.keySet())
206
      {
207
      tmp = mMapNodeID.get(key);
208
          
209
      if( tmp.mDF != null )
210
        {
211
    	  tmp.mDF.reset();
212
        tmp.numRendered = 0;
213
        }
214
      }
215
    }
216

    
217
///////////////////////////////////////////////////////////////////////////////////////////////////
218
// Debug - print all the Node IDs
219

    
220
  void debug(int depth)
221
    {
222
    String tmp="";
223
    int i;
224

    
225
    for(i=0; i<depth; i++) tmp +="   ";
226
    tmp += (mData.ID+" (nodes: "+mData.numPointingNodes+")");
227

    
228
    android.util.Log.e("NODE", tmp);
229

    
230
    for(i=0; i<mNumChildren[0]; i++)
231
      mChildren.get(i).debug(depth+1);
232
    }
233

    
234
///////////////////////////////////////////////////////////////////////////////////////////////////
235
// Debug - print contents of the HashMap
236

    
237
  static void debugMap()
238
    {
239
    NodeData tmp;
240

    
241
    for(ArrayList<Long> key: mMapNodeID.keySet())
242
      {
243
      tmp = mMapNodeID.get(key);
244

    
245
      android.util.Log.e("NODE", "key="+key+" NodeID: "+tmp.ID);
246
      }
247
    }
248

    
249
///////////////////////////////////////////////////////////////////////////////////////////////////
250
// PUBLIC API
251
///////////////////////////////////////////////////////////////////////////////////////////////////
252
/**
253
 * Constructs new Node of the Tree.
254
 *     
255
 * @param texture DistortedTexture to put into the new Node.
256
 * @param queues  DistortedEffects to put into the new Node.
257
 * @param grid GridObject to put into the new Node.
258
 */
259
  public DistortedTree(DistortedTexture texture, DistortedEffects queues, GridObject grid)
260
    {
261
    mTexture= texture;
262
    mQueues = queues;
263
    mGrid   = grid;
264
    mParent = null;
265
    mChildren = null;
266
    mNumChildren = new int[1];
267
    mNumChildren[0] = 0;
268
   
269
    ArrayList<Long> list = new ArrayList<>();
270
    list.add(mTexture.getID());
271

    
272
    mData = mMapNodeID.get(list);
273
   
274
    if( mData!=null )
275
      {
276
      mData.numPointingNodes++;
277
      }
278
    else
279
      {
280
      mData = new NodeData(++mNextNodeID);   
281
      mMapNodeID.put(list, mData);
282
      }
283
    }
284

    
285
///////////////////////////////////////////////////////////////////////////////////////////////////  
286
/**
287
 * Copy-constructs new Node of the Tree from another Node.
288
 *     
289
 * @param node The DistortedTree to copy data from.
290
 * @param flags bit field composed of a subset of the following:
291
 *        {@link Distorted#CLONE_BITMAP},  {@link Distorted#CLONE_MATRIX}, {@link Distorted#CLONE_VERTEX},
292
 *        {@link Distorted#CLONE_FRAGMENT} and {@link Distorted#CLONE_CHILDREN}.
293
 *        For example flags = CLONE_BITMAP | CLONE_CHILDREN.
294
 */
295
  public DistortedTree(DistortedTree node, int flags)
296
    {
297
    mParent = null;
298
    mTexture= new DistortedTexture(node.mTexture,flags);
299
    mQueues = new DistortedEffects(node.mQueues, flags);
300
    mGrid   = node.mGrid;
301

    
302
    if( (flags & Distorted.CLONE_CHILDREN) != 0 )
303
      {
304
      mChildren = node.mChildren;
305
      mNumChildren = node.mNumChildren;
306
      }
307
    else
308
      {
309
      mChildren = null;
310
      mNumChildren = new int[1];
311
      mNumChildren[0] = 0;
312
      }
313
   
314
    ArrayList<Long> list = generateIDList();
315
   
316
    mData = mMapNodeID.get(list);
317
   
318
    if( mData!=null )
319
      {
320
      mData.numPointingNodes++;
321
      }
322
    else
323
      {
324
      mData = new NodeData(++mNextNodeID);   
325
      mMapNodeID.put(list, mData);
326
      }
327
    }
328
  
329
///////////////////////////////////////////////////////////////////////////////////////////////////
330
/**
331
 * Adds a new child to the last position in the list of our Node's children.
332
 * 
333
 * @param node The new Node to add.
334
 */
335
  public synchronized void attach(DistortedTree node)
336
    {
337
    ArrayList<Long> prev = generateIDList(); 
338
   
339
    if( mChildren==null ) mChildren = new ArrayList<>(2);
340
     
341
    node.mParent = this;
342
    mChildren.add(node);
343
    mNumChildren[0]++;
344
     
345
    RecomputeNodeID(prev);
346
    }
347
   
348
///////////////////////////////////////////////////////////////////////////////////////////////////
349
/**
350
 * Adds a new child to the last position in the list of our Node's children.
351
 * 
352
 * @param texture DistortedTexture to initialize our child Node with.
353
 * @param queues DistortedEffects to initialize our child Node with.
354
 * @param grid GridObject to initialize our child Node with.
355
 * @return the newly constructed child Node, or null if we couldn't allocate resources.
356
 */
357
  public synchronized DistortedTree attach(DistortedTexture texture, DistortedEffects queues, GridObject grid)
358
    {
359
    ArrayList<Long> prev = generateIDList(); 
360
      
361
    if( mChildren==null ) mChildren = new ArrayList<>(2);
362
    DistortedTree node = new DistortedTree(texture,queues,grid);
363
    node.mParent = this;
364
    mChildren.add(node);
365
    mNumChildren[0]++;
366
   
367
    RecomputeNodeID(prev);
368

    
369
    return node;
370
    }
371
  
372
///////////////////////////////////////////////////////////////////////////////////////////////////
373
/**
374
 * Removes the first occurrence of a specified child from the list of children of our Node.
375
 * 
376
 * @param node The Node to remove.
377
 * @return <code>true</code> if the child was successfully removed.
378
 */
379
  public synchronized boolean detach(DistortedTree node)
380
    {
381
    if( mNumChildren[0]>0 )
382
      {
383
      ArrayList<Long> prev = generateIDList();  
384
         
385
      if( mChildren.remove(node) )
386
        {
387
        node.mParent = null;  
388
        mNumChildren[0]--;
389
     
390
        RecomputeNodeID(prev);
391
     
392
        return true;
393
        }
394
      }
395
   
396
    return false;
397
    }
398
  
399
///////////////////////////////////////////////////////////////////////////////////////////////////
400
/**
401
 * Removes the first occurrence of a specified child from the list of children of our Node.
402
 * 
403
 * @param queues DistortedEffects to remove.
404
 * @return <code>true</code> if the child was successfully removed.
405
 */
406
  public synchronized boolean detach(DistortedEffects queues)
407
    {
408
    long id = queues.getID();
409
    DistortedTree node;
410
   
411
    for(int i=0; i<mNumChildren[0]; i++)
412
      {
413
      node = mChildren.get(i);
414
     
415
      if( node.mQueues.getID()==id )
416
        {
417
        ArrayList<Long> prev = generateIDList();   
418
     
419
        node.mParent = null;  
420
        mChildren.remove(i);
421
        mNumChildren[0]--;
422
      
423
        RecomputeNodeID(prev);
424
      
425
        return true;
426
        }
427
      }
428
   
429
    return false;
430
    }
431
    
432
///////////////////////////////////////////////////////////////////////////////////////////////////
433
/**
434
 * Removes all children Nodes.
435
 */
436
  public synchronized void detachAll()
437
    {
438
    for(int i=0; i<mNumChildren[0]; i++)
439
      {
440
      mChildren.get(i).mParent = null;
441
      }
442
   
443
    if( mNumChildren[0]>0 )
444
      {
445
      ArrayList<Long> prev = generateIDList();  
446
      
447
      mNumChildren[0] = 0;
448
      mChildren.clear();
449
      RecomputeNodeID(prev);
450
      }
451
    }
452

    
453
///////////////////////////////////////////////////////////////////////////////////////////////////
454
/**
455
 * Draws the Node, and all its children, to the Framebuffer passed.
456
 * <p>
457
 * Must be called from a thread holding OpenGL Context
458
 *
459
 * @param currTime Current time, in milliseconds.
460
 * @param df       Framebuffer to render this to.
461
 */
462
  public void draw(long currTime, DistortedFramebuffer df)
463
    {
464
    df.createFBO();
465
    GLES20.glBindFramebuffer(GLES20.GL_FRAMEBUFFER, df.fboIds[0]);
466
    drawRecursive(currTime,df);
467
    DistortedFramebuffer.deleteAllMarked();
468
    DistortedTexture.deleteAllMarked();
469
    }
470

    
471
///////////////////////////////////////////////////////////////////////////////////////////////////
472
/**
473
 * Returns the DistortedEffects object that's in the Node.
474
 * 
475
 * @return The DistortedEffects contained in the Node.
476
 */
477
  public DistortedEffects getEffects()
478
    {
479
    return mQueues;
480
    }
481

    
482
///////////////////////////////////////////////////////////////////////////////////////////////////
483
/**
484
 * Returns the DistortedTexture object that's in the Node.
485
 *
486
 * @return The DistortedTexture contained in the Node.
487
 */
488
  public DistortedTexture getTexture()
489
    {
490
    return mTexture;
491
    }
492

    
493
///////////////////////////////////////////////////////////////////////////////////////////////////
494
  }
495

    
(5-5/15)