cregit-Linux how code gets into the kernel

Release 4.18 drivers/media/platform/vsp1/vsp1_dl.c

// SPDX-License-Identifier: GPL-2.0+
/*
 * vsp1_dl.c  --  R-Car VSP1 Display List
 *
 * Copyright (C) 2015 Renesas Corporation
 *
 * Contact: Laurent Pinchart (laurent.pinchart@ideasonboard.com)
 */

#include <linux/device.h>
#include <linux/dma-mapping.h>
#include <linux/gfp.h>
#include <linux/refcount.h>
#include <linux/slab.h>
#include <linux/workqueue.h>

#include "vsp1.h"
#include "vsp1_dl.h"


#define VSP1_DL_NUM_ENTRIES		256


#define VSP1_DLH_INT_ENABLE		(1 << 1)

#define VSP1_DLH_AUTO_START		(1 << 0)


struct vsp1_dl_header_list {
	
u32 num_bytes;
	
u32 addr;
} __attribute__((__packed__));


struct vsp1_dl_header {
	
u32 num_lists;
	
struct vsp1_dl_header_list lists[8];
	
u32 next_header;
	
u32 flags;
} __attribute__((__packed__));


struct vsp1_dl_entry {
	
u32 addr;
	
u32 data;
} __attribute__((__packed__));

/**
 * struct vsp1_dl_body - Display list body
 * @list: entry in the display list list of bodies
 * @free: entry in the pool free body list
 * @pool: pool to which this body belongs
 * @vsp1: the VSP1 device
 * @entries: array of entries
 * @dma: DMA address of the entries
 * @size: size of the DMA memory in bytes
 * @num_entries: number of stored entries
 * @max_entries: number of entries available
 */

struct vsp1_dl_body {
	
struct list_head list;
	
struct list_head free;

	
refcount_t refcnt;

	
struct vsp1_dl_body_pool *pool;
	
struct vsp1_device *vsp1;

	
struct vsp1_dl_entry *entries;
	
dma_addr_t dma;
	
size_t size;

	
unsigned int num_entries;
	
unsigned int max_entries;
};

/**
 * struct vsp1_dl_body_pool - display list body pool
 * @dma: DMA address of the entries
 * @size: size of the full DMA memory pool in bytes
 * @mem: CPU memory pointer for the pool
 * @bodies: Array of DLB structures for the pool
 * @free: List of free DLB entries
 * @lock: Protects the free list
 * @vsp1: the VSP1 device
 */

struct vsp1_dl_body_pool {
	/* DMA allocation */
	
dma_addr_t dma;
	
size_t size;
	
void *mem;

	/* Body management */
	
struct vsp1_dl_body *bodies;
	
struct list_head free;
	
spinlock_t lock;

	
struct vsp1_device *vsp1;
};

/**
 * struct vsp1_dl_list - Display list
 * @list: entry in the display list manager lists
 * @dlm: the display list manager
 * @header: display list header, NULL for headerless lists
 * @dma: DMA address for the header
 * @body0: first display list body
 * @bodies: list of extra display list bodies
 * @has_chain: if true, indicates that there's a partition chain
 * @chain: entry in the display list partition chain
 * @internal: whether the display list is used for internal purpose
 */

struct vsp1_dl_list {
	
struct list_head list;
	
struct vsp1_dl_manager *dlm;

	
struct vsp1_dl_header *header;
	
dma_addr_t dma;

	
struct vsp1_dl_body *body0;
	
struct list_head bodies;

	
bool has_chain;
	
struct list_head chain;

	
bool internal;
};


enum vsp1_dl_mode {
	
VSP1_DL_MODE_HEADER,
	
VSP1_DL_MODE_HEADERLESS,
};

/**
 * struct vsp1_dl_manager - Display List manager
 * @index: index of the related WPF
 * @mode: display list operation mode (header or headerless)
 * @singleshot: execute the display list in single-shot mode
 * @vsp1: the VSP1 device
 * @lock: protects the free, active, queued, and pending lists
 * @free: array of all free display lists
 * @active: list currently being processed (loaded) by hardware
 * @queued: list queued to the hardware (written to the DL registers)
 * @pending: list waiting to be queued to the hardware
 * @pool: body pool for the display list bodies
 */

struct vsp1_dl_manager {
	
unsigned int index;
	
enum vsp1_dl_mode mode;
	
bool singleshot;
	
struct vsp1_device *vsp1;

	
spinlock_t lock;
	
struct list_head free;
	
struct vsp1_dl_list *active;
	
struct vsp1_dl_list *queued;
	
struct vsp1_dl_list *pending;

	
struct vsp1_dl_body_pool *pool;
};

/* -----------------------------------------------------------------------------
 * Display List Body Management
 */

/**
 * vsp1_dl_body_pool_create - Create a pool of bodies from a single allocation
 * @vsp1: The VSP1 device
 * @num_bodies: The number of bodies to allocate
 * @num_entries: The maximum number of entries that a body can contain
 * @extra_size: Extra allocation provided for the bodies
 *
 * Allocate a pool of display list bodies each with enough memory to contain the
 * requested number of entries plus the @extra_size.
 *
 * Return a pointer to a pool on success or NULL if memory can't be allocated.
 */

struct vsp1_dl_body_pool * vsp1_dl_body_pool_create(struct vsp1_device *vsp1, unsigned int num_bodies, unsigned int num_entries, size_t extra_size) { struct vsp1_dl_body_pool *pool; size_t dlb_size; unsigned int i; pool = kzalloc(sizeof(*pool), GFP_KERNEL); if (!pool) return NULL; pool->vsp1 = vsp1; /* * TODO: 'extra_size' is only used by vsp1_dlm_create(), to allocate * extra memory for the display list header. We need only one header per * display list, not per display list body, thus this allocation is * extraneous and should be reworked in the future. */ dlb_size = num_entries * sizeof(struct vsp1_dl_entry) + extra_size; pool->size = dlb_size * num_bodies; pool->bodies = kcalloc(num_bodies, sizeof(*pool->bodies), GFP_KERNEL); if (!pool->bodies) { kfree(pool); return NULL; } pool->mem = dma_alloc_wc(vsp1->bus_master, pool->size, &pool->dma, GFP_KERNEL); if (!pool->mem) { kfree(pool->bodies); kfree(pool); return NULL; } spin_lock_init(&pool->lock); INIT_LIST_HEAD(&pool->free); for (i = 0; i < num_bodies; ++i) { struct vsp1_dl_body *dlb = &pool->bodies[i]; dlb->pool = pool; dlb->max_entries = num_entries; dlb->dma = pool->dma + i * dlb_size; dlb->entries = pool->mem + i * dlb_size; list_add_tail(&dlb->free, &pool->free); } return pool; }

Contributors

PersonTokensPropCommitsCommitProp
Kieran Bingham261100.00%1100.00%
Total261100.00%1100.00%

/** * vsp1_dl_body_pool_destroy - Release a body pool * @pool: The body pool * * Release all components of a pool allocation. */
void vsp1_dl_body_pool_destroy(struct vsp1_dl_body_pool *pool) { if (!pool) return; if (pool->mem) dma_free_wc(pool->vsp1->bus_master, pool->size, pool->mem, pool->dma); kfree(pool->bodies); kfree(pool); }

Contributors

PersonTokensPropCommitsCommitProp
Kieran Bingham55100.00%1100.00%
Total55100.00%1100.00%

/** * vsp1_dl_body_get - Obtain a body from a pool * @pool: The body pool * * Obtain a body from the pool without blocking. * * Returns a display list body or NULL if there are none available. */
struct vsp1_dl_body *vsp1_dl_body_get(struct vsp1_dl_body_pool *pool) { struct vsp1_dl_body *dlb = NULL; unsigned long flags; spin_lock_irqsave(&pool->lock, flags); if (!list_empty(&pool->free)) { dlb = list_first_entry(&pool->free, struct vsp1_dl_body, free); list_del(&dlb->free); refcount_set(&dlb->refcnt, 1); } spin_unlock_irqrestore(&pool->lock, flags); return dlb; }

Contributors

PersonTokensPropCommitsCommitProp
Kieran Bingham92100.00%2100.00%
Total92100.00%2100.00%

/** * vsp1_dl_body_put - Return a body back to its pool * @dlb: The display list body * * Return a body back to the pool, and reset the num_entries to clear the list. */
void vsp1_dl_body_put(struct vsp1_dl_body *dlb) { unsigned long flags; if (!dlb) return; if (!refcount_dec_and_test(&dlb->refcnt)) return; dlb->num_entries = 0; spin_lock_irqsave(&dlb->pool->lock, flags); list_add_tail(&dlb->free, &dlb->pool->free); spin_unlock_irqrestore(&dlb->pool->lock, flags); }

Contributors

PersonTokensPropCommitsCommitProp
Kieran Bingham77100.00%2100.00%
Total77100.00%2100.00%

/** * vsp1_dl_body_write - Write a register to a display list body * @dlb: The body * @reg: The register address * @data: The register value * * Write the given register and value to the display list body. The maximum * number of entries that can be written in a body is specified when the body is * allocated by vsp1_dl_body_alloc(). */
void vsp1_dl_body_write(struct vsp1_dl_body *dlb, u32 reg, u32 data) { if (WARN_ONCE(dlb->num_entries >= dlb->max_entries, "DLB size exceeded (max %u)", dlb->max_entries)) return; dlb->entries[dlb->num_entries].addr = reg; dlb->entries[dlb->num_entries].data = data; dlb->num_entries++; }

Contributors

PersonTokensPropCommitsCommitProp
Laurent Pinchart4668.66%133.33%
Kieran Bingham2131.34%266.67%
Total67100.00%3100.00%

/* ----------------------------------------------------------------------------- * Display List Transaction Management */
static struct vsp1_dl_list *vsp1_dl_list_alloc(struct vsp1_dl_manager *dlm) { struct vsp1_dl_list *dl; dl = kzalloc(sizeof(*dl), GFP_KERNEL); if (!dl) return NULL; INIT_LIST_HEAD(&dl->bodies); dl->dlm = dlm; /* Get a default body for our list. */ dl->body0 = vsp1_dl_body_get(dlm->pool); if (!dl->body0) return NULL; if (dlm->mode == VSP1_DL_MODE_HEADER) { size_t header_offset = dl->body0->max_entries * sizeof(*dl->body0->entries); dl->header = ((void *)dl->body0->entries) + header_offset; dl->dma = dl->body0->dma + header_offset; memset(dl->header, 0, sizeof(*dl->header)); dl->header->lists[0].addr = dl->body0->dma; } return dl; }

Contributors

PersonTokensPropCommitsCommitProp
Laurent Pinchart13176.61%350.00%
Kieran Bingham2715.79%233.33%
Takashi Saito137.60%116.67%
Total171100.00%6100.00%


static void vsp1_dl_list_bodies_put(struct vsp1_dl_list *dl) { struct vsp1_dl_body *dlb, *tmp; list_for_each_entry_safe(dlb, tmp, &dl->bodies, list) { list_del(&dlb->list); vsp1_dl_body_put(dlb); } }

Contributors

PersonTokensPropCommitsCommitProp
Kieran Bingham4193.18%133.33%
Laurent Pinchart36.82%266.67%
Total44100.00%3100.00%


static void vsp1_dl_list_free(struct vsp1_dl_list *dl) { vsp1_dl_body_put(dl->body0); vsp1_dl_list_bodies_put(dl); kfree(dl); }

Contributors

PersonTokensPropCommitsCommitProp
Takashi Saito1553.57%120.00%
Laurent Pinchart1139.29%360.00%
Kieran Bingham27.14%120.00%
Total28100.00%5100.00%

/** * vsp1_dl_list_get - Get a free display list * @dlm: The display list manager * * Get a display list from the pool of free lists and return it. * * This function must be called without the display list manager lock held. */
struct vsp1_dl_list *vsp1_dl_list_get(struct vsp1_dl_manager *dlm) { struct vsp1_dl_list *dl = NULL; unsigned long flags; spin_lock_irqsave(&dlm->lock, flags); if (!list_empty(&dlm->free)) { dl = list_first_entry(&dlm->free, struct vsp1_dl_list, list); list_del(&dl->list); /* * The display list chain must be initialised to ensure every * display list can assert list_empty() if it is not in a chain. */ INIT_LIST_HEAD(&dl->chain); } spin_unlock_irqrestore(&dlm->lock, flags); return dl; }

Contributors

PersonTokensPropCommitsCommitProp
Takashi Saito4852.75%125.00%
Laurent Pinchart3437.36%125.00%
Kieran Bingham88.79%125.00%
Mauro Carvalho Chehab11.10%125.00%
Total91100.00%4100.00%

/* This function must be called with the display list manager lock held.*/
static void __vsp1_dl_list_put(struct vsp1_dl_list *dl) { struct vsp1_dl_list *dl_child; if (!dl) return; /* * Release any linked display-lists which were chained for a single * hardware operation. */ if (dl->has_chain) { list_for_each_entry(dl_child, &dl->chain, chain) __vsp1_dl_list_put(dl_child); } dl->has_chain = false; vsp1_dl_list_bodies_put(dl); /* * body0 is reused as as an optimisation as presently every display list * has at least one body, thus we reinitialise the entries list. */ dl->body0->num_entries = 0; list_add_tail(&dl->list, &dl->dlm->free); }

Contributors

PersonTokensPropCommitsCommitProp
Kieran Bingham3544.30%225.00%
Laurent Pinchart3443.04%450.00%
Takashi Saito911.39%112.50%
Mauro Carvalho Chehab11.27%112.50%
Total79100.00%8100.00%

/** * vsp1_dl_list_put - Release a display list * @dl: The display list * * Release the display list and return it to the pool of free lists. * * Passing a NULL pointer to this function is safe, in that case no operation * will be performed. */
void vsp1_dl_list_put(struct vsp1_dl_list *dl) { unsigned long flags; if (!dl) return; spin_lock_irqsave(&dl->dlm->lock, flags); __vsp1_dl_list_put(dl); spin_unlock_irqrestore(&dl->dlm->lock, flags); }

Contributors

PersonTokensPropCommitsCommitProp
Laurent Pinchart49100.00%1100.00%
Total49100.00%1100.00%

/** * vsp1_dl_list_get_body0 - Obtain the default body for the display list * @dl: The display list * * Obtain a pointer to the internal display list body allowing this to be passed * directly to configure operations. */
struct vsp1_dl_body *vsp1_dl_list_get_body0(struct vsp1_dl_list *dl) { return dl->body0; }

Contributors

PersonTokensPropCommitsCommitProp
Takashi Saito741.18%120.00%
Kieran Bingham635.29%120.00%
Laurent Pinchart423.53%360.00%
Total17100.00%5100.00%

/** * vsp1_dl_list_add_body - Add a body to the display list * @dl: The display list * @dlb: The body * * Add a display list body to a display list. Registers contained in bodies are * processed after registers contained in the main display list, in the order in * which bodies are added. * * Adding a body to a display list passes ownership of the body to the list. The * caller retains its reference to the fragment when adding it to the display * list, but is not allowed to add new entries to the body. * * The reference must be explicitly released by a call to vsp1_dl_body_put() * when the body isn't needed anymore. * * Additional bodies are only usable for display lists in header mode. * Attempting to add a body to a header-less display list will return an error. */
int vsp1_dl_list_add_body(struct vsp1_dl_list *dl, struct vsp1_dl_body *dlb) { /* Multi-body lists are only available in header mode. */ if (dl->dlm->mode != VSP1_DL_MODE_HEADER) return -EINVAL; refcount_inc(&dlb->refcnt); list_add_tail(&dlb->list, &dl->bodies); return 0; }

Contributors

PersonTokensPropCommitsCommitProp
Laurent Pinchart4074.07%240.00%
Kieran Bingham1018.52%240.00%
Takashi Saito47.41%120.00%
Total54100.00%5100.00%

/** * vsp1_dl_list_add_chain - Add a display list to a chain * @head: The head display list * @dl: The new display list * * Add a display list to an existing display list chain. The chained lists * will be automatically processed by the hardware without intervention from * the CPU. A display list end interrupt will only complete after the last * display list in the chain has completed processing. * * Adding a display list to a chain passes ownership of the display list to * the head display list item. The chain is released when the head dl item is * put back with __vsp1_dl_list_put(). * * Chained display lists are only usable in header mode. Attempts to add a * display list to a chain in header-less mode will return an error. */
int vsp1_dl_list_add_chain(struct vsp1_dl_list *head, struct vsp1_dl_list *dl) { /* Chained lists are only available in header mode. */ if (head->dlm->mode != VSP1_DL_MODE_HEADER) return -EINVAL; head->has_chain = true; list_add_tail(&dl->chain, &head->chain); return 0; }

Contributors

PersonTokensPropCommitsCommitProp
Kieran Bingham3669.23%133.33%
Takashi Saito1325.00%133.33%
Laurent Pinchart35.77%133.33%
Total52100.00%3100.00%


static void vsp1_dl_list_fill_header(struct vsp1_dl_list *dl, bool is_last) { struct vsp1_dl_manager *dlm = dl->dlm; struct vsp1_dl_header_list *hdr = dl->header->lists; struct vsp1_dl_body *dlb; unsigned int num_lists = 0; /* * Fill the header with the display list bodies addresses and sizes. The * address of the first body has already been filled when the display * list was allocated. */ hdr->num_bytes = dl->body0->num_entries * sizeof(*dl->header->lists); list_for_each_entry(dlb, &dl->bodies, list) { num_lists++; hdr++; hdr->addr = dlb->dma; hdr->num_bytes = dlb->num_entries * sizeof(*dl->header->lists); } dl->header->num_lists = num_lists; if (!list_empty(&dl->chain) && !is_last) { /* * If this display list's chain is not empty, we are on a list, * and the next item is the display list that we must queue for * automatic processing by the hardware. */ struct vsp1_dl_list *next = list_next_entry(dl, chain); dl->header->next_header = next->dma; dl->header->flags = VSP1_DLH_AUTO_START; } else if (!dlm->singleshot) { /* * if the display list manager works in continuous mode, the VSP * should loop over the display list continuously until * instructed to do otherwise. */ dl->header->next_header = dl->dma; dl->header->flags = VSP1_DLH_INT_ENABLE | VSP1_DLH_AUTO_START; } else { /* * Otherwise, in mem-to-mem mode, we work in single-shot mode * and the next display list must not be started automatically. */ dl->header->flags = VSP1_DLH_INT_ENABLE; } }

Contributors

PersonTokensPropCommitsCommitProp
Laurent Pinchart13465.05%342.86%
Kieran Bingham7134.47%342.86%
Mauro Carvalho Chehab10.49%114.29%
Total206100.00%7100.00%


static bool vsp1_dl_list_hw_update_pending(struct vsp1_dl_manager *dlm) { struct vsp1_device *vsp1 = dlm->vsp1; if (!dlm->queued) return false; /* * Check whether the VSP1 has taken the update. In headerless mode the * hardware indicates this by clearing the UPD bit in the DL_BODY_SIZE * register, and in header mode by clearing the UPDHDR bit in the CMD * register. */ if (dlm->mode == VSP1_DL_MODE_HEADERLESS) return !!(vsp1_read(vsp1, VI6_DL_BODY_SIZE) & VI6_DL_BODY_SIZE_UPD); else return !!(vsp1_read(vsp1, VI6_CMD(dlm->index)) & VI6_CMD_UPDHDR); }

Contributors

PersonTokensPropCommitsCommitProp
Laurent Pinchart4358.90%350.00%
Kieran Bingham2027.40%233.33%
Takashi Saito1013.70%116.67%
Total73100.00%6100.00%


static void vsp1_dl_list_hw_enqueue(struct vsp1_dl_list *dl) { struct vsp1_dl_manager *dlm = dl->dlm; struct vsp1_device *vsp1 = dlm->vsp1; if (dlm->mode == VSP1_DL_MODE_HEADERLESS) { /* * In headerless mode, program the hardware directly with the * display list body address and size and set the UPD bit. The * bit will be cleared by the hardware when the display list * processing starts. */ vsp1_write(vsp1, VI6_DL_HDR_ADDR(0), dl->body0->dma); vsp1_write(vsp1, VI6_DL_BODY_SIZE, VI6_DL_BODY_SIZE_UPD | (dl->body0->num_entries * sizeof(*dl->header->lists))); } else { /* * In header mode, program the display list header address. If * the hardware is idle (single-shot mode or first frame in * continuous mode) it will then be started independently. If * the hardware is operating, the VI6_DL_HDR_REF_ADDR register * will be updated with the display list address. */ vsp1_write(vsp1, VI6_DL_HDR_ADDR(dlm->index), dl->dma); } }

Contributors

PersonTokensPropCommitsCommitProp
Laurent Pinchart6866.02%360.00%
Takashi Saito3332.04%120.00%
Kieran Bingham21.94%120.00%
Total103100.00%5100.00%


static void vsp1_dl_list_commit_continuous(struct vsp1_dl_list *dl) { struct vsp1_dl_manager *dlm = dl->dlm; /* * If a previous display list has been queued to the hardware but not * processed yet, the VSP can start processing it at any time. In that * case we can't replace the queued list by the new one, as we could * race with the hardware. We thus mark the update as pending, it will * be queued up to the hardware by the frame end interrupt handler. * * If a display list is already pending we simply drop it as the new * display list is assumed to contain a more recent configuration. It is * an error if the already pending list has the internal flag set, as * there is then a process waiting for that list to complete. This * shouldn't happen as the waiting process should perform proper * locking, but warn just in case. */ if (vsp1_dl_list_hw_update_pending(dlm)) { WARN_ON(dlm->pending && dlm->pending->internal); __vsp1_dl_list_put(dlm->pending); dlm->pending = dl; return; } /* * Pass the new display list to the hardware and mark it as queued. It * will become active when the hardware starts processing it. */ vsp1_dl_list_hw_enqueue(dl); __vsp1_dl_list_put(dlm->queued); dlm->queued = dl; }

Contributors

PersonTokensPropCommitsCommitProp
Laurent Pinchart76100.00%2100.00%
Total76100.00%2100.00%


static void vsp1_dl_list_commit_singleshot(struct vsp1_dl_list *dl) { struct vsp1_dl_manager *dlm = dl->dlm; /* * When working in single-shot mode, the caller guarantees that the * hardware is idle at this point. Just commit the head display list * to hardware. Chained lists will be started automatically. */ vsp1_dl_list_hw_enqueue(dl); dlm->active = dl; }

Contributors

PersonTokensPropCommitsCommitProp
Laurent Pinchart32100.00%1100.00%
Total32100.00%1100.00%


void vsp1_dl_list_commit(struct vsp1_dl_list *dl, bool internal) { struct vsp1_dl_manager *dlm = dl->dlm; struct vsp1_dl_list *dl_child; unsigned long flags; if (dlm->mode == VSP1_DL_MODE_HEADER) { /* Fill the header for the head and chained display lists. */ vsp1_dl_list_fill_header(dl, list_empty(&dl->chain)); list_for_each_entry(dl_child, &dl->chain, chain) { bool last = list_is_last(&dl_child->chain, &dl->chain); vsp1_dl_list_fill_header(dl_child, last); } } dl->internal = internal; spin_lock_irqsave(&dlm->lock, flags); if (dlm->singleshot) vsp1_dl_list_commit_singleshot(dl); else vsp1_dl_list_commit_continuous(dl); spin_unlock_irqrestore(&dlm->lock, flags); }

Contributors

PersonTokensPropCommitsCommitProp
Laurent Pinchart12192.37%375.00%
Takashi Saito107.63%125.00%
Total131100.00%4100.00%

/* ----------------------------------------------------------------------------- * Display List Manager */ /** * vsp1_dlm_irq_frame_end - Display list handler for the frame end interrupt * @dlm: the display list manager * * Return a set of flags that indicates display list completion status. * * The VSP1_DL_FRAME_END_COMPLETED flag indicates that the previous display list * has completed at frame end. If the flag is not returned display list * completion has been delayed by one frame because the display list commit * raced with the frame end interrupt. The function always returns with the flag * set in header mode as display list processing is then not continuous and * races never occur. * * The VSP1_DL_FRAME_END_INTERNAL flag indicates that the previous display list * has completed and had been queued with the internal notification flag. * Internal notification is only supported for continuous mode. */
unsigned int vsp1_dlm_irq_frame_end(struct vsp1_dl_manager *dlm) { unsigned int flags = 0; spin_lock(&dlm->lock); /* * The mem-to-mem pipelines work in single-shot mode. No new display * list can be queued, we don't have to do anything. */ if (dlm->singleshot) { __vsp1_dl_list_put(dlm->active); dlm->active = NULL; flags |= VSP1_DL_FRAME_END_COMPLETED; goto done; } /* * If the commit operation raced with the interrupt and occurred after * the frame end event but before interrupt processing, the hardware * hasn't taken the update into account yet. We have to skip one frame * and retry. */ if (vsp1_dl_list_hw_update_pending(dlm)) goto done; /* * The device starts processing the queued display list right after the * frame end interrupt. The display list thus becomes active. */ if (dlm->queued) { if (dlm->queued->internal) flags |= VSP1_DL_FRAME_END_INTERNAL; dlm->queued->internal = false; __vsp1_dl_list_put(dlm->active); dlm->active = dlm->queued; dlm->queued = NULL; flags |= VSP1_DL_FRAME_END_COMPLETED; } /* * Now that the VSP has started processing the queued display list, we * can queue the pending display list to the hardware if one has been * prepared. */ if (dlm->pending) { vsp1_dl_list_hw_enqueue(dlm->pending); dlm->queued = dlm->pending; dlm->pending = NULL; } done: spin_unlock(&dlm->lock); return flags; }

Contributors

PersonTokensPropCommitsCommitProp
Laurent Pinchart8854.32%777.78%
Takashi Saito6741.36%111.11%
Kieran Bingham74.32%111.11%
Total162100.00%9100.00%

/* Hardware Setup */
void vsp1_dlm_setup(struct vsp1_device *vsp1) { u32 ctrl = (256 << VI6_DL_CTRL_AR_WAIT_SHIFT) | VI6_DL_CTRL_DC2 | VI6_DL_CTRL_DC1 | VI6_DL_CTRL_DC0 | VI6_DL_CTRL_DLE; /* * The DRM pipeline operates with display lists in Continuous Frame * Mode, all other pipelines use manual start. */ if (vsp1->drm) ctrl |= VI6_DL_CTRL_CFM0 | VI6_DL_CTRL_NH0; vsp1_write(vsp1, VI6_DL_CTRL, ctrl); vsp1_write(vsp1, VI6_DL_SWAP, VI6_DL_SWAP_LWS); }

Contributors

PersonTokensPropCommitsCommitProp
Takashi Saito4882.76%125.00%
Laurent Pinchart1017.24%375.00%
Total58100.00%4100.00%


void vsp1_dlm_reset(struct vsp1_dl_manager *dlm) { unsigned long flags; spin_lock_irqsave(&dlm->lock, flags); __vsp1_dl_list_put(dlm->active); __vsp1_dl_list_put(dlm->queued); __vsp1_dl_list_put(dlm->pending); spin_unlock_irqrestore(&dlm->lock, flags); dlm->active = NULL; dlm->queued = NULL; dlm->pending = NULL; }

Contributors

PersonTokensPropCommitsCommitProp
Laurent Pinchart5271.23%266.67%
Takashi Saito2128.77%133.33%
Total73100.00%3100.00%


struct vsp1_dl_body *vsp1_dlm_dl_body_get(struct vsp1_dl_manager *dlm) { return vsp1_dl_body_get(dlm->pool); }

Contributors

PersonTokensPropCommitsCommitProp
Kieran Bingham20100.00%1100.00%
Total20100.00%1100.00%


struct vsp1_dl_manager *vsp1_dlm_create(struct vsp1_device *vsp1, unsigned int index, unsigned int prealloc) { struct vsp1_dl_manager *dlm; size_t header_size; unsigned int i; dlm = devm_kzalloc(vsp1->dev, sizeof(*dlm), GFP_KERNEL); if (!dlm) return NULL; dlm->index = index; dlm->mode = index == 0 && !vsp1->info->uapi ? VSP1_DL_MODE_HEADERLESS : VSP1_DL_MODE_HEADER; dlm->singleshot = vsp1->info->uapi; dlm->vsp1 = vsp1; spin_lock_init(&dlm->lock); INIT_LIST_HEAD(&dlm->free); /* * Initialize the display list body and allocate DMA memory for the body * and the optional header. Both are allocated together to avoid memory * fragmentation, with the header located right after the body in * memory. An extra body is allocated on top of the prealloc to account * for the cached body used by the vsp1_pipeline object. */ header_size = dlm->mode == VSP1_DL_MODE_HEADER ? ALIGN(sizeof(struct vsp1_dl_header), 8) : 0; dlm->pool = vsp1_dl_body_pool_create(vsp1, prealloc + 1, VSP1_DL_NUM_ENTRIES, header_size); if (!dlm->pool) return NULL; for (i = 0; i < prealloc; ++i) { struct vsp1_dl_list *dl; dl = vsp1_dl_list_alloc(dlm); if (!dl) return NULL; list_add_tail(&dl->list, &dlm->free); } return dlm; }

Contributors

PersonTokensPropCommitsCommitProp
Laurent Pinchart13362.15%562.50%
Kieran Bingham4320.09%225.00%
Takashi Saito3817.76%112.50%
Total214100.00%8100.00%


void vsp1_dlm_destroy(struct vsp1_dl_manager *dlm) { struct vsp1_dl_list *dl, *next; if (!dlm) return; list_for_each_entry_safe(dl, next, &dlm->free, list) { list_del(&dl->list); vsp1_dl_list_free(dl); } vsp1_dl_body_pool_destroy(dlm->pool); }

Contributors

PersonTokensPropCommitsCommitProp
Laurent Pinchart3460.71%360.00%
Takashi Saito1933.93%120.00%
Kieran Bingham35.36%120.00%
Total56100.00%5100.00%


Overall Contributors

PersonTokensPropCommitsCommitProp
Laurent Pinchart131249.77%1453.85%
Kieran Bingham91634.75%1038.46%
Takashi Saito40515.36%13.85%
Mauro Carvalho Chehab30.11%13.85%
Total2636100.00%26100.00%
Information contained on this website is for historical information purposes only and does not indicate or represent copyright ownership.
Created with cregit.