Home
last modified time | relevance | path

Searched +full:- +full:i (Results 1 – 25 of 1657) sorted by relevance

12345678910>>...67

/external/python/cpython3/Lib/test/
Drandv2_32.pck6 (I-2147483648
7 I-845974985
8 I-1294090086
10 I-1849481736
11 I-946579732
12 I-34406770
17 I-943175655
18 I-1718073964
20 I-1045260575
22 I-1555108250
[all …]
/external/cronet/stable/third_party/icu/source/data/region/
Dzu.txt3 // Generated using tools/cldr/cldr-to-icu/build-icu-data.xml
7 002{"i-Africa"}
8 003{"i-North America"}
9 005{"i-South America"}
10 009{"i-Oceania"}
11 011{"i-Western Africa"}
12 013{"i-Central America"}
13 014{"i-Eastern Africa"}
14 015{"i-Northern Africa"}
15 017{"i-Middle Africa"}
[all …]
/external/cronet/tot/third_party/icu/source/data/region/
Dzu.txt3 // Generated using tools/cldr/cldr-to-icu/build-icu-data.xml
7 002{"i-Africa"}
8 003{"i-North America"}
9 005{"i-South America"}
10 009{"i-Oceania"}
11 011{"i-Western Africa"}
12 013{"i-Central America"}
13 014{"i-Eastern Africa"}
14 015{"i-Northern Africa"}
15 017{"i-Middle Africa"}
[all …]
/external/icu/icu4c/source/data/region/
Dzu.txt3 // Generated using tools/cldr/cldr-to-icu/build-icu-data.xml
7 002{"i-Africa"}
8 003{"i-North America"}
9 005{"i-South America"}
10 009{"i-Oceania"}
11 011{"i-Western Africa"}
12 013{"i-Central America"}
13 014{"i-Eastern Africa"}
14 015{"i-Northern Africa"}
15 017{"i-Middle Africa"}
[all …]
/external/cldr/tools/cldr-code/src/main/resources/org/unicode/cldr/util/data/
Diso-639-3.tab2 aaa I L Ghotuo
3 aab I L Alumu-Tesu
4 aac I L Ari
5 aad I L Amal
6 aae I L Arbëreshë Albanian
7 aaf I L Aranadan
8 aag I L Ambrak
9 aah I L Abu' Arapesh
10 aai I L Arifama-Miniafia
11 aak I L Ankave
[all …]
/external/llvm/test/Transforms/InstCombine/
Ddiv-shift-crash.ll1 ; RUN: opt -instcombine < %s
2 target datalayout = "E-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-f…
3 target triple = "powerpc64-unknown-linux-gnu"
10 …%l_819.i.i = alloca %struct.S0.0.1.2.3.4.13.22.31.44.48.53.54.55.56.58.59.60.66.68.70.74.77.106.10…
11 br i1 undef, label %land.lhs.true, label %for.cond.i
14 br label %for.cond.i
16 for.cond.i: ; preds = %land.lhs.true, %entry
17 ….54.55.56.58.59.60.66.68.70.74.77.106.107.108.109.110.113.117.118.128.129* %l_819.i.i, i64 0, i32 0
18 br label %for.cond.i6.i.i
20 for.cond.i6.i.i: ; preds = %for.body.i8.i.i, %for.cond.i
[all …]
/external/curl/tests/libtest/
Dlib557.c21 * SPDX-License-Identifier: curl
42 #pragma GCC diagnostic ignored "-Wformat"
43 #pragma GCC diagnostic ignored "-Wformat-extra-args"
45 #pragma GCC diagnostic ignored "-Wformat-overflow"
135 int i, j; in test_unsigned_short_formatting() local
139 i = 1; us_test[i].num = 0xFFFFU; us_test[i].expected = "65535"; in test_unsigned_short_formatting()
140 i++; us_test[i].num = 0xFF00U; us_test[i].expected = "65280"; in test_unsigned_short_formatting()
141 i++; us_test[i].num = 0x00FFU; us_test[i].expected = "255"; in test_unsigned_short_formatting()
143 i++; us_test[i].num = 0xF000U; us_test[i].expected = "61440"; in test_unsigned_short_formatting()
144 i++; us_test[i].num = 0x0F00U; us_test[i].expected = "3840"; in test_unsigned_short_formatting()
[all …]
/external/icu/icu4c/source/data/curr/
Dzu.txt3 // Generated using tools/cldr/cldr-to-icu/build-icu-data.xml
8 "i-Dirham yase-United Arab Emirates",
12 "i-Afghan Afghani",
16 "i-Albanian Lek",
20 "i-Armenian Dram",
24 "i-Netherlands Antillean Guilder",
28 "i-Angolan Kwanza",
32 "i-Argentina Peso",
36 "i-Austrilian Dollar",
40 "i-Aruban Florin",
[all …]
/external/cronet/tot/third_party/icu/source/data/curr/
Dzu.txt3 // Generated using tools/cldr/cldr-to-icu/build-icu-data.xml
8 "i-Dirham yase-United Arab Emirates",
12 "i-Afghan Afghani",
16 "i-Albanian Lek",
20 "i-Armenian Dram",
24 "i-Netherlands Antillean Guilder",
28 "i-Angolan Kwanza",
32 "i-Argentina Peso",
36 "i-Austrilian Dollar",
40 "i-Aruban Florin",
[all …]
/external/cronet/stable/third_party/icu/source/data/curr/
Dzu.txt3 // Generated using tools/cldr/cldr-to-icu/build-icu-data.xml
8 "i-Dirham yase-United Arab Emirates",
12 "i-Afghan Afghani",
16 "i-Albanian Lek",
20 "i-Armenian Dram",
24 "i-Netherlands Antillean Guilder",
28 "i-Angolan Kwanza",
32 "i-Argentina Peso",
36 "i-Austrilian Dollar",
40 "i-Aruban Florin",
[all …]
/external/intel-media-driver/
DREADME.md6 The Intel(R) Media Driver for VAAPI is a new VA-API (Video Acceleration API)
13 portions covered under the BSD 3-clause "New" or "Revised" License.
14 …at [MIT](https://opensource.org/licenses/MIT) & [BSD-3-Clause](https://opensource.org/licenses/BSD…
20 apt install autoconf libtool libdrm-dev xorg xorg-dev openbox libx11-dev libgl1-mesa-glx
26 …lowing [GmmLib compatibility](https://github.com/intel/media-driver/wiki/Compatibility-with-GmmLib)
30 |- media-driver
39 |- media-driver
40 |- build_media
48 $ cmake ../media-driver
52 $ make -j"$(nproc)"
[all …]
/external/cronet/stable/third_party/libc++/src/src/
Dhash.cpp1 //===----------------------------------------------------------------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
14 _LIBCPP_CLANG_DIAGNOSTIC_IGNORED("-Wtautological-constant-out-of-range-compare")
20 // handle all next_prime(i) for i in [1, 210), special case 0
26 // potential primes = 210*k + indices[i], k >= 1
39 // The algorithm creates a list of small primes, plus an open-ended list of
71 if (n <= small_primes[N - 1]) in __next_prime()
79 // Known a-priori n >= L in __next_prime()
81 size_t in = static_cast<size_t>(std::lower_bound(indices, indices + M, n - k0 * L) - indices); in __next_prime()
[all …]
/external/cronet/tot/third_party/libc++/src/src/
Dhash.cpp1 //===----------------------------------------------------------------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
14 _LIBCPP_CLANG_DIAGNOSTIC_IGNORED("-Wtautological-constant-out-of-range-compare")
20 // handle all next_prime(i) for i in [1, 210), special case 0
26 // potential primes = 210*k + indices[i], k >= 1
39 // The algorithm creates a list of small primes, plus an open-ended list of
71 if (n <= small_primes[N - 1]) in __next_prime()
79 // Known a-priori n >= L in __next_prime()
81 size_t in = static_cast<size_t>(std::lower_bound(indices, indices + M, n - k0 * L) - indices); in __next_prime()
[all …]
/external/cpuinfo/test/mock/
Dgalaxy-s9-us.cc3 #include <cpuinfo-mock.h>
15 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
16 ASSERT_EQ(0, cpuinfo_get_processor(i)->smt_id); in TEST()
21 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
22 ASSERT_EQ(cpuinfo_get_core(i), cpuinfo_get_processor(i)->core); in TEST()
27 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
28 switch (i) { in TEST()
33 ASSERT_EQ(cpuinfo_get_cluster(0), cpuinfo_get_processor(i)->cluster); in TEST()
39 ASSERT_EQ(cpuinfo_get_cluster(1), cpuinfo_get_processor(i)->cluster); in TEST()
46 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
[all …]
Dmeizu-pro-6.cc3 #include <cpuinfo-mock.h>
15 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
16 ASSERT_EQ(0, cpuinfo_get_processor(i)->smt_id); in TEST()
21 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
22 ASSERT_EQ(cpuinfo_get_core(i), cpuinfo_get_processor(i)->core); in TEST()
27 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
28 switch (i) { in TEST()
31 ASSERT_EQ(cpuinfo_get_cluster(0), cpuinfo_get_processor(i)->cluster); in TEST()
37 ASSERT_EQ(cpuinfo_get_cluster(1), cpuinfo_get_processor(i)->cluster); in TEST()
43 ASSERT_EQ(cpuinfo_get_cluster(2), cpuinfo_get_processor(i)->cluster); in TEST()
[all …]
Dmeizu-pro-6s.cc3 #include <cpuinfo-mock.h>
15 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
16 ASSERT_EQ(0, cpuinfo_get_processor(i)->smt_id); in TEST()
21 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
22 ASSERT_EQ(cpuinfo_get_core(i), cpuinfo_get_processor(i)->core); in TEST()
27 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
28 switch (i) { in TEST()
31 ASSERT_EQ(cpuinfo_get_cluster(0), cpuinfo_get_processor(i)->cluster); in TEST()
37 ASSERT_EQ(cpuinfo_get_cluster(1), cpuinfo_get_processor(i)->cluster); in TEST()
43 ASSERT_EQ(cpuinfo_get_cluster(2), cpuinfo_get_processor(i)->cluster); in TEST()
[all …]
Dlg-optimus-g-pro.cc3 #include <cpuinfo-mock.h>
15 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
16 ASSERT_EQ(0, cpuinfo_get_processor(i)->smt_id); in TEST()
21 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
22 ASSERT_EQ(cpuinfo_get_core(i), cpuinfo_get_processor(i)->core); in TEST()
27 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
28 ASSERT_EQ(cpuinfo_get_cluster(0), cpuinfo_get_processor(i)->cluster); in TEST()
33 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
34 ASSERT_EQ(cpuinfo_get_package(0), cpuinfo_get_processor(i)->package); in TEST()
39 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
[all …]
Dgalaxy-s5-us.cc3 #include <cpuinfo-mock.h>
15 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
16 ASSERT_EQ(0, cpuinfo_get_processor(i)->smt_id); in TEST()
21 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
22 ASSERT_EQ(cpuinfo_get_core(i), cpuinfo_get_processor(i)->core); in TEST()
27 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
28 ASSERT_EQ(cpuinfo_get_cluster(0), cpuinfo_get_processor(i)->cluster); in TEST()
33 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
34 ASSERT_EQ(cpuinfo_get_package(0), cpuinfo_get_processor(i)->package); in TEST()
39 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
[all …]
Dgalaxy-grand-prime-value-edition.cc3 #include <cpuinfo-mock.h>
15 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
16 ASSERT_EQ(0, cpuinfo_get_processor(i)->smt_id); in TEST()
21 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
22 ASSERT_EQ(cpuinfo_get_core(i), cpuinfo_get_processor(i)->core); in TEST()
27 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
28 ASSERT_EQ(cpuinfo_get_cluster(0), cpuinfo_get_processor(i)->cluster); in TEST()
33 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
34 ASSERT_EQ(cpuinfo_get_package(0), cpuinfo_get_processor(i)->package); in TEST()
39 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
[all …]
Dgalaxy-s4-us.cc3 #include <cpuinfo-mock.h>
15 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
16 ASSERT_EQ(0, cpuinfo_get_processor(i)->smt_id); in TEST()
21 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
22 ASSERT_EQ(cpuinfo_get_core(i), cpuinfo_get_processor(i)->core); in TEST()
27 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
28 ASSERT_EQ(cpuinfo_get_cluster(0), cpuinfo_get_processor(i)->cluster); in TEST()
33 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
34 ASSERT_EQ(cpuinfo_get_package(0), cpuinfo_get_processor(i)->package); in TEST()
39 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
[all …]
Dgalaxy-s3-us.cc3 #include <cpuinfo-mock.h>
15 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
16 ASSERT_EQ(0, cpuinfo_get_processor(i)->smt_id); in TEST()
21 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
22 ASSERT_EQ(cpuinfo_get_core(i), cpuinfo_get_processor(i)->core); in TEST()
27 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
28 ASSERT_EQ(cpuinfo_get_cluster(0), cpuinfo_get_processor(i)->cluster); in TEST()
33 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
34 ASSERT_EQ(cpuinfo_get_package(0), cpuinfo_get_processor(i)->package); in TEST()
39 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
[all …]
Dgalaxy-tab-3-lite.cc3 #include <cpuinfo-mock.h>
15 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
16 ASSERT_EQ(0, cpuinfo_get_processor(i)->smt_id); in TEST()
21 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
22 ASSERT_EQ(cpuinfo_get_core(i), cpuinfo_get_processor(i)->core); in TEST()
27 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
28 ASSERT_EQ(cpuinfo_get_cluster(0), cpuinfo_get_processor(i)->cluster); in TEST()
33 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
34 ASSERT_EQ(cpuinfo_get_package(0), cpuinfo_get_processor(i)->package); in TEST()
39 for (uint32_t i = 0; i < cpuinfo_get_processors_count(); i++) { in TEST() local
[all …]
/external/clang/test/OpenMP/
Dfor_schedule_messages.cpp1 // RUN: %clang_cc1 -verify -fopenmp %s
10 struct S1; // expected-note {{declared here}}
12 template <class T, typename S, int N, int ST> // expected-note {{declared here}}
14 #pragma omp for schedule // expected-error {{expected '(' after 'schedule'}} in tmain()
15 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
16 …-error {{expected 'static', 'dynamic', 'guided', 'auto', 'runtime', 'monotonic', 'nonmonotonic' or… in tmain()
17 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
18 …#pragma omp for schedule () // expected-error {{expected 'static', 'dynamic', 'guided', 'auto', 'r… in tmain()
19 for (int i = ST; i < N; i++) argv[0][i] = argv[0][i] - argv[0][i-ST]; in tmain() local
20 …#pragma omp for schedule (auto // expected-error {{expected ')'}} expected-note {{to match this '(… in tmain()
[all …]
/external/libcxx/src/
Dhash.cpp1 //===-------------------------- hash.cpp ----------------------------------===//
8 //===----------------------------------------------------------------------===//
16 #pragma clang diagnostic ignored "-Wtautological-constant-out-of-range-compare"
23 // handle all next_prime(i) for i in [1, 210), special case 0
76 // potential primes = 210*k + indices[i], k >= 1
136 // The algorithm creates a list of small primes, plus an open-ended list of
184 if (n <= small_primes[N-1]) in __next_prime()
192 // Known a-priori n >= L in __next_prime()
194 size_t in = static_cast<size_t>(std::lower_bound(indices, indices + M, n - k0 * L) in __next_prime()
195 - indices); in __next_prime()
[all …]
/external/clang/test/CodeGen/
Dcomplex-convert.c1 // RUN: %clang_cc1 -emit-llvm -o - %s | FileCheck %s
5 // with widening, narrowing, and equal-size operands. Signed and unsigned
24 // CHECK-LABEL: define {{.*}}void @foo( in foo()
26 // CHECK: i[[CHSIZE:[0-9]+]]{{[^,]*}}, in foo()
27 // CHECK: i[[CHSIZE]]{{[^,]*}}, in foo()
28 // CHECK: i[[LLSIZE:[0-9]+]] in foo()
31 // CHECK: alloca i[[CHSIZE]], align [[CHALIGN:[0-9]+]] in foo()
32 // CHECK: alloca i[[LLSIZE]], align [[LLALIGN:[0-9]+]] in foo()
37 …:[A-Za-z0-9.]+]] = getelementptr inbounds { i[[CHSIZE]], i[[CHSIZE]] }, { i[[CHSIZE]], i[[CHSIZE]… in foo()
38 // CHECK-NEXT: %[[VAR2:[A-Za-z0-9.]+]] = load i[[CHSIZE]], i[[CHSIZE]]* %[[VAR1]] in foo()
[all …]

12345678910>>...67