| /external/bluetooth/glib/docs/reference/glib/tmpl/ |
| hash_tables.sgml | 43 To call a function for each key and value pair use g_hash_table_foreach()
104 to find the 'bucket' to place each key into.
105 The function should also be very fast, since it is called for each key
200 It is called with each key/value pair, together with the @user_data parameter
288 It is called with each key/value pair, together with the @user_data parameter
|
| memory_chunks.sgml | 69 100 bytes. Note that this means that only 2 atoms fit into each memory
101 g_mem_chunk_create(<!-- -->) convenience macro. We want 1024 atoms in each
164 @atom_size: the size, in bytes, of each element in the #GMemChunk.
165 @area_size: the size, in bytes, of each block of memory allocated to contain
229 @pre_alloc: the number of atoms to store in each block of memory.
313 and calls g_mem_chunk_print() to output information on each one.
|
| /external/jpeg/ |
| jcmainct.c | 37 * (we allocate one for each component). In the full-image case, this
44 * control blocks for each component. Unused if not full-image storage.
261 /* Create the buffer. It holds downsampled data, so each component
266 /* Allocate a full-image virtual array for each component */
284 /* Allocate a strip buffer for each component */
|
| wizard.doc | 36 values. The file should contain one to four tables, each of 64 elements.
79 each color component.
81 The -qslots switch specifies a quantization table number for each color
83 For example, to create a separate table for each of Y,Cb,Cr, you could
96 -sample HxV[,...] Set JPEG sampling factors for each color
99 The -sample switch specifies the JPEG sampling factors for each color
126 Each entry in the script defines one scan. A scan definition specifies
132 Each scan definition contains one to four component indexes, optionally
140 The progression parameters for each scan are:
|
| /external/webkit/WebCore/manual-tests/ |
| css3-cursor-fallback-quirks.html | 13 <p>In each of the blue boxes below, the cursor should become a help cursor (question mark).</p>
22 <p>In each of the blue boxes below, the cursor should remain the default cursor, since all cursor definitions are invalid in quirks mode.</p>
27 <p>In each of the blue boxes below, the cursor should show the text cursor, since they contain invalid hotspots.</p>
34 <p>In each of the blue boxes below, the cursor should show the help, since they contain valid hotspots.</p>
57 <p>In each of the blue boxes below, the hotspot is out-of-range. In quirks mode we do not support hotspots at all, so we show the fallback cursor(text).</p>
|
| /external/webkit/WebCore/platform/graphics/ |
| GlyphPageTreeNode.h | 65 // starting from 0 and incrementing for each 256 glyphs.
151 // GlyphPageTreeNode for each glyph page number. The roots do not have a
155 // Each root node maps a FontData pointer to another GlyphPageTreeNode at
167 // but on demand for each glyph, because the system may need to use different
168 // fallback fonts for each. This lazy population is done by the Font.
|
| /external/webkit/WebKitTools/iExploder/ |
| README.txt | 35 for each browser you test simultaneous using this method.
64 Letting you know how many tests and what the last test id was for each
75 through each subtest for a particular test.
77 Each subtest will rotate through a tag offset and a number of tags to
79 used doubles each cycle. Here is an idea of how many subtests to expect
|
| /frameworks/base/media/libstagefright/codecs/amrnb/enc/src/ |
| set_sign.cpp | 57 each incoming pulse, and the loop that calculates the position
83 and the starting position for each pulse.
130 dn2 = buffer containing the maximum of correlation in each track.(Word16)
141 correlation for each track.
154 the position of maximum of correlation in each track and the starting
155 position for each pulse.
172 Word16 dn2[], o : maximum of correlation in each track.
195 // keep 8-n maximum positions/8 of each track and store it in dn2[]
233 used to represent cycle count for each subroutine
247 Word16 dn2[], /* o : maximum of correlation in each track. *
[all...] |
| /libcore/luni/src/main/java/java/sql/ |
| BatchUpdateException.java | 138 * successful updates (or another status code) for each command
156 * successful updates (or another status code) for each command
176 * successful updates (or another status code) for each command
198 * successful updates (or another status code) for each command
221 * process commands following an error, for each successive command
|
| /libcore/luni/src/main/java/org/apache/xalan/templates/ |
| ElemUse.java | 56 * sets. Each name is specified as a QName, which is expanded as
80 * sets. Each name is specified as a QName, which is expanded as
98 * sets. Each name is specified as a QName, which is expanded as
181 * xsl:attribute elements for each of the attributes in each of the
|
| /external/zlib/examples/ |
| enough.c | 30 are coded at each length. At each step, we have how many symbols remain to
50 codes. Each subsequent root-bit prefix then has its own sub-table. The
52 incrementally as the number of codes at each bit length is populated. When
136 of those for each symbol. There are totsym-2 of those, with each one
149 Each element in the array is further indexed by the (mem, rem) doublet,
151 remaining unused entries in the current inflate sub-table. Each indexed
153 not. Since the ranges for mem and rem are not known a priori, each bit
171 local int *code; /* number of symbols assigned to each bit length *
[all...] |
| /external/chromium/net/disk_cache/ |
| disk_format.h | 32 // data_3), each one dedicated to store blocks of a given size. The number at
47 // cache entry has a dirty identifier. Each running instance of the cache keeps
111 // blocks (adding 256 bytes each time), up to 4 blocks (1024 - 32 - 1 chars).
124 int32 data_size[4]; // We can store up to 4 data streams for each
173 // counters of the number of blocks available for each type of entry. For
186 int32 empty[4]; // Counters of empty entries for each type.
187 int32 hints[4]; // Last used position for each entry type.
203 // and the second level stores blocks of 1 KB inside each child entry.
227 // Each child entry keeps track of all the 1 KB blocks that have been written
|
| /external/iproute2/man/man8/ |
| tc-cbq-details.8 | 118 Within the one CBQ instance many classes may exist. Each of these classes
146 parameters. The defmap may contain instructions for each possible Linux packet
150 Each class also has a
222 in which each class with packets gets a chance to send in turn. The WRR process
230 Each class is not allowed to send at length though - they can only dequeue a
231 configurable amount of data during each round.
299 have more traffic to offer during each round, so it makes sense to allow
306 during each round of the process. This parameter is weighted using the
382 CBQ can measure how much bandwidth each class is using, which tc filters
|
| /external/openssl/crypto/engine/ |
| README | 12 "eng_int.h", implemented in eng_table.c, and used in each of the "class" files;
78 the RSA_METHOD would call ENGINE_get_RSA() each time on its ENGINE handle to
80 efficient, switching back to each RSA having an RSA_METHOD pointer also allows
135 These nids provide the uniquenness of an algorithm/mode - and each nid will hash
137 pointers to ENGINEs that implement that particular 'nid'. Each "pile" uses some
143 ENGINEs support. If each of those ENGINEs has a "des_cbc" implementation, we
145 each of those 10 ENGINEs. Instead, the first such request will try to do that
181 functions. These functions are internal-only and each part of ENGINE code that
189 callbacks calling each in turn, and will then internally delete its own storage
|
| /frameworks/base/media/libstagefright/codecs/m4v_h263/enc/src/ |
| mp4lib_int.h | 121 Int nMBPerRow, nMBPerCol; /* number of MBs in each row & column */
206 Int Refresh; /* Number of MBs refresh in each frame */
323 Vol **vol; /* Data stored for each VOL */
347 /* 12/25/00, each R.C. for each layer */
381 typeDCStore *predDC; /* The DC coeffs for each MB */
386 UChar *sliceNo; /* Slice Number for each MB */
391 UChar *QPMB; /* Quantizer value for each MB */
400 Int relLayerCodeTime[4];/* Next coding time for each Layer relative to highest layer */
|
| /device/samsung/crespo/sec_mm/sec_omx/sec_omx_include/khronos/ |
| OMX_Video.h | 44 * Each OMX header must include all required header files to allow the
384 * H.263 profile types, each profile indicates support for various
424 * H.263 level types, each level indicates support for various frame sizes,
474 * nPFrames : Number of P frames between each I frame
475 * nBFrames : Number of B frames between each I frame
486 * the value of the RTYPE bit for each reference
510 * MPEG-2 profile types, each profile indicates support for various
527 * MPEG-2 level types, each level indicates support for various frame
548 * nPFrames : Number of P frames between each I frame
549 * nBFrames : Number of B frames between each I fram
[all...] |
| /frameworks/base/include/media/stagefright/openmax/ |
| OMX_Video.h | 61 * Each OMX header must include all required header files to allow the
401 * H.263 profile types, each profile indicates support for various
441 * H.263 level types, each level indicates support for various frame sizes,
491 * nPFrames : Number of P frames between each I frame
492 * nBFrames : Number of B frames between each I frame
503 * the value of the RTYPE bit for each reference
527 * MPEG-2 profile types, each profile indicates support for various
544 * MPEG-2 level types, each level indicates support for various frame
565 * nPFrames : Number of P frames between each I frame
566 * nBFrames : Number of B frames between each I fram
[all...] |
| /hardware/qcom/media/mm-core/omxcore/inc/ |
| OMX_Video.h | 44 * Each OMX header must include all required header files to allow the
384 * H.263 profile types, each profile indicates support for various
424 * H.263 level types, each level indicates support for various frame sizes,
474 * nPFrames : Number of P frames between each I frame
475 * nBFrames : Number of B frames between each I frame
486 * the value of the RTYPE bit for each reference
510 * MPEG-2 profile types, each profile indicates support for various
527 * MPEG-2 level types, each level indicates support for various frame
548 * nPFrames : Number of P frames between each I frame
549 * nBFrames : Number of B frames between each I fram
[all...] |
| /hardware/ti/omap3/omx/system/src/openmax_il/omx_core/inc/ |
| OMX_Video.h | 44 * Each OMX header must include all required header files to allow the
384 * H.263 profile types, each profile indicates support for various
424 * H.263 level types, each level indicates support for various frame sizes,
474 * nPFrames : Number of P frames between each I frame
475 * nBFrames : Number of B frames between each I frame
486 * the value of the RTYPE bit for each reference
510 * MPEG-2 profile types, each profile indicates support for various
527 * MPEG-2 level types, each level indicates support for various frame
548 * nPFrames : Number of P frames between each I frame
549 * nBFrames : Number of B frames between each I frame
[all...] |
| /dalvik/dx/src/com/android/dx/dex/code/ |
| StdCatchBuilder.java | 44 /** {@code non-null;} address objects for each block */
53 * @param addresses {@code non-null;} address objects for each block
119 * @param addresses {@code non-null;} address objects for each block
213 * @param addresses {@code non-null;} address objects for each block
272 * @param addresses {@code non-null;} address objects for each block
297 * @param addresses {@code non-null;} address objects for each block
|
| /dalvik/dx/src/com/android/dx/ssa/ |
| SsaConverter.java | 123 * Converts CFG into "edge-split" form, such that each node either a
127 * requiring each block with a final instruction that returns a
183 * unique move-exception block for each predecessor.
312 * For each register, build a set of all basic blocks where
341 * For each register, compute all locations for phi placement
347 /* Worklist set starts out with each node where reg is assigned. */
|
| /external/apache-http/src/org/apache/commons/logging/ |
| package.html | 30 from Apache's Jakarta project. Each named <a href="Log.html">Log</a>
33 JDK Logging API</a>, included in JDK 1.4 or later systems. Each named
37 Avalon project. Each named <a href="Log.html">Log</a> instance is
119 but still allow each web application to provide its own <code>LogFactory</code>
177 <p>Each individual <a href="Log.html">Log</a> implementation may
198 purposes. A typical scenario for a server application is to have each
|
| /external/chromium/third_party/icu/source/common/ |
| triedict.h | 75 * <p>Returns true if the dictionary contains values associated with each word.</p>
152 * @param containsValue True if the dictionary stores values associated with each word.
162 * Indicate whether the MutableTrieDictionary stores values associated with each word
169 * <p>Returns true if the dictionary contains values associated with each word.</p>
256 * with each word added.
318 * <p>Returns true if the dictionary contains values associated with each word.</p>
|
| uprops.h | 97 * 31..24 DerivedAge version major/minor one nibble each
104 /* derived age: one nibble each for major and minor version numbers */
118 * Each bit encodes one binary property.
368 * start of each range of same properties to the set.
376 * start of each range of same properties to the set.
391 * For each two consecutive characters (start, limit) in the set,
|
| /external/icu4c/common/ |
| uprops.h | 85 * 31..24 DerivedAge version major/minor one nibble each
92 /* derived age: one nibble each for major and minor version numbers */
106 * Each bit encodes one binary property.
355 * start of each range of same properties to the set.
363 * start of each range of same properties to the set.
371 * For each two consecutive characters (start, limit) in the set,
|
