blob: de8c8d395507d23d9a5a2261478d31cddad4e563 [file] [log] [blame]
Angel Ponsc74dae92020-04-02 23:48:16 +02001/* SPDX-License-Identifier: GPL-2.0-only */
Julius Wernerdb7f6fb2019-08-12 16:45:21 -07002
3#include <assert.h>
4#include <device/mmio.h>
5
6/* Helper functions for various MMIO access patterns. */
7
8void buffer_from_fifo32(void *buffer, size_t size, void *fifo,
9 int fifo_stride, int fifo_width)
10{
11 u8 *p = buffer;
12 int i, j;
13
14 assert(fifo_width > 0 && fifo_width <= sizeof(u32) &&
15 fifo_stride % sizeof(u32) == 0);
16
17 for (i = 0; i < size; i += fifo_width, fifo += fifo_stride) {
18 u32 val = read32(fifo);
19 for (j = 0; j < MIN(size - i, fifo_width); j++)
20 *p++ = (u8)(val >> (j * 8));
21 }
22}
23
Julius Wernerea03d002021-09-16 15:53:32 -070024void buffer_to_fifo32_prefix(const void *buffer, u32 prefix, int prefsz, size_t size,
Julius Wernerdb7f6fb2019-08-12 16:45:21 -070025 void *fifo, int fifo_stride, int fifo_width)
26{
Julius Wernerea03d002021-09-16 15:53:32 -070027 const u8 *p = buffer;
Julius Wernerdb7f6fb2019-08-12 16:45:21 -070028 int i, j = prefsz;
29
30 assert(fifo_width > 0 && fifo_width <= sizeof(u32) &&
31 fifo_stride % sizeof(u32) == 0 && prefsz <= fifo_width);
32
33 uint32_t val = prefix;
34 for (i = 0; i < size; i += fifo_width, fifo += fifo_stride) {
35 for (; j < MIN(size - i, fifo_width); j++)
36 val |= *p++ << (j * 8);
37 write32(fifo, val);
38 val = 0;
39 j = 0;
40 }
41
42}