HomeSort by: relevance | last modified time | path
    Searched refs:way (Results 1 - 25 of 75) sorted by relevancy

1 2 3

  /src/sys/arch/sh3/sh3/
mmu_sh3.c 28 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
61 int i, way; local
66 for (way = 0; way < SH3_MMU_WAY; ++way) {
67 a = idx | (way << SH3_MMU_WAY_SHIFT);
80 int i, way; local
85 for (way = 0; way < SH3_MMU_WAY; ++way) {
99 int way; local
130 int way; local
    [all...]
cache_sh3.c 28 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
99 * In RAM-mode, way 2 and 3 are used as RAM.
109 sh_cache_way_size = sh_cache_size_unified / 4/*way*/;
112 /* shift for way selection (16KB/8KB) */
115 ffs(sh_cache_size_unified / (4/*way*/ * 16/*line-size*/)) - 1
145 int way; local
150 /* operate for each way */
151 for (way = 0; way < n; way++)
167 int way; local
    [all...]
  /src/sys/arch/playstation2/playstation2/
locore_machdep.S 25 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
156 srl t2, 1 # Two way set assoc
162 cache CACHEOP_R5900_IWBINV_D, 0(t0);sync.l;sync.p # way 0
163 cache CACHEOP_R5900_IWBINV_D, 1(t0);sync.l;sync.p # way 1
165 cache CACHEOP_R5900_IWBINV_D, 64(t0);sync.l;sync.p # way 0
166 cache CACHEOP_R5900_IWBINV_D, 65(t0);sync.l;sync.p # way 1
168 cache CACHEOP_R5900_IWBINV_D,128(t0);sync.l;sync.p # way 0
169 cache CACHEOP_R5900_IWBINV_D,129(t0);sync.l;sync.p # way 1
171 cache CACHEOP_R5900_IWBINV_D,192(t0);sync.l;sync.p # way 0
172 cache CACHEOP_R5900_IWBINV_D,193(t0);sync.l;sync.p # way
    [all...]
  /src/sys/arch/mips/mips/
cache_octeon.c 134 /* way = (0 .. 3) */
136 int way; local
138 for (way = 0; way < maxway; way++)
139 octeon_icache_dump_way(way);
143 octeon_icache_dump_way(int way)
150 octeon_icache_dump_index(way, index);
154 octeon_icache_dump_index(int way, int index)
156 const vaddr_t va = (way << 13) | (index << 7)
207 int way; local
    [all...]
cache_mipsNN.c 34 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
131 * If we are going to flush more than is in a way (or the stride
132 * need for that way), we are flushing everything.
139 for (size_t way = 0; way < ways; way++) {
169 * If we are going to flush more than is in a way, we are flushing
179 * Invalidate each way. If the address range wraps past the end of
180 * the way, we will be invalidating in two ways but eventually things
181 * work out since the last way will wrap into the first way
    [all...]
cache_r5k.c 34 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
51 * - 2-way set-associative
55 * Since the R4600 is so similar (2-way set-associative, 32b/l),
136 * If we are going to flush more than is in a way (or the stride
137 * needed for that way), we are flushing everything.
144 for (size_t way = 0; way < ways; way++) {
187 * If we are going to flush more than is in a way, we are flushing
197 * Invalidate each way. If the address range wraps past the end o
    [all...]
  /src/lib/libtelnet/
auth.h 27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
65 int way; member in struct:XauthP
auth.c 27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
137 findauthenticator(int type, int way)
141 while (ap->type && (ap->type != type || ap->way != way))
163 ap->type, ap->way);
167 Name, ap->type, ap->way);
299 Name, ap->type, ap->way);
302 *e++ = ap->way;
kerberos5.c 27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
116 *p++ = ap->way;
204 if ((ap->way & AUTH_HOW_MASK) == AUTH_HOW_MUTUAL)
234 foo[1] = ap->way;
334 foo[1] = ap->way;
384 if ((ap->way & AUTH_HOW_MASK) == AUTH_HOW_MUTUAL) {
526 if ((ap->way & AUTH_HOW_MASK) == AUTH_HOW_MUTUAL &&
559 if ((ap->way & AUTH_HOW_MASK) == AUTH_HOW_MUTUAL) {
  /src/sys/arch/arm/arm32/
arm32_tlb.c 26 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
152 for (size_t way = 0; way < 2; way++) {
154 __SHIFTIN(way, ARM_TLBDATAOP_WAY)
184 for (size_t way = 0; way < 2; way++) {
186 __SHIFTIN(way, ARM_TLBDATAOP_WAY)
236 /* no way to view the TLB *
    [all...]
db_machdep.c 231 tlb_print_addr(size_t way, size_t va_index, vaddr_t vpn, paddr_t pfn)
233 db_printf("[%1zu:%02zx] 0x%05lx000 0x%05lx000", way, va_index, vpn, pfn);
277 tlb_print_cortex_a5_entry(size_t way, size_t va_index, uint32_t d0, uint32_t d1)
288 tlb_print_addr(way, va_index, vpn, pfn);
342 tlb_print_cortex_a7_entry(size_t way, size_t va_index, uint32_t d0, uint32_t d1)
351 tlb_print_addr(way, va_index, vpn, pfn);
422 for (size_t way = 0; way < 2; way++) {
425 | __SHIFTIN(way, ARM_TLBDATAOP_WAY))
    [all...]
  /src/sys/stand/efiboot/bootarm/
cache.S 22 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
77 orr r3, r3, r2 @ merge set into way/set/level
82 clz r2, ip @ number of bits to MSB of way
83 lsl ip, ip, r2 @ shift by that into way position
85 lsl r2, r0, r2 @ r2 now contains the way decr
86 mov r0, r3 @ get sets/level (no way yet)
87 orr r3, r3, ip @ merge way into way/set/level
89 sub r2, r2, r0 @ subtract from way decr
91 /* r3 = ways/sets/level, r2 = way decr, r1 = set decr, r0 and ip are free *
    [all...]
  /src/sys/arch/aarch64/aarch64/
cpufunc.c 25 * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
281 "L%d %uKB/%uB %u-way (%u set) %s %s cache\n",
311 unsigned int set, way, setshift, wayshift; local
316 for (way = 0; way < cunit->cache_ways; way++) {
318 x = (way << wayshift) | (set << setshift) |
329 unsigned int set, way, setshift, wayshift; local
334 for (way = 0; way < cunit->cache_ways; way++)
347 unsigned int set, way, setshift, wayshift; local
    [all...]
  /src/lib/libc/arch/powerpc64/string/
bzero.S 28 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
73 std 0, 0(10) # 8-way + unrolled store loop
89 std 0, 0(10) # 8-way not-unrolled loop
  /src/usr.bin/make/unit-tests/
export-all.mk 6 # the old way to do :tA
dep-var.mk 6 # be the only way to reach the lower half of SuffExpandChildren.
44 # the empty string. This way, the final output is the string
49 # The number of actual expansions is way more than one might expect,
var-scope-cmdline.mk 20 # way:
75 # installing the cmdline variable instead. Since there is no obvious way to
79 # See varmod-loop.mk for a non-obvious way to undefine a cmdline variable.
  /src/sys/arch/hpc/stand/hpcboot/sh3/
sh_mmu.cpp 28 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
48 int way, kmode; local
66 for (way = 0; way < SH3_MMU_WAY; way++) {
67 entry_idx = idx | (way << SH3_MMU_WAY_SHIFT);
175 DPRINTF((TEXT(" [way %d]\n"), i));
  /src/distrib/mac68k/miniroot/
install.md 29 # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
134 simple and rational way. You'll be asked several questions, and it would
  /src/games/battlestar/
room.c 27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
116 truedirec(int way, int option)
118 switch (way) {
  /src/sys/arch/arm/arm/
cpufunc_asm_armv7.S 22 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
335 clz r1, r3 @ number of bits to MSB of way
338 lsl ip, ip, r1 @ ip now contains the way decr
344 sub ip, ip, r2 @ subtract numsets - 1 from way decr
347 mov r2, ip @ r2 now contains set way decr
349 /* r3 = ways/sets, r2 = way decr, r1 = set decr, r0 and ip are free */
350 1: mcr p15, 0, r3, c7, c6, 2 @ DCISW (data cache invalidate by set/way)
351 movs r0, r3 @ get current way/set
353 lsls r0, r0, #10 @ clear way bits leaving only set bits
355 subeq r3, r3, r2 @ zero?, decrement way # and restore set coun
    [all...]
  /src/sys/arch/sparc64/sparc64/
lock_stubs.s 28 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
67 nop ! hard way
  /src/sys/arch/amiga/stand/loadkmap/din/
din-kbdmap.c 423 /* string table. If there's a better way to get the offsets into the
  /src/sys/arch/amiga/stand/loadkmap/pl_din/
pl_din-kbdmap.c 428 /* string table. If there's a better way to get the offsets into the
  /src/sys/arch/x68k/dev/
kbdmap.c 262 /* string table. If there's a better way to get the offsets into the

Completed in 322 milliseconds

1 2 3