javascript - Webgl Angle loops really slow -

-

i have here glsl, , works charm. compiling taking 3 minutes or something. know due angle, angle piece of software converts opengl es 2.0 code directx 9 webgl on windows systems. if disable angle, compiles in second. know's why nested loops soo slow in angle. , if there work around? mean can't let wait more minute per shader.

for ( int b = 0; b < numberofsplitpoints; b++ ) {     if ( cameradepth > splitpoints[b] && cameradepth < splitpoints[b+1] ) {         const float numberofsplitpoints = float( number_of_split_points - 1 );         vec4 projcoords = v_projtexturecoords[b];          projcoords /= projcoords.w;         projcoords = 0.5 * projcoords + 0.5;          float shadowdepth = projcoords.z;          projcoords.x /= numberofsplitpoints;         projcoords.x += float(b) / numberofsplitpoints;           for( int x = 0; x < fullkernelsize; x++ ) {             for( int y = 0; y < fullkernelsize; y++ ) {                 vec2 pointer = vec2( float(x-kernelsize) / 3072.0, float(y-kernelsize) / 1024.0 );                 float convolution = kernel[x] * kernel[y];                 vec4 color = texture2d(shadowmapsampler, projcoords.xy+pointer);                  if(encodedepth( color ) + shadowbias > shadowdepth) {                     light += convolution;                 } else {                     light += convolution * 0.6;                 }             }         }      } }  vec2 random = normalize(texture2d(randomsampler, screensize * uv / 64.0).xy * 2.0 - 1.0); float ambiantamount = 0.0;  const int kernel = 4;  float offset = ssoasamplerad / depth;   for(int x = 0; x<kernel; x++) {      vec2  = reflect(directions[x], random) * offset;      vec2 b  = vec2( a.x *0.707 - a.y*0.707,                      a.x*0.707 + a.y*0.707 );      ambiantamount += abientocclusion(uv, a*0.25, position, normal);     ambiantamount += abientocclusion(uv, b*0.50, position, normal);     ambiantamount += abientocclusion(uv, a*0.75, position, normal);     ambiantamount += abientocclusion(uv, b, position, normal); }

the glsl es not define while loops , "dynamically" bounded loops mandatory. angle takes advantage of , extensive loop unrolling: if have for ( int b = 0; b < numberofsplitpoints; b++ ), numberofsplitpoints has constant expression, otherwise shader won't compile.

the loop unrolling supposed allow native shader optimizer more optimizations , minimize divergence, (in code) if have numberofsplitpoints , fullkernelsize large, unrolled code can long (code in inner-most part repeated numberofsplitpoints*fullkernelsize*fullkernelsize times), may cause optimizer , compiler go sorts of trouble.


Comments

Post a Comment

Popular posts from this blog

c# - SVN Error : "svnadmin: E205000: Too many arguments" -

-
i trying reposotries using c# code process svncommand = null; var psi = new processstartinfo("svnadmin"); psi.redirectstandardoutput = true; psi.redirectstandarderror = true; psi.useshellexecute = false; psi.arguments= @"dump c:\repositories\myrepo > c:\temp\myrepodumpfile.dump"; using (svncommand = process.start(psi)) { var myoutput = svncommand.standardoutput; var myerror = svncommand.standarderror; debug.write("output :" + environment.newline + environment.newline + myoutput.readtoend() + environment.newline + "error :" + environment.newline + environment.newline + myerror.readtoend()); svncommand.close(); } when use dump command commandline svnadmin dump c:\repositories\myrepo > c:\temp\myrepodumpfile.dump it works fine when try ...
Read more

c++ - Using OpenSSL in a multi-threaded application -

-
i have been writing soap client application in c++ on ubuntu using openssl https transport , pthreads threading. have number of threads - 1 central data acquisition thread periodically gets worker threads make soap requests via shared mutex protected queues. reading documentation openssl found is openssl thread-safe? in openssl faq describes mechanisms required ensure thread safety when using openssl. implemented , works fine. the reason question conceptual difficulty really. thinking implementing same functionality application has already, instead of using threads, create 2 seperate applications : 1 worker thread (of multiple copies running) , main data acquisition thread. use tcp sockets communicate between 2 rather mutex protected queues. may bad idea not important - confusing me would have implement same functions required ensure openssl thread safety in second approach or not? my guess not have , treated independent (indeed surely must many applications use openssl) re...
Read more

All overlapping substrings matching a java regex -

-
is there api method returns (possibly overlapping) substrings match regular expression? for example, have text string: string t = 04/31 412-555-1235; , , have pattern: pattern p = new pattern("\\d\\d+"); matches strings of 2 or more characters. the matches are: 04, 31, 412, 555, 1235. how overlapping matches? i want code return: 04, 31, 41, 412, 12, 55, 555, 55, 12, 123, 1235, 23, 235, 35. theoretically should possible -- there obvious o(n^2) algorithm enumerates , checks substrings against pattern. edit rather enumerating substrings, safer use region(int start, int end) method in matcher . checking pattern against separate, extracted substring might change result of match (e.g. if there non-capturing group or word boundary check @ start/end of pattern). edit 2 actually, it's unclear whether region() expect zero-width matches. specification vague, , experiments yield disappointing results. for example: string line = "xx90xx"; strin...
Read more