HomeSort by: relevance | last modified time | path
    Searched refs:MaxSplit (Results 1 - 4 of 4) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/Support/
StringRef.cpp 309 StringRef Separator, int MaxSplit,
313 // Count down from MaxSplit. When MaxSplit is -1, this will just split
315 // intentionally; if we ever want that we can make MaxSplit a 64-bit integer
317 while (MaxSplit-- != 0) {
336 int MaxSplit, bool KeepEmpty) const {
339 // Count down from MaxSplit. When MaxSplit is -1, this will just split
341 // intentionally; if we ever want that we can make MaxSplit a 64-bit integer
343 while (MaxSplit-- != 0)
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/Format/
BreakableToken.cpp 78 unsigned MaxSplit = ColumnLimit - ContentStartColumn + 1;
82 NumChars < MaxSplit && MaxSplitBytes < Text.size();) {
144 // reaches past MaxSplit.
178 unsigned MaxSplit = ColumnLimit - UsedColumns;
194 if (Chars > MaxSplit || Text.size() <= Advance)
  /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
StringRef.h 768 /// Each substring is stored in \p A. If \p MaxSplit is >= 0, at most
769 /// \p MaxSplit splits are done and consequently <= \p MaxSplit + 1
772 /// still count when considering \p MaxSplit
774 /// Separator.join(A) == *this if MaxSplit == -1 and KeepEmpty == true
778 /// \param MaxSplit - The maximum number of times the string is split.
781 StringRef Separator, int MaxSplit = -1,
786 /// Each substring is stored in \p A. If \p MaxSplit is >= 0, at most
787 /// \p MaxSplit splits are done and consequently <= \p MaxSplit +
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
DAGCombiner.cpp 21707 int MaxSplit = 1;
21709 MaxSplit = RVT.getScalarSizeInBits() / 8;
21711 for (int Split = 1; Split <= MaxSplit; ++Split)

Completed in 48 milliseconds