| /prebuilts/go/darwin-x86/test/alias3.dir/ |
| a.go | 15 Int int
16 IntAlias = Int
19 Int
36 M1(Int) float64
|
| /prebuilts/go/linux-x86/test/alias3.dir/ |
| a.go | 15 Int int
16 IntAlias = Int
19 Int
36 M1(Int) float64
|
| /tools/metalava/src/main/java/com/android/tools/metalava/ |
| DriverException.kt | 22 val exitCode: Int = if (stderr.isBlank()) 0 else -1
|
| /prebuilts/go/darwin-x86/src/crypto/elliptic/ |
| elliptic.go | 28 IsOnCurve(x, y *big.Int) bool
30 Add(x1, y1, x2, y2 *big.Int) (x, y *big.Int)
32 Double(x1, y1 *big.Int) (x, y *big.Int)
34 ScalarMult(x1, y1 *big.Int, k []byte) (x, y *big.Int)
37 ScalarBaseMult(k []byte) (x, y *big.Int)
43 P *big.Int // the order of the underlying field
44 N *big.Int // the order of the base poin
[all...] |
| /prebuilts/go/linux-x86/src/crypto/elliptic/ |
| elliptic.go | 28 IsOnCurve(x, y *big.Int) bool
30 Add(x1, y1, x2, y2 *big.Int) (x, y *big.Int)
32 Double(x1, y1 *big.Int) (x, y *big.Int)
34 ScalarMult(x1, y1 *big.Int, k []byte) (x, y *big.Int)
37 ScalarBaseMult(k []byte) (x, y *big.Int)
43 P *big.Int // the order of the underlying field
44 N *big.Int // the order of the base poin
[all...] |
| /external/clang/test/CXX/basic/basic.start/basic.start.main/ |
| p2.cpp | 24 typedef int Int;
28 Int main(Int argc, Carp argv[]) {
34 typedef int Int;
38 Int main(Int argc, Carp argv[], Char *env[]) {
44 int main() {
49 static int main() { // expected-error {{'main' is not allowed to be declared static}
[all...] |
| /external/clang/test/Index/ |
| complete-member-access.m | 9 int SuperIVar;
12 @interface Int : Super<MyProtocol>
14 int IVar;
17 @property int prop1;
20 void test_props(Int* ptr) {
25 @interface Sub : Int
26 @property int myProp;
28 - (int)myProp;
29 - (int)myOtherPropLikeThing;
30 - (int)myOtherNonPropThing:(int)value
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| IntervalIterator.h | 68 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) {
69 Int->Nodes.push_back(BB);
79 inline void addNodeToInterval(Interval *Int, Interval *I) {
80 // Add all of the nodes in I as new nodes in Int.
81 Int->Nodes.insert(Int->Nodes.end(), I->Nodes.begin(), I->Nodes.end());
160 IntervalIterator operator++(int) { // Postincrement
180 Interval *Int = new Interval(Header);
185 ProcessNode(Int, getSourceGraphNode(OrigContainer, *I));
187 IntStack.push_back(std::make_pair(Int, succ_begin(Int)))
[all...] |
| /external/valgrind/coregrind/ |
| pub_core_signals.h | 42 extern Int VG_(max_signal);
45 extern const HChar *VG_(signame)(Int sigNo);
60 extern SysRes VG_(do_sys_sigaction) ( Int signo,
63 extern SysRes VG_(do_sys_sigprocmask) ( ThreadId tid, Int how,
70 extern void VG_(kill_self)(Int sigNo);
88 extern void VG_(set_default_handler)(Int sig);
|
| /frameworks/support/buildSrc/src/main/kotlin/androidx/build/doclava/ |
| ChecksConfig.kt | 27 val errors: List<Int>,
33 val warnings: List<Int>,
39 val hidden: List<Int>,
|
| /frameworks/support/core/ktx/src/main/java/androidx/core/widget/ |
| Toast.kt | 30 inline fun Context.toast(text: CharSequence, duration: Int = Toast.LENGTH_SHORT): Toast {
40 inline fun Context.toast(@StringRes resId: Int, duration: Int = Toast.LENGTH_SHORT): Toast {
|
| /frameworks/support/navigation/testing/ktx/src/main/java/androidx/navigation/testing/ |
| TestNavigatorDestinationBuilder.kt | 30 inline fun NavGraphBuilder.test(@IdRes id: Int) = test(id) {}
36 @IdRes id: Int,
46 @IdRes id: Int
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| IntervalIterator.h | 68 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) {
69 Int->Nodes.push_back(BB);
79 inline void addNodeToInterval(Interval *Int, Interval *I) {
80 // Add all of the nodes in I as new nodes in Int.
81 Int->Nodes.insert(Int->Nodes.end(), I->Nodes.begin(), I->Nodes.end());
160 IntervalIterator operator++(int) { // Postincrement
180 Interval *Int = new Interval(Header);
185 ProcessNode(Int, getSourceGraphNode(OrigContainer, *I));
187 IntStack.push_back(std::make_pair(Int, succ_begin(Int)))
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Analysis/ |
| IntervalIterator.h | 68 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) {
69 Int->Nodes.push_back(BB);
79 inline void addNodeToInterval(Interval *Int, Interval *I) {
80 // Add all of the nodes in I as new nodes in Int.
81 Int->Nodes.insert(Int->Nodes.end(), I->Nodes.begin(), I->Nodes.end());
160 IntervalIterator operator++(int) { // Postincrement
180 Interval *Int = new Interval(Header);
185 ProcessNode(Int, getSourceGraphNode(OrigContainer, *I));
187 IntStack.push_back(std::make_pair(Int, succ_begin(Int)))
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Analysis/ |
| IntervalIterator.h | 68 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) {
69 Int->Nodes.push_back(BB);
79 inline void addNodeToInterval(Interval *Int, Interval *I) {
80 // Add all of the nodes in I as new nodes in Int.
81 Int->Nodes.insert(Int->Nodes.end(), I->Nodes.begin(), I->Nodes.end());
160 IntervalIterator operator++(int) { // Postincrement
180 Interval *Int = new Interval(Header);
185 ProcessNode(Int, getSourceGraphNode(OrigContainer, *I));
187 IntStack.push_back(std::make_pair(Int, succ_begin(Int)))
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Analysis/ |
| IntervalIterator.h | 73 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) {
74 Int->Nodes.push_back(BB);
83 inline void addNodeToInterval(Interval *Int, Interval *I) {
84 // Add all of the nodes in I as new nodes in Int.
85 Int->Nodes.insert(Int->Nodes.end(), I->Nodes.begin(), I->Nodes.end());
163 IntervalIterator operator++(int) { // Postincrement
182 Interval *Int = new Interval(Header);
187 ProcessNode(Int, getSourceGraphNode(OrigContainer, *I));
189 IntStack.push_back(std::make_pair(Int, succ_begin(Int)))
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Analysis/ |
| IntervalIterator.h | 73 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) {
74 Int->Nodes.push_back(BB);
83 inline void addNodeToInterval(Interval *Int, Interval *I) {
84 // Add all of the nodes in I as new nodes in Int.
85 Int->Nodes.insert(Int->Nodes.end(), I->Nodes.begin(), I->Nodes.end());
163 IntervalIterator operator++(int) { // Postincrement
182 Interval *Int = new Interval(Header);
187 ProcessNode(Int, getSourceGraphNode(OrigContainer, *I));
189 IntStack.push_back(std::make_pair(Int, succ_begin(Int)))
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Analysis/ |
| IntervalIterator.h | 73 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) {
74 Int->Nodes.push_back(BB);
83 inline void addNodeToInterval(Interval *Int, Interval *I) {
84 // Add all of the nodes in I as new nodes in Int.
85 Int->Nodes.insert(Int->Nodes.end(), I->Nodes.begin(), I->Nodes.end());
163 IntervalIterator operator++(int) { // Postincrement
182 Interval *Int = new Interval(Header);
187 ProcessNode(Int, getSourceGraphNode(OrigContainer, *I));
189 IntStack.push_back(std::make_pair(Int, succ_begin(Int)))
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Analysis/ |
| IntervalIterator.h | 73 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) {
74 Int->Nodes.push_back(BB);
83 inline void addNodeToInterval(Interval *Int, Interval *I) {
84 // Add all of the nodes in I as new nodes in Int.
85 Int->Nodes.insert(Int->Nodes.end(), I->Nodes.begin(), I->Nodes.end());
163 IntervalIterator operator++(int) { // Postincrement
182 Interval *Int = new Interval(Header);
187 ProcessNode(Int, getSourceGraphNode(OrigContainer, *I));
189 IntStack.push_back(std::make_pair(Int, succ_begin(Int)))
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| IntervalIterator.h | 68 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) {
69 Int->Nodes.push_back(BB);
79 inline void addNodeToInterval(Interval *Int, Interval *I) {
80 // Add all of the nodes in I as new nodes in Int.
81 Int->Nodes.insert(Int->Nodes.end(), I->Nodes.begin(), I->Nodes.end());
160 IntervalIterator operator++(int) { // Postincrement
180 Interval *Int = new Interval(Header);
185 ProcessNode(Int, getSourceGraphNode(OrigContainer, *I));
187 IntStack.push_back(std::make_pair(Int, succ_begin(Int)))
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Analysis/ |
| IntervalIterator.h | 68 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) {
69 Int->Nodes.push_back(BB);
79 inline void addNodeToInterval(Interval *Int, Interval *I) {
80 // Add all of the nodes in I as new nodes in Int.
81 Int->Nodes.insert(Int->Nodes.end(), I->Nodes.begin(), I->Nodes.end());
160 IntervalIterator operator++(int) { // Postincrement
180 Interval *Int = new Interval(Header);
185 ProcessNode(Int, getSourceGraphNode(OrigContainer, *I));
187 IntStack.push_back(std::make_pair(Int, succ_begin(Int)))
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Analysis/ |
| IntervalIterator.h | 68 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) {
69 Int->Nodes.push_back(BB);
79 inline void addNodeToInterval(Interval *Int, Interval *I) {
80 // Add all of the nodes in I as new nodes in Int.
81 Int->Nodes.insert(Int->Nodes.end(), I->Nodes.begin(), I->Nodes.end());
160 IntervalIterator operator++(int) { // Postincrement
180 Interval *Int = new Interval(Header);
185 ProcessNode(Int, getSourceGraphNode(OrigContainer, *I));
187 IntStack.push_back(std::make_pair(Int, succ_begin(Int)))
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Analysis/ |
| IntervalIterator.h | 73 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) {
74 Int->Nodes.push_back(BB);
83 inline void addNodeToInterval(Interval *Int, Interval *I) {
84 // Add all of the nodes in I as new nodes in Int.
85 Int->Nodes.insert(Int->Nodes.end(), I->Nodes.begin(), I->Nodes.end());
163 IntervalIterator operator++(int) { // Postincrement
182 Interval *Int = new Interval(Header);
187 ProcessNode(Int, getSourceGraphNode(OrigContainer, *I));
189 IntStack.push_back(std::make_pair(Int, succ_begin(Int)))
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Analysis/ |
| IntervalIterator.h | 73 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) {
74 Int->Nodes.push_back(BB);
83 inline void addNodeToInterval(Interval *Int, Interval *I) {
84 // Add all of the nodes in I as new nodes in Int.
85 Int->Nodes.insert(Int->Nodes.end(), I->Nodes.begin(), I->Nodes.end());
163 IntervalIterator operator++(int) { // Postincrement
182 Interval *Int = new Interval(Header);
187 ProcessNode(Int, getSourceGraphNode(OrigContainer, *I));
189 IntStack.push_back(std::make_pair(Int, succ_begin(Int)))
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Analysis/ |
| IntervalIterator.h | 73 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) {
74 Int->Nodes.push_back(BB);
83 inline void addNodeToInterval(Interval *Int, Interval *I) {
84 // Add all of the nodes in I as new nodes in Int.
85 Int->Nodes.insert(Int->Nodes.end(), I->Nodes.begin(), I->Nodes.end());
163 IntervalIterator operator++(int) { // Postincrement
182 Interval *Int = new Interval(Header);
187 ProcessNode(Int, getSourceGraphNode(OrigContainer, *I));
189 IntStack.push_back(std::make_pair(Int, succ_begin(Int)))
[all...] |
