Lines Matching refs:slice
155 struct bo_slice *slice = container_of(kref, struct bo_slice, ref_count);
157 list_del(&slice->slice);
158 drm_gem_object_put(&slice->bo->base);
159 sg_free_table(slice->sgt);
160 kfree(slice->sgt);
161 kfree(slice->reqs);
162 kfree(slice);
245 static int encode_reqs(struct qaic_device *qdev, struct bo_slice *slice,
257 if (!slice->no_xfer)
258 cmd |= (slice->dir == DMA_TO_DEVICE ? INBOUND_XFER : OUTBOUND_XFER);
288 * When we end up splitting up a single request (ie a buf slice) into
297 for_each_sgtable_sg(slice->sgt, sg, i) {
298 slice->reqs[i].cmd = cmd;
299 slice->reqs[i].src_addr = cpu_to_le64(slice->dir == DMA_TO_DEVICE ?
301 slice->reqs[i].dest_addr = cpu_to_le64(slice->dir == DMA_TO_DEVICE ?
309 slice->reqs[i].len = cpu_to_le32((u32)sg_dma_len(sg));
312 slice->reqs[i].sem_cmd0 = cpu_to_le32(ENCODE_SEM(req->sem0.val,
319 slice->reqs[i].sem_cmd1 = cpu_to_le32(ENCODE_SEM(req->sem1.val,
326 slice->reqs[i].sem_cmd2 = cpu_to_le32(ENCODE_SEM(req->sem2.val,
333 slice->reqs[i].sem_cmd3 = cpu_to_le32(ENCODE_SEM(req->sem3.val,
344 slice->reqs[i].cmd |= GEN_COMPLETION;
345 slice->reqs[i].db_addr = db_addr;
346 slice->reqs[i].db_len = db_len;
347 slice->reqs[i].db_data = db_data;
362 req->sem0.flags |= (slice->dir == DMA_TO_DEVICE ?
364 slice->reqs[i].sem_cmd0 = cpu_to_le32(ENCODE_SEM(req->sem0.val, req->sem0.index,
367 slice->reqs[i].sem_cmd1 = cpu_to_le32(ENCODE_SEM(req->sem1.val, req->sem1.index,
370 slice->reqs[i].sem_cmd2 = cpu_to_le32(ENCODE_SEM(req->sem2.val, req->sem2.index,
373 slice->reqs[i].sem_cmd3 = cpu_to_le32(ENCODE_SEM(req->sem3.val, req->sem3.index,
384 struct bo_slice *slice;
391 slice = kmalloc(sizeof(*slice), GFP_KERNEL);
392 if (!slice) {
397 slice->reqs = kcalloc(sgt->nents, sizeof(*slice->reqs), GFP_KERNEL);
398 if (!slice->reqs) {
403 slice->no_xfer = !slice_ent->size;
404 slice->sgt = sgt;
405 slice->nents = sgt->nents;
406 slice->dir = bo->dir;
407 slice->bo = bo;
408 slice->size = slice_ent->size;
409 slice->offset = slice_ent->offset;
411 ret = encode_reqs(qdev, slice, slice_ent);
416 kref_init(&slice->ref_count);
418 list_add_tail(&slice->slice, &bo->slices);
423 kfree(slice->reqs);
425 kfree(slice);
889 struct bo_slice *slice, *temp;
891 list_for_each_entry_safe(slice, temp, &bo->slices, slice)
892 kref_put(&slice->ref_count, free_slice);
1043 static inline int copy_exec_reqs(struct qaic_device *qdev, struct bo_slice *slice, u32 dbc_id,
1047 struct dbc_req *reqs = slice->reqs;
1057 if (avail < slice->nents)
1060 if (tail + slice->nents > dbc->nelem) {
1062 avail = min_t(u32, avail, slice->nents);
1066 avail = slice->nents - avail;
1071 sizeof(*reqs) * slice->nents);
1074 *ptail = (tail + slice->nents) % dbc->nelem;
1084 static inline int copy_partial_exec_reqs(struct qaic_device *qdev, struct bo_slice *slice,
1088 struct dbc_req *reqs = slice->reqs;
1105 for (i = 0; i < slice->nents; i++) {
1143 memcpy(last_req, reqs + slice->nents - 1, sizeof(*reqs));
1166 struct bo_slice *slice;
1208 list_for_each_entry(slice, &bo->slices, slice) {
1210 * If this slice does not fall under the given
1211 * resize then skip this slice and continue the loop
1213 if (is_partial && pexec[i].resize && pexec[i].resize <= slice->offset)
1216 for (j = 0; j < slice->nents; j++)
1217 slice->reqs[j].req_id = cpu_to_le16(bo->req_id);
1221 * resize has cut this slice short then do a partial copy
1225 pexec[i].resize < slice->offset + slice->size)
1226 ret = copy_partial_exec_reqs(qdev, slice,
1227 pexec[i].resize - slice->offset,
1230 ret = copy_exec_reqs(qdev, slice, dbc->id, head, tail);
1858 struct bo_slice *slice, *slice_temp;
1876 list_for_each_entry_safe(slice, slice_temp, &bo->slices, slice)
1877 kref_put(&slice->ref_count, free_slice);