/INFOMOV/ Optimization & Vectorization. J. Bikker - Sep-Nov Lecture 12: Snippets. Welcome!

Size: px

Start display at page:

Download "/INFOMOV/ Optimization & Vectorization. J. Bikker - Sep-Nov Lecture 12: Snippets. Welcome!"

Elmer Robbins
6 years ago
Views:

1 /INFOMOV/ Optimization & Vectorization J. Bikker - Sep-Nov Lecture 12: Snippets Welcome!

2 Today s Agenda: Self-modifying code Blind stupidity Of square roots and sorting Madness

3 INFOMOV Lecture 12 Snippets 3 Self-modifying Fast Polygons on Limited Hardware Typical span rendering code: for( int i = 0; i < len; i++ ) *a++ = texture[u,v]; u += du; v += dv; } How do we make this faster? Every cycle counts Loop unrolling Two pixels at a time

4 INFOMOV Lecture 12 Snippets 4 Self-modifying Fast Polygons on Limited Hardware How about switch (len) case 8: *a++ = tex[u,v]; u+=du; v+=dv; case 7: *a++ = tex[u,v]; u+=du; v+=dv; case 6: *a++ = tex[u,v]; u+=du; v+=dv; case 5: *a++ = tex[u,v]; u+=du; v+=dv; case 4: *a++ = tex[u,v]; u+=du; v+=dv; case 3: *a++ = tex[u,v]; u+=du; v+=dv; case 2: *a++ = tex[u,v]; u+=du; v+=dv; case 1: *a++ = tex[u,v]; u+=du; v+=dv; }

5 INFOMOV Lecture 12 Snippets 5 Self-modifying Fast Polygons on Limited Hardware What if a massive unroll isn t an option, but we have only 4 registers? for( int i = 0; i < len; i++ ) *a++ = texture[u,v]; u += du, v += dv; } Registers: i, a, u, v, du, dv, len }. Idea: just before entering the loop, replace len by the correct constant in the code; replace du and dv by the correct constant. Our code is now self-modifying.

(future) target) L1 instruction cache (handles reads only) code

6 INFOMOV Lecture 12 Snippets 6 Self-modifying Self-modifying Code Good reasons for not writing SMC: the CPU pipeline (mind every potential (future) target) L1 instruction cache (handles reads only) code readability Good reasons for writing SMC: code readability genetic code optimization

INFOMOV Lecture 12 Snippets 7 Self-modifying Hardware Evolution* Experiment: take 100 FPGA s, load them with random programs, max 100 logic gates test each chip s ability to

NASA s evolved antenna** Observations: 1. The chip used only 37 logic gates, of which 5 disconnected from the rest. 2.

7 INFOMOV Lecture 12 Snippets 7 Self-modifying Hardware Evolution* Experiment: take 100 FPGA s, load them with random programs, max 100 logic gates test each chip s ability to differentiate between two audio tones use the best candidates to produce the next generation. Outcome (generation 4000): one chip capable of the intended task. NASA s evolved antenna** Observations: 1. The chip used only 37 logic gates, of which 5 disconnected from the rest. 2. The 5 disconnected gates where vital to the function of the chip. 3. The program could not be transferred to another chip. *: On the Origin of Circuits, Alan Bellows, 2007, **: Evolved antenna, Wikipedia.

8 Today s Agenda: Self-modifying code Blind stupidity Of square roots and sorting Madness

9 INFOMOV Lecture 12 Snippets 9 Application DotCloud Application breakdown, Tick: t.reset(); Transform(); elapsed1 = t.elapsed(); t.reset(); Sort(); elapsed2 = t.elapsed(); t.reset(); Render(); elapsed3 = t.elapsed(); Transform: for ( int i = 0; i < DOTS; i++ ) m_rotated[i] = m.transform( m_points[i] ); Sort: for ( int i = 0; i < DOTS; i++ ) for ( int j = 0; j < (DOTS - 1); j++ ) if (m_rotated[j].z > m_rotated[j + 1].z) Swap( j, j + 1 ); Render: for ( int i = 0; i < DOTS; i++ ) m_dot->drawscaled( (sx - size / 2), (sy - size / 2), size, size, screen );

10 INFOMOV Lecture 12 Snippets 10 Application DotCloud Application breakdown: Tick Sort Transform Render DrawScaled

11 INFOMOV Lecture 12 Snippets 11 Analysis Performance Analysis & Scalability ms per frame Transform Sort Render Clear ms per dot Transform Sort Render Clear

12 INFOMOV Lecture 12 Snippets 12 Research Solving the Sort Problem Current Sort: bubblesort ( O(N 2 ) ). Alternatives*: Quicksort Heapsort Mergesort Radixsort Insertionsort Selectionsort Monkeysort Countingsort Introsort Shell sort Binary tree sort Library sort Smoothsort Strand sort Cocktail sort Comb sort Block sort Odd-even sort Pigeonhole sort Bucket sort Spread sort Burstsort Flashsort Postman sort Bread sort Bitonic sort Stooge sort * See e.g.:

13 INFOMOV Lecture 12 Snippets 13 Research Solving the Sort Problem Current Sort: bubblesort ( O(N 2 ) ). Best case: O(N). Which case do we have here? Factors: Size of set Already sorted / almost sorted? Distributed (even / uneven) Type of data (just key / full records) Key type (float / int / string) How much effort should we spend on this? For small sets, sorting takes far less time than rendering Anything that is not O(N 2 ) will probably be fine. Would be nice if we can find something that fits well in the current code (safe time for other optimizations).

14 INFOMOV Lecture 12 Snippets 14 High-level Solving the Sort Problem Current Sort: bubblesort ( O(N 2 ) ). Alternative: QuickSort ( O( N log N ) ). void Swap( float3& a, float3& b ) float3 t = a; a = b; b = t; } int Pivot( float3 a[], int first, int last ) int p = first; float3 e = a[first]; for( int i = first + 1; i <= last; i++ ) if (a[i].z <= e.z) Swap( a[i], a[++p] ); Swap( a[p], a[first] ); return p; } void QuickSort( float3 a[], int first, int last) int pivotelement; if (first >= last) return; pivotelement = Pivot( a, first, last ); QuickSort( a, first, pivotelement - 1 ); QuickSort( a, pivotelement + 1, last ); }

15 INFOMOV Lecture 12 Snippets 15 Profile Repeated Profiling bubblesort Transform Sort (bubble) Sort (quick) Render Clear Note: Clear is implemented using a loop; a memset is faster for clearing to zero (~0.43).

16 INFOMOV Lecture 12 Snippets 16 Profile Repeated Profiling

17 INFOMOV Lecture 12 Snippets 17 Low-level Low Level Optimization of DrawScaled void Sprite::DrawScaled( float a_x, float a_y, float a_width, float a_height, Surface* a_target ) Pixel* dest = a_target->getbuffer() + (int)a_x + (int)a_y * a_target->getpitch(); Pixel* src = GetBuffer() + m_currentframe * m_width; for ( int y = 0; y < (int)a_height; y++ ) for ( int x = 0; x < (int)a_width; x++ ) int v = (int)((y * m_height) / a_height); int u = (int)((x * m_pitch) / a_width); if (src[u + v * m_pitch] & 0xffffff) *(dest + x + y * a_target->getwidth()) = src[u + v * m_pitch]; } } Functionality: for every pixel of the rectangular target image, find the corresponding source pixel, using interpolation, plot if it s not black.

18 INFOMOV Lecture 12 Snippets 18 Low-level Low Level Optimization of DrawScaled A few basic optimizations: void Sprite::DrawScaled( float a_x, float a_y, float a_width, float a_height, Surface* a_target ) Pixel* dest = a_target->getbuffer() + (int)a_x + (int)a_y * a_target->getpitch(); Pixel* src = GetBuffer() + m_currentframe * m_width; for ( int y = 0; y < (int)a_height; y++ ) int v = (int)((y * m_height) / a_height); for ( int x = 0; x < (int)a_width; x++ ) int u = (int)((x * m_pitch) / a_width); Pixel color = src[u + v * m_pitch] & 0xffffff; if (color) *(dest + x + y * a_target->getwidth()) = color; } } } Loop hoisting (variable v is constant inside x loop) Reading source pixel only once

19 INFOMOV Lecture 12 Snippets 19 Low-level Low Level Optimization of DrawScaled More basic optimizations: void Sprite::DrawScaled( float a_x, float a_y, float a_width, float a_height, Surface* a_target ) Pixel* dest = a_target->getbuffer() + (int)a_x + (int)a_y * a_target->getpitch(); Pixel* src = GetBuffer() + m_currentframe * m_width; float rw = (float)m_width / a_width; float rh = (float)m_height / a_height; int iw = (int)a_width, ih = (int)a_height; } for ( int y = 0; y < ih; y++ ) int v = (int)(y * rh); Pixel* line = dest + y * a_target->getwidth(); for ( int x = 0; x < iw; x++ ) int u = (int)(x * rw); Pixel color = src[u + v * m_width] & 0xffffff; if (color) line[x] = color; } } Precalculate m_height / a_height, m_width / a_width Calculate target address once per line; index using x

20 INFOMOV Lecture 12 Snippets 20 Low-level Low Level Optimization of DrawScaled Fixed point optimization: void Sprite::DrawScaled( int a_x, int a_y, int a_width, int a_height, Surface* a_target ) const int rh = (m_height << 10) / a_height, rw = (m_width << 10) / a_width; Pixel* line = a_target->getbuffer() + a_x + a_y * a_target->getpitch(); for ( int y = 0; y < a_height; y++, line += a_target->getpitch() ) const int v = (y * rh) >> 10; for ( int x = 0; x < a_width; x++ ) const int u = (x * rw) >> 10; const Pixel color = GetBuffer()[u + v * m_pitch]; if (color & 0xffffff) line[x] = color; } } } Fixed point works really well here but doesn t improve performance. Seems we reached the end here

21 INFOMOV Lecture 12 Snippets 21 Blind Stupidity Low Level Optimization of DrawScaled Now what? Plot multiple pixels at a time? How many different ball sizes do we encounter? Why don t we simply precalculate those frames?

22 INFOMOV Lecture 12 Snippets 22 More computing sins are committed in the name of efficiency (without necessarily achieving it) than for any other single reason including blind stupidity. (W.A. Wulff)

23 INFOMOV Lecture 12 Snippets 23 High-level High Level Optimization of DrawScaled Sprite* scaled[64]; void Game::Init()... for( int i = 0; i < 64; i++ ) int size = i + 1; scaled[i] = new Sprite( new Surface( size, size ), 1 ); scaled[i]->getsurface()->clear( 0 ); m_dot->drawscaled( 0, 0, size, size, scaled[i]->getsurface() ); } } scaled[size]->draw( (sx - size / 2), (sy - size / 2), m_surface );

24 INFOMOV Lecture 12 Snippets 24 Profile Repeated Profiling bubblesort Transform Sort Render (old) Render (new)

25 INFOMOV Lecture 12 Snippets 25 Profile What about the compiler? bubblesort Transform Sort Render (vs 13) Render (vs 15) ? 26.30

26 INFOMOV Lecture 12 Snippets 26 Profile What about the compiler? bubblesort Transform Sort Render (vs 13) Render ( 15,32) ? Render ( 15,64)

27 INFOMOV Lecture 12 Snippets 27 Dotting i s Optimization of Dense Clouds Observation: beyond a certain dot count, a large number of particles is occluded. Specifically, we won t be able to see the back half. if (m_rotated[i].z > -0.2f) scaled[size]->draw( (sx - size / 2), (sy - size / 2), screen ); (perhaps we could also limit rendering to the outer shell of the cloud?) Rendering is now significantly faster, and sorting is significant again: At dots, we get 11ms for sorting, 3ms for rendering.

28 INFOMOV Lecture 12 Snippets 28 High-level Sorting in O(1) For this specific situation, we can sort in O(1), e.g., independent of particle count. Observation: dots do not move independently. Intuition: why rotate 64k dots if you can rotate a single camera?

29 INFOMOV Lecture 12 Snippets 29 High-level Sorting in O(1)

30 INFOMOV Lecture 12 Snippets 30 High-level Sorting in O(1)

31 INFOMOV Lecture 12 Snippets 31 High-level Sorting in O(1)

32 INFOMOV Lecture 12 Snippets 32 High-level Sorting in O(1)

33 INFOMOV Lecture 12 Snippets 33 High-level Sorting in O(1)

34 INFOMOV Lecture 12 Snippets 34 High-level Sorting in O(1) For each split: Process nearest half first Then farthest half Recurse Where nearest is the side that the camera is on.

35 INFOMOV Lecture 12 Snippets 37 High-level Optimizing Sphere Cloud - TakeAway Profile High level: bang for the buck Mind blind stupidity The fastest solution is sometimes not doing anything at all

36 Today s Agenda: Self-modifying code Blind stupidity Of square roots and sorting Madness

37 INFOMOV Lecture 12 Snippets 39 Sqrt & Sort Accurate reciprocal square roots 1.0f / sqrtf( 7 ) : / sqrt( 7 ) : _mm_rsqrt_ps( _mm_set1_ps( 7.0f ) ) : Newton iteration: y n+1 = y n(3 xy n 2 ) 2 In SSE: m128 y = _mm_rsqrt_ps( x ); m128 m = _mm_mul_ps( _mm_mul_ps( x, y ), y ); return _mm_mul_ps( _mm_mul_ps( half, y ), _mm_sub_ps( three, m ) );

38 INFOMOV Lecture 12 Snippets 40 Sqrt & Sort idxmask4 = _mm_set1_ps( 0xfffffffc ); idxadd4 = _mm_set_ps( 0, 1, 2, 3 ); void sse_sort( m128& v0 ) Sorting four key/item pairs Sorting three numbers a,b and c: if (a > b) swap( a, b ); if (b > c) swap( b, c ); if (a > b) swap( a, b ); Sorting four numbers a, b, c and d: if (a > c) swap( a, c ); if (b > d) swap( b, d ); if (a > b) swap( a, b ); if (c > d) swap( c, d ); if (b > c) swap( b, c ); } m128 v1, v2, v3, t; v0 = _mm_or_ps(_mm_and_ps( v0, idxmask4 ),idxadd4 ); v1 = _mm_movelh_ps( v1, v0 ), t = v0; v0 = _mm_min_ps( v0, v1 ), v1 = _mm_max_ps( v1, t ); v0 = _mm_movehl_ps( v0, v1 ); v1 = _mm_shuffle_ps( v1, v0, 0x88 ), t = v0; v0 = _mm_min_ps( v0, v1 ), v1 = _mm_max_ps( v1, t ); v2 = _mm_movehl_ps( v2, v1 ), v3 = v0, t = v2; v2 = _mm_min_ps( v2, v3 ), v3 = _mm_max_ps( v3, t ); v0 = _mm_shuffle_ps( _mm_movelh_ps( v1, v3 ), _mm_shuffle_ps( v0, v2, 0x ), 0x2d );

39 Today s Agenda: Self-modifying code Blind stupidity Of square roots and sorting Madness

40 INFOMOV Lecture 12 Snippets 42 Low Level Optimization of Sprite::Draw Pre-scaled sprites are faster than on-the-fly scaling. But, we still have loops, and if-statements, and look-ups. I wonder

41 INFOMOV Lecture 12 Snippets 43 Low Level Optimization of Sprite::Draw Extreme Optimization: We simply generate a function that plots every pixel, without the need for a loop. Side effect: L1 data cache is now used for the screen buffer; L1 instruction cache is used for the sprite data. void Sprite::DrawBall( int x, int y, int size, Surface* target ) uint* a = target->getbuffer() + x + y * SCRWIDTH; switch( size ) case 1: break; case 2: a[1]= ; a[800]= ; a[801]= ; break; case 3: a[801]= ; a[802]= ; a[1601]= ; a[1602]= ; break; case 4: a[2]= ; a[801]= ; a[802]= ; a[803]= ; a[1600]= ; a[1601]= ; a[1602]= ; a[1603]= ; a[2401]= ; a[2402]= ; a[2403]= ; break;

42 INFOMOV Lecture 12 Snippets 44 Low Level Optimization of Sprite::Draw Extreme Optimization: We simply generate a function that plots every pixel, without the need for a loop. FILE* f = fopen( "drawfunc.h", "w" ); fprintf( f, "void Sprite::DrawBall( int x, int y, int size, Surface* target )\n" ); fprintf( f, "\nuint* a = target->getbuffer() + x + y * SCRWIDTH;\nswitch( size )\n\n" ); for( int i = 0; i < 64; i++ )... fprintf( f, "case %i:\n", size ); for( int y = 0; y < size; y++) for( int x = 0; x < size; x++ ) int a = y * SCRWIDTH + x; if (scaled[i]->getbuffer()[x + y * size] & 0xffffff) fprintf( f, "a[%i]=%i;\n", a, scaled[i]->getbuffer()[x + y * size] & 0xffffff ); } fprintf( f, "break;\n" ); } fprintf( f, "}\n}\n" );

43 INFOMOV Lecture 12 Snippets 45 switch( size ) case 1: break; case 2: a[1]= ; a[800]= ; a[801]= ; break; case 3: a[801]= ; a[802]= ; a[1601]= ; a[1602]= ; break; case 4: a[2]= ; a[801]= ; a[802]= ; a[803]= ; a[1600]= ; a[1601]= ; a[1602]= ; a[1603]= ; a[2401]= ; a[2402]= ; a[2403]= ; break; case 5: a[2]=526344; a[3]=526344; a[801]= ; a[802]= ; a[803]= ; a[804]= ; a[1600]=526344; a[1601]= ; a[1602]= ; a[1603]= ; a[1604]= ; a[2400]=526344; a[2401]= ; a[2402]= ; a[2403]= ; a[2404]= ; a[3201]= ; a[3202]= ; a[3203]= ; a[3204]= ; break; case 6: a[3]= ; a[801]= ; a[802]= ; a[803]= ; a[804]= ; a[805]= ; a[1601]= ; a[1602]= ; a[1603]= ; a[1604]= ; a[1605]= ; a[2400]= ; a[2401]= ; a[2402]= ; a[2403]= ; a[2404]= ; a[2405]= ; a[3201]= ; a[3202]= ; a[3203]= ; a[3204]= ; a[3205]= ; a[4001]= ; a[4002]= ; a[4003]= ; a[4004]= ; a[4005]=526344; break; case 7: a[3]= ; a[4]=526344; a[801]=526344; a[802]= ; a[803]= ; a[804]= ; a[805]= ; a[1601]= ; a[1602]= ; a[1603]= ; a[1604]= ; a[1605]= ; a[1606]= ; a[2400]= ; a[2401]= ; a[2402]= ; a[2403]= ; a[2404]= ; a[2405]= ; a[2406]= ; a[3200]=526344; a[3201]= ; a[3202]= ; a[3203]= ; a[3204]= ; a[3205]= ; a[3206]= ; a[4001]= ; a[4002]= ; a[4003]= ; a[4004]= ; a[4005]= ; a[4006]= ; a[4802]= ; a[4803]= ; a[4804]= ; a[4805]= ; break; case 8: a[3]=526344; a[4]= ; a[801]=526344; a[802]= ; a[803]= ; a[804]= ; a[805]= ; a[806]= ; a[1601]= ; a[1602]= ; a[1603]= ; a[1604]= ; a[1605]= ; a[1606]= ; a[1607]= ; a[2400]=526344; a[2401]= ; a[2402]= ; a[2403]= ; a[2404]= ; a[2405]= ; a[2406]= ; a[2407]= ; a[3200]= ; a[3201]= ; a[3202]= ; a[3203]= ; a[3204]= ; a[3205]= ; a[3206]= ; a[3207]= ; a[4001]= ; a[4002]= ; a[4003]= ; a[4004]= ; a[4005]= ; a[4006]= ; a[4007]= ; a[4801]= ; a[4802]= ; a[4803]= ; a[4804]= ; a[4805]= ; a[4806]= ; a[5602]= ; a[5603]= ; a[5604]= ; a[5605]= ; break; case 9: a[4]= ; a[5]= ; a[802]= ; a[803]= ; a[804]= ; a[805]= ; a[806]= ; a[807]= ; a[1601]= ; a[1602]= ; a[1603]= ; a[1604]= ; a[1605]= ; a[1606]= ; a[1607]= ; a[1608]=526344; a[2401]= ; a[2402]= ; a[2403]= ; a[2404]= ; a[2405]= ; a[2406]= ; a[2407]= ; a[2408]= ; a[3200]= ; a[3201]= ; a[3202]= ; a[3203]= ; a[3204]= ; a[3205]= ; a[3206]= ; a[3207]= ; a[3208]= ; a[4000]= ; a[4001]= ; a[4002]= ; a[4003]= ; a[4004]= ; a[4005]= ; a[4006]= ; a[4007]= ; a[4008]= ; a[4801]= ; a[4802]= ; a[4803]= ; a[4804]= ; a[4805]= ; a[4806]= ; a[4807]= ; a[4808]= ; a[5601]= ; a[5602]= ; a[5603]= ; a[5604]= ; a[5605]= ; a[5606]= ; a[5607]= ; a[6402]=526344; a[6403]= ; a[6404]= ; a[6405]= ; a[6406]= ; break; case 10: a[4]=526344; a[5]= ; a[6]=526344; a[802]= ; a[803]= ; a[804]= ; a[805]= ; a[806]= ; a[807]= ; a[808]=526344; a[1601]= ; a[1602]= ; a[1603]= ; a[1604]= ; a[1605]= ; a[1606]= ; a[1607]= ; a[1608]= ; a[2401]= ; a[2402]= ; a[2403]= ; a[2404]= ; a[2405]= ; a[2406]= ; a[2407]= ; a[2408]= ; a[2409]= ; a[3200]=526344; a[3201]= ; a[3202]= ; a[3203]= ; a[3204]= ; a[3205]= ; a[3206]= ; a[3207]= ; a[3208]= ; a[3209]= ; a[4000]= ; a[4001]= ; a[4002]= ; a[4003]= ; a[4004]= ; a[4005]= ; a[4006]= ; a[4007]= ; a[4008]= ; a[4009]= ; a[4800]=526344; a[4801]= ; a[4802]= ; a[4803]= ; a[4804]= ; a[4805]= ; a[4806]= ; a[4807]= ; a[4808]= ; a[4809]= ; a[5601]= ; a[5602]= ; a[5603]= ; a[5604]= ; a[5605]= ; a[5606]= ; a[5607]= ; a[5608]= ; a[5609]= ; a[6401]=526344; a[6402]= ; a[6403]= ; a[6404]= ; a[6405]= ; a[6406]= ; a[6407]= ; a[6408]= ; a[7203]= ; a[7204]= ; a[7205]= ; a[7206]= ; a[7207]= ; break; case 11: a[4]=526344; a[5]= ; a[6]= ; a[803]= ; a[804]= ; a[805]= ; a[806]= ; a[807]= ; a[808]=526344; a[1602]= ; a[1603]= ; a[1604]= ; a[1605]= ; a[1606]= ; a[1607]= ; a[1608]= ; a[1609]= ; a[2401]= ; a[2402]= ; a[2403]= ; a[2404]= ; a[2405]= ; a[2406]= ; a[2407]= ; a[2408]= ; a[2409]= ; a[2410]=526344; a[3200]=526344; a[3201]= ; a[3202]= ; a[3203]= ; a[3204]= ; a[3205]= ; a[3206]= ; a[3207]= ; a[3208]= ; a[3209]= ; a[3210]= ; a[4000]= ; a[4001]= ; a[4002]= ; a[4003]= ; a[4004]= ; a[4005]= ; a[4006]= ; a[4007]= ; a[4008]= ; a[4009]= ; a[4010]= ; a[4800]= ; a[4801]= ; a[4802]= ; a[4803]= ; a[4804]= ; a[4805]= ; a[4806]= ; a[4807]= ; a[4808]= ; a[4809]= ; a[4810]= ; a[5601]= ; a[5602]= ; a[5603]= ; a[5604]= ; a[5605]= ; a[5606]= ; a[5607]= ; a[5608]= ; a[5609]= ; a[5610]= ; a[6401]=526344; a[6402]= ; a[6403]= ; a[6404]= ; a[6405]= ; a[6406]= ; a[6407]= ; a[6408]= ; a[6409]= ; a[7202]= ; a[7203]= ; a[7204]= ; a[7205]= ; a[7206]= ; a[7207]= ; a[7208]= ; a[7209]=526344; a[8003]=526344; a[8004]= ; a[8005]= ; a[8006]= ; a[8007]= ; break; case 12: a[5]= ; a[6]= ; a[7]=526344; a[803]= ; a[804]= ; a[805]= ; a[806]= ; a[807]= ; a[808]= ; a[1602]= ; a[1603]= ; a[1604]= ; a[1605]= ; a[1606]= ; a[1607]= ; a[1608]= ; a[1609]= ; a[1610]= ; a[2401]= ; a[2402]= ; a[2403]= ; a[2404]= ; a[2405]= ; a[2406]= ; a[2407]= ; a[2408]= ; a[2409]= ; a[2410]= ; a[2411]=526344; a[3201]= ; a[3202]= ; a[3203]= ; a[3204]= ; a[3205]= ; a[3206]= ; a[3207]= ; a[3208]= ; a[3209]= ; a[3210]= ; a[3211]= ; a[4000]= ; a[4001]= ; a[4002]= ; a[4003]= ; a[4004]= ; a[4005]= ; a[4006]= ; a[4007]= ; a[4008]= ; a[4009]= ; a[4010]= ; a[4011]= ; a[4800]= ; a[4801]= ; a[4802]= ; a[4803]= ; a[4804]= ; a[4805]= ; a[4806]= ; a[4807]= ; a[4808]= ; a[4809]= ; a[4810]= ; a[4811]= ; a[5600]=526344; a[5601]= ; a[5602]= ; a[5603]= ; a[5604]= ; a[5605]= ; a[5606]= ; a[5607]= ; a[5608]= ; a[5609]= ; a[5610]= ; a[5611]= ; a[6401]= ; a[6402]= ; a[6403]= ; a[6404]= ; a[6405]= ; a[6406]= ; a[6407]= ; a[6408]= ; a[6409]= ; a[6410]= ; a[6411]=526344; a[7202]= ; a[7203]= ; a[7204]= ; a[7205]= ; a[7206]= ; a[7207]= ; a[7208]= ; a[7209]= ; a[7210]= ; a[8002]= ; a[8003]= ; a[8004]= ; a[8005]= ; a[8006]= ; a[8007]= ; a[8008]= ; a[8009]= ; a[8010]=526344; a[8803]=526344; a[8804]= ; a[8805]= ; a[8806]= ; a[8807]= ; a[8808]=526344; break; case 13: a[5]=526344; a[6]= ; a[7]= ; a[8]=526344; a[803]=526344; a[804]= ; a[805]= ; a[806]= ; a[807]= ; a[808]= ; a[809]= ; a[1602]=526344; a[1603]= ; a[1604]= ; a[1605]= ; a[1606]= ; a[1607]= ; a[1608]= ; a[1609]= ; a[1610]= ; a[2401]=526344; a[2402]= ; a[2403]= ; a[2404]= ; a[2405]= ; a[2406]= ; a[2407]= ; a[2408]= ; a[2409]= ; a[2410]= ; a[2411]= ; a[3201]= ; a[3202]= ; a[3203]= ; a[3204]= ; a[3205]= ; a[3206]= ; a[3207]= ; a[3208]= ; a[3209]= ; a[3210]= ; a[3211]= ; a[3212]=526344; a[4000]=526344; a[4001]= ; a[4002]= ; a[4003]= ; a[4004]= ; a[4005]= ; a[4006]= ; a[4007]= ; a[4008]= ; a[4009]= ; a[4010]= ; a[4011]= ; a[4012]= ; a[4800]= ; a[4801]= ; a[4802]= ; a[4803]= ; a[4804]= ; a[4805]= ; a[4806]= ; a[4807]= ; a[4808]= ; a[4809]= ; a[4810]= ; a[4811]= ; a[4812]= ; a[5600]= ; a[5601]= ; a[5602]= ; a[5603]= ; a[5604]= ; a[5605]= ; a[5606]= ; a[5607]= ; a[5608]= ; a[5609]= ; a[5610]= ; a[5611]= ; a[5612]= ; a[6400]=526344; a[6401]= ; a[6402]= ; a[6403]= ; a[6404]= ; a[6405]= ; a[6406]= ; a[6407]= ; a[6408]= ; a[6409]= ; a[6410]= ; a[6411]= ; a[6412]= ; a[7201]= ; a[7202]= ; a[7203]= ; a[7204]= ; a[7205]= ; a[7206]= ; a[7207]= ; a[7208]= ; a[7209]= ; a[7210]= ; a[7211]= ; a[7212]=526344; a[8002]= ; a[8003]= ; a[8004]= ; a[8005]= ; a[8006]= ; a[8007]= ; a[8008]= ; a[8009]= ; a[8010]= ; a[8011]= ; a[8803]= ; a[8804]= ; a[8805]= ; a[8806]= ; a[8807]= ; a[8808]= ; a[8809]= ; a[8810]= ; a[9604]=526344; a[9605]= ; a[9606]= ; a[9607]= ; a[9608]= ; a[9609]=526344; break; case 14: a[5]=526344; a[6]= ; a[7]= ; a[8]=526344; a[804]= ; a[805]= ; a[806]= ; a[807]= ; a[808]= ; a[809]= ; a[810]= ; a[1602]=526344; a[1603]= ; a[1604]= ; a[1605]= ; a[1606]= ; a[1607]= ; a[1608]= ; a[1609]= ; a[1610]= ; a[1611]= ; a[2402]= ; a[2403]= ; a[2404]= ; a[2405]= ; a[2406]= ; a[2407]= ; a[2408]= ; a[2409]= ; a[2410]= ; a[2411]= ; a[2412]= ; a[3201]= ; a[3202]= ; a[3203]= ; a[3204]= ; a[3205]= ; a[3206]= ; a[3207]= ; a[3208]= ; a[3209]= ; a[3210]= ; a[3211]= ; a[3212]= ; a[3213]=526344; a[4000]=526344; a[4001]= ; a[4002]= ; a[4003]= ; a[4004]= ; a[4005]= ; a[4006]= ; a[4007]= ; a[4008]= ; a[4009]= ; a[4010]= ; a[4011]= ; a[4012]= ; a[4013]= ; a[4800]= ; a[4801]= ; a[4802]= ; a[4803]= ; a[4804]= ; a[4805]= ; a[4806]= ; a[4807]= ; a[4808]= ; a[4809]= ; a[4810]= ; a[4811]= ; a[4812]= ; a[4813]= ; a[5600]= ; a[5601]= ; a[5602]= ; a[5603]= ; a[5604]= ; a[5605]= ; a[5606]= ; a[5607]= ; a[5608]= ; a[5609]= ; a[5610]= ; a[5611]= ; a[5612]= ; a[5613]= ; a[6400]=526344; a[6401]= ; a[6402]= ; a[6403]= ; a[6404]= ; a[6405]= ; a[6406]= ; a[6407]= ; a[6408]= ; a[6409]= ; a[6410]= ; a[6411]= ; a[6412]= ; a[6413]= ; a[7201]= ; a[7202]= ; a[7203]= ; a[7204]= ; a[7205]= ; a[7206]= ; a[7207]= ; a[7208]= ; a[7209]= ; a[7210]= ; a[7211]= ; a[7212]= ; a[7213]= ; a[8001]= ; a[8002]= ; a[8003]= ; a[8004]= ; a[8005]= ; a[8006]= ; a[8007]= ; a[8008]= ; a[8009]= ; a[8010]= ; a[8011]= ; a[8012]= ; a[8013]=526344; a[8802]= ; a[8803]= ; a[8804]= ; a[8805]= ; a[8806]= ; a[8807]= ; a[8808]= ; a[8809]= ; a[8810]= ; a[8811]= ; a[8812]=526344; a[9603]= ; a[9604]= ; a[9605]= ; a[9606]= ; a[9607]= ; a[9608]= ; a[9609]= ; a[9610]= ; a[9611]=526344; a[10404]=526344; a[10405]= ; a[10406]= ; a[10407]= ; a[10408]= ; a[10409]= ; a[10410]=526344; break; case 15: a[6]=526344; a[7]= ; a[8]= ; a[9]=526344; a[804]= ; a[805]= ; a[806]= ; a[807]= ; a[808]= ; a[809]= ; a[810]= ; a[811]=526344; a[1602]=526344; a[1603]= ; a[1604]= ; a[1605]= ; a[1606]= ; a[1607]= ; a[1608]= ; a[1609]= ; a[1610]= ; a[1611]= ; a[1612]= ; a[2402]= ; a[2403]= ; a[2404]= ; a[2405]= ; a[2406]= ; a[2407]= ; a[2408]= ; a[2409]= ; a[2410]= ; a[2411]= ; a[2412]= ; a[2413]= ; a[3201]= ; a[3202]= ; a[3203]= ; a[3204]= ; a[3205]= ; a[3206]= ; a[3207]= ; a[3208]= ; a[3209]= ; a[3210]= ; a[3211]= ; a[3212]= ; a[3213]= ; a[3214]=526344; a[4001]= ; a[4002]= ; a[4003]= ; a[4004]= ; a[4005]= ; a[4006]= ; a[4007]= ; a[4008]= ; a[4009]= ; a[4010]= ; a[4011]= ; a[4012]= ; a[4013]= ; a[4014]= ; a[4800]=526344; a[4801]= ; a[4802]= ; a[4803]= ; a[4804]= ; a[4805]= ; a[4806]= ; a[4807]= ; a[4808]= ; a[4809]= ; a[4810]= ; a[4811]= ; a[4812]= ; a[4813]= ; a[4814]= ; a[5600]= ; a[5601]= ; a[5602]= ; a[5603]= ; a[5604]= ; a[5605]= ; a[5606]= ; a[5607]= ; a[5608]= ; a[5609]= ; a[5610]= ; a[5611]= ; a[5612]= ; a[5613]= ; a[5614]= ; a[6400]= ; a[6401]= ; a[6402]= ; a[6403]= ; a[6404]= ; a[6405]= ; a[6406]= ; a[6407]= ; a[6408]= ; a[6409]= ; a[6410]= ; a[6411]= ; a[6412]= ; a[6413]= ; a[6414]= ; a[7200]=526344; a[7201]= ; a[7202]= ; a[7203]= ; a[7204]= ; a[7205]= ; a[7206]= ; a[7207]= ; a[7208]= ; a[7209]= ; a[7210]= ; a[7211]= ; a[7212]= ; a[7213]= ; a[7214]= ; a[8001]= ; a[8002]= ; a[8003]= ; a[8004]= ; a[8005]= ; a[8006]= ; a[8007]= ; a[8008]= ; a[8009]= ; a[8010]= ; a[8011]= ; a[8012]= ; a[8013]= ; a[8014]=526344; a[8801]=526344; a[8802]= ; a[8803]= ; a[8804]= ; a[8805]= ; a[8806]= ; a[8807]= ; a[8808]= ; a[8809]= ; a[8810]= ; a[8811]= ; a[8812]= ; a[8813]= ; a[9602]= ; a[9603]= ; a[9604]= ; a[9605]= ; a[9606]= ; a[9607]= ; a[9608]= ; a[9609]= ; a[9610]= ; a[9611]= ; a[9612]= ; a[9613]=526344; a[10403]= ; a[10404]= ; a[10405]= ; a[10406]= ; a[10407]= ; a[10408]= ; a[10409]= ; a[10410]= ; a[10411]= ; a[10412]=526344; a[11204]=526344; a[11205]= ; a[11206]= ; a[11207]= ; a[11208]= ; a[11209]= ; a[11210]=526344; break; case 16: a[6]=526344; a[7]= ; a[8]= ; a[9]=526344; a[804]= ; a[805]= ; a[806]= ; a[807]= ; a[808]= ; a[809]= ; a[810]= ; a[811]= ; a[1602]=526344; a[1603]= ; a[1604]= ; a[1605]= ; a[1606]= ; a[1607]= ; a[1608]= ; a[1609]= ; a[1610]= ; a[1611]= ; a[1612]= ; a[1613]=526344; a[2402]= ; a[2403]= ; a[2404]= ; a[2405]= ; a[2406]= ; a[2407]= ; a[2408]= ; a[2409]= ; a[2410]= ; a[2411]= ; a[2412]= ; a[2413]= ; a[3201]= ; a[3202]= ; a[3203]= ; a[3204]= ; a[3205]= ; a[3206]= ; a[3207]= ; a[3208]= ; a[3209]= ; a[3210]= ; a[3211]= ; a[3212]= ; a[3213]= ; a[3214]= ; a[4001]= ; a[4002]= ; a[4003]= ; a[4004]= ; a[4005]= ; a[4006]= ; a[4007]= ; a[4008]= ; a[4009]= ; a[4010]= ; a[4011]= ; a[4012]= ; a[4013]= ; a[4014]= ; a[4800]=526344; a[4801]= ; a[4802]= ; a[4803]= ; a[4804]= ; a[4805]= ; a[4806]= ; a[4807]= ; a[4808]= ; a[4809]= ; a[4810]= ; a[4811]= ; a[4812]= ; a[4813]= ; a[4814]= ; a[4815]=526344; a[5600]= ; a[5601]= ; a[5602]= ; a[5603]= ; a[5604]= ; a[5605]= ; a[5606]= ; a[5607]= ; a[5608]= ; a[5609]= ; a[5610]= ; a[5611]= ; a[5612]= ; a[5613]= ; a[5614]= ; a[5615]= ; a[6400]= ; a[6401]= ; a[6402]= ; a[6403]= ; a[6404]= ; a[6405]= ; a[6406]= ; a[6407]= ; a[6408]= ; a[6409]= ; a[6410]= ; a[6411]= ; a[6412]= ; a[6413]= ; a[6414]= ; a[6415]= ; a[7200]=526344; a[7201]= ; a[7202]= ; a[7203]= ; a[7204]= ; a[7205]= ; a[7206]= ; a[7207]= ; a[7208]= ; a[7209]= ; a[7210]= ; a[7211]= ; a[7212]= ; a[7213]= ; a[7214]= ; a[7215]=526344; a[8001]= ; a[8002]= ; a[8003]= ; a[8004]= ; a[8005]= ; a[8006]= ; a[8007]= ; a[8008]= ; a[8009]= ; a[8010]= ; a[8011]= ; a[8012]= ; a[8013]= ; a[8014]= ; a[8801]= ; a[8802]= ; a[8803]= ; a[8804]= ; a[8805]= ; a[8806]= ; a[8807]= ; a[8808]= ; a[8809]= ; a[8810]= ; a[8811]= ; a[8812]= ; a[8813]= ; a[8814]= ; a[9602]= ; a[9603]= ; a[9604]= ; a[9605]= ; a[9606]= ; a[9607]= ; a[9608]= ; a[9609]= ; a[9610]= ; a[9611]= ; a[9612]= ; a[9613]= ; a[10402]=526344; a[10403]= ; a[10404]= ; a[10405]= ; a[10406]= ; a[10407]= ; a[10408]= ; a[10409]= ; a[10410]= ; a[10411]= ; a[10412]= ; a[10413]=526344; a[11204]= ; a[11205]= ; a[11206]= ; a[11207]= ; a[11208]= ; a[11209]= ; a[11210]= ; a[11211]= ; a[12006]=526344; a[12007]= ; a[12008]= ; a[12009]=526344; break; case 17: a[6]=526344; a[7]= ; a[8]= ; a[9]= ; a[10]=526344; a[805]=526344; a[806]= ; a[807]= ; a[808]= ; a[809]= ; a[810]= ; a[811]= ; a[812]=526344; a[1603]=526344; a[1604]= ; a[1605]= ; a[1606]= ; a[1607]= ; a[1608]= ; a[1609]= ; a[1610]= ; a[1611]= ; a[1612]= ; a[1613]= ; a[2402]=526344; a[2403]= ; a[2404]= ; a[2405]= ; a[2406]= ; a[2407]= ; a[2408]= ; a[2409]= ; a[2410]= ; a[2411]= ; a[2412]= ; a[2413]= ; a[2414]= ; a[3202]= ; a[3203]= ; a[3204]= ; a[3205]= ; a[3206]= ; a[3207]= ; a[3208]= ; a[3209]= ; a[3210]= ; a[3211]= ; a[3212]= ; a[3213]= ; a[3214]= ; a[3215]=526344; a[4001]=526344; a[4002]= ; a[4003]= ; a[4004]= ; a[4005]= ; a[4006]= ; a[4007]= ; a[4008]= ; a[4009]= ; a[4010]= ; a[4011]= ; a[4012]= ; a[4013]= ; a[4014]= ; a[4015]= ; a[4800]=526344; a[4801]= ; a[4802]= ; a[4803]= ; a[4804]= ; a[4805]= ; a[4806]= ; a[4807]= ; a[4808]= ; a[4809]= ; a[4810]= ; a[4811]= ; a[4812]= ; a[4813]= ; a[4814]= ; a[4815]= ; a[4816]=526344; a[5600]= ; a[5601]= ; a[5602]= ; a[5603]= ; a[5604]= ; a[5605]= ; a[5606]= ; a[5607]= ; a[5608]= ; a[5609]= ; a[5610]= ; a[5611]= ; a[5612]= ; a[5613]= ; a[5614]= ; a[5615]= ; a[5616]= ; a[6400]= ; a[6401]= ; a[6402]= ; a[6403]= ; a[6404]= ; a[6405]= ; a[6406]= ; a[6407]= ; a[6408]= ; a[6409]= ; a[6410]= ; a[6411]= ; a[6412]= ; a[6413]= ; a[6414]= ; a[6415]= ; a[6416]= ; a[7200]= ; a[7201]= ; a[7202]= ; a[7203]= ; a[7204]= ; a[7205]= ; a[7206]= ; a[7207]= ; a[7208]= ; a[7209]= ; a[7210]= ; a[7211]= ; a[7212]= ; a[7213]= ; a[7214]= ; a[7215]= ; a[7216]= ; a[8000]=526344; a[8001]= ; a[8002]= ; a[8003]= ; a[8004]= ; a[8005]= ; a[8006]= ; a[8007]= ; a[8008]= ; a[8009]= ; a[8010]= ; a[8011]= ; a[8012]= ; a[8013]= ; a[8014]= ; a[8015]= ; a[8016]=526344; a[8801]= ; a[8802]= ; a[8803]= ; a[8804]= ; a[8805]= ; a[8806]= ; a[8807]= ; a[8808]= ; a[8809]= ; a[8810]= ; a[8811]= ; a[8812]= ; a[8813]= ; a[8814]= ; a[8815]= ; a[9601]=526344; a[9602]= ; a[9603]= ; a[9604]= ; a[9605]= ; a[9606]= ; a[9607]= ; a[9608]= ; a[9609]= ; a[9610]= ; a[9611]= ; a[9612]= ; a[9613]= ; a[9614]= ; a[9615]= ; a[10402]= ; a[10403]= ; a[10404]= ; a[10405]= ; a[10406]= ; a[10407]= ; a[10408]= ; a[10409]= ; a[10410]= ; a[10411]= ; a[10412]= ; a[10413]= ; a[10414]= ; a[11203]= ; a[11204]= ; a[11205]= ; a[11206]= ; a[11207]= ; a[11208]= ; a[11209]= ; a[11210]= ; a[11211]= ; a[11212]= ; a[11213]= ; a[11214]=526344; a[12004]=526344; a[12005]= ; a[12006]= ; a[12007]= ; a[12008]= ; a[12009]= ; a[12010]= ; a[12011]= ; a[12012]= ; a[12806]=526344; a[12807]= ; a[12808]= ; a[12809]= ; a[12810]=526344; break; case 18: a[7]=526344; a[8]= ; a[9]= ; a[10]= ; a[11]=526344; a[805]=526344; a[806]= ; a[807]= ; a[808]= ; a[809]= ; a[810]= ; a[811]= ; a[812]=526344; a[1603]=526344; a[1604]= ; a[1605]= ; a[1606]= ; a[1607]= ; a[1608]= ; a[1609]= ; a[1610]= ; a[1611]= ; a[1612]= ; a[1613]= ; a[1614]= ; a[2402]=526344; a[2403]= ; a[2404]= ; a[2405]= ; a[2406]= ; a[2407]= ; a[2408]= ; a[2409]= ; a[2410]= ; a[2411]= ; a[2412]= ; a[2413]= ; a[2414]= ; a[2415]= ; a[3202]= ; a[3203]= ; a[3204]= ; a[3205]= ; a[3206]= ; a[3207]= ; a[3208]= ; a[3209]= ; a[3210]= ; a[3211]= ; a[3212]= ; a[3213]= ; a[3214]= ; a[3215]= ; a[3216]=526344; a[4001]=526344; a[4002]= ; a[4003]= ; a[4004]= ; a[4005]= ; a[4006]= ; a[4007]= ; a[4008]= ; a[4009]= ; a[4010]= ; a[4011]= ; a[4012]= ; a[4013]= ; a[4014]= ; a[4015]= ; a[4016]= ; a[4801]= ; a[4802]= ; a[4803]= ; a[4804]= ; a[4805]= ; a[4806]= ; a[4807]= ; a[4808]= ;

44 INFOMOV Lecture 12 Snippets 46 Madness!? This is INFOMOV!

45 /INFOMOV/ END of Snippets next lecture: Grand Recap

/INFOMOV/ Optimization & Vectorization. J. Bikker - Sep-Nov Lecture 10: Practical. Welcome!

/INFOMOV/ Optimization & Vectorization J. Bikker - Sep-Nov 2015 - Lecture 10: Practical Welcome! Today s Agenda: DotCloud: profiling & high-level (1) DotCloud: low-level and blind stupidity DotCloud: high-level