| 1 |
c204c69d
|
leszek
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
| 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 |
fe82a979
|
Leszek Koltunski
|
package org.distorted.library.main;
|
| 21 |
c204c69d
|
leszek
|
|
| 22 |
efe3d8fe
|
leszek
|
import java.util.ArrayList;
|
| 23 |
|
|
|
| 24 |
c204c69d
|
leszek
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
| 25 |
|
|
/**
|
| 26 |
efe3d8fe
|
leszek
|
* This static class handles assigning jobs to other classes. It does it once, at the beginning of
|
| 27 |
|
|
* each frame.
|
| 28 |
86d322b5
|
Leszek Koltunski
|
* <p>
|
| 29 |
|
|
* Not part of public API, do not document (public only because has to be used in PostprocessEffects)
|
| 30 |
|
|
*
|
| 31 |
|
|
* @y.exclude
|
| 32 |
c204c69d
|
leszek
|
*/
|
| 33 |
86d322b5
|
Leszek Koltunski
|
public class DistortedMaster
|
| 34 |
c204c69d
|
leszek
|
{
|
| 35 |
86d322b5
|
Leszek Koltunski
|
private static ArrayList<Slave> mSlaves = new ArrayList<>();
|
| 36 |
13981586
|
Leszek Koltunski
|
|
| 37 |
86d322b5
|
Leszek Koltunski
|
public interface Slave
|
| 38 |
|
|
{
|
| 39 |
|
|
void doWork();
|
| 40 |
|
|
}
|
| 41 |
efe3d8fe
|
leszek
|
|
| 42 |
|
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
| 43 |
|
|
|
| 44 |
|
|
private DistortedMaster()
|
| 45 |
|
|
{
|
| 46 |
|
|
|
| 47 |
|
|
}
|
| 48 |
|
|
|
| 49 |
|
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
| 50 |
|
|
|
| 51 |
|
|
static boolean toDo()
|
| 52 |
|
|
{
|
| 53 |
86d322b5
|
Leszek Koltunski
|
Slave slave;
|
| 54 |
efe3d8fe
|
leszek
|
int num = mSlaves.size();
|
| 55 |
|
|
|
| 56 |
|
|
for(int i=0; i<num; i++)
|
| 57 |
|
|
{
|
| 58 |
|
|
slave = mSlaves.remove(0);
|
| 59 |
|
|
slave.doWork();
|
| 60 |
|
|
}
|
| 61 |
|
|
|
| 62 |
|
|
return ( num>0 );
|
| 63 |
|
|
}
|
| 64 |
|
|
|
| 65 |
|
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
| 66 |
13981586
|
Leszek Koltunski
|
|
| 67 |
86d322b5
|
Leszek Koltunski
|
public static void newSlave(Slave s)
|
| 68 |
efe3d8fe
|
leszek
|
{
|
| 69 |
|
|
int num = mSlaves.size();
|
| 70 |
|
|
boolean found = false;
|
| 71 |
86d322b5
|
Leszek Koltunski
|
Slave tmp;
|
| 72 |
efe3d8fe
|
leszek
|
|
| 73 |
|
|
for(int i=0; i<num; i++)
|
| 74 |
|
|
{
|
| 75 |
|
|
tmp = mSlaves.get(i);
|
| 76 |
|
|
|
| 77 |
|
|
if( tmp==s )
|
| 78 |
|
|
{
|
| 79 |
|
|
found = true;
|
| 80 |
|
|
break;
|
| 81 |
|
|
}
|
| 82 |
|
|
}
|
| 83 |
|
|
|
| 84 |
|
|
if( !found ) mSlaves.add(s);
|
| 85 |
|
|
}
|
| 86 |
|
|
|
| 87 |
be60d4ff
|
leszek
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
| 88 |
040cd18c
|
Leszek Koltunski
|
// Can make this logarithmic but the typical number of children is very small anyway.
|
| 89 |
|
|
//
|
| 90 |
|
|
// We want to keep same buckets next to each other, while avoiding changes in order of the children
|
| 91 |
|
|
// (if possible!) We want to keep bucket=0 (i.e. the non-postprocessed children) at the beginning.
|
| 92 |
be60d4ff
|
leszek
|
|
| 93 |
040cd18c
|
Leszek Koltunski
|
static void addSortingByBuckets(ArrayList<DistortedNode> mChildren, DistortedNode newChild)
|
| 94 |
be60d4ff
|
leszek
|
{
|
| 95 |
|
|
int i,num = mChildren.size();
|
| 96 |
70b6a155
|
Leszek Koltunski
|
long bucket = newChild.getPostprocessQueue().getID();
|
| 97 |
040cd18c
|
Leszek Koltunski
|
boolean sameBucket = false;
|
| 98 |
be60d4ff
|
leszek
|
|
| 99 |
|
|
for(i=0; i<num; i++)
|
| 100 |
|
|
{
|
| 101 |
040cd18c
|
Leszek Koltunski
|
if( mChildren.get(i).getPostprocessQueue().getID() == bucket )
|
| 102 |
|
|
{
|
| 103 |
|
|
sameBucket=true;
|
| 104 |
|
|
}
|
| 105 |
|
|
else if( sameBucket || bucket==0 )
|
| 106 |
|
|
{
|
| 107 |
|
|
break;
|
| 108 |
|
|
}
|
| 109 |
be60d4ff
|
leszek
|
}
|
| 110 |
|
|
|
| 111 |
|
|
mChildren.add(i,newChild);
|
| 112 |
|
|
|
| 113 |
70b6a155
|
Leszek Koltunski
|
//android.util.Log.e("newChild", "newBucket="+bucket+" new child at "+i+" total num ="+num);
|
| 114 |
be60d4ff
|
leszek
|
}
|
| 115 |
|
|
|
| 116 |
efe3d8fe
|
leszek
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
| 117 |
|
|
|
| 118 |
|
|
static void onDestroy()
|
| 119 |
|
|
{
|
| 120 |
|
|
mSlaves.clear();
|
| 121 |
|
|
}
|
| 122 |
c204c69d
|
leszek
|
}
|