(d, count)
| 6637 | |
| 6638 | //Initialize iterative loop queue |
| 6639 | function iterInit(d, count) { |
| 6640 | var levels = (8 * bits.log2(count+1) * (d+1))|0 |
| 6641 | var maxInts = bits.nextPow2(IFRAME_SIZE*levels) |
| 6642 | if(BOX_ISTACK.length < maxInts) { |
| 6643 | pool.free(BOX_ISTACK) |
| 6644 | BOX_ISTACK = pool.mallocInt32(maxInts) |
| 6645 | } |
| 6646 | var maxDoubles = bits.nextPow2(DFRAME_SIZE*levels) |
| 6647 | if(BOX_DSTACK.length < maxDoubles) { |
| 6648 | pool.free(BOX_DSTACK) |
| 6649 | BOX_DSTACK = pool.mallocDouble(maxDoubles) |
| 6650 | } |
| 6651 | } |
| 6652 | |
| 6653 | //Append item to queue |
| 6654 | function iterPush(ptr, |
no outgoing calls
no test coverage detected
searching dependent graphs…