| /bionic/libc/kernel/arch-mips/asm/ |
| cpu-info.h | 26 unsigned char ways; member in struct:cache_desc
|
| /development/ndk/platforms/android-9/arch-mips/include/asm/ |
| cpu-info.h | 26 unsigned char ways; member in struct:cache_desc
|
| /prebuilts/ndk/8/platforms/android-14/arch-mips/usr/include/asm/ |
| cpu-info.h | 26 unsigned char ways; member in struct:cache_desc
|
| /prebuilts/ndk/8/platforms/android-9/arch-mips/usr/include/asm/ |
| cpu-info.h | 26 unsigned char ways; member in struct:cache_desc
|
| /external/eigen/bench/ |
| check_cache_queries.cpp | 65 int ways = (abcd[1] & 0xFFC00000) >> 22; // B[31:22] local
69 int cache_size = (ways+1) * (partitions+1) * (line_size+1) * (sets+1);
73 cout << "cache[" << cache_id << "].ways = " << ways << "\n"; local
|
| /external/kernel-headers/original/asm-mips/ |
| cpu-info.h | 23 unsigned char ways; /* Number of ways */ member in struct:cache_desc
|
| /ndk/sources/host-tools/sed-4.2.1/doc/ |
| sed.x | 20 While in some ways similar to an editor which
|
| /external/icu4c/tools/genren/ |
| genren.pl | 97 /* U_DISABLE_RENAMING can be defined in the following ways:
|
| /external/v8/test/mjsunit/compiler/ |
| expression-trees.js | 42 // ways. For each split recursively compute all possible subtrees.
|
| /external/ceres-solver/docs/ |
| powell.tex | 37 But this can get painful very quickly, especially for residuals involving complicated multi-variate terms. Ceres provides two ways around this problem. Numeric and automatic symbolic differentiation.
|
| solving.tex | 56 There are a number of different ways of solving this problem, each giving rise to a different concrete trust-region algorithm. Currently Ceres, implements two trust-region algorithms - Levenberg-Marquardt and Dogleg.
394 There are two ways in which it can be solved. First eliminating $x$
[all...] |
| /external/eigen/Eigen/src/Core/util/ |
| Memory.h | 776 int ways = (abcd[1] & 0xFFC00000) >> 22; // B[31:22] local
781 int cache_size = (ways+1) * (partitions+1) * (line_size+1) * (sets+1);
807 case 0x0A: l1 = 8; break; // 0Ah data L1 cache, 8 KB, 2 ways, 32 byte lines
808 case 0x0C: l1 = 16; break; // 0Ch data L1 cache, 16 KB, 4 ways, 32 byte lines
809 case 0x0E: l1 = 24; break; // 0Eh data L1 cache, 24 KB, 6 ways, 64 byte lines
810 case 0x10: l1 = 16; break; // 10h data L1 cache, 16 KB, 4 ways, 32 byte lines (IA-64)
811 case 0x15: l1 = 16; break; // 15h code L1 cache, 16 KB, 4 ways, 32 byte lines (IA-64)
812 case 0x2C: l1 = 32; break; // 2Ch data L1 cache, 32 KB, 8 ways, 64 byte lines
813 case 0x30: l1 = 32; break; // 30h code L1 cache, 32 KB, 8 ways, 64 byte lines
814 case 0x60: l1 = 16; break; // 60h data L1 cache, 16 KB, 8 ways, 64 byte lines, sectore
[all...] |
| /external/bison/doc/ |
| refcard.tex | 42 % This file can be used to produce it in any of three ways:
|
| /external/libvorbis/doc/ |
| 01-introduction.tex | 126 embedded designs are allowed to deviate in limited ways from the
|
| /external/blktrace/doc/ |
| blktrace.tex | 371 \item The default behaviour for blktrace is to run forever until explicitly killed by the user (via a control-C, or \emph{kill} utility invocation). There are two ways to modify this:
[all...] |
| /external/icu4c/data/ |
| makedata.mak | 468 # Common defines for both ways of building ICU's data library.
[all...] |
| /frameworks/base/docs/html/training/ |
| training_toc.cs | [all...] |
| /external/bison/ |
| maint.mk | 534 # But we can do better, in at least two ways:
[all...] |
| /external/blktrace/btt/doc/ |
| btt.tex | 750 The seek difference is calculated in one of two ways:
[all...] |
| /external/v8/test/mjsunit/ |
| unicode-test.js | [all...] |
| /external/dropbear/libtomcrypt/ |
| crypt.tex | [all...] |
