/external/valgrind/main/memcheck/tests/ |
H A D | 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);
|
/external/icu4c/test/cintltst/ |
H A D | cbiditst.h | 68 const UBiDiLevel *levels; member in struct:__anon4874
|
H A D | cbiditst.c | 105 static void printUnicode(const UChar *s, int32_t length, const UBiDiLevel *levels); 422 const UBiDiLevel *levels; local 428 levels = ubidi_getLevels(bidi, &errorCode); 434 lev = levels[i]; 480 /* For UBIDI_REORDER_RUNS_ONLY, it would not be correct to check levels[i], 818 UBiDiLevel levels[UBIDI_MAX_EXPLICIT_LEVEL]={1,2,3,4,5,6,7,8,9,10}; local 822 ubidi_setPara(bidi,src,srcSize,UBIDI_DEFAULT_LTR,levels,&ec); 852 UBiDiLevel levels[UBIDI_MAX_EXPLICIT_LEVEL]={1,2,3,4,5,6,7,8,9,10}; local 856 ubidi_setPara(bidi,src,srcSize,UBIDI_DEFAULT_LTR,levels,&ec); 884 const UBiDiLevel *levels local 995 const UBiDiLevel *levels; local 2869 printUnicode(const UChar *s, int32_t length, const UBiDiLevel *levels) argument [all...] |
/external/ipsec-tools/ |
H A D | main.c | 218 static int levels[6] = { local 224 __android_log_vprint(levels[level], "racoon", format, ap); 227 static char *levels = "EWNIDV"; 228 fprintf(stderr, "%c: ", levels[level]);
|
/external/openssl/crypto/x509v3/ |
H A D | pcy_int.h | 160 X509_POLICY_LEVEL *levels; member in struct:X509_POLICY_TREE_st
|
/external/icu4c/test/intltest/ |
H A D | bidiconf.cpp | 54 UBiDiLevel levels[1000]; member in class:BiDiConformanceTest 123 levels[levelsCount++]=UBIDI_DEFAULT_LTR; 132 levels[levelsCount++]=(UBiDiLevel)value; 395 if(levels[i]!=actualLevels[i] && levels[i]<UBIDI_DEFAULT_LTR) { 399 // levels but just returns all levels as the paragraph level 0 or 1. 404 (int)i, levels[i], actualLevels[i]); 413 UnicodeString els("Expected levels: "); 416 els.append((UChar)0x20).append(printLevel(levels[ [all...] |
/external/mesa3d/test/ |
H A D | main.cpp | 135 &texture.levels); 139 // ((unsigned *)texture.levels[0])[i] = ((x + y) % 2) * 0xffffff | 0xff000000; 150 //texture.levelCount = GenerateMipmaps(texture.levels, texture.width, texture.height); 154 // memcpy(texture.levels[0], texels, sizeof texels); 202 void * levels [1] = {cubeTextureSurface}; local 203 cubeTexture.levels = levels; 336 //memcpy(((GGLContext *)ggl)->frameSurface.data, ((GGLContext *)ggl)->textureState.textures[0].levels[0], width * height * 4); 362 //// ((unsigned *)frameSurface.data)[index] = ((unsigned *)textureGGLContext->textureState.textures[0].levels[0])[index]; 446 free(texture.levels); [all...] |
H A D | image_file.h | 251 unsigned levels = 1; local 256 levels++; 265 for (unsigned i = 1; i < levels; i++) 298 return levels;
|
/external/mtpd/ |
H A D | mtpd.c | 238 static int levels[5] = { local 244 __android_log_vprint(levels[level], "mtpd", format, ap); 247 static char *levels = "DIWEF"; 249 fprintf(stderr, "%c: ", levels[level]);
|
/external/replicaisland/src/com/replica/replicaisland/ |
H A D | 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 [all...] |
/external/dbus/dbus/ |
H A D | dbus-message-factory.c | 337 message_with_nesting_levels (int levels) argument 345 /* If levels is higher it breaks sig_refcount in DBusMessageRealIter 349 _dbus_assert (levels < 256); 351 parents = dbus_new(DBusMessageIter, levels + 1); 352 children = dbus_new(DBusMessageIter, levels + 1); 359 while (i < levels) 362 i == (levels - 1) ? 787 /* 64 levels of nesting is OK */ 796 /* 65 levels of nesting is not OK */
|
/external/icu4c/common/ |
H A D | 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 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...] |
H A D | ubidiimp.h | 234 UBiDiLevel *levels; member in struct:UBiDi 261 const struct ImpTabPair * pImpTabPair; /* pointer to levels state table pair */ 273 /* implicitly at the paraLevel (rule (L1)) - levels may not reflect that */
|
H A D | ubidi.c | 58 * For the purpose of conformance, the levels of all these codes 89 * and all levels are set to the paragraph level. 94 * If embedding levels are supplied as a parameter, then all 528 * Resolve the explicit levels as specified by explicit embedding codes. 533 * levels are externally specified (from "styled text", supposedly the preferred 562 * Handling the stack of explicit levels (Xn): 564 * With the BiDi stack of explicit levels, 574 * Popping levels with PDF must work in the opposite order so that level 61 582 UBiDiLevel *levels=pBiDi->levels; local 754 UBiDiLevel *levels=pBiDi->levels; local 1221 UBiDiLevel * levels=pBiDi->levels; local 1533 UBiDiLevel *levels=pBiDi->levels; local 1578 const UBiDiLevel *levels; local 1955 UBiDiLevel *levels=pBiDi->levels; local [all...] |
/external/bluetooth/bluez/sbc/ |
H A D | sbc.c | 390 uint32_t levels[2][8]; /* levels derived from that */ local 490 levels[ch][sb] = (1 << bits[ch][sb]) - 1; 496 if (levels[ch][sb] > 0) { 510 levels[ch][sb] - (1 << frame->scale_factor[ch][sb]); 777 uint32_t levels[2][8]; /* levels are derived from that */ local 845 levels[ch][sb] = ((1 << bits[ch][sb]) - 1) << 861 audio_sample = ((uint64_t) levels[ch][sb] *
|
/external/webp/src/enc/ |
H A D | frame.c | 255 int VP8GetCostLuma4(VP8EncIterator* const it, const int16_t levels[16]) { argument 263 SetResidualCoeffs(levels, &res);
|
H A D | quant.c | 577 // quantized levels in *levels. 626 int16_t levels[16], 640 nz = TrellisQuantizeBlock(it, tmp, levels, ctx, 3, &dqm->y1_, 643 nz = VP8EncQuantizeBlock(tmp, levels, 0, &dqm->y1_); 625 ReconstructIntra4(VP8EncIterator* const it, int16_t levels[16], const uint8_t* const src, uint8_t* const yuv_out, int mode) argument
|
/external/libpcap/ |
H A D | optimize.c | 157 struct block **levels; variable in typeref:struct:block 235 b->link = levels[level]; 236 levels[level] = b; 240 * Level graph. The levels go from 0 at the leaves to 241 * N_LEVELS at the root. The levels[] array points to the 249 memset((char *)levels, 0, n_blocks * sizeof(*levels)); 279 for (b = levels[i]; b; b = b->link) { 320 for (b = levels[i]; b != 0; b = b->link) { 349 for (b = levels[ [all...] |
/external/mesa3d/include/pixelflinger2/ |
H A D | pixelflinger2_interface.h | 71 void * levels; member in struct:GGLTexture
|
/external/skia/src/core/ |
H A D | SkBitmap.cpp | 65 const MipLevel* levels() const { return (const MipLevel*)(this + 1); } function in struct:SkBitmap::MipMap 66 MipLevel* levels() { return (MipLevel*)(this + 1); } function in struct:SkBitmap::MipMap 68 const void* pixels() const { return levels() + fLevelCount; } 69 void* pixels() { return levels() + fLevelCount; } 1132 MipLevel* level = mm->levels(); 1184 const MipLevel& mip = fMipMap->levels()[level - 1];
|
/external/webkit/Source/ThirdParty/ANGLE/src/libGLESv2/ |
H A D | Texture.cpp | 1210 // for render-to-texture (such as CopyTexImage). We have no way of keeping individual inconsistent levels. 1234 // Purge all the levels and the texture. 1532 int levels = levelCount(); local 1534 for (int level = 0; level < levels; level++) 1576 int levels = levelCount(); local 1577 for (int i = 0; i < levels; i++) 1652 // Purge array levels 1 through q and reset them to represent the generated mipmap levels. 1973 int levels = levelCount(); local 1974 for (int level = 0; level < levels; leve 2017 int levels = levelCount(); local [all...] |
/external/freetype/src/smooth/ |
H A D | ftgrays.c | 75 /* - It can easily be modified to render to _any_ number of gray levels */ 157 /* we don't handle tracing levels in stand-alone mode; */ 876 int* levels; local 900 levels = ras.lev_stack; 901 levels[0] = level; 906 level = levels[top]; 929 levels[top] = levels[top - 1] = level - 1;
|
/external/quake/quake/src/WinQuake/ |
H A D | menu.cpp | 2407 level_t levels[] = variable 2455 //MED 01/06/97 added hipnotic levels 2483 //PGM 01/07/97 added rogue levels 2510 int levels; member in struct:__anon9303 2665 M_Print (160, 120, levels[episodes[startepisode].firstLevel + startlevel].description); 2666 M_Print (160, 128, levels[episodes[startepisode].firstLevel + startlevel].name); 2778 count = hipnoticepisodes[startepisode].levels; 2781 count = rogueepisodes[startepisode].levels; 2783 count = episodes[startepisode].levels; 2845 Cbuf_AddText ( va ("map %s\n", levels[episode [all...] |
/external/kernel-headers/original/linux/ |
H A D | msm_vidc_dec.h | 452 uint32_t levels; member in struct:vdec_profile_level
|
H A D | soundcard.h | 968 int levels[32]; member in struct:mixer_vol_table
|