blob: b9c8d98ef826cd7a32dbe3c8cc8c8ddf0bcdad10 [file] [log] [blame]
Kim Phillips8e8ec592011-03-13 16:54:26 +08001/*
2 * caam descriptor construction helper functions
3 *
Yashpal Duttac4b66402012-06-22 19:42:37 -05004 * Copyright 2008-2012 Freescale Semiconductor, Inc.
Kim Phillips8e8ec592011-03-13 16:54:26 +08005 */
6
7#include "desc.h"
Horia Geantă261ea052016-05-19 18:11:26 +03008#include "regs.h"
Kim Phillips8e8ec592011-03-13 16:54:26 +08009
10#define IMMEDIATE (1 << 23)
11#define CAAM_CMD_SZ sizeof(u32)
12#define CAAM_PTR_SZ sizeof(dma_addr_t)
Yuan Kang1acebad2011-07-15 11:21:42 +080013#define CAAM_DESC_BYTES_MAX (CAAM_CMD_SZ * MAX_CAAM_DESCSIZE)
Vakul Gargaa2faec2013-07-10 06:27:21 +000014#define DESC_JOB_IO_LEN (CAAM_CMD_SZ * 5 + CAAM_PTR_SZ * 3)
Kim Phillips8e8ec592011-03-13 16:54:26 +080015
16#ifdef DEBUG
17#define PRINT_POS do { printk(KERN_DEBUG "%02d: %s\n", desc_len(desc),\
18 &__func__[sizeof("append")]); } while (0)
19#else
20#define PRINT_POS
21#endif
22
Kim Phillipsa2ecb152011-12-12 14:59:15 -060023#define SET_OK_NO_PROP_ERRORS (IMMEDIATE | LDST_CLASS_DECO | \
24 LDST_SRCDST_WORD_DECOCTRL | \
25 (LDOFF_CHG_SHARE_OK_NO_PROP << \
26 LDST_OFFSET_SHIFT))
Kim Phillips8e8ec592011-03-13 16:54:26 +080027#define DISABLE_AUTO_INFO_FIFO (IMMEDIATE | LDST_CLASS_DECO | \
28 LDST_SRCDST_WORD_DECOCTRL | \
29 (LDOFF_DISABLE_AUTO_NFIFO << LDST_OFFSET_SHIFT))
30#define ENABLE_AUTO_INFO_FIFO (IMMEDIATE | LDST_CLASS_DECO | \
31 LDST_SRCDST_WORD_DECOCTRL | \
32 (LDOFF_ENABLE_AUTO_NFIFO << LDST_OFFSET_SHIFT))
33
Horia Geantă261ea052016-05-19 18:11:26 +030034extern bool caam_little_end;
35
Horia Geantă24a4f142016-11-09 10:46:23 +020036static inline int desc_len(u32 * const desc)
Kim Phillips8e8ec592011-03-13 16:54:26 +080037{
Horia Geantă261ea052016-05-19 18:11:26 +030038 return caam32_to_cpu(*desc) & HDR_DESCLEN_MASK;
Kim Phillips8e8ec592011-03-13 16:54:26 +080039}
40
Horia Geantă24a4f142016-11-09 10:46:23 +020041static inline int desc_bytes(void * const desc)
Kim Phillips8e8ec592011-03-13 16:54:26 +080042{
43 return desc_len(desc) * CAAM_CMD_SZ;
44}
45
Horia Geantă24a4f142016-11-09 10:46:23 +020046static inline u32 *desc_end(u32 * const desc)
Kim Phillips8e8ec592011-03-13 16:54:26 +080047{
48 return desc + desc_len(desc);
49}
50
Horia Geantă24a4f142016-11-09 10:46:23 +020051static inline void *sh_desc_pdb(u32 * const desc)
Kim Phillips8e8ec592011-03-13 16:54:26 +080052{
53 return desc + 1;
54}
55
Horia Geantă24a4f142016-11-09 10:46:23 +020056static inline void init_desc(u32 * const desc, u32 options)
Kim Phillips8e8ec592011-03-13 16:54:26 +080057{
Horia Geantă261ea052016-05-19 18:11:26 +030058 *desc = cpu_to_caam32((options | HDR_ONE) + 1);
Kim Phillips8e8ec592011-03-13 16:54:26 +080059}
60
Horia Geantă24a4f142016-11-09 10:46:23 +020061static inline void init_sh_desc(u32 * const desc, u32 options)
Kim Phillips8e8ec592011-03-13 16:54:26 +080062{
63 PRINT_POS;
64 init_desc(desc, CMD_SHARED_DESC_HDR | options);
65}
66
Horia Geantă24a4f142016-11-09 10:46:23 +020067static inline void init_sh_desc_pdb(u32 * const desc, u32 options,
68 size_t pdb_bytes)
Kim Phillips8e8ec592011-03-13 16:54:26 +080069{
Kim Phillips991c5692012-06-22 19:42:38 -050070 u32 pdb_len = (pdb_bytes + CAAM_CMD_SZ - 1) / CAAM_CMD_SZ;
Kim Phillips8e8ec592011-03-13 16:54:26 +080071
Yashpal Duttac4b66402012-06-22 19:42:37 -050072 init_sh_desc(desc, (((pdb_len + 1) << HDR_START_IDX_SHIFT) + pdb_len) |
Kim Phillips8e8ec592011-03-13 16:54:26 +080073 options);
74}
75
Horia Geantă24a4f142016-11-09 10:46:23 +020076static inline void init_job_desc(u32 * const desc, u32 options)
Kim Phillips8e8ec592011-03-13 16:54:26 +080077{
78 init_desc(desc, CMD_DESC_HDR | options);
79}
80
Horia Geantă24a4f142016-11-09 10:46:23 +020081static inline void init_job_desc_pdb(u32 * const desc, u32 options,
82 size_t pdb_bytes)
Tudor Ambarus8c419772016-07-04 13:12:08 +030083{
84 u32 pdb_len = (pdb_bytes + CAAM_CMD_SZ - 1) / CAAM_CMD_SZ;
85
86 init_job_desc(desc, (((pdb_len + 1) << HDR_START_IDX_SHIFT)) | options);
87}
88
Horia Geantă24a4f142016-11-09 10:46:23 +020089static inline void append_ptr(u32 * const desc, dma_addr_t ptr)
Kim Phillips8e8ec592011-03-13 16:54:26 +080090{
91 dma_addr_t *offset = (dma_addr_t *)desc_end(desc);
92
Horia Geantă261ea052016-05-19 18:11:26 +030093 *offset = cpu_to_caam_dma(ptr);
Kim Phillips8e8ec592011-03-13 16:54:26 +080094
Horia Geantă261ea052016-05-19 18:11:26 +030095 (*desc) = cpu_to_caam32(caam32_to_cpu(*desc) +
96 CAAM_PTR_SZ / CAAM_CMD_SZ);
Kim Phillips8e8ec592011-03-13 16:54:26 +080097}
98
Horia Geantă24a4f142016-11-09 10:46:23 +020099static inline void init_job_desc_shared(u32 * const desc, dma_addr_t ptr,
100 int len, u32 options)
Kim Phillips8e8ec592011-03-13 16:54:26 +0800101{
102 PRINT_POS;
103 init_job_desc(desc, HDR_SHARED | options |
104 (len << HDR_START_IDX_SHIFT));
105 append_ptr(desc, ptr);
106}
107
Horia Geantă24a4f142016-11-09 10:46:23 +0200108static inline void append_data(u32 * const desc, void *data, int len)
Kim Phillips8e8ec592011-03-13 16:54:26 +0800109{
110 u32 *offset = desc_end(desc);
111
112 if (len) /* avoid sparse warning: memcpy with byte count of 0 */
113 memcpy(offset, data, len);
114
Horia Geantă261ea052016-05-19 18:11:26 +0300115 (*desc) = cpu_to_caam32(caam32_to_cpu(*desc) +
116 (len + CAAM_CMD_SZ - 1) / CAAM_CMD_SZ);
Kim Phillips8e8ec592011-03-13 16:54:26 +0800117}
118
Horia Geantă24a4f142016-11-09 10:46:23 +0200119static inline void append_cmd(u32 * const desc, u32 command)
Kim Phillips8e8ec592011-03-13 16:54:26 +0800120{
121 u32 *cmd = desc_end(desc);
122
Horia Geantă261ea052016-05-19 18:11:26 +0300123 *cmd = cpu_to_caam32(command);
Kim Phillips8e8ec592011-03-13 16:54:26 +0800124
Horia Geantă261ea052016-05-19 18:11:26 +0300125 (*desc) = cpu_to_caam32(caam32_to_cpu(*desc) + 1);
Kim Phillips8e8ec592011-03-13 16:54:26 +0800126}
127
Andrei Varvara3ebfa922013-05-28 15:37:07 +0800128#define append_u32 append_cmd
129
Horia Geantă24a4f142016-11-09 10:46:23 +0200130static inline void append_u64(u32 * const desc, u64 data)
Andrei Varvara3ebfa922013-05-28 15:37:07 +0800131{
132 u32 *offset = desc_end(desc);
133
Horia Geantă261ea052016-05-19 18:11:26 +0300134 /* Only 32-bit alignment is guaranteed in descriptor buffer */
135 if (caam_little_end) {
136 *offset = cpu_to_caam32(lower_32_bits(data));
137 *(++offset) = cpu_to_caam32(upper_32_bits(data));
138 } else {
139 *offset = cpu_to_caam32(upper_32_bits(data));
140 *(++offset) = cpu_to_caam32(lower_32_bits(data));
141 }
Andrei Varvara3ebfa922013-05-28 15:37:07 +0800142
Horia Geantă261ea052016-05-19 18:11:26 +0300143 (*desc) = cpu_to_caam32(caam32_to_cpu(*desc) + 2);
Andrei Varvara3ebfa922013-05-28 15:37:07 +0800144}
145
146/* Write command without affecting header, and return pointer to next word */
Horia Geantă24a4f142016-11-09 10:46:23 +0200147static inline u32 *write_cmd(u32 * const desc, u32 command)
Andrei Varvara3ebfa922013-05-28 15:37:07 +0800148{
Horia Geantă261ea052016-05-19 18:11:26 +0300149 *desc = cpu_to_caam32(command);
Andrei Varvara3ebfa922013-05-28 15:37:07 +0800150
151 return desc + 1;
152}
153
Horia Geantă24a4f142016-11-09 10:46:23 +0200154static inline void append_cmd_ptr(u32 * const desc, dma_addr_t ptr, int len,
Kim Phillips8e8ec592011-03-13 16:54:26 +0800155 u32 command)
156{
157 append_cmd(desc, command | len);
158 append_ptr(desc, ptr);
159}
160
Yuan Kang6ec47332012-06-22 19:48:43 -0500161/* Write length after pointer, rather than inside command */
Horia Geantă24a4f142016-11-09 10:46:23 +0200162static inline void append_cmd_ptr_extlen(u32 * const desc, dma_addr_t ptr,
Yuan Kang6ec47332012-06-22 19:48:43 -0500163 unsigned int len, u32 command)
164{
165 append_cmd(desc, command);
Andrei Varvarae2d4ea92013-05-28 15:37:05 +0800166 if (!(command & (SQIN_RTO | SQIN_PRE)))
167 append_ptr(desc, ptr);
Yuan Kang6ec47332012-06-22 19:48:43 -0500168 append_cmd(desc, len);
169}
170
Horia Geantă24a4f142016-11-09 10:46:23 +0200171static inline void append_cmd_data(u32 * const desc, void *data, int len,
Kim Phillips8e8ec592011-03-13 16:54:26 +0800172 u32 command)
173{
174 append_cmd(desc, command | IMMEDIATE | len);
175 append_data(desc, data, len);
176}
177
Horia Geantaae4a8252014-03-14 17:46:52 +0200178#define APPEND_CMD_RET(cmd, op) \
Horia Geantă24a4f142016-11-09 10:46:23 +0200179static inline u32 *append_##cmd(u32 * const desc, u32 options) \
Horia Geantaae4a8252014-03-14 17:46:52 +0200180{ \
181 u32 *cmd = desc_end(desc); \
182 PRINT_POS; \
183 append_cmd(desc, CMD_##op | options); \
184 return cmd; \
Kim Phillips8e8ec592011-03-13 16:54:26 +0800185}
Horia Geantaae4a8252014-03-14 17:46:52 +0200186APPEND_CMD_RET(jump, JUMP)
187APPEND_CMD_RET(move, MOVE)
Kim Phillips8e8ec592011-03-13 16:54:26 +0800188
Horia Geantă24a4f142016-11-09 10:46:23 +0200189static inline void set_jump_tgt_here(u32 * const desc, u32 *jump_cmd)
Kim Phillips8e8ec592011-03-13 16:54:26 +0800190{
Horia Geantă261ea052016-05-19 18:11:26 +0300191 *jump_cmd = cpu_to_caam32(caam32_to_cpu(*jump_cmd) |
192 (desc_len(desc) - (jump_cmd - desc)));
Kim Phillips8e8ec592011-03-13 16:54:26 +0800193}
194
Horia Geantă24a4f142016-11-09 10:46:23 +0200195static inline void set_move_tgt_here(u32 * const desc, u32 *move_cmd)
Horia Geantaae4a8252014-03-14 17:46:52 +0200196{
Horia Geantă261ea052016-05-19 18:11:26 +0300197 u32 val = caam32_to_cpu(*move_cmd);
198
199 val &= ~MOVE_OFFSET_MASK;
200 val |= (desc_len(desc) << (MOVE_OFFSET_SHIFT + 2)) & MOVE_OFFSET_MASK;
201 *move_cmd = cpu_to_caam32(val);
Horia Geantaae4a8252014-03-14 17:46:52 +0200202}
203
Kim Phillips8e8ec592011-03-13 16:54:26 +0800204#define APPEND_CMD(cmd, op) \
Horia Geantă24a4f142016-11-09 10:46:23 +0200205static inline void append_##cmd(u32 * const desc, u32 options) \
Kim Phillips8e8ec592011-03-13 16:54:26 +0800206{ \
207 PRINT_POS; \
208 append_cmd(desc, CMD_##op | options); \
209}
210APPEND_CMD(operation, OPERATION)
Kim Phillips8e8ec592011-03-13 16:54:26 +0800211
212#define APPEND_CMD_LEN(cmd, op) \
Horia Geantă24a4f142016-11-09 10:46:23 +0200213static inline void append_##cmd(u32 * const desc, unsigned int len, \
214 u32 options) \
Kim Phillips8e8ec592011-03-13 16:54:26 +0800215{ \
216 PRINT_POS; \
217 append_cmd(desc, CMD_##op | len | options); \
218}
Catalin Vasile2b22f6c2014-10-31 12:45:35 +0200219
220APPEND_CMD_LEN(seq_load, SEQ_LOAD)
Kim Phillips8e8ec592011-03-13 16:54:26 +0800221APPEND_CMD_LEN(seq_store, SEQ_STORE)
222APPEND_CMD_LEN(seq_fifo_load, SEQ_FIFO_LOAD)
223APPEND_CMD_LEN(seq_fifo_store, SEQ_FIFO_STORE)
224
225#define APPEND_CMD_PTR(cmd, op) \
Horia Geantă24a4f142016-11-09 10:46:23 +0200226static inline void append_##cmd(u32 * const desc, dma_addr_t ptr, \
227 unsigned int len, u32 options) \
Kim Phillips8e8ec592011-03-13 16:54:26 +0800228{ \
229 PRINT_POS; \
230 append_cmd_ptr(desc, ptr, len, CMD_##op | options); \
231}
232APPEND_CMD_PTR(key, KEY)
Kim Phillips8e8ec592011-03-13 16:54:26 +0800233APPEND_CMD_PTR(load, LOAD)
Kim Phillips8e8ec592011-03-13 16:54:26 +0800234APPEND_CMD_PTR(fifo_load, FIFO_LOAD)
235APPEND_CMD_PTR(fifo_store, FIFO_STORE)
236
Horia Geantă24a4f142016-11-09 10:46:23 +0200237static inline void append_store(u32 * const desc, dma_addr_t ptr,
238 unsigned int len, u32 options)
Andrei Varvara524f1bd2013-05-28 15:37:06 +0800239{
240 u32 cmd_src;
241
242 cmd_src = options & LDST_SRCDST_MASK;
243
244 append_cmd(desc, CMD_STORE | options | len);
245
246 /* The following options do not require pointer */
247 if (!(cmd_src == LDST_SRCDST_WORD_DESCBUF_SHARED ||
248 cmd_src == LDST_SRCDST_WORD_DESCBUF_JOB ||
249 cmd_src == LDST_SRCDST_WORD_DESCBUF_JOB_WE ||
250 cmd_src == LDST_SRCDST_WORD_DESCBUF_SHARED_WE))
251 append_ptr(desc, ptr);
252}
253
Yuan Kang6ec47332012-06-22 19:48:43 -0500254#define APPEND_SEQ_PTR_INTLEN(cmd, op) \
Horia Geantă24a4f142016-11-09 10:46:23 +0200255static inline void append_seq_##cmd##_ptr_intlen(u32 * const desc, \
256 dma_addr_t ptr, \
Yuan Kang6ec47332012-06-22 19:48:43 -0500257 unsigned int len, \
258 u32 options) \
259{ \
260 PRINT_POS; \
Andrei Varvarae2d4ea92013-05-28 15:37:05 +0800261 if (options & (SQIN_RTO | SQIN_PRE)) \
262 append_cmd(desc, CMD_SEQ_##op##_PTR | len | options); \
263 else \
264 append_cmd_ptr(desc, ptr, len, CMD_SEQ_##op##_PTR | options); \
Yuan Kang6ec47332012-06-22 19:48:43 -0500265}
266APPEND_SEQ_PTR_INTLEN(in, IN)
267APPEND_SEQ_PTR_INTLEN(out, OUT)
268
Kim Phillips8e8ec592011-03-13 16:54:26 +0800269#define APPEND_CMD_PTR_TO_IMM(cmd, op) \
Horia Geantă24a4f142016-11-09 10:46:23 +0200270static inline void append_##cmd##_as_imm(u32 * const desc, void *data, \
Kim Phillips8e8ec592011-03-13 16:54:26 +0800271 unsigned int len, u32 options) \
272{ \
273 PRINT_POS; \
274 append_cmd_data(desc, data, len, CMD_##op | options); \
275}
276APPEND_CMD_PTR_TO_IMM(load, LOAD);
277APPEND_CMD_PTR_TO_IMM(fifo_load, FIFO_LOAD);
278
Yuan Kang6ec47332012-06-22 19:48:43 -0500279#define APPEND_CMD_PTR_EXTLEN(cmd, op) \
Horia Geantă24a4f142016-11-09 10:46:23 +0200280static inline void append_##cmd##_extlen(u32 * const desc, dma_addr_t ptr, \
Yuan Kang6ec47332012-06-22 19:48:43 -0500281 unsigned int len, u32 options) \
282{ \
283 PRINT_POS; \
284 append_cmd_ptr_extlen(desc, ptr, len, CMD_##op | SQIN_EXT | options); \
285}
286APPEND_CMD_PTR_EXTLEN(seq_in_ptr, SEQ_IN_PTR)
287APPEND_CMD_PTR_EXTLEN(seq_out_ptr, SEQ_OUT_PTR)
288
289/*
290 * Determine whether to store length internally or externally depending on
291 * the size of its type
292 */
293#define APPEND_CMD_PTR_LEN(cmd, op, type) \
Horia Geantă24a4f142016-11-09 10:46:23 +0200294static inline void append_##cmd(u32 * const desc, dma_addr_t ptr, \
Yuan Kang6ec47332012-06-22 19:48:43 -0500295 type len, u32 options) \
296{ \
297 PRINT_POS; \
298 if (sizeof(type) > sizeof(u16)) \
299 append_##cmd##_extlen(desc, ptr, len, options); \
300 else \
301 append_##cmd##_intlen(desc, ptr, len, options); \
302}
303APPEND_CMD_PTR_LEN(seq_in_ptr, SEQ_IN_PTR, u32)
304APPEND_CMD_PTR_LEN(seq_out_ptr, SEQ_OUT_PTR, u32)
305
Kim Phillips8e8ec592011-03-13 16:54:26 +0800306/*
307 * 2nd variant for commands whose specified immediate length differs
308 * from length of immediate data provided, e.g., split keys
309 */
310#define APPEND_CMD_PTR_TO_IMM2(cmd, op) \
Horia Geantă24a4f142016-11-09 10:46:23 +0200311static inline void append_##cmd##_as_imm(u32 * const desc, void *data, \
Kim Phillips8e8ec592011-03-13 16:54:26 +0800312 unsigned int data_len, \
313 unsigned int len, u32 options) \
314{ \
315 PRINT_POS; \
316 append_cmd(desc, CMD_##op | IMMEDIATE | len | options); \
317 append_data(desc, data, data_len); \
318}
319APPEND_CMD_PTR_TO_IMM2(key, KEY);
320
321#define APPEND_CMD_RAW_IMM(cmd, op, type) \
Horia Geantă24a4f142016-11-09 10:46:23 +0200322static inline void append_##cmd##_imm_##type(u32 * const desc, type immediate, \
Kim Phillips8e8ec592011-03-13 16:54:26 +0800323 u32 options) \
324{ \
325 PRINT_POS; \
326 append_cmd(desc, CMD_##op | IMMEDIATE | options | sizeof(type)); \
327 append_cmd(desc, immediate); \
328}
329APPEND_CMD_RAW_IMM(load, LOAD, u32);
Yuan Kang1acebad2011-07-15 11:21:42 +0800330
331/*
Catalin Vasile5ba1c7b2016-08-31 15:57:55 +0300332 * ee - endianness
333 * size - size of immediate type in bytes
334 */
335#define APPEND_CMD_RAW_IMM2(cmd, op, ee, size) \
336static inline void append_##cmd##_imm_##ee##size(u32 *desc, \
337 u##size immediate, \
338 u32 options) \
339{ \
340 __##ee##size data = cpu_to_##ee##size(immediate); \
341 PRINT_POS; \
342 append_cmd(desc, CMD_##op | IMMEDIATE | options | sizeof(data)); \
343 append_data(desc, &data, sizeof(data)); \
344}
345
346APPEND_CMD_RAW_IMM2(load, LOAD, be, 32);
347
348/*
Yuan Kang1acebad2011-07-15 11:21:42 +0800349 * Append math command. Only the last part of destination and source need to
350 * be specified
351 */
352#define APPEND_MATH(op, desc, dest, src_0, src_1, len) \
353append_cmd(desc, CMD_MATH | MATH_FUN_##op | MATH_DEST_##dest | \
Andrei Varvara3ebfa922013-05-28 15:37:07 +0800354 MATH_SRC0_##src_0 | MATH_SRC1_##src_1 | (u32)len);
Yuan Kang1acebad2011-07-15 11:21:42 +0800355
356#define append_math_add(desc, dest, src0, src1, len) \
357 APPEND_MATH(ADD, desc, dest, src0, src1, len)
358#define append_math_sub(desc, dest, src0, src1, len) \
359 APPEND_MATH(SUB, desc, dest, src0, src1, len)
360#define append_math_add_c(desc, dest, src0, src1, len) \
361 APPEND_MATH(ADDC, desc, dest, src0, src1, len)
362#define append_math_sub_b(desc, dest, src0, src1, len) \
363 APPEND_MATH(SUBB, desc, dest, src0, src1, len)
364#define append_math_and(desc, dest, src0, src1, len) \
365 APPEND_MATH(AND, desc, dest, src0, src1, len)
366#define append_math_or(desc, dest, src0, src1, len) \
367 APPEND_MATH(OR, desc, dest, src0, src1, len)
368#define append_math_xor(desc, dest, src0, src1, len) \
369 APPEND_MATH(XOR, desc, dest, src0, src1, len)
370#define append_math_lshift(desc, dest, src0, src1, len) \
371 APPEND_MATH(LSHIFT, desc, dest, src0, src1, len)
372#define append_math_rshift(desc, dest, src0, src1, len) \
373 APPEND_MATH(RSHIFT, desc, dest, src0, src1, len)
Andrei Varvarad179333b2013-05-28 15:37:06 +0800374#define append_math_ldshift(desc, dest, src0, src1, len) \
375 APPEND_MATH(SHLD, desc, dest, src0, src1, len)
Yuan Kang1acebad2011-07-15 11:21:42 +0800376
377/* Exactly one source is IMM. Data is passed in as u32 value */
378#define APPEND_MATH_IMM_u32(op, desc, dest, src_0, src_1, data) \
379do { \
380 APPEND_MATH(op, desc, dest, src_0, src_1, CAAM_CMD_SZ); \
381 append_cmd(desc, data); \
Horia Geantaae4a8252014-03-14 17:46:52 +0200382} while (0)
Yuan Kang1acebad2011-07-15 11:21:42 +0800383
384#define append_math_add_imm_u32(desc, dest, src0, src1, data) \
385 APPEND_MATH_IMM_u32(ADD, desc, dest, src0, src1, data)
386#define append_math_sub_imm_u32(desc, dest, src0, src1, data) \
387 APPEND_MATH_IMM_u32(SUB, desc, dest, src0, src1, data)
388#define append_math_add_c_imm_u32(desc, dest, src0, src1, data) \
389 APPEND_MATH_IMM_u32(ADDC, desc, dest, src0, src1, data)
390#define append_math_sub_b_imm_u32(desc, dest, src0, src1, data) \
391 APPEND_MATH_IMM_u32(SUBB, desc, dest, src0, src1, data)
392#define append_math_and_imm_u32(desc, dest, src0, src1, data) \
393 APPEND_MATH_IMM_u32(AND, desc, dest, src0, src1, data)
394#define append_math_or_imm_u32(desc, dest, src0, src1, data) \
395 APPEND_MATH_IMM_u32(OR, desc, dest, src0, src1, data)
396#define append_math_xor_imm_u32(desc, dest, src0, src1, data) \
397 APPEND_MATH_IMM_u32(XOR, desc, dest, src0, src1, data)
398#define append_math_lshift_imm_u32(desc, dest, src0, src1, data) \
399 APPEND_MATH_IMM_u32(LSHIFT, desc, dest, src0, src1, data)
400#define append_math_rshift_imm_u32(desc, dest, src0, src1, data) \
401 APPEND_MATH_IMM_u32(RSHIFT, desc, dest, src0, src1, data)
Andrei Varvara3ebfa922013-05-28 15:37:07 +0800402
403/* Exactly one source is IMM. Data is passed in as u64 value */
404#define APPEND_MATH_IMM_u64(op, desc, dest, src_0, src_1, data) \
405do { \
406 u32 upper = (data >> 16) >> 16; \
407 APPEND_MATH(op, desc, dest, src_0, src_1, CAAM_CMD_SZ * 2 | \
408 (upper ? 0 : MATH_IFB)); \
409 if (upper) \
410 append_u64(desc, data); \
411 else \
Tudor Ambarusc1f2cd22015-07-17 16:54:54 +0300412 append_u32(desc, lower_32_bits(data)); \
Andrei Varvara3ebfa922013-05-28 15:37:07 +0800413} while (0)
414
415#define append_math_add_imm_u64(desc, dest, src0, src1, data) \
416 APPEND_MATH_IMM_u64(ADD, desc, dest, src0, src1, data)
417#define append_math_sub_imm_u64(desc, dest, src0, src1, data) \
418 APPEND_MATH_IMM_u64(SUB, desc, dest, src0, src1, data)
419#define append_math_add_c_imm_u64(desc, dest, src0, src1, data) \
420 APPEND_MATH_IMM_u64(ADDC, desc, dest, src0, src1, data)
421#define append_math_sub_b_imm_u64(desc, dest, src0, src1, data) \
422 APPEND_MATH_IMM_u64(SUBB, desc, dest, src0, src1, data)
423#define append_math_and_imm_u64(desc, dest, src0, src1, data) \
424 APPEND_MATH_IMM_u64(AND, desc, dest, src0, src1, data)
425#define append_math_or_imm_u64(desc, dest, src0, src1, data) \
426 APPEND_MATH_IMM_u64(OR, desc, dest, src0, src1, data)
427#define append_math_xor_imm_u64(desc, dest, src0, src1, data) \
428 APPEND_MATH_IMM_u64(XOR, desc, dest, src0, src1, data)
429#define append_math_lshift_imm_u64(desc, dest, src0, src1, data) \
430 APPEND_MATH_IMM_u64(LSHIFT, desc, dest, src0, src1, data)
431#define append_math_rshift_imm_u64(desc, dest, src0, src1, data) \
432 APPEND_MATH_IMM_u64(RSHIFT, desc, dest, src0, src1, data)
Horia Geantădb576562016-11-22 15:44:04 +0200433
434/**
435 * struct alginfo - Container for algorithm details
436 * @algtype: algorithm selector; for valid values, see documentation of the
437 * functions where it is used.
438 * @keylen: length of the provided algorithm key, in bytes
439 * @keylen_pad: padded length of the provided algorithm key, in bytes
440 * @key: address where algorithm key resides; virtual address if key_inline
441 * is true, dma (bus) address if key_inline is false.
442 * @key_inline: true - key can be inlined in the descriptor; false - key is
443 * referenced by the descriptor
444 */
445struct alginfo {
446 u32 algtype;
447 unsigned int keylen;
448 unsigned int keylen_pad;
Arnd Bergmann9c0bc512016-11-30 22:01:59 +0100449 union {
450 dma_addr_t key_dma;
451 void *key_virt;
452 };
Horia Geantădb576562016-11-22 15:44:04 +0200453 bool key_inline;
454};
Horia Geantă4cbe79c2016-11-22 15:44:06 +0200455
456/**
457 * desc_inline_query() - Provide indications on which data items can be inlined
458 * and which shall be referenced in a shared descriptor.
459 * @sd_base_len: Shared descriptor base length - bytes consumed by the commands,
460 * excluding the data items to be inlined (or corresponding
461 * pointer if an item is not inlined). Each cnstr_* function that
462 * generates descriptors should have a define mentioning
463 * corresponding length.
464 * @jd_len: Maximum length of the job descriptor(s) that will be used
465 * together with the shared descriptor.
466 * @data_len: Array of lengths of the data items trying to be inlined
467 * @inl_mask: 32bit mask with bit x = 1 if data item x can be inlined, 0
468 * otherwise.
469 * @count: Number of data items (size of @data_len array); must be <= 32
470 *
471 * Return: 0 if data can be inlined / referenced, negative value if not. If 0,
472 * check @inl_mask for details.
473 */
474static inline int desc_inline_query(unsigned int sd_base_len,
475 unsigned int jd_len, unsigned int *data_len,
476 u32 *inl_mask, unsigned int count)
477{
478 int rem_bytes = (int)(CAAM_DESC_BYTES_MAX - sd_base_len - jd_len);
479 unsigned int i;
480
481 *inl_mask = 0;
482 for (i = 0; (i < count) && (rem_bytes > 0); i++) {
483 if (rem_bytes - (int)(data_len[i] +
484 (count - i - 1) * CAAM_PTR_SZ) >= 0) {
485 rem_bytes -= data_len[i];
486 *inl_mask |= (1 << i);
487 } else {
488 rem_bytes -= CAAM_PTR_SZ;
489 }
490 }
491
492 return (rem_bytes >= 0) ? 0 : -1;
493}