Searched refs:levels (Results 1 - 25 of 181) sorted by relevance

12345678

/external/mesa3d/src/mesa/main/
H A Dtexstorage.h30 _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,
H A Dtexstorage.c128 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 agains
125 setup_texstorage(struct gl_context *ctx, struct gl_texture_object *texObj, GLuint dims, GLsizei levels, GLenum internalFormat, GLsizei width, GLsizei height, GLsizei depth) argument
242 tex_storage_error_check(struct gl_context *ctx, GLuint dims, GLenum target, GLsizei levels, GLenum internalformat, GLsizei width, GLsizei height, GLsizei depth) argument
356 texstorage(GLuint dims, GLenum target, GLsizei levels, GLenum internalformat, GLsizei width, GLsizei height, GLsizei depth) argument
396 _mesa_TexStorage1D(GLenum target, GLsizei levels, GLenum internalformat, GLsizei width) argument
404 _mesa_TexStorage2D(GLenum target, GLsizei levels, GLenum internalformat, GLsizei width, GLsizei height) argument
412 _mesa_TexStorage3D(GLenum target, GLsizei levels, GLenum internalformat, GLsizei width, GLsizei height, GLsizei depth) argument
429 _mesa_TextureStorage1DEXT(GLuint texture, GLenum target, GLsizei levels, GLenum internalformat, GLsizei width) argument
438 _mesa_TextureStorage2DEXT(GLuint texture, GLenum target, GLsizei levels, GLenum internalformat, GLsizei width, GLsizei height) argument
448 _mesa_TextureStorage3DEXT(GLuint texture, GLenum target, GLsizei levels, GLenum internalformat, GLsizei width, GLsizei height, GLsizei depth) argument
[all...]
/external/jemalloc/src/
H A Dbitmap.c19 * progressively work upward through the levels until reaching a level
22 binfo->levels[0].group_offset = 0;
26 binfo->levels[i].group_offset = binfo->levels[i-1].group_offset
30 binfo->levels[i].group_offset = binfo->levels[i-1].group_offset
32 assert(binfo->levels[i].group_offset <= BITMAP_GROUPS_MAX);
41 return (binfo->levels[binfo->nlevels].group_offset);
61 bitmap[binfo->levels[1].group_offset - 1] >>= extra;
63 size_t group_count = binfo->levels[
[all...]
H A Drtree.c35 rtree->levels[0].subtree = NULL;
36 rtree->levels[0].bits = (height > 1) ? RTREE_BITS_PER_LEVEL :
38 rtree->levels[0].cumbits = rtree->levels[0].bits;
39 /* Interior levels. */
41 rtree->levels[i].subtree = NULL;
42 rtree->levels[i].bits = RTREE_BITS_PER_LEVEL;
43 rtree->levels[i].cumbits = rtree->levels[i-1].cumbits +
48 rtree->levels[heigh
[all...]
/external/replicaisland/src/com/replica/replicaisland/
H A DLevelTree.java28 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
[all...]
/external/autotest/client/cros/cellular/wardmodem/state_machines/
H A Dlevel_indicators_machine.py60 levels = []
62 levels.append(str(self._state[indicator]))
63 self._respond(self.wm_response_level_indicators, 0, *levels)
/external/webrtc/webrtc/modules/audio_processing/transient/
H A Dwpd_tree.cc25 int levels)
27 levels_(levels),
28 num_nodes_((1 << (levels + 1)) - 1) {
29 assert(data_length > (static_cast<size_t>(1) << levels) &&
32 levels > 0);
49 for (int current_level = 0; current_level < levels; ++current_level) {
23 WPDTree(size_t data_length, const float* high_pass_coefficients, const float* low_pass_coefficients, size_t coefficients_length, int levels) argument
H A Dwpd_tree.h26 // 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
/external/valgrind/memcheck/tests/
H A Dmempool.c25 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);
H A Dmempool2.c28 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/
H A Dclang-parse-diagnostics-file30 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/icu/android_icu4j/src/main/java/android/icu/text/
H A DBidiLine.java29 * This means that there is a Bidi object with a levels
32 * Only if the length of the text is zero, then levels==dirProps==NULL.
45 * Here, the levels array is scanned as soon as necessary, and a vector of
54 * In a further attempt to save memory, the levels array is never changed
59 * which is not reflected in the levels array.
60 * This allows a line Bidi object to use the same levels array as
64 * paragraph's levels and dirProps arrays are reused by way of setting
66 * change the now shared levels for (L1).
74 * the paragraph's levels array that we just point into.
87 byte[] levels
629 prepareReorder(byte[] levels, byte[] pMinLevel, byte[] pMaxLevel) argument
669 reorderLogical(byte[] levels) argument
738 reorderVisual(byte[] levels) argument
[all...]
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
H A DBidiLine.java28 * This means that there is a Bidi object with a levels
31 * Only if the length of the text is zero, then levels==dirProps==NULL.
44 * Here, the levels array is scanned as soon as necessary, and a vector of
53 * In a further attempt to save memory, the levels array is never changed
58 * which is not reflected in the levels array.
59 * This allows a line Bidi object to use the same levels array as
63 * paragraph's levels and dirProps arrays are reused by way of setting
65 * change the now shared levels for (L1).
73 * the paragraph's levels array that we just point into.
86 byte[] levels
628 prepareReorder(byte[] levels, byte[] pMinLevel, byte[] pMaxLevel) argument
668 reorderLogical(byte[] levels) argument
737 reorderVisual(byte[] levels) argument
[all...]
/external/deqp/modules/gles31/functional/
H A Des31fTextureLevelStateQueryTests.cpp151 std::vector<TextureLevelSpec> levels; member in struct:deqp::gles31::Functional::__anon4736::TextureGenerationSpec
424 texGen.levels.push_back(level);
445 texGen.levels.push_back(level);
466 texGen.levels.push_back(level);
493 texGen.levels.push_back(level);
517 texGen.levels.push_back(level);
540 texGen.levels.push_back(level);
560 texGen.levels.push_back(level);
580 texGen.levels.push_back(level);
647 texGen.levels
[all...]
/external/eigen/demos/opengl/
H A Dicosphere.h19 IcoSphere(unsigned int levels=1);
/external/icu/icu4c/source/common/
H A Dubidiln.c35 * 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 local
189 const UBiDiLevel *levels=pLineBiDi->levels; local
283 UBiDiLevel *levels=pBiDi->levelsMemory; local
437 UBiDiLevel *levels; local
564 UBiDiLevel *levels=pBiDi->levels; local
710 prepareReorder(const UBiDiLevel *levels, int32_t length, int32_t *indexMap, UBiDiLevel *pMinLevel, UBiDiLevel *pMaxLevel) argument
750 ubidi_reorderLogical(const UBiDiLevel *levels, int32_t length, int32_t *indexMap) argument
813 ubidi_reorderVisual(const UBiDiLevel *levels, int32_t length, int32_t *indexMap) argument
[all...]
/external/icu/android_icu4j/src/main/tests/android/icu/dev/test/bidi/
H A DTestReorder.java201 byte[] levels = new byte[Bidi.MAX_EXPLICIT_LEVEL];
203 levels[i] = (byte)(i + 1);
206 bidi.setPara(srcU16, Bidi.LEVEL_DEFAULT_LTR, levels);
228 byte[] levels = new byte[Bidi.MAX_EXPLICIT_LEVEL];
230 levels[i] = (byte)(i + 1);
233 bidi.setPara(srcU16, Bidi.LEVEL_DEFAULT_LTR, levels);
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/bidi/
H A DTestReorder.java197 byte[] levels = new byte[Bidi.MAX_EXPLICIT_LEVEL];
199 levels[i] = (byte)(i + 1);
202 bidi.setPara(srcU16, Bidi.LEVEL_DEFAULT_LTR, levels);
224 byte[] levels = new byte[Bidi.MAX_EXPLICIT_LEVEL];
226 levels[i] = (byte)(i + 1);
229 bidi.setPara(srcU16, Bidi.LEVEL_DEFAULT_LTR, levels);
/external/autotest/client/site_tests/power_Backlight/
H A Dpower_Backlight.py47 raise error.TestFail('Must have at least 5 backlight levels')
56 levels = [0, 50, 100]
57 for i in levels:
69 for i in range(1, len(levels)):
/external/fio/lib/
H A Daxmap.c48 struct axmap_level *levels; member in struct:axmap
66 struct axmap_level *al = &axmap->levels[i];
82 free(axmap->levels[i].map);
84 free(axmap->levels);
91 unsigned int i, levels; local
97 levels = 1;
101 levels++;
104 axmap->nr_levels = levels;
105 axmap->levels = malloc(axmap->nr_levels * sizeof(struct axmap_level));
109 struct axmap_level *al = &axmap->levels[
[all...]
/external/webp/src/dsp/
H A Dcost_sse2.c46 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];
/external/deqp/framework/opengl/
H A DgluTexture.cpp129 Texture2D::Texture2D (const RenderContext& context, const ContextInfo& contextInfo, int numLevels, const tcu::CompressedTexture* levels, const tcu::TexDecompressionParams& decompressionParams) argument
132 , m_format (getGLFormat(levels[0].getFormat()))
133 , m_refTexture (getUncompressedFormat(levels[0].getFormat()), levels[0].getWidth(), levels[0].getHeight())
146 loadCompressed(numLevels, levels, decompressionParams);
187 void Texture2D::loadCompressed (int numLevels, const tcu::CompressedTexture* levels, const tcu::TexDecompressionParams& decompressionParams) argument
190 deUint32 compressedFormat = getGLFormat(levels[0].getFormat());
197 const tcu::CompressedTexture& level = levels[levelNdx];
241 // Fill remaining levels
288 TextureCube(const RenderContext& context, const ContextInfo& contextInfo, int numLevels, const tcu::CompressedTexture* levels, const tcu::TexDecompressionParams& decompressionParams) argument
375 loadCompressed(int numLevels, const tcu::CompressedTexture* levels, const tcu::TexDecompressionParams& decompressionParams) argument
521 Texture2DArray(const RenderContext& context, const ContextInfo& contextInfo, int numLevels, const tcu::CompressedTexture* levels, const tcu::TexDecompressionParams& decompressionParams) argument
581 loadCompressed(int numLevels, const tcu::CompressedTexture* levels, const tcu::TexDecompressionParams& decompressionParams) argument
637 Texture3D(const RenderContext& context, const ContextInfo& contextInfo, int numLevels, const tcu::CompressedTexture* levels, const tcu::TexDecompressionParams& decompressionParams) argument
703 loadCompressed(int numLevels, const tcu::CompressedTexture* levels, const tcu::TexDecompressionParams& decompressionParams) argument
[all...]
/external/icu/android_icu4j/src/main/java/android/icu/impl/coll/
H A DCollationKeys.java259 private static SortKeyLevel getSortKeyLevel(int levels, int level) { argument
260 return (levels & level) != 0 ? new SortKeyLevel() : null;
329 * the case level. Stops writing levels when callback.needToWrite(level) returns false.
330 * Separates levels with the LEVEL_SEPARATOR_BYTE but does not write a TERMINATOR_BYTE.
337 // Set of levels to process and write.
338 int levels = levelMasks[CollationSettings.getStrength(options)];
340 levels |= Collation.CASE_LEVEL_FLAG;
342 // Minus the levels below minLevel.
343 levels &= ~((1 << minLevel) - 1);
344 if (levels
[all...]
/external/icu/android_icu4j/src/main/java/android/icu/impl/duration/impl/
H A DUtils.java47 * - Units repeat in levels of 10,000, there are symbols for each level too (except 1's).
52 * - The 1000's 0 is also omitted in alternating levels, such that it is omitted in the rightmost
80 buf[--x] = zh.levels[l];
133 // remove levels for empty blocks
193 final char[] levels; field in class:Utils.ChineseDigits
197 ChineseDigits(String digits, String units, String levels, char liang, boolean ko) { argument
200 this.levels = levels.toCharArray();
/external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/
H A DCollationKeys.java255 private static SortKeyLevel getSortKeyLevel(int levels, int level) { argument
256 return (levels & level) != 0 ? new SortKeyLevel() : null;
325 * the case level. Stops writing levels when callback.needToWrite(level) returns false.
326 * Separates levels with the LEVEL_SEPARATOR_BYTE but does not write a TERMINATOR_BYTE.
333 // Set of levels to process and write.
334 int levels = levelMasks[CollationSettings.getStrength(options)];
336 levels |= Collation.CASE_LEVEL_FLAG;
338 // Minus the levels below minLevel.
339 levels &= ~((1 << minLevel) - 1);
340 if (levels
[all...]

Completed in 775 milliseconds

12345678