Lines Matching refs:PARALLELISM_DEGREE
26 #define PARALLELISM_DEGREE 4
33 P->fanout = PARALLELISM_DEGREE;
52 P->fanout = PARALLELISM_DEGREE;
77 for( size_t i = 0; i < PARALLELISM_DEGREE; ++i )
81 S->S[PARALLELISM_DEGREE - 1]->last_node = 1;
98 for( size_t i = 0; i < PARALLELISM_DEGREE; ++i )
103 S->S[PARALLELISM_DEGREE - 1]->last_node = 1;
110 for( size_t i = 0; i < PARALLELISM_DEGREE; ++i )
128 for( size_t i = 0; i < PARALLELISM_DEGREE; ++i )
137 omp_set_num_threads(PARALLELISM_DEGREE);
140 for( size_t id__ = 0; id__ < PARALLELISM_DEGREE; ++id__ )
150 while( inlen__ >= PARALLELISM_DEGREE * BLAKE2B_BLOCKBYTES )
153 in__ += PARALLELISM_DEGREE * BLAKE2B_BLOCKBYTES;
154 inlen__ -= PARALLELISM_DEGREE * BLAKE2B_BLOCKBYTES;
158 in += inlen - inlen % ( PARALLELISM_DEGREE * BLAKE2B_BLOCKBYTES );
159 inlen %= PARALLELISM_DEGREE * BLAKE2B_BLOCKBYTES;
172 uint8_t hash[PARALLELISM_DEGREE][BLAKE2B_OUTBYTES];
176 for( size_t i = 0; i < PARALLELISM_DEGREE; ++i )
190 for( size_t i = 0; i < PARALLELISM_DEGREE; ++i )
198 uint8_t hash[PARALLELISM_DEGREE][BLAKE2B_OUTBYTES];
199 blake2b_state S[PARALLELISM_DEGREE][1];
213 for( size_t i = 0; i < PARALLELISM_DEGREE; ++i )
217 S[PARALLELISM_DEGREE - 1]->last_node = 1; // mark last node
225 for( size_t i = 0; i < PARALLELISM_DEGREE; ++i )
232 omp_set_num_threads(PARALLELISM_DEGREE);
235 for( size_t id__ = 0; id__ < PARALLELISM_DEGREE; ++id__ )
245 while( inlen__ >= PARALLELISM_DEGREE * BLAKE2B_BLOCKBYTES )
248 in__ += PARALLELISM_DEGREE * BLAKE2B_BLOCKBYTES;
249 inlen__ -= PARALLELISM_DEGREE * BLAKE2B_BLOCKBYTES;
267 for( size_t i = 0; i < PARALLELISM_DEGREE; ++i )