/external/v8/src/compiler/ |
D | opcodes.h | 11 #define CONTROL_OP_LIST(V) \ argument 33 #define CONSTANT_OP_LIST(V) \ argument 42 #define INNER_OP_LIST(V) \ argument 59 #define COMMON_OP_LIST(V) \ argument 65 #define JS_COMPARE_BINOP_LIST(V) \ argument 75 #define JS_BITWISE_BINOP_LIST(V) \ argument 83 #define JS_ARITH_BINOP_LIST(V) \ argument 90 #define JS_SIMPLE_BINOP_LIST(V) \ argument 95 #define JS_CONVERSION_UNOP_LIST(V) \ argument 102 #define JS_OTHER_UNOP_LIST(V) \ argument [all …]
|
/external/antlr/antlr-3.4/runtime/Ruby/test/functional/ast-output/ |
D | hetero-nodes.rb | 16 class V < ANTLR3::CommonTree class in TestHeterogeneousNodeTypes 35 class V < ANTLR3::CommonTree class in TestHeterogeneousNodeTypes 54 class V < ANTLR3::CommonTree class in TestHeterogeneousNodeTypes 73 class V < ANTLR3::CommonTree class in TestHeterogeneousNodeTypes 92 class V < ANTLR3::CommonTree class in TestHeterogeneousNodeTypes 112 class V < ANTLR3::CommonTree class in TestHeterogeneousNodeTypes 132 class V < ANTLR3::CommonTree class in TestHeterogeneousNodeTypes 152 class V < ANTLR3::CommonTree class in TestHeterogeneousNodeTypes 172 class V < ANTLR3::CommonTree class in TestHeterogeneousNodeTypes 192 class V < ANTLR3::CommonTree class in TestHeterogeneousNodeTypes [all …]
|
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
D | SVals.h | 197 static bool isKind(const SVal& V) { in isKind() 219 static bool isKind(const SVal& V) { in isKind() 230 static bool isKind(const SVal &V) { in isKind() 248 static bool isKind(const SVal& V) { in isKind() 258 static bool isKind(const SVal &V) { in isKind() 262 KnownSVal(const DefinedSVal &V) : SVal(V) {} in KnownSVal() 263 KnownSVal(const UndefinedVal &V) : SVal(V) {} in KnownSVal() 277 static bool isKind(const SVal& V) { in isKind() 298 static bool isKind(const SVal& V) { in isKind() 328 static bool isKind(const SVal& V) { in isKind() [all …]
|
/external/llvm/include/llvm/ADT/ |
D | TinyPtrVector.h | 38 if (VecTy *V = Val.template dyn_cast<VecTy*>()) in ~TinyPtrVector() local 39 delete V; in ~TinyPtrVector() local 43 if (VecTy *V = Val.template dyn_cast<VecTy*>()) in TinyPtrVector() local 88 if (VecTy *V = Val.template dyn_cast<VecTy*>()) { variable 94 delete V; variable 171 if (EltTy V = Val.template dyn_cast<EltTy>()) { variable 183 if (EltTy V = Val.template dyn_cast<EltTy>()) in front() local 190 if (EltTy V = Val.template dyn_cast<EltTy>()) in back() local 205 if (EltTy V = Val.template dyn_cast<EltTy>()) { in push_back() local 271 if (EltTy V = Val.template dyn_cast<EltTy>()) { in insert() local [all …]
|
/external/harfbuzz_ng/src/ |
D | hb-atomic-private.hh | 66 #define HB_ATOMIC_INT_IMPL_INIT(V) (V) argument 67 #define hb_atomic_int_impl_add(AI, V) InterlockedExchangeAdd (&(AI), (V)) argument 84 #define HB_ATOMIC_INT_IMPL_INIT(V) (V) argument 85 #define hb_atomic_int_impl_add(AI, V) (OSAtomicAdd32Barrier ((V), &(AI)) - (V)) argument 102 #define HB_ATOMIC_INT_IMPL_INIT(V) (V) argument 103 #define hb_atomic_int_impl_add(AI, V) __sync_fetch_and_add (&(AI), (V)) argument 115 #define HB_ATOMIC_INT_IMPL_INIT(V) (V) argument 116 #define hb_atomic_int_impl_add(AI, V) ( ({__machine_rw_barrier ();}), atomic_add_int_nv (&(AI), (V… argument 127 static inline int hb_fetch_and_add(volatile int* AI, unsigned int V) { in hb_fetch_and_add() 141 #define HB_ATOMIC_INT_IMPL_INIT(V) (V) argument [all …]
|
/external/llvm/include/llvm/IR/ |
D | IntrinsicInst.h | 54 static inline bool classof(const Value *V) { in classof() 73 static inline bool classof(const Value *V) { in classof() 103 static inline bool classof(const Value *V) { in classof() 136 static inline bool classof(const Value *V) { in classof() 195 void setVolatile(Constant* V) { in setVolatile() 213 static inline bool classof(const Value *V) { in classof() 238 static inline bool classof(const Value *V) { in classof() 273 static inline bool classof(const Value *V) { in classof() 287 static inline bool classof(const Value *V) { in classof() 300 static inline bool classof(const Value *V) { in classof() [all …]
|
/external/llvm/lib/Analysis/ |
D | InstructionSimplify.cpp | 90 static bool isSameCompare(Value *V, CmpInst::Predicate Pred, Value *LHS, in isSameCompare() 104 static bool ValueDominatesPHI(Value *V, PHINode *P, const DominatorTree *DT) { in ValueDominatesPHI() 163 if (Value *V = SimplifyBinOp(OpcodeToExpand, L, R, Q, MaxRecurse)) { in ExpandBinOp() local 186 if (Value *V = SimplifyBinOp(OpcodeToExpand, L, R, Q, MaxRecurse)) { in ExpandBinOp() local 217 if (Value *V = SimplifyBinOp(Opcode, B, C, Q, MaxRecurse)) { in SimplifyAssociativeBinOp() local 236 if (Value *V = SimplifyBinOp(Opcode, A, B, Q, MaxRecurse)) { in SimplifyAssociativeBinOp() local 259 if (Value *V = SimplifyBinOp(Opcode, C, A, Q, MaxRecurse)) { in SimplifyAssociativeBinOp() local 278 if (Value *V = SimplifyBinOp(Opcode, C, A, Q, MaxRecurse)) { in SimplifyAssociativeBinOp() local 429 if (Value *V = SimplifyAndInst(Cond, TCmp, Q, MaxRecurse)) in ThreadCmpOverSelect() local 434 if (Value *V = SimplifyOrInst(Cond, FCmp, Q, MaxRecurse)) in ThreadCmpOverSelect() local [all …]
|
/external/clang/test/CXX/dcl.dcl/dcl.spec/dcl.constexpr/ |
D | p4.cpp | 61 struct V { struct 62 constexpr V() { in V() argument 85 constexpr V(int(&)[1]) { in V() argument 92 constexpr V(int(&)[2]) { in V() argument 98 constexpr V(int(&)[3]) { in V() argument 104 constexpr V(int(&)[4]) { in V() function 110 constexpr V(int(&)[5]) { in V() argument 116 constexpr V(int(&)[6]) { in V() argument 122 constexpr V(int(&)[7]) { in V() argument 319 template<typename> struct V { struct [all …]
|
/external/libcxx/test/std/containers/associative/map/map.access/ |
D | at.pass.cpp | 25 typedef std::pair<const int, double> V; in main() typedef 58 typedef std::pair<const int, double> V; in main() typedef 90 typedef std::pair<const int, double> V; in main() typedef 123 typedef std::pair<const int, double> V; in main() typedef
|
/external/clang/test/CodeGenCXX/ |
D | array-operator-delete-call.cpp | 16 struct V { struct 17 V() : iV (++count) { printf("V::V(%d)\n", iV); } in V() argument 18 virtual ~V() { printf("V::~V(%d)\n", iV); } in ~V() argument 19 int iV; argument
|
/external/v8/src/ |
D | builtins.h | 27 #define CODE_AGE_LIST_WITH_ARG(V, A) \ argument 34 #define CODE_AGE_LIST_IGNORE_ARG(X, V) V(X) argument 36 #define CODE_AGE_LIST(V) \ argument 39 #define CODE_AGE_LIST_COMPLETE(V) \ argument 46 #define DECLARE_CODE_AGE_BUILTIN(C, V) \ argument 54 #define BUILTIN_LIST_C(V) \ argument 148 #define BUILTIN_LIST_A(V) \ argument 266 #define BUILTIN_LIST_H(V) \ argument 278 #define BUILTIN_LIST_DEBUG_A(V) \ argument
|
/external/libcxx/test/std/containers/associative/map/map.cons/ |
D | copy_assign.pass.cpp | 26 typedef std::pair<const int, double> V; in main() typedef 61 typedef std::pair<const int, double> V; in main() typedef 76 typedef std::pair<const int, double> V; in main() typedef 112 typedef std::pair<const int, double> V; in main() typedef 147 typedef std::pair<const int, double> V; in main() typedef
|
D | iter_iter_comp_alloc.pass.cpp | 28 typedef std::pair<const int, double> V; in main() typedef 54 typedef std::pair<const int, double> V; in main() typedef 80 typedef std::pair<const int, double> V; in main() typedef 93 typedef std::pair<const int, double> V; in main() typedef
|
/external/llvm/lib/Target/PowerPC/ |
D | PPCBoolRetToInt.cpp | 61 static SmallPtrSet<Value *, 8> findAllDefs(Value *V) { in findAllDefs() 78 static Value *translate(Value *V) { in translate() 124 auto IsValidUser = [] (const Value *V) -> bool { in getPromotablePHINodes() 128 auto IsValidOperand = [] (const Value *V) -> bool { in getPromotablePHINodes() 140 auto IsPromotable = [&Promotable] (const Value *V) -> bool { in getPromotablePHINodes() 202 for (const auto &V : Defs) in runOnUse() local 206 for (const auto &V : Defs) in runOnUse() local 217 for (const auto &V : Defs) in runOnUse() local
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
D | SetMultimapTestSuiteBuilder.java | 67 OneSizeTestContainerGenerator<SetMultimap<K, V>, Entry<K, V>>> parentBuilder) { in computeMultimapGetTestSuite() argument 79 OneSizeTestContainerGenerator<SetMultimap<K, V>, Entry<K, V>>> parentBuilder) { in computeMultimapAsMapGetTestSuite() argument 96 OneSizeTestContainerGenerator<SetMultimap<K, V>, Map.Entry<K, V>>> parentBuilder) { in computeEntriesTestSuite() argument 110 OneSizeTestContainerGenerator<SetMultimap<K, V>, Entry<K, V>> multimapGenerator) { in EntriesGenerator() argument 124 OneSizeTestContainerGenerator<SetMultimap<K, V>, Entry<K, V>> multimapGenerator) { in MultimapGetGenerator() argument 139 OneSizeTestContainerGenerator<SetMultimap<K, V>, Entry<K, V>> multimapGenerator) { in MultimapAsMapGetGenerator() argument
|
/external/llvm/lib/Transforms/InstCombine/ |
D | InstCombineAddSub.cpp | 70 bool insaneIntVal(int V) { return V > 4 || V < -4; } in insaneIntVal() 126 void set(short Coefficient, Value *V) { Coeff.set(Coefficient), Val = V; } in set() 127 void set(const APFloat& Coefficient, Value *V) in set() 129 void set(const ConstantFP* Coefficient, Value *V) in set() 722 Value *V = createAddendVal(**I, NeedNeg); in createNaryFAdd() local 755 Value *V = Builder->CreateFSub(Opnd0, Opnd1); in createFSub() local 761 Value *FAddCombine::createFNeg(Value *V) { in createFNeg() 770 Value *V = Builder->CreateFAdd(Opnd0, Opnd1); in createFAdd() local 777 Value *V = Builder->CreateFMul(Opnd0, Opnd1); in createFMul() local 784 Value *V = Builder->CreateFDiv(Opnd0, Opnd1); in createFDiv() local [all …]
|
D | InstCombineMulDivRem.cpp | 28 static Value *simplifyValueKnownNonZero(Value *V, InstCombiner &IC, in simplifyValueKnownNonZero() 179 if (Value *V = SimplifyVectorOp(I)) in visitMul() local 182 if (Value *V = SimplifyMulInst(Op0, Op1, DL, TLI, DT, AC)) in visitMul() local 185 if (Value *V = SimplifyUsingDistributiveLaws(I)) in visitMul() local 233 uint64_t V; in visitMul() local 383 Value *V = Builder->CreateSub(Constant::getNullValue(I.getType()), in visitMul() local 464 static bool isFMulOrFDivWithConstant(Value *V) { in isFMulOrFDivWithConstant() 538 if (Value *V = SimplifyVectorOp(I)) in visitFMul() local 544 if (Value *V = in visitFMul() local 576 if (Value *V = foldFMulConst(cast<Instruction>(Op0), C, &I)) in visitFMul() local [all …]
|
/external/v8/src/wasm/ |
D | wasm-opcodes.h | 71 #define FOREACH_CONTROL_OPCODE(V) \ argument 86 #define FOREACH_MISC_OPCODE(V) \ argument 100 #define FOREACH_LOAD_MEM_OPCODE(V) \ argument 117 #define FOREACH_STORE_MEM_OPCODE(V) \ argument 129 #define FOREACH_MISC_MEM_OPCODE(V) \ argument 134 #define FOREACH_SIMPLE_OPCODE(V) \ argument 255 #define FOREACH_OPCODE(V) \ argument 264 #define FOREACH_SIGNATURE(V) \ argument
|
/external/libcxx/test/std/containers/associative/multimap/multimap.cons/ |
D | copy_assign.pass.cpp | 26 typedef std::pair<const int, double> V; in main() typedef 52 typedef std::pair<const int, double> V; in main() typedef 72 typedef std::pair<const int, double> V; in main() typedef 99 typedef std::pair<const int, double> V; in main() typedef
|
/external/clang/test/CodeGen/ |
D | 2007-04-13-InlineAsmStruct2.c | 3 struct V { short X, Y; }; struct
|
D | 2007-04-11-InlineAsmStruct.c | 3 struct V { short X, Y; }; argument
|
/external/llvm/lib/IR/ |
D | ValueSymbolTable.cpp | 35 ValueName *ValueSymbolTable::makeUniqueName(Value *V, in makeUniqueName() 55 void ValueSymbolTable::reinsertValue(Value* V) { in reinsertValue() 74 void ValueSymbolTable::removeValueName(ValueName *V) { in removeValueName() 83 ValueName *ValueSymbolTable::createValueName(StringRef Name, Value *V) { in createValueName()
|
/external/libcxx/test/std/containers/associative/multiset/ |
D | count.pass.cpp | 25 typedef int V; in main() typedef 60 typedef int V; in main() typedef 96 typedef int V; in main() typedef 129 typedef PrivateConstructor V; in main() typedef
|
/external/libcxx/test/std/containers/associative/set/ |
D | count.pass.cpp | 25 typedef int V; in main() typedef 61 typedef int V; in main() typedef 98 typedef int V; in main() typedef 133 typedef PrivateConstructor V; in main() typedef
|
/external/llvm/include/llvm/Support/ |
D | Endian.h | 321 template <typename T, endianness E> inline void write(void *P, T V) { in write() 325 template <endianness E> inline void write16(void *P, uint16_t V) { in write16() 328 template <endianness E> inline void write32(void *P, uint32_t V) { in write32() 331 template <endianness E> inline void write64(void *P, uint64_t V) { in write64() 335 inline void write16le(void *P, uint16_t V) { write16<little>(P, V); } in write16le() 336 inline void write32le(void *P, uint32_t V) { write32<little>(P, V); } in write32le() 337 inline void write64le(void *P, uint64_t V) { write64<little>(P, V); } in write64le() 338 inline void write16be(void *P, uint16_t V) { write16<big>(P, V); } in write16be() 339 inline void write32be(void *P, uint32_t V) { write32<big>(P, V); } in write32be() 340 inline void write64be(void *P, uint64_t V) { write64<big>(P, V); } in write64be()
|