Searched refs:it (Results 26 - 50 of 4721) sorted by last modified time

1234567891011>>

/external/xmp_toolkit/XMPCore/src/com/adobe/xmp/impl/
H A DXMPSchemaRegistryImpl.java7 // of the Adobe license agreement accompanying it.
283 for (Iterator it = aliasMap.keySet().iterator(); it.hasNext();)
285 String qname = (String) it.next();
309 * Note2: The method is only package-private so that it can be tested with unittests
H A DXMPSerializerRDF.java7 // of the Adobe license agreement accompanying it.
133 * Calulates the padding according to the options and write it to the stream.
314 for (Iterator it = xmp.getRoot().iterateChildren(); it.hasNext(); )
316 XMPNode currSchema = (XMPNode) it.next();
363 for (Iterator it = xmp.getRoot().iterateChildren(); it.hasNext();)
365 XMPNode schema = (XMPNode) it.next();
371 for (Iterator it = xmp.getRoot().iterateChildren(); it
[all...]
H A DXMPUtilsImpl.java7 // of the Adobe license agreement accompanying it.
103 // hurl if it isn't the right form.
126 for (Iterator it = arrayNode.iterateChildren(); it.hasNext();)
128 currItem = (XMPNode) it.next();
136 if (it.hasNext())
266 // This is not a matching quote, just append it to the
272 // This is a "matching" quote. Is it doubled, or the
291 // This is doubled, copy it and skip the double.
298 // This is an undoubled, non-closing quote, copy it
[all...]
/external/valgrind/main/none/tests/s390x/
H A Dop_exception.stderr.exp9 warning about a bad jump, it's probably your program's fault.
10 2. The instruction is legitimate but Valgrind doesn't handle it,
11 i.e. it's Valgrind's fault. If you think this is the case or
12 you are not sure, please let us know and we'll try to fix it.
22 warning about a bad jump, it's probably your program's fault.
23 2. The instruction is legitimate but Valgrind doesn't handle it,
24 i.e. it's Valgrind's fault. If you think this is the case or
25 you are not sure, please let us know and we'll try to fix it.
35 warning about a bad jump, it's probably your program's fault.
36 2. The instruction is legitimate but Valgrind doesn't handle it,
[all...]
/external/valgrind/main/none/tests/x86/
H A Dbug126147-x86.c13 modify it under the terms of the GNU General Public
116 const char *it = "<UNSET>"; /* Routine name for message routines. */ variable
125 printf("%s flunked test %d\n", it, number);
145 it = "strncpy";
/external/vixl/src/a64/
H A Dassembler-a64.cc1913 // If it can be encoded, the function returns true, and values pointed to by n,
1916 // If it can not be encoded, the function returns false, and the values pointed
1949 // 1. If the value has all set or all clear bits, it can't be encoded.
1969 // 2. If the value is two bits wide, it can be encoded.
1986 // the bit width of the value, it can be encoded.
1992 // value is equal to the bit width of the value, it can be encoded.
2150 // generating a jump over it.
2198 std::list<Literal*>::iterator it; local
2199 for (it = literals_.begin(); it !
2236 std::list<Literal*>::iterator it; local
[all...]
H A Ddecoder-a64.cc126 std::list<DecoderVisitor*>::iterator it; local
127 for (it = visitors_.begin(); it != visitors_.end(); it++) {
128 if (*it == registered_visitor) {
129 visitors_.insert(it, new_visitor);
135 VIXL_ASSERT(*it == registered_visitor);
136 visitors_.insert(it, new_visitor);
143 std::list<DecoderVisitor*>::iterator it; local
144 for (it
[all...]
H A Dinstrument-a64.cc120 // Set up the output stream. If datafile is non-NULL, use that file. If it
152 std::list<Counter*>::iterator it; local
153 for (it = counters_.begin(); it != counters_.end(); it++) {
154 delete *it;
179 std::list<Counter*>::const_iterator it; local
180 for (it = counters_.begin(); it != counters_.end(); it
191 std::list<Counter*>::const_iterator it; local
221 std::list<Counter*>::const_iterator it; local
239 std::list<Counter*>::iterator it; local
247 std::list<Counter*>::iterator it; local
[all...]
/external/webp/src/dsp/
H A Ddec.c527 int step, int t, int it) {
532 return VP8kabs0[p3 - p2] <= it && VP8kabs0[p2 - p1] <= it &&
533 VP8kabs0[p1 - p0] <= it && VP8kabs0[q3 - q2] <= it &&
534 VP8kabs0[q2 - q1] <= it && VP8kabs0[q1 - q0] <= it;
526 needs_filter2(const uint8_t* p, int step, int t, int it) argument
H A Ddec_mips32.c77 int step, int t, int it) {
84 return abs_mips32(p3 - p2) <= it && abs_mips32(p2 - p1) <= it &&
85 abs_mips32(p1 - p0) <= it && abs_mips32(q3 - q2) <= it &&
86 abs_mips32(q2 - q1) <= it && abs_mips32(q1 - q0) <= it;
76 needs_filter2(const uint8_t* p, int step, int t, int it) argument
H A Ddec_sse2.c20 // one it seems => disable it by default. Uncomment the following to enable:
524 // TODO(somnath): Investigate _mm_shuffle* also see if it can be broken into
742 const __m128i it = _mm_set1_epi8(ithresh); local
743 const __m128i diff = _mm_subs_epu8(*mask, it);
/external/webp/src/enc/
H A Danalysis.c236 static int MBAnalyzeBestIntra16Mode(VP8EncIterator* const it) { argument
242 VP8MakeLuma16Preds(it);
247 VP8CollectHistogram(it->yuv_in_ + Y_OFF,
248 it->yuv_p_ + VP8I16ModeOffsets[mode],
256 VP8SetIntra16Mode(it, best_mode);
260 static int MBAnalyzeBestIntra4Mode(VP8EncIterator* const it, argument
268 VP8IteratorStartI4(it);
273 const uint8_t* const src = it->yuv_in_ + Y_OFF + VP8Scan[it->i4_];
275 VP8MakeIntra4Preds(it);
302 MBAnalyzeBestUVMode(VP8EncIterator* const it) argument
325 MBAnalyze(VP8EncIterator* const it, int alphas[MAX_ALPHA + 1], int* const alpha, int* const uv_alpha) argument
393 VP8EncIterator it; member in struct:__anon33363
398 DoSegmentsJob(SegmentJob* const job, VP8EncIterator* const it) argument
[all...]
H A Dcost.c52 // use for coding it (in [][0]) as well as the bit value to use for each
494 // should be prob[VP8EncBands[n]], but it's equivalent for n=0 or 1
498 // (as required by the syntax). For ctx0 == 0, we need to add it here or it'll
599 int VP8GetCostLuma4(VP8EncIterator* const it, const int16_t levels[16]) { argument
600 const int x = (it->i4_ & 3), y = (it->i4_ >> 2);
602 VP8Encoder* const enc = it->enc_;
607 ctx = it->top_nz_[x] + it
613 VP8GetCostLuma16(VP8EncIterator* const it, const VP8ModeScore* const rd) argument
639 VP8GetCostUV(VP8EncIterator* const it, const VP8ModeScore* const rd) argument
[all...]
H A Dfilter.c83 static void DoFilter(const VP8EncIterator* const it, int level) { argument
84 const VP8Encoder* const enc = it->enc_;
88 uint8_t* const y_dst = it->yuv_out2_ + Y_OFF;
89 uint8_t* const u_dst = it->yuv_out2_ + U_OFF;
90 uint8_t* const v_dst = it->yuv_out2_ + V_OFF;
93 memcpy(y_dst, it->yuv_out_, YUV_SIZE * sizeof(uint8_t));
214 void VP8InitFilter(VP8EncIterator* const it) { argument
215 if (it->lf_stats_ != NULL) {
219 (*it->lf_stats_)[s][i] = 0;
225 void VP8StoreFilterStats(VP8EncIterator* const it) { argument
259 VP8AdjustFilterStrength(VP8EncIterator* const it) argument
[all...]
H A Dframe.c229 // should be prob[VP8EncBands[n]], but it's equivalent for n=0 or 1
299 static void CodeResiduals(VP8BitWriter* const bw, VP8EncIterator* const it, argument
304 const int i16 = (it->mb_->type_ == 1);
305 const int segment = it->mb_->segment_;
306 VP8Encoder* const enc = it->enc_;
308 VP8IteratorNzToBytes(it);
314 it->top_nz_[8] = it->left_nz_[8] =
315 PutCoeffs(bw, it->top_nz_[8] + it
353 RecordResiduals(VP8EncIterator* const it, const VP8ModeScore* const rd) argument
401 RecordTokens(VP8EncIterator* const it, const VP8ModeScore* const rd, VP8TBuffer* const tokens) argument
474 StoreSSE(const VP8EncIterator* const it) argument
485 StoreSideInfo(const VP8EncIterator* const it) argument
543 VP8EncIterator it; local
662 PostLoopFinalize(VP8EncIterator* const it, int ok) argument
692 ResetAfterSkip(VP8EncIterator* const it) argument
702 VP8EncIterator it; local
745 VP8EncIterator it; local
[all...]
H A Diterator.c22 static void InitLeft(VP8EncIterator* const it) { argument
23 it->y_left_[-1] = it->u_left_[-1] = it->v_left_[-1] =
24 (it->y_ > 0) ? 129 : 127;
25 memset(it->y_left_, 129, 16);
26 memset(it->u_left_, 129, 8);
27 memset(it->v_left_, 129, 8);
28 it->left_nz_[8] = 0;
31 static void InitTop(VP8EncIterator* const it) { argument
38 VP8IteratorSetRow(VP8EncIterator* const it, int y) argument
51 VP8IteratorReset(VP8EncIterator* const it) argument
61 VP8IteratorSetCountDown(VP8EncIterator* const it, int count_down) argument
65 VP8IteratorIsDone(const VP8EncIterator* const it) argument
69 VP8IteratorInit(VP8Encoder* const enc, VP8EncIterator* const it) argument
85 VP8IteratorProgress(const VP8EncIterator* const it, int delta) argument
127 VP8IteratorImport(VP8EncIterator* const it, uint8_t* tmp_32) argument
184 VP8IteratorExport(const VP8EncIterator* const it) argument
230 VP8IteratorNzToBytes(VP8EncIterator* const it) argument
263 VP8IteratorBytesToNz(VP8EncIterator* const it) argument
286 VP8IteratorSaveBoundary(VP8EncIterator* const it) argument
311 VP8IteratorNext(VP8EncIterator* const it) argument
327 VP8SetIntra16Mode(const VP8EncIterator* const it, int mode) argument
337 VP8SetIntra4Mode(const VP8EncIterator* const it, const uint8_t* modes) argument
348 VP8SetIntraUVMode(const VP8EncIterator* const it, int mode) argument
352 VP8SetSkip(const VP8EncIterator* const it, int skip) argument
356 VP8SetSegment(const VP8EncIterator* const it, int segment) argument
399 VP8IteratorStartI4(VP8EncIterator* const it) argument
426 VP8IteratorRotateI4(VP8EncIterator* const it, const uint8_t* const yuv_out) argument
[all...]
H A Dquant.c53 static void PrintBlockInfo(const VP8EncIterator* const it, argument
56 const int is_i16 = (it->mb_->type_ == 1);
60 for (i = 0; i < 16; ++i) printf("%3d ", it->yuv_in_[i + j * BPS]);
62 for (i = 0; i < 16; ++i) printf("%3d ", it->yuv_out_[i + j * BPS]);
65 printf("%1d ", abs(it->yuv_out_[i + j * BPS] - it->yuv_in_[i + j * BPS]));
353 // Replicate the trailing segment infos (it's mostly cosmetics)
389 // We map it to the safe maximal range of MAX/MIN_DQ_UV for dq_uv.
394 // and make it safe.
427 void VP8MakeLuma16Preds(const VP8EncIterator* const it) { argument
433 VP8MakeChroma8Preds(const VP8EncIterator* const it) argument
439 VP8MakeIntra4Preds(const VP8EncIterator* const it) argument
716 ReconstructIntra16(VP8EncIterator* const it, VP8ModeScore* const rd, uint8_t* const yuv_out, int mode) argument
767 ReconstructIntra4(VP8EncIterator* const it, int16_t levels[16], const uint8_t* const src, uint8_t* const yuv_out, int mode) argument
791 ReconstructUV(VP8EncIterator* const it, VP8ModeScore* const rd, uint8_t* const yuv_out, int mode) argument
851 SwapOut(VP8EncIterator* const it) argument
868 PickBestIntra16(VP8EncIterator* const it, VP8ModeScore* const rd) argument
922 GetCostModeI4(VP8EncIterator* const it, const uint8_t modes[16]) argument
931 PickBestIntra4(VP8EncIterator* const it, VP8ModeScore* const rd) argument
1015 PickBestUV(VP8EncIterator* const it, VP8ModeScore* const rd) argument
1057 SimpleQuantize(VP8EncIterator* const it, VP8ModeScore* const rd) argument
1082 DistoRefine(VP8EncIterator* const it, int try_both_i4_i16) argument
1137 VP8Decimate(VP8EncIterator* const it, VP8ModeScore* const rd, VP8RDLevel rd_opt) argument
[all...]
H A Dtree.c315 VP8EncIterator it; local
316 VP8IteratorInit(enc, &it);
318 const VP8MBInfo* const mb = it.mb_;
319 const uint8_t* preds = it.preds_;
343 } while (VP8IteratorNext(&it));
H A Dvp8enci.h317 void VP8IteratorInit(VP8Encoder* const enc, VP8EncIterator* const it);
319 void VP8IteratorReset(VP8EncIterator* const it);
321 void VP8IteratorSetRow(VP8EncIterator* const it, int y);
323 void VP8IteratorSetCountDown(VP8EncIterator* const it, int count_down);
325 int VP8IteratorIsDone(const VP8EncIterator* const it);
329 void VP8IteratorImport(VP8EncIterator* const it, uint8_t* tmp_32);
331 void VP8IteratorExport(const VP8EncIterator* const it);
333 int VP8IteratorNext(VP8EncIterator* const it);
335 void VP8IteratorSaveBoundary(VP8EncIterator* const it);
337 int VP8IteratorProgress(const VP8EncIterator* const it,
[all...]
/external/valgrind/main/
H A DAndroid.mk580 # TODO: tests need separate build framework it terms of 2ND_ARCH
/external/valgrind/main/cachegrind/
H A Dcg_annotate.in13 # This program is free software; you can redistribute it and/or
14 # modify it under the terms of the GNU General Public License as
18 # This program is distributed in the hope that it will be useful, but
48 #13. only adding b[i] to a[i] if b[i] defined (was doing it if
50 # it just added 0) 1.48s
108 # (Might help to think of it like a hash (0 => 2, 1 => 0, 2 => 3).)
152 --threshold=<0--20> a function is shown if it accounts for more than x% of
285 # 1. If $a2->[$i] is undefined, it defaults to 0 which is what we want; we turn
288 # 2. We don't add an undefined count or a ".", even though it's value is 0,
737 # Nb: include_dirs already includes "", so it work
[all...]
/external/valgrind/main/coregrind/m_syswrap/
H A Dsyscall-mips32-linux.S13 This program is free software; you can redistribute it and/or
14 modify it under the terms of the GNU General Public License as
18 This program is distributed in the hope that it will be useful, but
51 The syscall number is taken from the argument, even though it
108 # TODO: this should remain, keep it just for now
/external/valgrind/main/drd/tests/
H A Dbar_bad.stderr.exp18 initialise a barrier which has threads waiting on it
H A Dbar_bad_xml.stderr.exp108 initialise a barrier which has threads waiting on it
H A Dtc15_laog_lockdel.stderr.exp4 Free 2 and re-allocate it. This gives it a new identity,

Completed in 373 milliseconds

1234567891011>>