/prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Analysis/ |
H A D | IntervalIterator.h | 73 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) { argument 74 Int->Nodes.push_back(BB); 83 inline void addNodeToInterval(Interval *Int, Interval *I) { argument 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()); 182 Interval *Int = new Interval(Header); 187 ProcessNode(Int, getSourceGraphNode(OrigContainer, *I)); 189 IntStack.push_back(std::make_pair(Int, succ_begin(Int))); 201 ProcessNode(Interval *Int, NodeTy *Node) argument [all...] |
/prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Analysis/ |
H A D | IntervalIterator.h | 73 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) { argument 74 Int->Nodes.push_back(BB); 83 inline void addNodeToInterval(Interval *Int, Interval *I) { argument 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()); 182 Interval *Int = new Interval(Header); 187 ProcessNode(Int, getSourceGraphNode(OrigContainer, *I)); 189 IntStack.push_back(std::make_pair(Int, succ_begin(Int))); 201 ProcessNode(Interval *Int, NodeTy *Node) argument [all...] |
/prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Analysis/ |
H A D | IntervalIterator.h | 73 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) { argument 74 Int->Nodes.push_back(BB); 83 inline void addNodeToInterval(Interval *Int, Interval *I) { argument 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()); 182 Interval *Int = new Interval(Header); 187 ProcessNode(Int, getSourceGraphNode(OrigContainer, *I)); 189 IntStack.push_back(std::make_pair(Int, succ_begin(Int))); 201 ProcessNode(Interval *Int, NodeTy *Node) argument [all...] |
/prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Analysis/ |
H A D | IntervalIterator.h | 73 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) { argument 74 Int->Nodes.push_back(BB); 83 inline void addNodeToInterval(Interval *Int, Interval *I) { argument 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()); 182 Interval *Int = new Interval(Header); 187 ProcessNode(Int, getSourceGraphNode(OrigContainer, *I)); 189 IntStack.push_back(std::make_pair(Int, succ_begin(Int))); 201 ProcessNode(Interval *Int, NodeTy *Node) argument [all...] |
/prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Analysis/ |
H A D | IntervalIterator.h | 73 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) { argument 74 Int->Nodes.push_back(BB); 83 inline void addNodeToInterval(Interval *Int, Interval *I) { argument 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()); 182 Interval *Int = new Interval(Header); 187 ProcessNode(Int, getSourceGraphNode(OrigContainer, *I)); 189 IntStack.push_back(std::make_pair(Int, succ_begin(Int))); 201 ProcessNode(Interval *Int, NodeTy *Node) argument [all...] |
/prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Analysis/ |
H A D | IntervalIterator.h | 73 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) { argument 74 Int->Nodes.push_back(BB); 83 inline void addNodeToInterval(Interval *Int, Interval *I) { argument 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()); 182 Interval *Int = new Interval(Header); 187 ProcessNode(Int, getSourceGraphNode(OrigContainer, *I)); 189 IntStack.push_back(std::make_pair(Int, succ_begin(Int))); 201 ProcessNode(Interval *Int, NodeTy *Node) argument [all...] |
/prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Analysis/ |
H A D | IntervalIterator.h | 73 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) { argument 74 Int->Nodes.push_back(BB); 83 inline void addNodeToInterval(Interval *Int, Interval *I) { argument 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()); 182 Interval *Int = new Interval(Header); 187 ProcessNode(Int, getSourceGraphNode(OrigContainer, *I)); 189 IntStack.push_back(std::make_pair(Int, succ_begin(Int))); 201 ProcessNode(Interval *Int, NodeTy *Node) argument [all...] |
/prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Analysis/ |
H A D | IntervalIterator.h | 73 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) { argument 74 Int->Nodes.push_back(BB); 83 inline void addNodeToInterval(Interval *Int, Interval *I) { argument 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()); 182 Interval *Int = new Interval(Header); 187 ProcessNode(Int, getSourceGraphNode(OrigContainer, *I)); 189 IntStack.push_back(std::make_pair(Int, succ_begin(Int))); 201 ProcessNode(Interval *Int, NodeTy *Node) argument [all...] |
/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/support/ |
H A D | float_comparison.h | 95 typedef int Int; typedef in class:TypeWithSize 104 typedef __int64 Int; typedef in class:TypeWithSize 107 typedef long long Int; // NOLINT 117 typedef __int128 Int; // NOLINT typedef in class:TypeWithSize
|
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/support/ |
H A D | float_comparison.h | 95 typedef int Int; typedef in class:TypeWithSize 104 typedef __int64 Int; typedef in class:TypeWithSize 107 typedef long long Int; // NOLINT 117 typedef __int128 Int; // NOLINT typedef in class:TypeWithSize
|
/prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
H A D | IntervalIterator.h | 68 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) { argument 69 Int->Nodes.push_back(BB); 79 inline void addNodeToInterval(Interval *Int, Interval *I) { argument 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()); 180 Interval *Int = new Interval(Header); 185 ProcessNode(Int, getSourceGraphNode(OrigContainer, *I)); 187 IntStack.push_back(std::make_pair(Int, succ_begin(Int))); 200 ProcessNode(Interval *Int, NodeTy *Node) argument [all...] |
/prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Analysis/ |
H A D | IntervalIterator.h | 68 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) { argument 69 Int->Nodes.push_back(BB); 79 inline void addNodeToInterval(Interval *Int, Interval *I) { argument 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()); 180 Interval *Int = new Interval(Header); 185 ProcessNode(Int, getSourceGraphNode(OrigContainer, *I)); 187 IntStack.push_back(std::make_pair(Int, succ_begin(Int))); 200 ProcessNode(Interval *Int, NodeTy *Node) argument [all...] |
/prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Analysis/ |
H A D | IntervalIterator.h | 68 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) { argument 69 Int->Nodes.push_back(BB); 79 inline void addNodeToInterval(Interval *Int, Interval *I) { argument 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()); 180 Interval *Int = new Interval(Header); 185 ProcessNode(Int, getSourceGraphNode(OrigContainer, *I)); 187 IntStack.push_back(std::make_pair(Int, succ_begin(Int))); 200 ProcessNode(Interval *Int, NodeTy *Node) argument [all...] |
/prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
H A D | IntervalIterator.h | 68 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) { argument 69 Int->Nodes.push_back(BB); 79 inline void addNodeToInterval(Interval *Int, Interval *I) { argument 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()); 180 Interval *Int = new Interval(Header); 185 ProcessNode(Int, getSourceGraphNode(OrigContainer, *I)); 187 IntStack.push_back(std::make_pair(Int, succ_begin(Int))); 200 ProcessNode(Interval *Int, NodeTy *Node) argument [all...] |
/prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Analysis/ |
H A D | IntervalIterator.h | 68 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) { argument 69 Int->Nodes.push_back(BB); 79 inline void addNodeToInterval(Interval *Int, Interval *I) { argument 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()); 180 Interval *Int = new Interval(Header); 185 ProcessNode(Int, getSourceGraphNode(OrigContainer, *I)); 187 IntStack.push_back(std::make_pair(Int, succ_begin(Int))); 200 ProcessNode(Interval *Int, NodeTy *Node) argument [all...] |
/prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Analysis/ |
H A D | IntervalIterator.h | 68 inline void addNodeToInterval(Interval *Int, BasicBlock *BB) { argument 69 Int->Nodes.push_back(BB); 79 inline void addNodeToInterval(Interval *Int, Interval *I) { argument 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()); 180 Interval *Int = new Interval(Header); 185 ProcessNode(Int, getSourceGraphNode(OrigContainer, *I)); 187 IntStack.push_back(std::make_pair(Int, succ_begin(Int))); 200 ProcessNode(Interval *Int, NodeTy *Node) argument [all...] |
/prebuilts/gdb/darwin-x86/lib/python2.7/test/ |
H A D | test_getargs2.py | 54 class Int: class in inherits: 64 self.assertEqual(99, getargs_b(Int())) 80 self.assertEqual(99, getargs_B(Int())) 97 self.assertEqual(99, getargs_H(Int())) 114 self.assertEqual(99, getargs_I(Int())) 132 self.assertRaises(TypeError, getargs_k, Int()) 150 self.assertEqual(99, getargs_h(Int())) 166 self.assertEqual(99, getargs_i(Int())) 182 self.assertEqual(99, getargs_l(Int())) 199 self.assertEqual(99, getargs_n(Int())) [all...] |
H A D | test_heapq.py | 162 class Int(int): class in function:TestHeap.test_merge_stability 168 obj = Int(x)
|
/prebuilts/gdb/linux-x86/lib/python2.7/test/ |
H A D | test_getargs2.py | 54 class Int: class in inherits: 64 self.assertEqual(99, getargs_b(Int())) 80 self.assertEqual(99, getargs_B(Int())) 97 self.assertEqual(99, getargs_H(Int())) 114 self.assertEqual(99, getargs_I(Int())) 132 self.assertRaises(TypeError, getargs_k, Int()) 150 self.assertEqual(99, getargs_h(Int())) 166 self.assertEqual(99, getargs_i(Int())) 182 self.assertEqual(99, getargs_l(Int())) 199 self.assertEqual(99, getargs_n(Int())) [all...] |
/prebuilts/misc/common/swig/include/2.0.11/ocaml/ |
H A D | swig.ml | 5 type enum = [ `Int of int ] Constructor in type:enum
|
H A D | swig.mli | 3 type enum = [ `Int of int ] Constructor in type:enum
|
/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/libcxx/utilities/function.objects/func.require/ |
H A D | invoke_helpers.h | 20 struct Int : public std::integral_constant<int, I> {}; struct in inherits:std::integral_constant 257 Int<Arity> A; 263 Int<Arity> A; 277 void runTestImp(Int<0>, MethodPtr ptr, ObjectT& object) { 299 void runTestImp(Int<1>, MethodPtr ptr, ObjectT& object) { 321 void runTestImp(Int<2>, MethodPtr ptr, ObjectT& object) { 343 void runTestImp(Int<3>, MethodPtr ptr, ObjectT& object) { 368 void runTestImp(Int<0>, ObjectT& object) { 390 void runTestImp(Int<1>, ObjectT& object) { 412 void runTestImp(Int< [all...] |
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/libcxx/utilities/function.objects/func.require/ |
H A D | invoke_helpers.h | 20 struct Int : public std::integral_constant<int, I> {}; struct in inherits:std::integral_constant 257 Int<Arity> A; 263 Int<Arity> A; 277 void runTestImp(Int<0>, MethodPtr ptr, ObjectT& object) { 299 void runTestImp(Int<1>, MethodPtr ptr, ObjectT& object) { 321 void runTestImp(Int<2>, MethodPtr ptr, ObjectT& object) { 343 void runTestImp(Int<3>, MethodPtr ptr, ObjectT& object) { 368 void runTestImp(Int<0>, ObjectT& object) { 390 void runTestImp(Int<1>, ObjectT& object) { 412 void runTestImp(Int< [all...] |
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
H A D | test_getargs2.py | 54 class Int: class in inherits: 64 self.assertEqual(99, getargs_b(Int())) 80 self.assertEqual(99, getargs_B(Int())) 97 self.assertEqual(99, getargs_H(Int())) 114 self.assertEqual(99, getargs_I(Int())) 132 self.assertRaises(TypeError, getargs_k, Int()) 150 self.assertEqual(99, getargs_h(Int())) 166 self.assertEqual(99, getargs_i(Int())) 182 self.assertEqual(99, getargs_l(Int())) 199 self.assertEqual(99, getargs_n(Int())) [all...] |
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
H A D | test_getargs2.py | 54 class Int: class in inherits: 64 self.assertEqual(99, getargs_b(Int())) 80 self.assertEqual(99, getargs_B(Int())) 97 self.assertEqual(99, getargs_H(Int())) 114 self.assertEqual(99, getargs_I(Int())) 132 self.assertRaises(TypeError, getargs_k, Int()) 150 self.assertEqual(99, getargs_h(Int())) 166 self.assertEqual(99, getargs_i(Int())) 182 self.assertEqual(99, getargs_l(Int())) 199 self.assertEqual(99, getargs_n(Int())) [all...] |