HomeSort by relevance Sort by last modified time
    Searched full:incr (Results 1 - 25 of 221) sorted by null

1 2 3 4 5 6 7 8 9

  /external/sepolicy/
mls_macros 9 ifelse(`$1',`$2',,`decl_cats(incr($1),$2)')dnl
23 ifelse(`$1',`$2',,`decl_sens(incr($1),$2)')dnl
26 define(`gen_dominance',`s$1 ifelse(`$1',`$2',,`gen_dominance(incr($1),$2)')')
44 ifelse(`$1',`$2',,`decl_levels(incr($1),$2,$3)')dnl
  /external/webkit/Source/WebCore/xml/
XSLTUnicodeSort.cpp 85 int i, j, incr; local
171 for (incr = len / 2; incr > 0; incr /= 2) {
172 for (i = incr; i < len; i++) {
173 j = i - incr;
185 if (xmlXPathIsNaN(results[j + incr]->floatval))
189 } else if (xmlXPathIsNaN(results[j + incr]->floatval))
192 results[j + incr]->floatval)
195 results[j + incr]->floatval
    [all...]
  /external/dropbear/
buffer.c 115 void buf_incrlen(buffer* buf, unsigned int incr) {
116 if (incr > BUF_MAX_INCR || buf->len + incr > buf->size) {
119 buf->len += incr;
130 /* increment the postion by incr, increasing the buffer length if required */
131 void buf_incrwritepos(buffer* buf, unsigned int incr) {
132 if (incr > BUF_MAX_INCR || buf->pos + incr > buf->size) {
135 buf->pos += incr;
141 /* increment the position by incr, negative values are allowed, t
    [all...]
buffer.h 48 void buf_incrlen(buffer* buf, unsigned int incr);
50 void buf_incrpos(buffer* buf, int incr); /* -ve is ok, to go backwards */
51 void buf_incrwritepos(buffer* buf, unsigned int incr);
  /external/oprofile/module/
op_dname.c 174 uint incr; local
184 /* if N is prime, value in [0-N[ and incr = max(1, value) then
185 * iteration: value = (value + incr) % N covers the range [0-N[
187 incr = firsthash = value = name_hash(dname->name, dname->len, parent);
188 if (incr == 0)
189 incr = 1;
206 value = (value + incr) % OP_HASH_MAP_NR;
  /external/stlport/test/unit/
bind_test.cpp 39 int operator()(int incr, int& val) const
40 { return val += incr; }
45 int operator()(int& val, int incr) const
46 { return val += incr; }
  /ndk/tests/device/test-gnustl-full/unit/
bind_test.cpp 39 int operator()(int incr, int& val) const
40 { return val += incr; }
45 int operator()(int& val, int incr) const
46 { return val += incr; }
  /ndk/tests/device/test-stlport/unit/
bind_test.cpp 39 int operator()(int incr, int& val) const
40 { return val += incr; }
45 int operator()(int& val, int incr) const
46 { return val += incr; }
  /dalvik/vm/analysis/
DexVerify.h 39 size_t instrsExamined; /* incr on first visit of instruction */
40 size_t instrsReexamined; /* incr on each repeat visit of instruction */
  /external/elfutils/tests/
run-funcscopes.sh 30 testrun_compare ./funcscopes -e testfile25 incr <<\EOF
33 incr (0x2e): 0x8048348 (/home/roland/build/stock-elfutils/inline-test.c:7) .. 0x804834f (/home/roland/build/stock-elfutils/inline-test.c:9)
run-find-prologues.sh 54 incr 0x0000000008048348 0x000000000804834e
59 incr 0x0000000008048348 0x000000000804834c
  /external/qemu/distrib/zlib-1.2.3/
inftrees.c 49 unsigned incr; /* for incrementing code, index */ local
233 incr = 1U << (len - drop);
237 fill -= incr;
242 incr = 1U << (len - 1);
243 while (huff & incr)
244 incr >>= 1;
245 if (incr != 0) {
246 huff &= incr - 1;
247 huff += incr;
314 incr = 1U << (len - 1)
    [all...]
  /external/zlib/src/contrib/infback9/
inftree9.c 49 unsigned incr; /* for incrementing code, index */ local
227 incr = 1U << (len - drop);
230 fill -= incr;
235 incr = 1U << (len - 1);
236 while (huff & incr)
237 incr >>= 1;
238 if (incr != 0) {
239 huff &= incr - 1;
240 huff += incr;
309 incr = 1U << (len - 1)
    [all...]
  /external/qemu/audio/
esdaudio.c 85 int incr; member in struct:__anon13133
336 int incr, to_grab, wpos; local
352 incr = to_grab = esd->dead;
398 esd->dead -= incr;
399 esd->incr += incr;
409 int live, incr, dead; local
418 incr = audio_MIN (dead, esd->incr);
419 esd->incr -= incr
    [all...]
paaudio.c 58 int incr; member in struct:__anon13140
195 int incr, to_grab, wpos; local
211 incr = to_grab = pa->dead;
239 pa->dead -= incr;
240 pa->incr += incr;
250 int live, incr, dead; local
259 incr = audio_MIN (dead, pa->incr);
260 pa->incr -= incr
    [all...]
audio.h 145 static inline void *advance (void *p, int incr)
148 return (d + incr);
  /frameworks/base/docs/html/training/notify-user/
display-progress.jd 95 int incr;
97 for (incr = 0; incr &lt;= 100; incr+=5) {
101 mBuilder.setProgress(100, incr, false);
158 mBuilder.setProgress(100, incr, false);
  /bionic/libc/upstream-netbsd/libc/gen/
nice.c 56 nice(int incr)
64 if (setpriority(PRIO_PROCESS, 0, prio + incr) == -1) {
  /external/opencv/cv/src/
cvconvhull.cpp 47 int incr = end > start ? 1 : -1; local
49 int pprev = start, pcur = pprev + incr, pnext = pcur + incr;
64 end += incr; /* make end = afterend */
84 pnext += incr;
94 pnext += incr;
108 pnext += incr;
120 int incr = end > start ? 1 : -1; local
122 int pprev = start, pcur = pprev + incr, pnext = pcur + incr;
206 int i, incr = start < end ? 1 : -1; local
    [all...]
  /external/llvm/test/CodeGen/Mips/
atomic.ll 5 define i32 @AtomicLoadAdd32(i32 %incr) nounwind {
7 %0 = atomicrmw add i32* @x, i32 %incr monotonic
19 define i32 @AtomicLoadNand32(i32 %incr) nounwind {
21 %0 = atomicrmw nand i32* @x, i32 %incr monotonic
72 define signext i8 @AtomicLoadAdd8(i8 signext %incr) nounwind {
74 %0 = atomicrmw add i8* @y, i8 %incr monotonic
103 define signext i8 @AtomicLoadSub8(i8 signext %incr) nounwind {
105 %0 = atomicrmw sub i8* @y, i8 %incr monotonic
134 define signext i8 @AtomicLoadNand8(i8 signext %incr) nounwind {
136 %0 = atomicrmw nand i8* @y, i8 %incr monotoni
    [all...]
  /external/zlib/src/
inftrees.c 49 unsigned incr; /* for incrementing code, index */ local
233 incr = 1U << (len - drop);
237 fill -= incr;
242 incr = 1U << (len - 1);
243 while (huff & incr)
244 incr >>= 1;
245 if (incr != 0) {
246 huff &= incr - 1;
247 huff += incr;
  /external/apache-harmony/security/src/test/impl/java/org/apache/harmony/security/tests/provider/crypto/
SHA1PRNG_SecureRandomTest.java 34 private static final int INCR = 2; // constant defining loop increment
91 for ( int i = 0; i < LENGTH; i+=INCR ) {
133 for ( int i = 1; i < LENGTH; i+=INCR ) {
143 for ( int k = 1; k < LENGTH; k+=INCR ) {
159 for ( int n = 1; n < LENGTH; n+=INCR ) {
200 for ( int i = 1; i < LENGTH/2; i+=INCR ) {
255 for ( int i = 1; i < LENGTH/2; i+=INCR ) {
290 for ( int n = 1; n < LENGTH; n+=INCR ) {
  /external/eigen/blas/
common.h 104 Map<Matrix<T,Dynamic,1>, 0, InnerStride<Dynamic> > vector(T* data, int size, int incr)
106 return Map<Matrix<T,Dynamic,1>, 0, InnerStride<Dynamic> >(data, size, InnerStride<Dynamic>(incr));
  /external/openfst/src/include/fst/
lock.h 81 int Incr() const { return ++count_; }
  /external/webkit/Source/WebCore/platform/
Arena.h 93 #define ARENA_GROW(p, pool, size, incr) \
95 unsigned int _incr = ARENA_ALIGN(incr); \
102 p = ArenaGrow(pool, p, size, incr); \

Completed in 693 milliseconds

1 2 3 4 5 6 7 8 9