*/
if (fq->head > fq->tail) {
fr_assert(fq->num == (fq->head - fq->tail));
- memcpy(&nq->entry[0], &fq->entry[fq->tail], &fq->entry[fq->head] - &fq->entry[fq->tail]);
+ memcpy(&nq->entry[0], &fq->entry[fq->tail],
+ (uint8_t *) &fq->entry[fq->head] - (uint8_t *) &fq->entry[fq->tail]);
nq->head = fq->num;
nq->num = fq->num;
goto done;
* The block of elements is split in two. Copy the tail
* to the bottom of our array, and then then head.
*/
- memcpy(&nq->entry[0], &fq->entry[fq->tail], &fq->entry[fq->size] - &fq->entry[fq->tail]);
+ memcpy(&nq->entry[0], &fq->entry[fq->tail],
+ (uint8_t *) &fq->entry[fq->size] - (uint8_t *) &fq->entry[fq->tail]);
nq->head = fq->size - fq->tail;
fr_assert((nq->head + fq->head) == fq->num);
- memcpy(&nq->entry[nq->head], &fq->entry[0], &fq->entry[fq->head] - &fq->entry[0]);
+ memcpy(&nq->entry[nq->head], &fq->entry[0],
+ (uint8_t *) &fq->entry[fq->head] - (uint8_t *) &fq->entry[0]);
nq->head = fq->num;
nq->num = fq->num;