| /external/chromium_org/third_party/mesa/src/src/mesa/main/ |
| texstorage.h | 30 _mesa_TexStorage1D(GLenum target, GLsizei levels, GLenum internalformat,
35 _mesa_TexStorage2D(GLenum target, GLsizei levels, GLenum internalformat,
40 _mesa_TexStorage3D(GLenum target, GLsizei levels, GLenum internalformat,
46 _mesa_TextureStorage1DEXT(GLuint texture, GLenum target, GLsizei levels,
51 _mesa_TextureStorage2DEXT(GLuint texture, GLenum target, GLsizei levels,
56 _mesa_TextureStorage3DEXT(GLuint texture, GLenum target, GLsizei levels,
|
| texstorage.c | 128 GLsizei levels, GLenum internalFormat,
137 assert(levels > 0);
146 for (level = 0; level < levels; level++) {
173 if (!ctx->Driver.AllocTextureStorage(ctx, texObj, levels,
180 for (level = 0; level < levels; level++) {
243 GLsizei levels, GLenum internalformat,
303 /* levels check */
304 if (levels < 1 || height < 1 || depth < 1) {
305 _mesa_error(ctx, GL_INVALID_VALUE, "glTexStorage%uD(levels < 1)",
318 /* check levels against maximum *
[all...] |
| /external/mesa3d/src/mesa/main/ |
| texstorage.h | 30 _mesa_TexStorage1D(GLenum target, GLsizei levels, GLenum internalformat,
35 _mesa_TexStorage2D(GLenum target, GLsizei levels, GLenum internalformat,
40 _mesa_TexStorage3D(GLenum target, GLsizei levels, GLenum internalformat,
46 _mesa_TextureStorage1DEXT(GLuint texture, GLenum target, GLsizei levels,
51 _mesa_TextureStorage2DEXT(GLuint texture, GLenum target, GLsizei levels,
56 _mesa_TextureStorage3DEXT(GLuint texture, GLenum target, GLsizei levels,
|
| texstorage.c | 128 GLsizei levels, GLenum internalFormat,
137 assert(levels > 0);
146 for (level = 0; level < levels; level++) {
173 if (!ctx->Driver.AllocTextureStorage(ctx, texObj, levels,
180 for (level = 0; level < levels; level++) {
243 GLsizei levels, GLenum internalformat,
303 /* levels check */
304 if (levels < 1 || height < 1 || depth < 1) {
305 _mesa_error(ctx, GL_INVALID_VALUE, "glTexStorage%uD(levels < 1)",
318 /* check levels against maximum *
[all...] |
| /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/chromium_org/chrome/browser/ |
| chrome_page_zoom_unittest.cc | 47 // Fetch a vector of preset zoom levels, including a custom value that we
50 std::vector<double> levels = chrome_page_zoom::PresetZoomLevels(custom_value); local
52 // Expect at least 10 zoom levels.
53 EXPECT_GE(levels.size(), 10U);
64 for (i = levels.begin(); i != levels.end(); ++i) {
90 std::vector<double> levels = chrome_page_zoom::PresetZoomLevels(too_low); local
91 EXPECT_FALSE(content::ZoomValuesEqual(levels.front(), too_low));
94 levels = chrome_page_zoom::PresetZoomLevels(too_high);
95 EXPECT_FALSE(content::ZoomValuesEqual(levels.back(), too_high))
[all...] |
| /frameworks/base/core/jni/ |
| android_util_Log.cpp | 44 static levels_t levels; member in namespace:android
49 case 'V': return levels.verbose;
50 case 'D': return levels.debug;
51 case 'I': return levels.info;
52 case 'W': return levels.warn;
53 case 'E': return levels.error;
54 case 'A': return levels.assert;
57 return levels.info;
101 return isLoggable(tag, levels.verbose);
155 levels.verbose = env->GetStaticIntField(clazz, env->GetStaticFieldID(clazz, "VERBOSE", "I"))
[all...] |
| /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/valgrind/main/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);
|
| /external/llvm/utils/ |
| clang-parse-diagnostics-file | 30 levels = {'error': False, 'fatal error': False, 'ignored': False,
33 levels['error'] = True
35 levels['fatal error'] = True
37 levels['ignored'] = True
39 levels['note'] = True
41 levels['warning'] = True
74 # Get the diagnostics for the selected levels.
77 if levels[d.get('level')] or opts.all]
|
| /external/chromium_org/chrome/browser/ui/tabs/ |
| tab_audio_indicator.cc | 38 // The space between equalizer levels.
48 // equalizer levels change slowly.
92 // equalizer with 4 levels. The current level is between 0 and 4 so the
98 std::vector<int> levels = GetCurrentEqualizerLevels(); local
99 for (int i = levels.size() - 1; i >= 0; --i) {
101 if (levels[i] == 0)
105 int y = rect.bottom() - levels[i] * 2;
117 // Cache the levels that were just drawn. This is used to prevent
119 // levels changing.
120 last_displayed_equalizer_levels_ = levels;
133 std::vector<int> levels = GetCurrentEqualizerLevels(); local
154 std::vector<int> levels; local
[all...] |
| /libcore/luni/src/main/java/java/util/logging/ |
| Level.java | 33 * set of predefined logging levels, each associated with an integer value.
34 * Enabling a certain logging level also enables all logging levels with larger
37 * The predefined levels in ascending order are FINEST, FINER, FINE, CONFIG,
38 * INFO, WARNING, SEVERE. There are two additional predefined levels, which are
46 private static final List<Level> levels = new ArrayList<Level>(9); field in class:Level
120 synchronized (levels) {
121 for (Level level : levels) {
129 * Loop through levels a second time, so that the returned
132 for (Level level : levels) {
217 synchronized (levels) {
[all...] |
| /external/chromium_org/third_party/libjingle/source/talk/app/webrtc/java/src/org/webrtc/ |
| Logging.java | 68 // Enable tracing to |path| at |levels| and |severity|.
70 String path, EnumSet<TraceLevel> levels, Severity severity) {
72 for (TraceLevel level : levels) {
|
| /external/chromium_org/third_party/angle_dx11/src/libGLESv2/renderer/ |
| TextureStorage.cpp | 72 TextureStorageInterface2D::TextureStorageInterface2D(Renderer *renderer, int levels, GLenum internalformat, GLenum usage, bool forceRenderable, GLsizei width, GLsizei height)
75 mInstance = renderer->createTextureStorage2D(levels, internalformat, usage, forceRenderable, width, height);
97 TextureStorageInterfaceCube::TextureStorageInterfaceCube(Renderer *renderer, int levels, GLenum internalformat, GLenum usage, bool forceRenderable, int size)
100 mInstance = renderer->createTextureStorageCube(levels, internalformat, usage, forceRenderable, size);
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkMipMap.h | 36 // we take ownership of levels, and will free it with sk_free()
37 SkMipMap(Level* levels, int count, size_t size);
|
| SkMipMap.cpp | 174 Level* levels = SkMipMap::AllocLevels(countLevels, size); local
175 if (NULL == levels) {
179 uint8_t* baseAddr = (uint8_t*)&levels[countLevels];
191 levels[i].fPixels = addr;
192 levels[i].fWidth = width;
193 levels[i].fHeight = height;
194 levels[i].fRowBytes = rowBytes;
195 levels[i].fScale = (float)width / src.width();
214 return SkNEW_ARGS(SkMipMap, (levels, countLevels, size));
221 SkMipMap::SkMipMap(Level* levels, int count, size_t size
[all...] |
| /external/eigen/demos/opengl/ |
| icosphere.h | 19 IcoSphere(unsigned int levels=1);
|
| /external/skia/src/core/ |
| SkMipMap.h | 36 // we take ownership of levels, and will free it with sk_free()
37 SkMipMap(Level* levels, int count, size_t size);
|
| SkMipMap.cpp | 174 Level* levels = SkMipMap::AllocLevels(countLevels, size); local
175 if (NULL == levels) {
179 uint8_t* baseAddr = (uint8_t*)&levels[countLevels];
191 levels[i].fPixels = addr;
192 levels[i].fWidth = width;
193 levels[i].fHeight = height;
194 levels[i].fRowBytes = rowBytes;
195 levels[i].fScale = (float)width / src.width();
214 return SkNEW_ARGS(SkMipMap, (levels, countLevels, size));
221 SkMipMap::SkMipMap(Level* levels, int count, size_t size
[all...] |
| /external/chromium_org/third_party/tcmalloc/chromium/src/base/ |
| low_level_alloc.cc | 77 int levels; // levels in skiplist used member in struct:low_level_alloc_internal::AllocList
78 AllocList *next[kMaxLevel]; // actually has levels elements.
115 // Return a number of skiplist levels for a node of size bytes, where
119 // Bigger nodes tend to have more skiplist levels due to the log2(size / base)
124 // max_fit is the maximum number of levels that will fit in a node for the
136 // For 0 <= i < head->levels, set prev[i] to "no_greater", where no_greater
142 for (int level = head->levels - 1; level >= 0; level--) {
147 return (head->levels == 0) ? 0 : prev[0]->next[0];
151 // Requires that e->levels be previously set by the caller (usin
[all...] |
| /external/chromium_org/third_party/tcmalloc/vendor/src/base/ |
| low_level_alloc.cc | 77 int levels; // levels in skiplist used member in struct:low_level_alloc_internal::AllocList
78 AllocList *next[kMaxLevel]; // actually has levels elements.
115 // Return a number of skiplist levels for a node of size bytes, where
119 // Bigger nodes tend to have more skiplist levels due to the log2(size / base)
124 // max_fit is the maximum number of levels that will fit in a node for the
136 // For 0 <= i < head->levels, set prev[i] to "no_greater", where no_greater
142 for (int level = head->levels - 1; level >= 0; level--) {
147 return (head->levels == 0) ? 0 : prev[0]->next[0];
151 // Requires that e->levels be previously set by the caller (usin
[all...] |
| /external/chromium_org/third_party/icu/source/common/ |
| ubidiln.c | 35 * This means that there is a UBiDi object with a levels
38 * Only if the length of the text is zero, then levels==dirProps==NULL.
51 * Here, the levels array is scanned as soon as necessary, and a vector of
60 * In a further attempt to save memory, the levels array is never changed
65 * which is not reflected in the levels array.
66 * This allows a line UBiDi object to use the same levels array as
70 * paragraph's levels and dirProps arrays are reused by way of setting
72 * change the now shared levels for (L1).
80 * the paragraph's levels array that we just point into.
94 UBiDiLevel *levels=pBiDi->levels local
189 const UBiDiLevel *levels=pLineBiDi->levels; local
283 UBiDiLevel *levels=pBiDi->levelsMemory; local
437 UBiDiLevel *levels; local
564 UBiDiLevel *levels=pBiDi->levels; local
[all...] |
| /external/icu4c/common/ |
| ubidiln.c | 39 * This means that there is a UBiDi object with a levels
42 * Only if the length of the text is zero, then levels==dirProps==NULL.
55 * Here, the levels array is scanned as soon as necessary, and a vector of
64 * In a further attempt to save memory, the levels array is never changed
69 * which is not reflected in the levels array.
70 * This allows a line UBiDi object to use the same levels array as
74 * paragraph's levels and dirProps arrays are reused by way of setting
76 * change the now shared levels for (L1).
84 * the paragraph's levels array that we just point into.
98 UBiDiLevel *levels=pBiDi->levels local
193 const UBiDiLevel *levels=pLineBiDi->levels; local
287 UBiDiLevel *levels=pBiDi->levelsMemory; local
441 UBiDiLevel *levels; local
568 UBiDiLevel *levels=pBiDi->levels; local
[all...] |
| /frameworks/base/core/java/android/text/ |
| AndroidBidi.java | 54 * @param levels levels as returned from {@link #bidi}
55 * @param lstart start of the line in the levels array
61 public static Directions directions(int dir, byte[] levels, int lstart,
68 int curLevel = levels[lstart];
72 int level = levels[i];
120 int level = levels[i];
149 // level, we have a series of alternating levels that
162 if (levels[ld[i]] >= level) {
164 while (e < ld.length && levels[ld[e]] >= level)
[all...] |
