| /external/chromium_org/chrome/common/extensions/docs/examples/apps/calculator/tests/ |
| D | tests.js | 8 var run = window.calculatorTestRun.create();
128 run.test("Miscellaneous Test B", '2 * = [4] * [_ * _] = [16] = [64]');
130 run.test("Miscellaneous Test C", '0.020202020 [_ _ 0.0202020==]');
132 run.test("Miscellaneous Test D", '.2 [_ _ 0 .2]');
134 run.test("Miscellaneous Test E", '0.00000014 [_ _ 0.0000001=]');
136 run.test("Miscellaneous Test F", '0.10000004 [_ _ 0.1000000=]');
138 run.test("Miscellaneous Test G", '0.12312312 [_ _ 0.1231231=]');
140 run.test("Miscellaneous Test H", '1.231231234 [_ _ 1.2312312==]');
142 run.test("Miscellaneous Test I", '123.1231234 [_ _ 123.12312==]');
144 run.test("Miscellaneous Test J", '123123.1234 [_ _ 123123.12==]');
[all …]
|
| D | manual.js | 20 var run = window.runTests(false);
25 for (var i = 0; i < run.tests.length; ++i) {
27 tests[i].setAttribute('class', classes[run.tests[i].success]);
29 tests[i].children[0].textContent = run.tests[i].name;
31 counts.passed += run.tests[i].success ? 1 : 0;
32 counts.failed += run.tests[i].success ? 0 : 1;
33 for (var j = 0; j < run.tests[i].steps.length; ++j) {
36 step.setAttribute('class', classes[run.tests[i].steps[j].success]);
38 step.children[0].textContent = run.tests[i].steps[j].messages[0];
39 for (var k = 1; k < run.tests[i].steps[j].messages.length; ++k) {
[all …]
|
| /external/chromium_org/tools/telemetry/telemetry/results/ |
| D | page_run_unittest.py | 25 run = page_run.PageRun(self.pages[0])
26 run.AddValue(failure.FailureValue.FromMessage(self.pages[0], 'test'))
27 self.assertFalse(run.ok)
28 self.assertTrue(run.failed)
29 self.assertFalse(run.skipped)
31 run = page_run.PageRun(self.pages[0])
32 run.AddValue(scalar.ScalarValue(self.pages[0], 'a', 's', 1))
33 run.AddValue(failure.FailureValue.FromMessage(self.pages[0], 'test'))
34 self.assertFalse(run.ok)
35 self.assertTrue(run.failed)
[all …]
|
| /external/chromium_org/ui/gfx/ |
| D | render_text_win.cc | 80 Range CharRangeToGlyphRange(const internal::TextRun& run, in CharRangeToGlyphRange() argument
82 DCHECK(run.range.Contains(range)); in CharRangeToGlyphRange()
85 const Range run_range(range.start() - run.range.start(), in CharRangeToGlyphRange()
86 range.end() - run.range.start()); in CharRangeToGlyphRange()
88 if (run.script_analysis.fRTL) { in CharRangeToGlyphRange()
89 result = Range(run.logical_clusters[run_range.end() - 1], in CharRangeToGlyphRange()
90 run_range.start() > 0 ? run.logical_clusters[run_range.start() - 1] in CharRangeToGlyphRange()
91 : run.glyph_count); in CharRangeToGlyphRange()
93 result = Range(run.logical_clusters[run_range.start()], in CharRangeToGlyphRange()
94 run_range.end() < run.range.length() ? in CharRangeToGlyphRange()
[all …]
|
| D | render_text_harfbuzz.cc | 602 const internal::TextRunHarfBuzz& run = *runs_[run_index]; in FindCursorPosition() local
604 for (size_t i = 0; i < run.glyph_count; ++i) { in FindCursorPosition()
606 i + 1 == run.glyph_count ? run.width : run.positions[i + 1].x(); in FindCursorPosition()
607 const SkScalar middle = (end + run.positions[i].x()) / 2; in FindCursorPosition()
611 run.glyph_to_char[i] + (run.is_rtl ? 1 : 0)), in FindCursorPosition()
612 (run.is_rtl ? CURSOR_BACKWARD : CURSOR_FORWARD)); in FindCursorPosition()
616 run.glyph_to_char[i] + (run.is_rtl ? 0 : 1)), in FindCursorPosition()
617 (run.is_rtl ? CURSOR_FORWARD : CURSOR_BACKWARD)); in FindCursorPosition()
647 internal::TextRunHarfBuzz* run = runs_[run_index]; in GetGlyphBounds() local
648 Range bounds = run->GetGraphemeBounds(grapheme_iterator_.get(), layout_index); in GetGlyphBounds()
[all …]
|
| D | render_text_mac.cc | 168 const TextRun& run = runs_[i]; in DrawVisualText() local
169 renderer.SetForegroundColor(run.foreground); in DrawVisualText()
170 renderer.SetTextSize(run.text_size); in DrawVisualText()
171 renderer.SetFontFamilyWithStyle(run.font_name, run.font_style); in DrawVisualText()
172 renderer.DrawPosText(&run.glyph_positions[0], &run.glyphs[0], in DrawVisualText()
173 run.glyphs.size()); in DrawVisualText()
174 renderer.DrawDecorations(run.origin.x(), run.origin.y(), run.width, in DrawVisualText()
175 run.underline, run.strike, run.diagonal_strike); in DrawVisualText()
278 TextRun* run = &runs_.back(); in ComputeRuns() local
279 run->ct_run = ct_run; in ComputeRuns()
[all …]
|
| /external/chromium_org/third_party/libevent/test/ |
| D | regress.gen.h | 25 struct run;
44 int (*run_assign)(struct msg *, int, const struct run *);
45 int (*run_get)(struct msg *, int, struct run * *);
46 struct run * (*run_add)(struct msg *);
55 struct run **run_data;
81 int msg_run_assign(struct msg *, int, const struct run *);
82 int msg_run_get(struct msg *, int, struct run * *);
83 struct run * msg_run_add(struct msg *);
144 int (*how_assign)(struct run *, const char *);
145 int (*how_get)(struct run *, char * *);
[all …]
|
| /external/linux-tools-perf/perf-3.12.0/tools/perf/tests/ |
| D | make | 43 # $(run) contains all available tests
44 run := make_pure
45 run += make_clean_all
46 run += make_python_perf_so
47 run += make_debug
48 run += make_no_libperl
49 run += make_no_libpython
50 run += make_no_scripts
51 run += make_no_newt
52 run += make_no_slang
[all …]
|
| /external/icu/icu4c/source/layoutex/ |
| D | ParagraphLayout.cpp | 57 le_int32 style, run, runStyle; in StyleRuns() local
73 run = 0; in StyleRuns()
83 fRunLimits[run] = 0x7FFFFFFF; in StyleRuns()
87 if (styleRunArrays[style]->getLimit(currentRun[style]) < fRunLimits[run]) { in StyleRuns()
88 fRunLimits[run] = styleRunArrays[style]->getLimit(currentRun[style]); in StyleRuns()
96 if (styleRunArrays[style]->getLimit(currentRun[style]) == fRunLimits[run]) { in StyleRuns()
101 run += 1; in StyleRuns()
104 fRunCount = run; in StyleRuns()
377 le_int32 run, runStart; in ParagraphLayout() local
386 for (runStart = 0, run = 0; run < fStyleRunCount; run += 1) { in ParagraphLayout()
[all …]
|
| /external/llvm/unittests/IR/ |
| D | LegacyPassManagerTest.cpp | 54 static char run; member
58 run++; in runOnModule()
66 char ModuleNDNM::run=0; member in llvm::__anon4dffe3bf0111::ModuleNDNM
70 static char run; member
74 run++; in runOnModule()
79 char ModuleNDM::run=0; member in llvm::__anon4dffe3bf0111::ModuleNDM
83 static char run; member
87 run++; in runOnModule()
92 char ModuleNDM2::run=0; member in llvm::__anon4dffe3bf0111::ModuleNDM2
96 static char run; member
[all …]
|
| /external/chromium_org/third_party/WebKit/Source/platform/text/ |
| D | BidiRunList.h | 61 void setLogicallyLastRun(Run* run) { m_logicallyLastRun = run; } in setLogicallyLastRun() argument
75 inline void BidiRunList<Run>::addRun(Run* run) in addRun() argument
78 m_firstRun = run; in addRun()
80 m_lastRun->m_next = run; in addRun()
81 m_lastRun = run; in addRun()
86 inline void BidiRunList<Run>::prependRun(Run* run) in prependRun() argument
88 ASSERT(!run->m_next); in prependRun()
91 m_lastRun = run; in prependRun()
93 run->m_next = m_firstRun; in prependRun()
94 m_firstRun = run; in prependRun()
[all …]
|
| D | BidiTextRun.cpp | 39 TextDirection directionForRun(TextRun& run, bool& hasStrongDirectionality) in directionForRun() argument
42 bidiResolver.setStatus(BidiStatus(run.direction(), run.directionalOverride())); in directionForRun()
43 bidiResolver.setPositionIgnoringNestedIsolates(TextRunIterator(&run, 0)); in directionForRun()
49 TextRun run(value); in determineDirectionality() local
50 return directionForRun(run, hasStrongDirectionality); in determineDirectionality()
55 TextRun run(value); in textRunWithDirectionality() local
56 TextDirection direction = directionForRun(run, hasStrongDirectionality); in textRunWithDirectionality()
58 run.setDirection(direction); in textRunWithDirectionality()
59 return run; in textRunWithDirectionality()
|
| D | DecodeEscapeSequences.h | 56 static String decodeRun(const CharType* run, size_t runLength, const WTF::TextEncoding&) in decodeRun()
66 …eUnit = (toASCIIHexValue(run[2]) << 12) | (toASCIIHexValue(run[3]) << 8) | (toASCIIHexValue(run[4]… in decodeRun()
68 run += sequenceSize; in decodeRun()
103 … static String decodeRun(const CharType* run, size_t runLength, const WTF::TextEncoding& encoding) in decodeRun()
110 const CharType* runEnd = run + runLength; in decodeRun()
111 while (run < runEnd) { in decodeRun()
112 if (run[0] == '%') { in decodeRun()
113 *p++ = (toASCIIHexValue(run[1]) << 4) | toASCIIHexValue(run[2]); in decodeRun()
114 run += sequenceSize; in decodeRun()
116 *p++ = run[0]; in decodeRun()
[all …]
|
| /external/chromium_org/third_party/WebKit/Source/core/html/track/vtt/ |
| D | VTTScanner.cpp | 69 bool VTTScanner::scanRun(const Run& run, const String& toMatch) in scanRun() argument
71 ASSERT(run.start() == position()); in scanRun()
72 ASSERT(run.start() <= end()); in scanRun()
73 ASSERT(run.end() >= run.start()); in scanRun()
74 ASSERT(run.end() <= end()); in scanRun()
75 size_t matchLength = run.length(); in scanRun()
84 seekTo(run.end()); in scanRun()
88 void VTTScanner::skipRun(const Run& run) in skipRun() argument
90 ASSERT(run.start() <= end()); in skipRun()
91 ASSERT(run.end() >= run.start()); in skipRun()
[all …]
|
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| D | CubicReduceOrder_Test.cpp | 30 } run = RunAll; in CubicReduceOrder_Test() local
33 run = RunComputedLines; in CubicReduceOrder_Test()
36 …int firstPointDegeneratesTest = run == RunAll ? 0 : run == RunPointDegenerates ? firstTestIndex : … in CubicReduceOrder_Test()
37 …int firstNotPointDegeneratesTest = run == RunAll ? 0 : run == RunNotPointDegenerates ? firstTestIn… in CubicReduceOrder_Test()
38 int firstLinesTest = run == RunAll ? 0 : run == RunLines ? firstTestIndex : SK_MaxS32; in CubicReduceOrder_Test()
39 int firstNotLinesTest = run == RunAll ? 0 : run == RunNotLines ? firstTestIndex : SK_MaxS32; in CubicReduceOrder_Test()
40 …int firstModEpsilonTest = run == RunAll ? 0 : run == RunModEpsilonLines ? firstTestIndex : SK_MaxS… in CubicReduceOrder_Test()
41 …int firstLessEpsilonTest = run == RunAll ? 0 : run == RunLessEpsilonLines ? firstTestIndex : SK_Ma… in CubicReduceOrder_Test()
42 …int firstNegEpsilonTest = run == RunAll ? 0 : run == RunNegEpsilonLines ? firstTestIndex : SK_MaxS… in CubicReduceOrder_Test()
43 …int firstQuadraticLineTest = run == RunAll ? 0 : run == RunQuadraticLines ? firstTestIndex : SK_Ma… in CubicReduceOrder_Test()
[all …]
|
| /external/skia/experimental/Intersection/ |
| D | CubicReduceOrder_Test.cpp | 30 } run = RunAll; in CubicReduceOrder_Test() local
33 run = RunComputedLines; in CubicReduceOrder_Test()
36 …int firstPointDegeneratesTest = run == RunAll ? 0 : run == RunPointDegenerates ? firstTestIndex : … in CubicReduceOrder_Test()
37 …int firstNotPointDegeneratesTest = run == RunAll ? 0 : run == RunNotPointDegenerates ? firstTestIn… in CubicReduceOrder_Test()
38 int firstLinesTest = run == RunAll ? 0 : run == RunLines ? firstTestIndex : SK_MaxS32; in CubicReduceOrder_Test()
39 int firstNotLinesTest = run == RunAll ? 0 : run == RunNotLines ? firstTestIndex : SK_MaxS32; in CubicReduceOrder_Test()
40 …int firstModEpsilonTest = run == RunAll ? 0 : run == RunModEpsilonLines ? firstTestIndex : SK_MaxS… in CubicReduceOrder_Test()
41 …int firstLessEpsilonTest = run == RunAll ? 0 : run == RunLessEpsilonLines ? firstTestIndex : SK_Ma… in CubicReduceOrder_Test()
42 …int firstNegEpsilonTest = run == RunAll ? 0 : run == RunNegEpsilonLines ? firstTestIndex : SK_MaxS… in CubicReduceOrder_Test()
43 …int firstQuadraticLineTest = run == RunAll ? 0 : run == RunQuadraticLines ? firstTestIndex : SK_Ma… in CubicReduceOrder_Test()
[all …]
|
| /external/skia/tests/ |
| D | PathOpsCubicToQuadsTest.cpp | 111 } run = RunAll; in DEF_TEST() local
114 run = RunComputedLines; in DEF_TEST()
117 int firstPointDegeneratesTest = run == RunAll ? 0 : run == RunPointDegenerates in DEF_TEST()
119 int firstNotPointDegeneratesTest = run == RunAll ? 0 : run == RunNotPointDegenerates in DEF_TEST()
121 int firstLinesTest = run == RunAll ? 0 : run == RunLines ? firstTestIndex : SK_MaxS32; in DEF_TEST()
122 int firstNotLinesTest = run == RunAll ? 0 : run == RunNotLines ? firstTestIndex : SK_MaxS32; in DEF_TEST()
123 int firstModEpsilonTest = run == RunAll ? 0 : run == RunModEpsilonLines in DEF_TEST()
125 int firstLessEpsilonTest = run == RunAll ? 0 : run == RunLessEpsilonLines in DEF_TEST()
127 int firstNegEpsilonTest = run == RunAll ? 0 : run == RunNegEpsilonLines in DEF_TEST()
129 int firstQuadraticLineTest = run == RunAll ? 0 : run == RunQuadraticLines in DEF_TEST()
[all …]
|
| /external/chromium_org/third_party/skia/tests/ |
| D | PathOpsCubicToQuadsTest.cpp | 111 } run = RunAll; in DEF_TEST() local
114 run = RunComputedLines; in DEF_TEST()
117 int firstPointDegeneratesTest = run == RunAll ? 0 : run == RunPointDegenerates in DEF_TEST()
119 int firstNotPointDegeneratesTest = run == RunAll ? 0 : run == RunNotPointDegenerates in DEF_TEST()
121 int firstLinesTest = run == RunAll ? 0 : run == RunLines ? firstTestIndex : SK_MaxS32; in DEF_TEST()
122 int firstNotLinesTest = run == RunAll ? 0 : run == RunNotLines ? firstTestIndex : SK_MaxS32; in DEF_TEST()
123 int firstModEpsilonTest = run == RunAll ? 0 : run == RunModEpsilonLines in DEF_TEST()
125 int firstLessEpsilonTest = run == RunAll ? 0 : run == RunLessEpsilonLines in DEF_TEST()
127 int firstNegEpsilonTest = run == RunAll ? 0 : run == RunNegEpsilonLines in DEF_TEST()
129 int firstQuadraticLineTest = run == RunAll ? 0 : run == RunQuadraticLines in DEF_TEST()
[all …]
|
| /external/qemu/distrib/sdl-1.2.15/src/video/bwindow/ |
| D | SDL_sysmouse.cc | 48 int run, pad, i; in BE_CreateWMCursor() local
78 run = PADDED_BITS(w); in BE_CreateWMCursor()
79 pad = PADDED_BITS(allowed_x)-run; in BE_CreateWMCursor()
81 SDL_memcpy(cptr, data, run); in BE_CreateWMCursor()
82 SDL_memset(cptr+run, 0, pad); in BE_CreateWMCursor()
83 data += run; in BE_CreateWMCursor()
84 cptr += (run+pad); in BE_CreateWMCursor()
87 SDL_memset(cptr, 0, run+pad); in BE_CreateWMCursor()
88 cptr += (run+pad); in BE_CreateWMCursor()
95 SDL_memcpy(cptr, mask, run); in BE_CreateWMCursor()
[all …]
|
| /external/eigen/bench/ |
| D | product_threshold.cpp | 76 static void run() in run() function
79 print_n<N>::run(); in run()
82 loop_on_m<M,N,K>::run(); in run()
85 loop_on_k<M,N,K+1>::run(); in run()
90 struct loop_on_k<M,N,END> { static void run(){} }; in run() function
96 static void run() in run() function
99 loop_on_n<M,N,K,float,CoeffBasedProductMode>::run(); in run()
103 loop_on_n<M,N,K,float,-1>::run(); in run()
106 loop_on_m<M+1,N,K>::run(); in run()
111 struct loop_on_m<END,N,K> { static void run(){} }; in run() function
[all …]
|
| /external/eigen/blas/ |
| D | level2_impl.h | 23 …unc[NOTR] = (internal::general_matrix_vector_product<int,Scalar,ColMajor,false,Scalar,false>::run); in EIGEN_BLAS_FUNC()
24 …unc[TR ] = (internal::general_matrix_vector_product<int,Scalar,RowMajor,false,Scalar,false>::run); in EIGEN_BLAS_FUNC()
25 …unc[ADJ ] = (internal::general_matrix_vector_product<int,Scalar,RowMajor,Conj, Scalar,false>::run); in EIGEN_BLAS_FUNC()
87 …nternal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Upper|0, false,ColMajor>::run); in EIGEN_BLAS_FUNC()
88 …nternal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Lower|0, false,RowMajor>::run); in EIGEN_BLAS_FUNC()
89 …nternal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Lower|0, Conj, RowMajor>::run); in EIGEN_BLAS_FUNC()
91 …nternal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Lower|0, false,ColMajor>::run); in EIGEN_BLAS_FUNC()
92 …nternal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Upper|0, false,RowMajor>::run); in EIGEN_BLAS_FUNC()
93 …nternal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Upper|0, Conj, RowMajor>::run); in EIGEN_BLAS_FUNC()
95 …nternal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Upper|UnitDiag,false,ColMajor>::run); in EIGEN_BLAS_FUNC()
[all …]
|
| /external/oprofile/events/ppc64/power7/ |
| D | events | 23 …run latch. Operating systems use the run latch to indicate when they are doing useful work. The …
26 …nimum:1000 name:PM_RUN_INST_CMPL_GRP1 : (Group 1 pm_utilization) Number of run instructions comple…
27 …run latch. Operating systems use the run latch to indicate when they are doing useful work. The …
34 …o minimum:1000 name:PM_RUN_INST_CMPL_GRP2 : (Group 2 pm_branch1) Number of run instructions comple…
35 …run latch. Operating systems use the run latch to indicate when they are doing useful work. The …
42 …o minimum:1000 name:PM_RUN_INST_CMPL_GRP3 : (Group 3 pm_branch2) Number of run instructions comple…
43 …run latch. Operating systems use the run latch to indicate when they are doing useful work. The …
50 …o minimum:1000 name:PM_RUN_INST_CMPL_GRP4 : (Group 4 pm_branch3) Number of run instructions comple…
51 …run latch. Operating systems use the run latch to indicate when they are doing useful work. The …
58 …o minimum:1000 name:PM_RUN_INST_CMPL_GRP5 : (Group 5 pm_branch4) Number of run instructions comple…
[all …]
|
| /external/chromium_org/third_party/skia/src/core/ |
| D | SkTextBlob.cpp | 74 static const RunRecord* Next(const RunRecord* run) { in Next() argument
75 return reinterpret_cast<const RunRecord*>(reinterpret_cast<const uint8_t*>(run) in Next()
76 + StorageSize(run->glyphCount(), run->positioning())); in Next()
116 const RunRecord* run = RunRecord::First(this); in ~SkTextBlob() local
118 const RunRecord* nextRun = RunRecord::Next(run); in ~SkTextBlob()
119 SkDEBUGCODE(run->validate((uint8_t*)this + fStorageSize);) in ~SkTextBlob()
120 run->~RunRecord(); in ~SkTextBlob()
121 run = nextRun; in ~SkTextBlob()
353 SkTextBlob::RunRecord* run = reinterpret_cast<SkTextBlob::RunRecord*>(fStorage.get() + in mergeRun() local
355 SkASSERT(run->glyphCount() > 0); in mergeRun()
[all …]
|
| /external/wpa_supplicant_8/wpa_supplicant/examples/ |
| D | p2p-action.sh | 26 kill_daemon dhclient /var/run/dhclient-$GIFNAME.pid
27 rm /var/run/dhclient.leases-$GIFNAME
28 kill_daemon dnsmasq /var/run/dnsmasq.pid-$GIFNAME
30 if ! dnsmasq -x /var/run/dnsmasq.pid-$GIFNAME \
35 dnsmasq -x /var/run/dnsmasq.pid-$GIFNAME \
41 kill_daemon dhclient /var/run/dhclient-$GIFNAME.pid
42 rm /var/run/dhclient.leases-$GIFNAME
43 kill_daemon dnsmasq /var/run/dnsmasq.pid-$GIFNAME
57 dhclient -pf /var/run/dhclient-$GIFNAME.pid \
58 -lf /var/run/dhclient.leases-$GIFNAME \
[all …]
|
| /external/jemalloc/src/ |
| D | arena.c | 54 static void arena_run_dalloc(arena_t *arena, arena_run_t *run, bool dirty,
57 arena_run_t *run, arena_bin_t *bin);
59 arena_run_t *run, arena_bin_t *bin);
297 arena_run_reg_alloc(arena_run_t *run, arena_bin_info_t *bin_info) in arena_run_reg_alloc() argument
301 bitmap_t *bitmap = (bitmap_t *)((uintptr_t)run + in arena_run_reg_alloc()
304 assert(run->nfree > 0); in arena_run_reg_alloc()
308 ret = (void *)((uintptr_t)run + (uintptr_t)bin_info->reg0_offset + in arena_run_reg_alloc()
310 run->nfree--; in arena_run_reg_alloc()
311 if (regind == run->nextind) in arena_run_reg_alloc()
312 run->nextind++; in arena_run_reg_alloc()
[all …]
|