HomeSort by relevance Sort by last modified time
    Searched defs:levels (Results 1 - 25 of 320) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/swiftshader/src/D3D9/
Direct3DBaseTexture9.hpp 32 Direct3DBaseTexture9(Direct3DDevice9 *device, D3DRESOURCETYPE type, D3DFORMAT format, D3DPOOL pool, unsigned long levels, unsigned long usage);
67 unsigned long levels; // Recalculated when 0 member in class:D3D9::Direct3DBaseTexture9
  /external/fio/
log.c 94 static const char *levels[] = { "Unknown", "Debug", "Info", "Error", local
100 return levels[level];
  /external/webrtc/webrtc/modules/audio_processing/transient/
wpd_tree.h 26 // The number of nodes in the tree will be 2 ^ levels - 1.
45 int levels);
54 // Level goes from 0 to levels().
72 // Returns the total number of levels below the root. Root is cosidered level
74 int levels() const { return levels_; } function in class:webrtc::WPDTree
  /frameworks/base/packages/SettingsLib/tests/integ/src/com/android/settingslib/graph/
BatteryMeterDrawableBaseTest.java 55 final int levels[] = { 0, 1, 5, 10, 25, 50, 75, 90, 95, 99, 100 }; local
57 for (int l : levels) {
  /external/vboot_reference/firmware/stub/
vboot_api_stub_sf.c 38 int levels = backtrace(buffer, MAX_STACK_LEVELS); local
41 backtrace_symbols_fd(buffer + 1, levels - 1, 2);
  /frameworks/base/media/java/android/media/
CameraProfile.java 27 * capture (jpeg) quality levels (0-100) used for low, medium, and high
34 * Define three quality levels for JPEG image encoding.
82 int[] levels = sCache.get(cameraId); local
83 if (levels == null) {
84 levels = getImageEncodingQualityLevels(cameraId);
85 sCache.put(cameraId, levels);
87 return levels[quality];
99 throw new RuntimeException("Unexpected Jpeg encoding quality levels " + nLevels);
102 int[] levels = new int[nLevels]; local
104 levels[i] = native_get_image_encoding_quality_level(cameraId, i)
    [all...]
  /external/icu/android_icu4j/src/main/java/android/icu/impl/duration/impl/
Utils.java 49 * - Units repeat in levels of 10,000, there are symbols for each level too (except 1's).
54 * - The 1000's 0 is also omitted in alternating levels, such that it is omitted in the rightmost
82 buf[--x] = zh.levels[l];
135 // remove levels for empty blocks
195 final char[] levels; field in class:Utils.ChineseDigits
199 ChineseDigits(String digits, String units, String levels, char liang, boolean ko) {
202 this.levels = levels.toCharArray();
  /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/duration/impl/
Utils.java 45 * - Units repeat in levels of 10,000, there are symbols for each level too (except 1's).
50 * - The 1000's 0 is also omitted in alternating levels, such that it is omitted in the rightmost
78 buf[--x] = zh.levels[l];
131 // remove levels for empty blocks
191 final char[] levels; field in class:Utils.ChineseDigits
195 ChineseDigits(String digits, String units, String levels, char liang, boolean ko) {
198 this.levels = levels.toCharArray();
  /external/ipsec-tools/
main.c 213 static int levels[6] = { local
219 __android_log_vprint(levels[level], "racoon", format, ap);
222 static char *levels = "EWNIDV";
223 fprintf(stderr, "%c: ", levels[level]);
  /external/libvpx/libvpx/third_party/libwebm/common/
hdr_util.cc 179 const int levels[kNumLevels] = {10, 11, 20, 21, 30, 31, 40, local
183 if (priv_level == levels[i]) {
  /external/mesa3d/src/mesa/drivers/dri/radeon/
radeon_mipmap_tree.h 72 GLuint numLevels; /** Number of mip levels stored in this mipmap tree */
80 radeon_mipmap_level levels[RADEON_MIPTREE_MAX_TEXTURE_LEVELS]; member in struct:_radeon_mipmap_tree
  /external/skia/tests/
IntTextureTest.cpp 59 // Test that attempting to create a integer texture with multiple MIP levels fails.
61 GrMipLevel levels[2]; local
62 levels[0].fPixels = testData.get();
63 levels[0].fRowBytes = kRowBytes;
64 levels[1].fPixels = testData.get();
65 levels[1].fRowBytes = (kS / 2) * sizeof(int32_t);
69 levels, 2));
  /external/valgrind/memcheck/tests/
mempool.c 25 level_list *levels; member in struct:_pool
48 p->levels = NULL;
64 l->next = p->levels;
67 p->levels = l;
72 level_list *l = p->levels;
73 p->levels = l->next;
85 level_list *l = p->levels;
105 VALGRIND_MEMPOOL_ALLOC(p->levels->where, where, size);
mempool2.c 28 level_list *levels; member in struct:_pool
51 p->levels = NULL;
67 l->next = p->levels;
70 p->levels = l;
75 level_list *l = p->levels;
76 p->levels = l->next;
88 level_list *l = p->levels;
108 VALGRIND_MEMPOOL_ALLOC(p->levels->where, where, size);
  /frameworks/base/core/jni/
android_util_Log.cpp 44 static levels_t levels; member in namespace:android
68 return isLoggable(tag, levels.verbose);
128 levels.verbose = env->GetStaticIntField(clazz, GetStaticFieldIDOrDie(env, clazz, "VERBOSE", "I"));
129 levels.debug = env->GetStaticIntField(clazz, GetStaticFieldIDOrDie(env, clazz, "DEBUG", "I"));
130 levels.info = env->GetStaticIntField(clazz, GetStaticFieldIDOrDie(env, clazz, "INFO", "I"));
131 levels.warn = env->GetStaticIntField(clazz, GetStaticFieldIDOrDie(env, clazz, "WARN", "I"));
132 levels.error = env->GetStaticIntField(clazz, GetStaticFieldIDOrDie(env, clazz, "ERROR", "I"));
133 levels.assert = env->GetStaticIntField(clazz, GetStaticFieldIDOrDie(env, clazz, "ASSERT", "I"));
  /external/replicaisland/src/com/replica/replicaisland/
LevelTree.java 28 public ArrayList<Level> levels = new ArrayList<Level>(); field in class:LevelTree.LevelGroup
64 public final static ArrayList<LevelGroup> levels = new ArrayList<LevelGroup>(); field in class:LevelTree
69 return levels.get(row).levels.get(index);
77 if (levels.size() > 0 && mLoadedResource == resource) {
84 levels.clear();
96 levels.add(currentGroup);
138 currentGroup.levels.add(currentLevel);
197 final int levelGroupCount = levels.size();
199 final ArrayList<Level> row = levels.get(x).levels
    [all...]
  /external/ImageMagick/coders/
jnx.c 82 levels,
184 jnx_info.levels=ReadBlobLSBSignedLong(image);
185 if (jnx_info.levels > JNXMaxLevels)
198 Read JNX levels.
201 for (i=0; i < (ssize_t) jnx_info.levels; i++)
228 for (i=0; i < (ssize_t) jnx_info.levels; i++)
324 (MagickSizeType) jnx_info.levels);
79 levels, member in struct:_JNXInfo
  /external/boringssl/src/crypto/x509v3/
pcy_int.h 165 X509_POLICY_LEVEL *levels; member in struct:X509_POLICY_TREE_st
  /external/icu/icu4c/source/test/cintltst/
cbiditst.h 71 const UBiDiLevel *levels; member in struct:__anon20059
  /external/libdrm/
xf86drmSL.c 60 int levels; member in struct:SLEntry
84 entry->levels = max_level + 1;
304 printf("\nEntry %p <0x%08lx, %p> has %2d levels\n",
305 entry, entry->key, entry->value, entry->levels);
306 for (i = 0; i < entry->levels; i++) {
  /external/mesa3d/src/gallium/drivers/svga/
svga_screen.c 177 unsigned levels = SVGA_MAX_TEXTURE_LEVELS; local
179 levels = MIN2(util_logbase2(result.u) + 1, levels);
181 levels = 12 /* 2048x2048 */;
183 levels = MIN2(util_logbase2(result.u) + 1, levels);
185 levels = 12 /* 2048x2048 */;
186 return levels;
  /external/mtpd/
mtpd.c 242 static int levels[5] = { local
248 __android_log_vprint(levels[level], "mtpd", format, ap);
251 static char *levels = "DIWEF";
253 fprintf(stderr, "%c: ", levels[level]);
  /external/protobuf/src/google/protobuf/compiler/ruby/
ruby_generator.cc 306 int levels = 0; local
322 levels++;
324 return levels;
328 int levels,
330 while (levels > 0) {
331 levels--;
429 int levels = GeneratePackageModules(file->package(), printer); local
436 EndPackageModules(levels, printer);
  /external/webp/src/dsp/
cost_sse2.c 46 uint8_t levels[16], ctxs[16]; local
62 { // precompute clamped levels and contexts, packed to 8b.
77 _mm_storeu_si128((__m128i*)&levels[0], H);
84 const int level = levels[n];
91 const int level = levels[n];
  /system/extras/libfec/
fec_verity.cpp 88 number of hash tree levels in `verity_levels,' and the number of hashes per
194 uint32_t levels = 0; local
196 /* calculate the size and the number of levels in the hash tree */
198 verity_get_size(v->data_blocks * FEC_BLOCKSIZE, &levels, NULL);
226 uint32_t hashes[levels];
231 for (uint32_t i = 1; i < levels; ++i) {
232 uint32_t blocks = hashes[levels - i];
233 debug("%u hash blocks on level %u", blocks, levels - i);
264 for (uint32_t i = 1; i < levels; ++i) {
265 uint32_t blocks = hashes[levels - i]
    [all...]

Completed in 1416 milliseconds

1 2 3 4 5 6 7 8 91011>>