Lines Matching refs:PARALLELISM_DEGREE
25 #define PARALLELISM_DEGREE 8
32 P->fanout = PARALLELISM_DEGREE;
50 P->fanout = PARALLELISM_DEGREE;
74 for( size_t i = 0; i < PARALLELISM_DEGREE; ++i )
78 S->S[PARALLELISM_DEGREE - 1]->last_node = 1;
95 for( size_t i = 0; i < PARALLELISM_DEGREE; ++i )
100 S->S[PARALLELISM_DEGREE - 1]->last_node = 1;
107 for( size_t i = 0; i < PARALLELISM_DEGREE; ++i )
125 for( size_t i = 0; i < PARALLELISM_DEGREE; ++i )
134 omp_set_num_threads(PARALLELISM_DEGREE);
137 for( size_t id__ = 0; id__ < PARALLELISM_DEGREE; ++id__ )
147 while( inlen__ >= PARALLELISM_DEGREE * BLAKE2S_BLOCKBYTES )
150 in__ += PARALLELISM_DEGREE * BLAKE2S_BLOCKBYTES;
151 inlen__ -= PARALLELISM_DEGREE * BLAKE2S_BLOCKBYTES;
155 in += inlen - inlen % ( PARALLELISM_DEGREE * BLAKE2S_BLOCKBYTES );
156 inlen %= PARALLELISM_DEGREE * BLAKE2S_BLOCKBYTES;
168 uint8_t hash[PARALLELISM_DEGREE][BLAKE2S_OUTBYTES];
172 for( size_t i = 0; i < PARALLELISM_DEGREE; ++i )
186 for( size_t i = 0; i < PARALLELISM_DEGREE; ++i )
196 uint8_t hash[PARALLELISM_DEGREE][BLAKE2S_OUTBYTES];
197 blake2s_state S[PARALLELISM_DEGREE][1];
211 for( size_t i = 0; i < PARALLELISM_DEGREE; ++i )
215 S[PARALLELISM_DEGREE - 1]->last_node = 1; // mark last node
223 for( size_t i = 0; i < PARALLELISM_DEGREE; ++i )
230 omp_set_num_threads(PARALLELISM_DEGREE);
234 for( size_t id__ = 0; id__ < PARALLELISM_DEGREE; ++id__ )
244 while( inlen__ >= PARALLELISM_DEGREE * BLAKE2S_BLOCKBYTES )
247 in__ += PARALLELISM_DEGREE * BLAKE2S_BLOCKBYTES;
248 inlen__ -= PARALLELISM_DEGREE * BLAKE2S_BLOCKBYTES;
266 for( size_t i = 0; i < PARALLELISM_DEGREE; ++i )