Searched refs:b_cnt (Results 1 – 6 of 6) sorted by relevance
147 skein_assert_ret(ctx->h.b_cnt <= SKEIN_256_BLOCK_BYTES, SKEIN_FAIL); in skein_256_update()150 if (msg_byte_cnt + ctx->h.b_cnt > SKEIN_256_BLOCK_BYTES) { in skein_256_update()152 if (ctx->h.b_cnt) { in skein_256_update()154 n = SKEIN_256_BLOCK_BYTES - ctx->h.b_cnt; in skein_256_update()158 memcpy(&ctx->b[ctx->h.b_cnt], msg, n); in skein_256_update()161 ctx->h.b_cnt += n; in skein_256_update()163 skein_assert(ctx->h.b_cnt == SKEIN_256_BLOCK_BYTES); in skein_256_update()166 ctx->h.b_cnt = 0; in skein_256_update()180 skein_assert(ctx->h.b_cnt == 0); in skein_256_update()185 skein_assert(msg_byte_cnt + ctx->h.b_cnt <= in skein_256_update()[all …]
33 #define skein_put64_lsb_first(dst08, src64, b_cnt) memcpy(dst08, src64, b_cnt) argument65 size_t b_cnt; /* current byte count in buffer b[] */ member264 (ctx_ptr)->h.b_cnt = 0; \
209 length = ctx->m.h.b_cnt; in skein_update_bits()
184 unsigned int b_cnt; /* Bytes used */ member207 #define MON_RING_EMPTY(rp) ((rp)->b_cnt == 0)298 if (rp->b_cnt + size > rp->b_size) in mon_buff_area_alloc()301 rp->b_cnt += size; in mon_buff_area_alloc()324 if (rp->b_cnt + size > rp->b_size) in mon_buff_area_alloc_contiguous()333 if (rp->b_cnt + size + fill_size > rp->b_size) in mon_buff_area_alloc_contiguous()339 rp->b_cnt += size + fill_size; in mon_buff_area_alloc_contiguous()343 rp->b_cnt += size; in mon_buff_area_alloc_contiguous()347 rp->b_cnt += size; in mon_buff_area_alloc_contiguous()360 rp->b_cnt -= size; in mon_buff_area_shrink()[all …]
417 for (i = 0; i < pvt->csels[dct].b_cnt; i++)783 pvt->csels[0].b_cnt = pvt->csels[1].b_cnt = 8; in prep_chip_selects()786 pvt->csels[0].b_cnt = pvt->csels[1].b_cnt = 4; in prep_chip_selects()789 pvt->csels[0].b_cnt = pvt->csels[1].b_cnt = 8; in prep_chip_selects()2824 layers[0].size = pvt->csels[0].b_cnt; in init_one_instance()
285 u8 b_cnt; member