5da54698fa
This was an optimization used only by a few xscale platforms. Part of the optimization was to create a direct map for all physical pages, and that resulted in making multiple mappings of pages in a way that bypassed the logic in pmap.c to handle VIVT cache aliasing. It also just generally made the code more complex and hard to maintain for all SoCs. Reviewed by: cognet
62 lines
2.0 KiB
C
62 lines
2.0 KiB
C
/*-
|
|
* Copyright (c) 2003 Alan L. Cox <alc@cs.rice.edu>
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
* $FreeBSD$
|
|
*/
|
|
|
|
#ifndef _MACHINE_SF_BUF_H_
|
|
#define _MACHINE_SF_BUF_H_
|
|
|
|
#include <sys/queue.h>
|
|
|
|
struct vm_page;
|
|
|
|
struct sf_buf {
|
|
LIST_ENTRY(sf_buf) list_entry; /* list of buffers */
|
|
TAILQ_ENTRY(sf_buf) free_entry; /* list of buffers */
|
|
struct vm_page *m; /* currently mapped page */
|
|
vm_offset_t kva; /* va of mapping */
|
|
int ref_count; /* usage of this mapping */
|
|
};
|
|
|
|
static __inline vm_offset_t
|
|
sf_buf_kva(struct sf_buf *sf)
|
|
{
|
|
|
|
return (sf->kva);
|
|
}
|
|
|
|
static __inline struct vm_page *
|
|
sf_buf_page(struct sf_buf *sf)
|
|
{
|
|
|
|
return (sf->m);
|
|
}
|
|
|
|
struct sf_buf * sf_buf_alloc(struct vm_page *m, int flags);
|
|
void sf_buf_free(struct sf_buf *sf);
|
|
|
|
#endif /* !_MACHINE_SF_BUF_H_ */
|