| /src/external/apache2/llvm/dist/llvm/lib/Target/MSP430/Disassembler/ |
| MSP430Disassembler.cpp | 205 static const uint8_t *getDecoderTable(AddrMode SrcAM, unsigned Words) {
206 assert(0 < Words && Words < 4 && "Incorrect number of words");
211 assert(Words < 3 && "Incorrect number of words");
212 return Words == 2 ? DecoderTableAlpha32 : DecoderTableAlpha16;
214 assert(Words < 3 && "Incorrect number of words");
215 return Words == 2 ? DecoderTableBeta32 : DecoderTableBeta16
[all...] |
| /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...] |
| str.c | 107 * Fracture a string into an array of words (as delineated by tabs or spaces)
117 * Returns the fractured words, which must be freed later using Words_Free,
118 * unless the returned Words.words was NULL.
126 Substring *words; local
136 /* words_buf holds the words, separated by '\0'. */
141 words = bmake_malloc((words_cap + 1) * sizeof(words[0]));
191 * end of a token -- make sure there's enough words
200 words = bmake_realloc(words
279 Words words; local
[all...] |
| compat.c | 340 Words words = Str_Words(cmd, false); local
341 mav = words.words;
342 bp = words.freeIt;
|
| main.c | 681 * Break a line of arguments into words and parse them.
689 Words words; local
706 words = Str_Words(buf, true);
707 if (words.words == NULL) {
714 MainParseArgs((int)words.len, words.words);
717 Words_Free(words);
[all...] |
| var.c | 252 /* SepBuf builds a string from words interleaved with separators. */
643 * The argument is expanded exactly once and then split into words.
649 Words varnames;
667 if (varnames.len == 1 && varnames.words[0][0] == '\0')
671 const char *varname = varnames.words[i];
837 Words varnames = Str_Words(xvarnames, false);
841 ExportVar(varnames.words[i], scope, VEM_ENV);
851 Words words = Str_Words(varnames, false); local
854 if (words.len == 1 && words.words[0][0] == '\0'
995 SubstringWords words; local
1738 SubstringWords words; local
2366 SubstringWords words; local
2707 SubstringWords words = Expr_Words(ch->expr); local
3285 SubstringWords words = Expr_Words(expr); local
3437 SubstringWords words; local
3685 SubstringWords words; local
[all...] |
| job.c | 2280 * quotes can be used to enclose blanks in words. A backslash escapes
2306 Words wordsList;
2307 char **words; local
2323 words = wordsList.words;
2326 if (words == NULL) {
2332 for (path = NULL, argv = words; argc != 0; argc--, argv++) {
2377 free(words);
2388 free(words);
2394 free(words);
[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/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/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...] |
| HexagonISelLowering.cpp | 2185 // fit in a single byte. Build two 64-bit words:
2801 SmallVector<SDValue,4> Words[2];
2812 Words[IdxW].push_back(W);
2817 Words[IdxW ^ 1].clear();
2819 for (unsigned i = 0, e = Words[IdxW].size(); i != e; i += 2) {
2820 SDValue W0 = Words[IdxW][i], W1 = Words[IdxW][i+1];
2824 Words[IdxW ^ 1].push_back(T);
2830 // Another sanity check. At this point there should only be two words
2832 assert(Scale == 2 && Words[IdxW].size() == 2)
[all...] |
| /src/usr.bin/make/unit-tests/ |
| varmod-sysv.mk | 21 # Words that don't match the pattern are passed unmodified.
72 # of words in the expression.
128 # Words that don't match are copied unmodified.
|
| /src/external/apache2/llvm/dist/llvm/lib/Support/ |
| APInt.cpp | 99 // Calculate the number of words to copy
100 unsigned words = std::min<unsigned>(bigVal.size(), getNumWords()); local
101 // Copy the words from bigVal to pVal
102 memcpy(U.pVal, bigVal.data(), words * APINT_WORD_SIZE);
125 // If the number of words is the same we can just change the width and stop.
325 // Fill any words between loWord and hiWord with all ones.
377 // Direct copy whole words.
417 static_assert(8 * sizeof(WordType) <= 64, "This code assumes only two words affected");
447 // General case - shift + copy source words directly into place.
480 static_assert(8 * sizeof(WordType) <= 64, "This code assumes only two words affected")
[all...] |
| /src/external/apache2/llvm/dist/llvm/tools/obj2yaml/ |
| elf2yaml.cpp | 1498 ArrayRef<Elf_Word> Words(
1503 for (size_t I = 0, E = Words.size(); I != E; I += 2)
1504 S->Entries->push_back({(yaml::Hex32)Words[I], (yaml::Hex32)Words[I + 1]});
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| APInt.h | 295 /// \param bigVal a sequence of words to form the initial value of the APInt
1433 // Set all the bits in all the words.
1583 /// Get the number of words.
1587 /// \returns the number of words to hold the integer value of this APInt.
1590 /// Get the number of words.
1594 /// \returns the number of words to hold the integer value with a given bit
1607 /// Compute the number of active words in the value of this APInt.
1990 static void tcShiftLeft(WordType *, unsigned Words, unsigned Count);
1994 static void tcShiftRight(WordType *, unsigned Words, unsigned Count);
|
| /src/external/bsd/ntp/dist/ntpq/ |
| ntpq-opts.def | 781 .Ss Status Words and Kiss Codes
783 in a set of status words
786 These words are displayed by the
792 .Lk decode.html "Event Messages and Status Words"
|
| /src/external/apache2/llvm/dist/llvm/tools/llvm-readobj/ |
| ELFDumper.cpp | 2507 W.printNumber("Num Mask Words", GnuHashTable->maskwords);
4911 ArrayRef<Elf_Word> Words(reinterpret_cast<const Elf_Word *>(Desc.begin()),
4914 if (Words.size() < 4)
4921 if (Words[0] < array_lengthof(OSNames))
4922 OSName = OSNames[Words[0]];
4923 uint32_t Major = Words[1], Minor = Words[2], Patch = Words[3];
|
| /src/external/gpl3/gcc/dist/libgcc/config/avr/ |
| lib1funcs.S | 903 ;; Counting in Words, we have to perform a 4 * 4 Multiplication
1141 ;; Counting in Words, we have to perform 4 Multiplications
|
| /src/external/gpl3/gcc.old/dist/libgcc/config/avr/ |
| lib1funcs.S | 898 ;; Counting in Words, we have to perform a 4 * 4 Multiplication
1136 ;; Counting in Words, we have to perform 4 Multiplications
|
| /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/Bitcode/Reader/ |
| BitcodeReader.cpp | 2355 SmallVector<uint64_t, 8> Words(Vals.size());
2356 transform(Vals, Words.begin(),
2359 return APInt(TypeBits, Words);
|
| /src/external/apache2/llvm/dist/llvm/include/llvm-c/ |
| Core.h | 1077 * alive at a time. In other words, a unique type is shared among all
1942 const uint64_t Words[]);
|
| /src/external/apache2/llvm/dist/llvm/lib/IR/ |
| Core.cpp | 1358 const uint64_t Words[]) {
1362 makeArrayRef(Words, NumWords))));
|
| /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);
|
