| /llvm-project-15.0.7/flang/include/flang/Common/ |
| H A D | interval.h | 36 (start_ == that.start_ && size_ < that.size_);
40 (start_ == that.start_ && size_ <= that.size_);
43 return start_ == that.start_ && size_ == that.size_;
46 return !(*this == that);
49 return !(*this < that);
63 return Contains(that.start_) && Contains(that.start_ + (that.size_ - 1)); in Contains()
66 return that.NextAfter() <= start_ || NextAfter() <= that.start_; in IsDisjointWith()
72 size_ = (that.start_ + that.size_) - start_; in Annex()
76 size_ += that.size_; in AnnexIfPredecessor()
83 *this = that; in ExtendToCover()
[all …]
|
| H A D | uint128.h | 87 return {high_ & that.high_, low_ & that.low_};
90 return {high_ | that.high_, low_ | that.low_};
93 return {high_ ^ that.high_, low_ ^ that.low_};
128 return {high_ + that.high_ + carry, low_ + that.low_};
130 constexpr Int128 operator-(Int128 that) const { return *this + -that; }
136 std::uint64_t y0{that.low_ & mask32}, y1{that.low_ >> 32};
143 std::uint64_t y0{that.low_ & mask32}, y1{that.low_ >> 32},
144 y2{that.high_ & mask32}, y3{that.high_ >> 32};
197 return high_ < that.high_ || (high_ == that.high_ && low_ < that.low_);
201 return low_ == that.low_ && high_ == that.high_;
[all …]
|
| H A D | indirection.h | 40 Indirection(Indirection &&that) : p_{that.p_} { in Indirection() argument
51 p_ = that.p_;
52 that.p_ = tmp;
59 bool operator==(const A &that) const { return *p_ == that; }
87 Indirection(Indirection &&that) : p_{that.p_} { in Indirection() argument
97 *p_ = *that.p_;
103 p_ = that.p_;
104 that.p_ = tmp;
111 bool operator==(const A &that) const { return *p_ == that; }
132 : p_{that.p_}, deleter_{that.deleter_} { in ForwardOwningPointer()
[all …]
|
| H A D | constexpr-bitset.h | 46 bits_ &= that.bits_;
50 bits_ &= that.bits_;
54 bits_ ^= that.bits_;
58 bits_ ^= that.bits_;
62 bits_ |= that.bits_;
66 bits_ |= that.bits_;
74 constexpr BitSet operator&(BitSet &&that) const { return bits_ & that.bits_; }
78 constexpr BitSet operator^(BitSet &&that) const { return bits_ & that.bits_; }
82 constexpr BitSet operator|(BitSet &&that) const { return bits_ | that.bits_; }
87 constexpr bool operator==(BitSet &&that) const { return bits_ == that.bits_; }
[all …]
|
| H A D | reference.h | 22 Reference(const Reference &that) : p_{that.p_} {} in Reference() argument
23 Reference(Reference &&that) : p_{that.p_} {} in Reference() argument
24 Reference &operator=(const Reference &that) {
25 p_ = that.p_;
28 Reference &operator=(Reference &&that) {
29 p_ = that.p_;
50 return p_ == &that || *p_ == that;
52 bool operator!=(std::add_const_t<A> &that) const { return !(*this == that); }
53 bool operator==(const Reference &that) const {
54 return p_ == that.p_ || *this == *that.p_;
[all …]
|
| H A D | enum-set.h | 53 bitset_ &= that.bitset_;
57 bitset_ &= that.bitset_;
61 bitset_ |= that.bitset_;
65 bitset_ |= that.bitset_;
69 bitset_ ^= that.bitset_;
73 bitset_ ^= that.bitset_;
84 result.bitset_ &= that.bitset_;
89 result.bitset_ &= that.bitset_;
94 result.bitset_ |= that.bitset_;
99 result.bitset_ |= that.bitset_;
[all …]
|
| /llvm-project-15.0.7/flang/include/flang/Parser/ |
| H A D | parse-state.h | 39 ParseState(const ParseState &that) in ParseState() argument
40 : p_{that.p_}, limit_{that.limit_}, context_{that.context_}, in ParseState()
41 userState_{that.userState_}, inFixedForm_{that.inFixedForm_},
47 ParseState(ParseState &&that) in ParseState() argument
48 : p_{that.p_}, limit_{that.limit_}, messages_{std::move(that.messages_)}, in ParseState()
49 context_{std::move(that.context_)}, userState_{that.userState_},
50 inFixedForm_{that.inFixedForm_},
57 p_ = that.p_, limit_ = that.limit_, context_ = that.context_;
58 userState_ = that.userState_, inFixedForm_ = that.inFixedForm_;
67 p_ = that.p_, limit_ = that.limit_, messages_ = std::move(that.messages_);
[all …]
|
| H A D | char-block.h | 79 bool operator<(const CharBlock &that) const { return Compare(that) < 0; }
80 bool operator<=(const CharBlock &that) const { return Compare(that) <= 0; }
81 bool operator==(const CharBlock &that) const { return Compare(that) == 0; }
84 bool operator>(const CharBlock &that) const { return Compare(that) > 0; }
86 bool operator<(const char *that) const { return Compare(that) < 0; }
87 bool operator<=(const char *that) const { return Compare(that) <= 0; }
88 bool operator==(const char *that) const { return Compare(that) == 0; }
89 bool operator!=(const char *that) const { return Compare(that) != 0; }
90 bool operator>=(const char *that) const { return Compare(that) >= 0; }
91 bool operator>(const char *that) const { return Compare(that) > 0; }
[all …]
|
| H A D | char-buffer.h | 26 CharBuffer(CharBuffer &&that) in CharBuffer() argument
27 : blocks_(std::move(that.blocks_)), bytes_{that.bytes_}, in CharBuffer()
28 lastBlockEmpty_{that.lastBlockEmpty_} {
29 that.clear();
31 CharBuffer &operator=(CharBuffer &&that) {
32 blocks_ = std::move(that.blocks_);
33 bytes_ = that.bytes_;
34 lastBlockEmpty_ = that.lastBlockEmpty_;
35 that.clear();
|
| H A D | char-set.h | 59 constexpr bool Has(SetOfChars that) const { in Has()
60 return (that.bits_ & ~bits_) == 0; in Has()
62 constexpr SetOfChars Union(SetOfChars that) const { in Union()
63 return SetOfChars{bits_ | that.bits_}; in Union()
65 constexpr SetOfChars Intersection(SetOfChars that) const { in Intersection()
66 return SetOfChars{bits_ & that.bits_}; in Intersection()
68 constexpr SetOfChars Difference(SetOfChars that) const { in Difference()
69 return SetOfChars{bits_ & ~that.bits_}; in Difference()
|
| /llvm-project-15.0.7/flang/lib/Evaluate/ |
| H A D | expression.cpp | 128 return name_ == that.name_ && lower_ == that.lower_ && in operator ==()
129 upper_ == that.upper_ && stride_ == that.stride_ && in operator ==()
136 return u == that.u; in operator ==()
168 return result_ == that.result_ && values_ == that.values_; in operator ==()
172 return u == that.u; in operator ==()
178 return u == that.u; in operator ==()
184 return u == that.u; in operator ==()
190 return u == that.u; in operator ==()
196 return u == that.u; in operator ==()
202 return u == that.u; in operator ==()
[all …]
|
| H A D | complex.cpp | 16 const Complex &that, Rounding rounding) const { in Add() argument
18 Part reSum{re_.Add(that.re_, rounding).AccumulateFlags(flags)}; in Add()
19 Part imSum{im_.Add(that.im_, rounding).AccumulateFlags(flags)}; in Add()
25 const Complex &that, Rounding rounding) const { in Subtract() argument
34 const Complex &that, Rounding rounding) const { in Multiply() argument
48 const Complex &that, Rounding rounding) const { in Divide() argument
55 bool cGEd{that.re_.ABS().Compare(that.im_.ABS()) != Relation::Less}; in Divide()
57 scale = that.im_.Divide(that.re_, rounding).AccumulateFlags(flags); in Divide()
59 scale = that.re_.Divide(that.im_, rounding).AccumulateFlags(flags); in Divide()
64 den = dS.Add(that.re_, rounding).AccumulateFlags(flags); in Divide()
[all …]
|
| H A D | variable.cpp | 645 return base_ == that.base_ && &*symbol_ == &*that.symbol_; in operator ==()
652 return !that.IsSymbol() && GetComponent() == that.GetComponent(); in operator ==()
656 return &*parameter_ == &*that.parameter_ && base_ == that.base_; in operator ==()
659 return lower_ == that.lower_ && upper_ == that.upper_ && in operator ==()
664 return base_ == that.base_ && subscript_ == that.subscript_; in operator ==()
667 return base_ == that.base_ && subscript_ == that.subscript_ && in operator ==()
668 cosubscript_ == that.cosubscript_ && stat_ == that.stat_ && in operator ==()
675 return parent_ == that.parent_ && lower_ == that.lower_ && in operator ==()
679 return part_ == that.part_ && complex_ == that.complex_; in operator ==()
682 return proc_ == that.proc_ && arguments_ == that.arguments_; in operator ==()
[all …]
|
| H A D | type.cpp | 110 return category_ == that.category_ && kind_ == that.kind_ && in operator ==()
114 PointeeComparison(derived_, that.derived_); in operator ==()
341 return AreCompatibleTypes(*this, that, false); in IsTkCompatibleWith()
346 bool x{AreCompatibleTypes(*this, that, true)}; in SameTypeAs()
347 bool y{AreCompatibleTypes(that, *this, true)}; in SameTypeAs()
363 } else if (that.IsPolymorphic()) { in ExtendsTypeOf()
404 switch (that.category_) { in ResultTypeForMultiply()
409 return that; in ResultTypeForMultiply()
415 switch (that.category_) { in ResultTypeForMultiply()
427 switch (that.category_) { in ResultTypeForMultiply()
[all …]
|
| /llvm-project-15.0.7/clang/test/SemaObjC/ |
| H A D | non-trivial-c-union.m | 5 …that are non-trivial to default-initialize}} expected-note 36 {{'U0' has subobjects that are non-t…
6 …that is non-trivial to default-initialize}} expected-note 36 {{f0 has type '__strong id' that is n…
7 …that is non-trivial to default-initialize}} expected-note 36 {{f1 has type '__weak id' that is non…
22 …that is non-trivial to destruct}} expected-error {{cannot use type 'U0' for a function/method para…
23 …that is non-trivial to destruct}} expected-error {{cannot use type 'S0' for a function/method para…
26 …that is non-trivial to destruct}} expected-error {{cannot use type 'U0' for a function/method para…
27 …that is non-trivial to destruct}} expected-error {{cannot use type 'S0' for a function/method para…
31 …that is non-trivial to destruct}} expected-error {{cannot use type 'U0' for a function/method para…
32 …that is non-trivial to destruct}} expected-error {{cannot use type 'S0' for a function/method para…
36 …e it is a union that is non-trivial to destruct}} expected-error {{cannot copy-initialize an objec…
[all …]
|
| H A D | unsafe-perform-selector.m | 29 - (struct Struct)returnsStruct2; // expected-note {{method 'returnsStruct2' that returns 'struct St…
36 - (Union)returnsUnion; // expected-note 2 {{method 'returnsUnion' that returns 'Union' declared her…
45 - (Rectangle)returnsStruct; // expected-note 4 {{method 'returnsStruct' that returns 'Rectangle' de…
49 - (float3)returnsExtVector; // expected-note {{method 'returnsExtVector' that returns 'float3' (vec…
50 - (int4)returnsVector; // expected-note {{method 'returnsVector' that returns 'int4' (vector of 4 '…
52 + (Rectangle)returnsStructClass; // expected-note 2 {{method 'returnsStructClass' that returns 'Rec…
58 …; // expected-warning {{'performSelector:' is incompatible with selectors that return a struct typ…
60 …; // expected-warning {{'performSelector:' is incompatible with selectors that return a union type…
84 - (struct Struct)returnsSubStructImpl { // expected-note {{method 'returnsSubStructImpl' that retur…
95 …; // expected-warning {{'performSelector:' is incompatible with selectors that return a struct typ…
[all …]
|
| /llvm-project-15.0.7/flang/include/flang/Evaluate/ |
| H A D | logical.h | 49 return !IsTrue() && that.IsTrue();
57 return IsTrue() == that.IsTrue();
61 return IsTrue() != that.IsTrue();
69 return IsTrue() && !that.IsTrue();
82 constexpr Logical AND(const Logical &that) const { in AND() argument
83 return {word_.IAND(that.word_)}; in AND()
86 constexpr Logical OR(const Logical &that) const { in OR() argument
87 return {word_.IOR(that.word_)}; in OR()
90 constexpr Logical EQV(const Logical &that) const { return NEQV(that).NOT(); } in EQV() argument
92 constexpr Logical NEQV(const Logical &that) const { in NEQV() argument
[all …]
|
| /llvm-project-15.0.7/llvm/lib/Target/SystemZ/ |
| H A D | SystemZFeatures.td | 43 "Assume that the distinct-operands facility is installed"
48 "Assume that the fast-serialization facility is installed"
58 "Assume that the high-word facility is installed"
63 "Assume that interlocked-access facility 1 is installed"
75 "Assume that the population-count facility is installed"
114 "Assume that the execution-hint facility is installed"
119 "Assume that the load-and-trap facility is installed"
144 "Assume that the enhanced-DAT facility 2 is installed"
185 "Assume that the vectory facility is installed"
277 "Assume that the enhanced-sort facility is installed"
[all …]
|
| /llvm-project-15.0.7/flang/lib/Parser/ |
| H A D | message.cpp | 134 u_, that.u_); in Merge()
155 location_, that.location_); in SortBefore()
256 if (!AtSameLocation(that) || ToString() != that.ToString() || in operator ==()
275 return AtSameLocation(that) && in Merge()
276 (!that.attachment_.get() || in Merge()
285 text_, that.text_); in Merge()
316 location_, that.location_); in AtSameLocation()
332 *this = std::move(that); in Merge()
334 while (!that.messages_.empty()) { in Merge()
336 that.messages_.pop_front(); in Merge()
[all …]
|
| H A D | token-sequence.h | 37 TokenSequence(const TokenSequence &that) { Put(that); } in TokenSequence() argument
39 const TokenSequence &that, std::size_t at, std::size_t count = 1) {
40 Put(that, at, count);
42 TokenSequence(TokenSequence &&that) in TokenSequence() argument
43 : start_{std::move(that.start_)}, nextStart_{that.nextStart_}, in TokenSequence()
44 char_{std::move(that.char_)}, provenances_{
45 std::move(that.provenances_)} {}
48 TokenSequence &operator=(const TokenSequence &that) {
50 Put(that);
53 TokenSequence &operator=(TokenSequence &&that);
|
| /llvm-project-15.0.7/clang/docs/ |
| H A D | RefactoringEngine.rst | 6 a couple of examples that show how various primitives in the refactoring API
8 library provides several other APIs that are used when developing a
11 Refactoring engine can be used to implement local refactorings that are
64 that define a set of different rules that produce similar results. For example,
67 refactoring that works on all switches that operate on a particular enum, as
69 constant. To achieve that, we can create two different rules that will use one
112 interface. The subclass should have a constructor that takes the inputs that
114 rule that simply deletes a selection, you should create a subclass of
153 requirements that can be used to construct a refactoring action rule.
190 that allows users to input these options without ever invoking the
[all …]
|
| /llvm-project-15.0.7/llvm/test/CodeGen/Mips/ |
| H A D | eh-return32.ll | 17 ; check that $a0-$a3 are saved on stack.
23 ; check that .cfi_offset directives are emitted for $a0-$a3.
29 ; check that stack adjustment and handler are put in $v1 and $v0.
35 ; check that $a0-$a3 are restored from stack.
41 ; check that stack is adjusted by $v1 and that code returns to address in $v0
42 ; also check that $25 contains handler value
59 ; check that $a0-$a3 are saved on stack.
65 ; check that .cfi_offset directives are emitted for $a0-$a3.
75 ; check that $a0-$a3 are restored from stack.
81 ; check that stack is adjusted by $v1 and that code returns to address in $v0
[all …]
|
| H A D | eh-return64.ll | 18 ; check that $a0-$a3 are saved on stack.
24 ; check that .cfi_offset directives are emitted for $a0-$a3.
30 ; check that stack adjustment and handler are put in $v1 and $v0.
36 ; check that $a0-$a3 are restored from stack.
42 ; check that stack is adjusted by $v1 and that code returns to address in $v0
43 ; also check that $25 contains handler value
62 ; check that $a0-$a3 are saved on stack.
68 ; check that .cfi_offset directives are emitted for $a0-$a3.
78 ; check that $a0-$a3 are restored from stack.
84 ; check that stack is adjusted by $v1 and that code returns to address in $v0
[all …]
|
| /llvm-project-15.0.7/llvm/test/MC/Mips/ |
| H A D | nacl-mask.s | 4 # This test tests that address-masking sandboxing is added when given assembly
8 # Test that address-masking sandboxing is added before indirect branches and
25 # Check that additional nop is inserted, to align mask and jr to the next
36 # Test that address-masking sandboxing is added before load instructions.
62 # Check that additional nop is inserted, to align mask and load to the next
106 # Test that address-masking sandboxing is added before store instructions.
130 # Check that additional nop is inserted, to align mask and store to the next
168 # Test that address-masking sandboxing is added after instructions that change
203 # Check that for instructions that change stack-pointer and load from memory
226 # Test that call + branch delay is aligned at bundle end. Test that mask is
[all …]
|
| /llvm-project-15.0.7/llvm/docs/ |
| H A D | Projects.rst | 12 projects that use LLVM header files, libraries, and tools. In order to use
15 * Set ``make`` variables. There are several variables that a ``Makefile`` needs
31 There are two ways that you can set all of these variables:
56 library that you build, you will have one directory in **lib** that will
57 contain that library's source code.
78 that will contain that program's source code.
82 This subdirectory should contain tests that verify that your code works
100 provided within that directory on your own.
179 Note that this works only for statically linked libraries.
217 Note that ``LIBS`` must occur in the Makefile after the inclusion of
[all …]
|