Searched defs:Kind (Results 1 - 25 of 372) sorted by last modified time

1234567891011>>

/external/skia/src/animator/
H A DSkDisplayEvent.h22 enum Kind { enum in class:SkDisplayEvent
51 Kind kind;
/external/skia/src/sfnt/
H A DSkPanose.h524 struct Kind { struct in struct:SkPanose::Data::Pictoral
/external/llvm/unittests/Support/
H A DSourceMgrTest.cpp39 void printMessage(SMLoc Loc, SourceMgr::DiagKind Kind, argument
43 SM.PrintMessage(OS, Loc, Kind, Msg, Ranges, FixIts);
H A DYAMLIOTest.cpp893 enum Kind { enum
900 KindAndFlags(Kind k, uint32_t f) : kind(k), flags(f) { }
901 Kind kind;
928 struct ScalarEnumerationTraits<Kind> {
929 static void enumeration(IO &io, Kind &value) {
/external/llvm/utils/TableGen/
H A DAsmMatcherEmitter.cpp164 /// Kind - The class kind, which is either a predefined kind, or (UserClass0 +
166 unsigned Kind; member in struct:__anon26561::ClassInfo
204 return Kind >= RegisterClass0 && Kind < UserClass0;
209 return Kind >= UserClass0;
216 if (Kind == Token || RHS.Kind == Token)
217 return Kind == Token && RHS.Kind == Token;
273 return Kind < RH
336 } Kind; member in struct:__anon26561::MatchableInfo::ResOperand
[all...]
H A DCodeGenInstruction.h33 enum { None, EarlyClobber, Tied } Kind; member in class:llvm::CGIOperandList::ConstraintInfo
36 ConstraintInfo() : Kind(None) {}
40 I.Kind = EarlyClobber;
47 I.Kind = Tied;
52 bool isNone() const { return Kind == None; }
53 bool isEarlyClobber() const { return Kind == EarlyClobber; }
54 bool isTied() const { return Kind == Tied; }
313 } Kind; member in struct:llvm::CodeGenInstAlias::ResultOperand
315 ResultOperand(std::string N, Record *r) : Name(N), R(r), Kind(K_Record) {}
316 ResultOperand(int64_t I) : Imm(I), Kind(K_Im
[all...]
H A DDAGISelMatcher.h88 const KindTy Kind; member in class:llvm::Matcher
91 Matcher(KindTy K) : Kind(K) {}
95 KindTy getKind() const { return Kind; }
H A DDAGISelMatcherOpt.cpp236 static Matcher *FindNodeWithKind(Matcher *M, Matcher::KindTy Kind) { argument
238 if (M->getKind() == Kind)
H A DPseudoLoweringEmitter.cpp29 MapKind Kind; member in struct:__anon26603::PseudoLoweringEmitter::OpData
83 OperandMap[BaseIdx + i].Kind = OpData::Reg;
99 // will be filled in later, just set the Kind for now. Do it
102 OperandMap[BaseIdx + i + I].Kind = OpData::Operand;
105 OperandMap[BaseIdx + i].Kind = OpData::Imm;
177 if (OperandMap[Insn.Operands[i].MIOperandNo].Kind != OpData::Operand)
226 switch (Expansion.OperandMap[MIOpNo + i].Kind) {
H A DSubtargetEmitter.cpp323 int Kind = Stage->getValueAsInt("Kind"); local
324 ItinString += ", (llvm::InstrStage::ReservationKinds)" + itostr(Kind);
/external/llvm/tools/llvm-objdump/
H A DMachODump.cpp103 unsigned short Kind) {
106 switch (Kind) {
145 outs() << "\t@ data in code kind = " << Kind << "\n";
409 uint16_t Kind; local
410 DTI->second.getKind(Kind);
411 DumpDataInCode(Bytes.data() + Index, Length, Kind);
102 DumpDataInCode(const char *bytes, uint64_t Size, unsigned short Kind) argument
/external/llvm/tools/opt/
H A Dopt.cpp551 PassKind Kind = P->getPassKind(); local
555 switch (Kind) {
/external/llvm/lib/Transforms/Vectorize/
H A DLoopVectorize.cpp585 Kind(RK_NoReduction), MinMaxKind(MRK_Invalid) {}
589 : StartValue(Start), LoopExitInstr(Exit), Kind(K), MinMaxKind(MK) {}
597 ReductionKind Kind; member in struct:__anon26368::LoopVectorizationLegality::ReductionDescriptor
752 /// 'Kind'. If this is a reduction variable, it adds it to ReductionList.
753 bool AddReductionVar(PHINode *Phi, ReductionKind Kind);
755 /// variable of type 'Kind'. If the reduction is a min/max pattern of
759 ReductionInstDesc isReductionInstr(Instruction *I, ReductionKind Kind,
2459 getReductionBinOp(LoopVectorizationLegality::ReductionKind Kind) { argument
2460 switch (Kind) {
2664 if (RdxDesc.Kind
[all...]
H A DSLPVectorizer.cpp219 unsigned Kind = Metadata[i].first; local
224 MDNode *IMD = I->getMetadata(Kind);
226 switch (Kind) {
238 I->setMetadata(Kind, MD);
/external/llvm/examples/Kaleidoscope/Chapter6/
H A Dtoy.cpp454 unsigned Kind = 0; // 0 = identifier, 1 = unary, 2 = binary. local
462 Kind = 0;
471 Kind = 1;
480 Kind = 2;
506 if (Kind && ArgNames.size() != Kind)
509 return new PrototypeAST(FnName, ArgNames, Kind != 0, BinaryPrecedence);
/external/llvm/examples/Kaleidoscope/Chapter7/
H A Dtoy.cpp519 unsigned Kind = 0; // 0 = identifier, 1 = unary, 2 = binary. local
527 Kind = 0;
536 Kind = 1;
545 Kind = 2;
571 if (Kind && ArgNames.size() != Kind)
574 return new PrototypeAST(FnName, ArgNames, Kind != 0, BinaryPrecedence);
/external/llvm/examples/Kaleidoscope/MCJIT/cached/
H A Dtoy-jit.cpp536 unsigned Kind = 0; // 0 = identifier, 1 = unary, 2 = binary. local
544 Kind = 0;
553 Kind = 1;
562 Kind = 2;
588 if (Kind && ArgNames.size() != Kind)
591 return new PrototypeAST(FnName, ArgNames, Kind != 0, BinaryPrecedence);
H A Dtoy.cpp542 unsigned Kind = 0; // 0 = identifier, 1 = unary, 2 = binary. local
550 Kind = 0;
559 Kind = 1;
568 Kind = 2;
594 if (Kind && ArgNames.size() != Kind)
597 return new PrototypeAST(FnName, ArgNames, Kind != 0, BinaryPrecedence);
/external/llvm/examples/Kaleidoscope/MCJIT/complete/
H A Dtoy.cpp566 unsigned Kind = 0; // 0 = identifier, 1 = unary, 2 = binary. local
574 Kind = 0;
583 Kind = 1;
592 Kind = 2;
618 if (Kind && ArgNames.size() != Kind)
621 return new PrototypeAST(FnName, ArgNames, Kind != 0, BinaryPrecedence);
/external/llvm/examples/Kaleidoscope/MCJIT/initial/
H A Dtoy.cpp519 unsigned Kind = 0; // 0 = identifier, 1 = unary, 2 = binary. local
527 Kind = 0;
536 Kind = 1;
545 Kind = 2;
571 if (Kind && ArgNames.size() != Kind)
574 return new PrototypeAST(FnName, ArgNames, Kind != 0, BinaryPrecedence);
/external/llvm/examples/Kaleidoscope/MCJIT/lazy/
H A Dtoy-jit.cpp521 unsigned Kind = 0; // 0 = identifier, 1 = unary, 2 = binary. local
529 Kind = 0;
538 Kind = 1;
547 Kind = 2;
573 if (Kind && ArgNames.size() != Kind)
576 return new PrototypeAST(FnName, ArgNames, Kind != 0, BinaryPrecedence);
H A Dtoy.cpp521 unsigned Kind = 0; // 0 = identifier, 1 = unary, 2 = binary. local
529 Kind = 0;
538 Kind = 1;
547 Kind = 2;
573 if (Kind && ArgNames.size() != Kind)
576 return new PrototypeAST(FnName, ArgNames, Kind != 0, BinaryPrecedence);
/external/llvm/include/llvm/ADT/
H A DTwine.h61 /// - Nullary twines are always represented with their Kind on the left-hand
165 explicit Twine(NodeKind Kind) argument
166 : LHSKind(Kind), RHSKind(EmptyKind) {
247 void printOneChild(raw_ostream &OS, Child Ptr, NodeKind Kind) const;
251 NodeKind Kind) const;
/external/llvm/include/llvm/Analysis/
H A DDependenceAnalysis.h386 enum ConstraintKind { Empty, Point, Distance, Line, Any } Kind; member in class:llvm::DependenceAnalysis::Constraint
394 bool isEmpty() const { return Kind == Empty; }
397 bool isPoint() const { return Kind == Point; }
400 bool isDistance() const { return Kind == Distance; }
405 bool isLine() const { return Kind == Line || Kind == Distance; }
408 bool isAny() const { return Kind == Any; }
/external/llvm/include/llvm/Bitcode/
H A DBitstreamReader.h143 } Kind; member in struct:llvm::BitstreamEntry
148 BitstreamEntry E; E.Kind = Error; return E;
151 BitstreamEntry E; E.Kind = EndBlock; return E;
154 BitstreamEntry E; E.Kind = SubBlock; E.ID = ID; return E;
157 BitstreamEntry E; E.Kind = Record; E.ID = AbbrevID; return E;
314 if (Entry.Kind != BitstreamEntry::SubBlock)

Completed in 6704 milliseconds

1234567891011>>