HomeSort by: relevance | last modified time | path
    Searched defs:Words (Results 1 - 7 of 7) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/Target/MSP430/
MSP430BranchSelector.cpp 68 // convert the distance from bytes to words, then check if it fits in 10-bit
75 int Words = DistanceInBytes / WordSize;
76 return isInt<10>(Words);
  /src/external/apache2/llvm/dist/llvm/tools/llvm-cxxfilt/
llvm-cxxfilt.cpp 144 // If 'Split' is true, then 'Mangled' is broken into individual words and each
150 SmallVector<std::pair<StringRef, StringRef>, 16> Words;
151 SplitStringDelims(Mangled, Words, IsLegalItaniumChar);
152 for (const auto &Word : Words)
  /src/usr.bin/make/
str.h 57 /* The result of splitting a string into words. */
58 typedef struct Words {
59 char **words; member in struct:Words
62 } Words;
64 /* The result of splitting a string into words. */
66 Substring *words; member in struct:SubstringWords
300 Words Str_Words(const char *, bool);
303 Words_Free(Words w)
305 free(w.words);
315 w->words = NULL
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
HexagonISelLoweringHVX.cpp 130 // HVX only has shifts of words and halfwords.
497 SmallVector<SDValue,32> Words;
505 Words.push_back(DAG.getBitcast(MVT::i32, W));
508 Words.assign(Values.begin(), Values.end());
511 unsigned NumWords = Words.size();
515 if (isUndef(Words[i]))
519 SplatV = Words[i];
520 else if (SplatV != Words[i])
621 assert(4*Words.size() == Subtarget.getVectorLength());
627 {HalfV0, Words[i]})
    [all...]
  /src/external/apache2/llvm/dist/llvm/utils/TableGen/
CodeGenDAGPatterns.h 72 for (WordType W : Words)
78 std::memset(Words.data(), 0, NumWords*sizeof(WordType));
82 for (WordType W : Words)
89 return (Words[T.SimpleTy / WordWidth] >> (T.SimpleTy % WordWidth)) & 1;
93 Words[T.SimpleTy / WordWidth] |= WordType(1) << (T.SimpleTy % WordWidth);
98 Words[i] |= S.Words[i];
103 Words[T.SimpleTy / WordWidth] &= ~(WordType(1) << (T.SimpleTy % WordWidth));
149 WordType W = Set->Words[SkipWords];
158 WordType W = Set->Words[i]
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/AST/
Expr.cpp 805 const uint64_t* Words = Val.getRawData();
808 std::copy(Words, Words + NumWords, pVal);
810 VAL = Words[0];
  /src/external/apache2/llvm/dist/llvm/lib/Target/ARM/
ARMISelLowering.cpp 831 // In another words, find a way when "copysign" appears in DAG with vector
10974 // __chkstk takes the number of words to allocate on the stack in R4, and
16820 // x != y. In other words, a carry C == 1 when x == y, C == 0
18843 SDValue Words = DAG.getNode(ISD::SRL, DL, MVT::i32, Size,
18847 Chain = DAG.getCopyToReg(Chain, DL, ARM::R4, Words, Flag);

Completed in 39 milliseconds