Bug Summary

File:clang/lib/AST/Expr.cpp
Warning:line 811, column 7
Called C++ object pointer is null

Annotated Source Code

Press '?' to see keyboard shortcuts

clang -cc1 -cc1 -triple x86_64-pc-linux-gnu -analyze -disable-free -clear-ast-before-backend -disable-llvm-verifier -discard-value-names -main-file-name Expr.cpp -analyzer-store=region -analyzer-opt-analyze-nested-blocks -analyzer-checker=core -analyzer-checker=apiModeling -analyzer-checker=unix -analyzer-checker=deadcode -analyzer-checker=cplusplus -analyzer-checker=security.insecureAPI.UncheckedReturn -analyzer-checker=security.insecureAPI.getpw -analyzer-checker=security.insecureAPI.gets -analyzer-checker=security.insecureAPI.mktemp -analyzer-checker=security.insecureAPI.mkstemp -analyzer-checker=security.insecureAPI.vfork -analyzer-checker=nullability.NullPassedToNonnull -analyzer-checker=nullability.NullReturnedFromNonnull -analyzer-output plist -w -setup-static-analyzer -analyzer-config-compatibility-mode=true -mrelocation-model pic -pic-level 2 -mframe-pointer=none -relaxed-aliasing -fmath-errno -fno-rounding-math -mconstructor-aliases -funwind-tables=2 -target-cpu x86-64 -tune-cpu generic -debugger-tuning=gdb -ffunction-sections -fdata-sections -fcoverage-compilation-dir=/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/build-llvm -resource-dir /usr/lib/llvm-14/lib/clang/14.0.0 -D CLANG_ROUND_TRIP_CC1_ARGS=ON -D _DEBUG -D _GNU_SOURCE -D __STDC_CONSTANT_MACROS -D __STDC_FORMAT_MACROS -D __STDC_LIMIT_MACROS -I tools/clang/lib/AST -I /build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST -I /build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/include -I tools/clang/include -I include -I /build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/llvm/include -D NDEBUG -U NDEBUG -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/10/../../../../include/c++/10 -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/10/../../../../include/x86_64-linux-gnu/c++/10 -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/10/../../../../include/c++/10/backward -internal-isystem /usr/lib/llvm-14/lib/clang/14.0.0/include -internal-isystem /usr/local/include -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/10/../../../../x86_64-linux-gnu/include -internal-externc-isystem /usr/include/x86_64-linux-gnu -internal-externc-isystem /include -internal-externc-isystem /usr/include -O2 -Wno-unused-command-line-argument -Wno-unknown-warning-option -Wno-unused-parameter -Wwrite-strings -Wno-missing-field-initializers -Wno-long-long -Wno-maybe-uninitialized -Wno-class-memaccess -Wno-redundant-move -Wno-pessimizing-move -Wno-noexcept-type -Wno-comment -std=c++14 -fdeprecated-macro -fdebug-compilation-dir=/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/build-llvm -ferror-limit 19 -fvisibility-inlines-hidden -fgnuc-version=4.2.1 -fcolor-diagnostics -vectorize-loops -vectorize-slp -analyzer-output=html -analyzer-config stable-report-filename=true -faddrsig -D__GCC_HAVE_DWARF2_CFI_ASM=1 -o /tmp/scan-build-2021-11-07-142024-21761-1 -x c++ /build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp

/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp

1//===--- Expr.cpp - Expression AST Node Implementation --------------------===//
2//
3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6//
7//===----------------------------------------------------------------------===//
8//
9// This file implements the Expr class and subclasses.
10//
11//===----------------------------------------------------------------------===//
12
13#include "clang/AST/Expr.h"
14#include "clang/AST/APValue.h"
15#include "clang/AST/ASTContext.h"
16#include "clang/AST/Attr.h"
17#include "clang/AST/ComputeDependence.h"
18#include "clang/AST/DeclCXX.h"
19#include "clang/AST/DeclObjC.h"
20#include "clang/AST/DeclTemplate.h"
21#include "clang/AST/DependenceFlags.h"
22#include "clang/AST/EvaluatedExprVisitor.h"
23#include "clang/AST/ExprCXX.h"
24#include "clang/AST/IgnoreExpr.h"
25#include "clang/AST/Mangle.h"
26#include "clang/AST/RecordLayout.h"
27#include "clang/AST/StmtVisitor.h"
28#include "clang/Basic/Builtins.h"
29#include "clang/Basic/CharInfo.h"
30#include "clang/Basic/SourceManager.h"
31#include "clang/Basic/TargetInfo.h"
32#include "clang/Lex/Lexer.h"
33#include "clang/Lex/LiteralSupport.h"
34#include "llvm/Support/ErrorHandling.h"
35#include "llvm/Support/Format.h"
36#include "llvm/Support/raw_ostream.h"
37#include <algorithm>
38#include <cstring>
39using namespace clang;
40
41const Expr *Expr::getBestDynamicClassTypeExpr() const {
42 const Expr *E = this;
43 while (true) {
44 E = E->IgnoreParenBaseCasts();
45
46 // Follow the RHS of a comma operator.
47 if (auto *BO = dyn_cast<BinaryOperator>(E)) {
48 if (BO->getOpcode() == BO_Comma) {
49 E = BO->getRHS();
50 continue;
51 }
52 }
53
54 // Step into initializer for materialized temporaries.
55 if (auto *MTE = dyn_cast<MaterializeTemporaryExpr>(E)) {
56 E = MTE->getSubExpr();
57 continue;
58 }
59
60 break;
61 }
62
63 return E;
64}
65
66const CXXRecordDecl *Expr::getBestDynamicClassType() const {
67 const Expr *E = getBestDynamicClassTypeExpr();
68 QualType DerivedType = E->getType();
69 if (const PointerType *PTy = DerivedType->getAs<PointerType>())
70 DerivedType = PTy->getPointeeType();
71
72 if (DerivedType->isDependentType())
73 return nullptr;
74
75 const RecordType *Ty = DerivedType->castAs<RecordType>();
76 Decl *D = Ty->getDecl();
77 return cast<CXXRecordDecl>(D);
78}
79
80const Expr *Expr::skipRValueSubobjectAdjustments(
81 SmallVectorImpl<const Expr *> &CommaLHSs,
82 SmallVectorImpl<SubobjectAdjustment> &Adjustments) const {
83 const Expr *E = this;
84 while (true) {
85 E = E->IgnoreParens();
86
87 if (const CastExpr *CE = dyn_cast<CastExpr>(E)) {
88 if ((CE->getCastKind() == CK_DerivedToBase ||
89 CE->getCastKind() == CK_UncheckedDerivedToBase) &&
90 E->getType()->isRecordType()) {
91 E = CE->getSubExpr();
92 auto *Derived =
93 cast<CXXRecordDecl>(E->getType()->castAs<RecordType>()->getDecl());
94 Adjustments.push_back(SubobjectAdjustment(CE, Derived));
95 continue;
96 }
97
98 if (CE->getCastKind() == CK_NoOp) {
99 E = CE->getSubExpr();
100 continue;
101 }
102 } else if (const MemberExpr *ME = dyn_cast<MemberExpr>(E)) {
103 if (!ME->isArrow()) {
104 assert(ME->getBase()->getType()->isRecordType())(static_cast <bool> (ME->getBase()->getType()->
isRecordType()) ? void (0) : __assert_fail ("ME->getBase()->getType()->isRecordType()"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 104, __extension__ __PRETTY_FUNCTION__))
;
105 if (FieldDecl *Field = dyn_cast<FieldDecl>(ME->getMemberDecl())) {
106 if (!Field->isBitField() && !Field->getType()->isReferenceType()) {
107 E = ME->getBase();
108 Adjustments.push_back(SubobjectAdjustment(Field));
109 continue;
110 }
111 }
112 }
113 } else if (const BinaryOperator *BO = dyn_cast<BinaryOperator>(E)) {
114 if (BO->getOpcode() == BO_PtrMemD) {
115 assert(BO->getRHS()->isPRValue())(static_cast <bool> (BO->getRHS()->isPRValue()) ?
void (0) : __assert_fail ("BO->getRHS()->isPRValue()",
"/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 115, __extension__ __PRETTY_FUNCTION__))
;
116 E = BO->getLHS();
117 const MemberPointerType *MPT =
118 BO->getRHS()->getType()->getAs<MemberPointerType>();
119 Adjustments.push_back(SubobjectAdjustment(MPT, BO->getRHS()));
120 continue;
121 }
122 if (BO->getOpcode() == BO_Comma) {
123 CommaLHSs.push_back(BO->getLHS());
124 E = BO->getRHS();
125 continue;
126 }
127 }
128
129 // Nothing changed.
130 break;
131 }
132 return E;
133}
134
135bool Expr::isKnownToHaveBooleanValue(bool Semantic) const {
136 const Expr *E = IgnoreParens();
137
138 // If this value has _Bool type, it is obvious 0/1.
139 if (E->getType()->isBooleanType()) return true;
140 // If this is a non-scalar-integer type, we don't care enough to try.
141 if (!E->getType()->isIntegralOrEnumerationType()) return false;
142
143 if (const UnaryOperator *UO = dyn_cast<UnaryOperator>(E)) {
144 switch (UO->getOpcode()) {
145 case UO_Plus:
146 return UO->getSubExpr()->isKnownToHaveBooleanValue(Semantic);
147 case UO_LNot:
148 return true;
149 default:
150 return false;
151 }
152 }
153
154 // Only look through implicit casts. If the user writes
155 // '(int) (a && b)' treat it as an arbitrary int.
156 // FIXME: Should we look through any cast expression in !Semantic mode?
157 if (const ImplicitCastExpr *CE = dyn_cast<ImplicitCastExpr>(E))
158 return CE->getSubExpr()->isKnownToHaveBooleanValue(Semantic);
159
160 if (const BinaryOperator *BO = dyn_cast<BinaryOperator>(E)) {
161 switch (BO->getOpcode()) {
162 default: return false;
163 case BO_LT: // Relational operators.
164 case BO_GT:
165 case BO_LE:
166 case BO_GE:
167 case BO_EQ: // Equality operators.
168 case BO_NE:
169 case BO_LAnd: // AND operator.
170 case BO_LOr: // Logical OR operator.
171 return true;
172
173 case BO_And: // Bitwise AND operator.
174 case BO_Xor: // Bitwise XOR operator.
175 case BO_Or: // Bitwise OR operator.
176 // Handle things like (x==2)|(y==12).
177 return BO->getLHS()->isKnownToHaveBooleanValue(Semantic) &&
178 BO->getRHS()->isKnownToHaveBooleanValue(Semantic);
179
180 case BO_Comma:
181 case BO_Assign:
182 return BO->getRHS()->isKnownToHaveBooleanValue(Semantic);
183 }
184 }
185
186 if (const ConditionalOperator *CO = dyn_cast<ConditionalOperator>(E))
187 return CO->getTrueExpr()->isKnownToHaveBooleanValue(Semantic) &&
188 CO->getFalseExpr()->isKnownToHaveBooleanValue(Semantic);
189
190 if (isa<ObjCBoolLiteralExpr>(E))
191 return true;
192
193 if (const auto *OVE = dyn_cast<OpaqueValueExpr>(E))
194 return OVE->getSourceExpr()->isKnownToHaveBooleanValue(Semantic);
195
196 if (const FieldDecl *FD = E->getSourceBitField())
197 if (!Semantic && FD->getType()->isUnsignedIntegerType() &&
198 !FD->getBitWidth()->isValueDependent() &&
199 FD->getBitWidthValue(FD->getASTContext()) == 1)
200 return true;
201
202 return false;
203}
204
205// Amusing macro metaprogramming hack: check whether a class provides
206// a more specific implementation of getExprLoc().
207//
208// See also Stmt.cpp:{getBeginLoc(),getEndLoc()}.
209namespace {
210 /// This implementation is used when a class provides a custom
211 /// implementation of getExprLoc.
212 template <class E, class T>
213 SourceLocation getExprLocImpl(const Expr *expr,
214 SourceLocation (T::*v)() const) {
215 return static_cast<const E*>(expr)->getExprLoc();
216 }
217
218 /// This implementation is used when a class doesn't provide
219 /// a custom implementation of getExprLoc. Overload resolution
220 /// should pick it over the implementation above because it's
221 /// more specialized according to function template partial ordering.
222 template <class E>
223 SourceLocation getExprLocImpl(const Expr *expr,
224 SourceLocation (Expr::*v)() const) {
225 return static_cast<const E *>(expr)->getBeginLoc();
226 }
227}
228
229SourceLocation Expr::getExprLoc() const {
230 switch (getStmtClass()) {
231 case Stmt::NoStmtClass: llvm_unreachable("statement without class")::llvm::llvm_unreachable_internal("statement without class", "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 231)
;
232#define ABSTRACT_STMT(type)
233#define STMT(type, base) \
234 case Stmt::type##Class: break;
235#define EXPR(type, base) \
236 case Stmt::type##Class: return getExprLocImpl<type>(this, &type::getExprLoc);
237#include "clang/AST/StmtNodes.inc"
238 }
239 llvm_unreachable("unknown expression kind")::llvm::llvm_unreachable_internal("unknown expression kind", "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 239)
;
240}
241
242//===----------------------------------------------------------------------===//
243// Primary Expressions.
244//===----------------------------------------------------------------------===//
245
246static void AssertResultStorageKind(ConstantExpr::ResultStorageKind Kind) {
247 assert((Kind == ConstantExpr::RSK_APValue ||(static_cast <bool> ((Kind == ConstantExpr::RSK_APValue
|| Kind == ConstantExpr::RSK_Int64 || Kind == ConstantExpr::
RSK_None) && "Invalid StorageKind Value") ? void (0) :
__assert_fail ("(Kind == ConstantExpr::RSK_APValue || Kind == ConstantExpr::RSK_Int64 || Kind == ConstantExpr::RSK_None) && \"Invalid StorageKind Value\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 249, __extension__ __PRETTY_FUNCTION__))
248 Kind == ConstantExpr::RSK_Int64 || Kind == ConstantExpr::RSK_None) &&(static_cast <bool> ((Kind == ConstantExpr::RSK_APValue
|| Kind == ConstantExpr::RSK_Int64 || Kind == ConstantExpr::
RSK_None) && "Invalid StorageKind Value") ? void (0) :
__assert_fail ("(Kind == ConstantExpr::RSK_APValue || Kind == ConstantExpr::RSK_Int64 || Kind == ConstantExpr::RSK_None) && \"Invalid StorageKind Value\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 249, __extension__ __PRETTY_FUNCTION__))
249 "Invalid StorageKind Value")(static_cast <bool> ((Kind == ConstantExpr::RSK_APValue
|| Kind == ConstantExpr::RSK_Int64 || Kind == ConstantExpr::
RSK_None) && "Invalid StorageKind Value") ? void (0) :
__assert_fail ("(Kind == ConstantExpr::RSK_APValue || Kind == ConstantExpr::RSK_Int64 || Kind == ConstantExpr::RSK_None) && \"Invalid StorageKind Value\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 249, __extension__ __PRETTY_FUNCTION__))
;
250 (void)Kind;
251}
252
253ConstantExpr::ResultStorageKind
254ConstantExpr::getStorageKind(const APValue &Value) {
255 switch (Value.getKind()) {
256 case APValue::None:
257 case APValue::Indeterminate:
258 return ConstantExpr::RSK_None;
259 case APValue::Int:
260 if (!Value.getInt().needsCleanup())
261 return ConstantExpr::RSK_Int64;
262 LLVM_FALLTHROUGH[[gnu::fallthrough]];
263 default:
264 return ConstantExpr::RSK_APValue;
265 }
266}
267
268ConstantExpr::ResultStorageKind
269ConstantExpr::getStorageKind(const Type *T, const ASTContext &Context) {
270 if (T->isIntegralOrEnumerationType() && Context.getTypeInfo(T).Width <= 64)
271 return ConstantExpr::RSK_Int64;
272 return ConstantExpr::RSK_APValue;
273}
274
275ConstantExpr::ConstantExpr(Expr *SubExpr, ResultStorageKind StorageKind,
276 bool IsImmediateInvocation)
277 : FullExpr(ConstantExprClass, SubExpr) {
278 ConstantExprBits.ResultKind = StorageKind;
279 ConstantExprBits.APValueKind = APValue::None;
280 ConstantExprBits.IsUnsigned = false;
281 ConstantExprBits.BitWidth = 0;
282 ConstantExprBits.HasCleanup = false;
283 ConstantExprBits.IsImmediateInvocation = IsImmediateInvocation;
284
285 if (StorageKind == ConstantExpr::RSK_APValue)
286 ::new (getTrailingObjects<APValue>()) APValue();
287}
288
289ConstantExpr *ConstantExpr::Create(const ASTContext &Context, Expr *E,
290 ResultStorageKind StorageKind,
291 bool IsImmediateInvocation) {
292 assert(!isa<ConstantExpr>(E))(static_cast <bool> (!isa<ConstantExpr>(E)) ? void
(0) : __assert_fail ("!isa<ConstantExpr>(E)", "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 292, __extension__ __PRETTY_FUNCTION__))
;
293 AssertResultStorageKind(StorageKind);
294
295 unsigned Size = totalSizeToAlloc<APValue, uint64_t>(
296 StorageKind == ConstantExpr::RSK_APValue,
297 StorageKind == ConstantExpr::RSK_Int64);
298 void *Mem = Context.Allocate(Size, alignof(ConstantExpr));
299 return new (Mem) ConstantExpr(E, StorageKind, IsImmediateInvocation);
300}
301
302ConstantExpr *ConstantExpr::Create(const ASTContext &Context, Expr *E,
303 const APValue &Result) {
304 ResultStorageKind StorageKind = getStorageKind(Result);
305 ConstantExpr *Self = Create(Context, E, StorageKind);
306 Self->SetResult(Result, Context);
307 return Self;
308}
309
310ConstantExpr::ConstantExpr(EmptyShell Empty, ResultStorageKind StorageKind)
311 : FullExpr(ConstantExprClass, Empty) {
312 ConstantExprBits.ResultKind = StorageKind;
313
314 if (StorageKind == ConstantExpr::RSK_APValue)
315 ::new (getTrailingObjects<APValue>()) APValue();
316}
317
318ConstantExpr *ConstantExpr::CreateEmpty(const ASTContext &Context,
319 ResultStorageKind StorageKind) {
320 AssertResultStorageKind(StorageKind);
321
322 unsigned Size = totalSizeToAlloc<APValue, uint64_t>(
323 StorageKind == ConstantExpr::RSK_APValue,
324 StorageKind == ConstantExpr::RSK_Int64);
325 void *Mem = Context.Allocate(Size, alignof(ConstantExpr));
326 return new (Mem) ConstantExpr(EmptyShell(), StorageKind);
327}
328
329void ConstantExpr::MoveIntoResult(APValue &Value, const ASTContext &Context) {
330 assert((unsigned)getStorageKind(Value) <= ConstantExprBits.ResultKind &&(static_cast <bool> ((unsigned)getStorageKind(Value) <=
ConstantExprBits.ResultKind && "Invalid storage for this value kind"
) ? void (0) : __assert_fail ("(unsigned)getStorageKind(Value) <= ConstantExprBits.ResultKind && \"Invalid storage for this value kind\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 331, __extension__ __PRETTY_FUNCTION__))
331 "Invalid storage for this value kind")(static_cast <bool> ((unsigned)getStorageKind(Value) <=
ConstantExprBits.ResultKind && "Invalid storage for this value kind"
) ? void (0) : __assert_fail ("(unsigned)getStorageKind(Value) <= ConstantExprBits.ResultKind && \"Invalid storage for this value kind\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 331, __extension__ __PRETTY_FUNCTION__))
;
332 ConstantExprBits.APValueKind = Value.getKind();
333 switch (ConstantExprBits.ResultKind) {
334 case RSK_None:
335 return;
336 case RSK_Int64:
337 Int64Result() = *Value.getInt().getRawData();
338 ConstantExprBits.BitWidth = Value.getInt().getBitWidth();
339 ConstantExprBits.IsUnsigned = Value.getInt().isUnsigned();
340 return;
341 case RSK_APValue:
342 if (!ConstantExprBits.HasCleanup && Value.needsCleanup()) {
343 ConstantExprBits.HasCleanup = true;
344 Context.addDestruction(&APValueResult());
345 }
346 APValueResult() = std::move(Value);
347 return;
348 }
349 llvm_unreachable("Invalid ResultKind Bits")::llvm::llvm_unreachable_internal("Invalid ResultKind Bits", "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 349)
;
350}
351
352llvm::APSInt ConstantExpr::getResultAsAPSInt() const {
353 switch (ConstantExprBits.ResultKind) {
354 case ConstantExpr::RSK_APValue:
355 return APValueResult().getInt();
356 case ConstantExpr::RSK_Int64:
357 return llvm::APSInt(llvm::APInt(ConstantExprBits.BitWidth, Int64Result()),
358 ConstantExprBits.IsUnsigned);
359 default:
360 llvm_unreachable("invalid Accessor")::llvm::llvm_unreachable_internal("invalid Accessor", "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 360)
;
361 }
362}
363
364APValue ConstantExpr::getAPValueResult() const {
365
366 switch (ConstantExprBits.ResultKind) {
367 case ConstantExpr::RSK_APValue:
368 return APValueResult();
369 case ConstantExpr::RSK_Int64:
370 return APValue(
371 llvm::APSInt(llvm::APInt(ConstantExprBits.BitWidth, Int64Result()),
372 ConstantExprBits.IsUnsigned));
373 case ConstantExpr::RSK_None:
374 if (ConstantExprBits.APValueKind == APValue::Indeterminate)
375 return APValue::IndeterminateValue();
376 return APValue();
377 }
378 llvm_unreachable("invalid ResultKind")::llvm::llvm_unreachable_internal("invalid ResultKind", "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 378)
;
379}
380
381DeclRefExpr::DeclRefExpr(const ASTContext &Ctx, ValueDecl *D,
382 bool RefersToEnclosingVariableOrCapture, QualType T,
383 ExprValueKind VK, SourceLocation L,
384 const DeclarationNameLoc &LocInfo,
385 NonOdrUseReason NOUR)
386 : Expr(DeclRefExprClass, T, VK, OK_Ordinary), D(D), DNLoc(LocInfo) {
387 DeclRefExprBits.HasQualifier = false;
388 DeclRefExprBits.HasTemplateKWAndArgsInfo = false;
389 DeclRefExprBits.HasFoundDecl = false;
390 DeclRefExprBits.HadMultipleCandidates = false;
391 DeclRefExprBits.RefersToEnclosingVariableOrCapture =
392 RefersToEnclosingVariableOrCapture;
393 DeclRefExprBits.NonOdrUseReason = NOUR;
394 DeclRefExprBits.Loc = L;
395 setDependence(computeDependence(this, Ctx));
396}
397
398DeclRefExpr::DeclRefExpr(const ASTContext &Ctx,
399 NestedNameSpecifierLoc QualifierLoc,
400 SourceLocation TemplateKWLoc, ValueDecl *D,
401 bool RefersToEnclosingVariableOrCapture,
402 const DeclarationNameInfo &NameInfo, NamedDecl *FoundD,
403 const TemplateArgumentListInfo *TemplateArgs,
404 QualType T, ExprValueKind VK, NonOdrUseReason NOUR)
405 : Expr(DeclRefExprClass, T, VK, OK_Ordinary), D(D),
406 DNLoc(NameInfo.getInfo()) {
407 DeclRefExprBits.Loc = NameInfo.getLoc();
408 DeclRefExprBits.HasQualifier = QualifierLoc ? 1 : 0;
409 if (QualifierLoc)
410 new (getTrailingObjects<NestedNameSpecifierLoc>())
411 NestedNameSpecifierLoc(QualifierLoc);
412 DeclRefExprBits.HasFoundDecl = FoundD ? 1 : 0;
413 if (FoundD)
414 *getTrailingObjects<NamedDecl *>() = FoundD;
415 DeclRefExprBits.HasTemplateKWAndArgsInfo
416 = (TemplateArgs || TemplateKWLoc.isValid()) ? 1 : 0;
417 DeclRefExprBits.RefersToEnclosingVariableOrCapture =
418 RefersToEnclosingVariableOrCapture;
419 DeclRefExprBits.NonOdrUseReason = NOUR;
420 if (TemplateArgs) {
421 auto Deps = TemplateArgumentDependence::None;
422 getTrailingObjects<ASTTemplateKWAndArgsInfo>()->initializeFrom(
423 TemplateKWLoc, *TemplateArgs, getTrailingObjects<TemplateArgumentLoc>(),
424 Deps);
425 assert(!(Deps & TemplateArgumentDependence::Dependent) &&(static_cast <bool> (!(Deps & TemplateArgumentDependence
::Dependent) && "built a DeclRefExpr with dependent template args"
) ? void (0) : __assert_fail ("!(Deps & TemplateArgumentDependence::Dependent) && \"built a DeclRefExpr with dependent template args\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 426, __extension__ __PRETTY_FUNCTION__))
426 "built a DeclRefExpr with dependent template args")(static_cast <bool> (!(Deps & TemplateArgumentDependence
::Dependent) && "built a DeclRefExpr with dependent template args"
) ? void (0) : __assert_fail ("!(Deps & TemplateArgumentDependence::Dependent) && \"built a DeclRefExpr with dependent template args\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 426, __extension__ __PRETTY_FUNCTION__))
;
427 } else if (TemplateKWLoc.isValid()) {
428 getTrailingObjects<ASTTemplateKWAndArgsInfo>()->initializeFrom(
429 TemplateKWLoc);
430 }
431 DeclRefExprBits.HadMultipleCandidates = 0;
432 setDependence(computeDependence(this, Ctx));
433}
434
435DeclRefExpr *DeclRefExpr::Create(const ASTContext &Context,
436 NestedNameSpecifierLoc QualifierLoc,
437 SourceLocation TemplateKWLoc, ValueDecl *D,
438 bool RefersToEnclosingVariableOrCapture,
439 SourceLocation NameLoc, QualType T,
440 ExprValueKind VK, NamedDecl *FoundD,
441 const TemplateArgumentListInfo *TemplateArgs,
442 NonOdrUseReason NOUR) {
443 return Create(Context, QualifierLoc, TemplateKWLoc, D,
444 RefersToEnclosingVariableOrCapture,
445 DeclarationNameInfo(D->getDeclName(), NameLoc),
446 T, VK, FoundD, TemplateArgs, NOUR);
447}
448
449DeclRefExpr *DeclRefExpr::Create(const ASTContext &Context,
450 NestedNameSpecifierLoc QualifierLoc,
451 SourceLocation TemplateKWLoc, ValueDecl *D,
452 bool RefersToEnclosingVariableOrCapture,
453 const DeclarationNameInfo &NameInfo,
454 QualType T, ExprValueKind VK,
455 NamedDecl *FoundD,
456 const TemplateArgumentListInfo *TemplateArgs,
457 NonOdrUseReason NOUR) {
458 // Filter out cases where the found Decl is the same as the value refenenced.
459 if (D == FoundD)
460 FoundD = nullptr;
461
462 bool HasTemplateKWAndArgsInfo = TemplateArgs || TemplateKWLoc.isValid();
463 std::size_t Size =
464 totalSizeToAlloc<NestedNameSpecifierLoc, NamedDecl *,
465 ASTTemplateKWAndArgsInfo, TemplateArgumentLoc>(
466 QualifierLoc ? 1 : 0, FoundD ? 1 : 0,
467 HasTemplateKWAndArgsInfo ? 1 : 0,
468 TemplateArgs ? TemplateArgs->size() : 0);
469
470 void *Mem = Context.Allocate(Size, alignof(DeclRefExpr));
471 return new (Mem) DeclRefExpr(Context, QualifierLoc, TemplateKWLoc, D,
472 RefersToEnclosingVariableOrCapture, NameInfo,
473 FoundD, TemplateArgs, T, VK, NOUR);
474}
475
476DeclRefExpr *DeclRefExpr::CreateEmpty(const ASTContext &Context,
477 bool HasQualifier,
478 bool HasFoundDecl,
479 bool HasTemplateKWAndArgsInfo,
480 unsigned NumTemplateArgs) {
481 assert(NumTemplateArgs == 0 || HasTemplateKWAndArgsInfo)(static_cast <bool> (NumTemplateArgs == 0 || HasTemplateKWAndArgsInfo
) ? void (0) : __assert_fail ("NumTemplateArgs == 0 || HasTemplateKWAndArgsInfo"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 481, __extension__ __PRETTY_FUNCTION__))
;
482 std::size_t Size =
483 totalSizeToAlloc<NestedNameSpecifierLoc, NamedDecl *,
484 ASTTemplateKWAndArgsInfo, TemplateArgumentLoc>(
485 HasQualifier ? 1 : 0, HasFoundDecl ? 1 : 0, HasTemplateKWAndArgsInfo,
486 NumTemplateArgs);
487 void *Mem = Context.Allocate(Size, alignof(DeclRefExpr));
488 return new (Mem) DeclRefExpr(EmptyShell());
489}
490
491void DeclRefExpr::setDecl(ValueDecl *NewD) {
492 D = NewD;
493 if (getType()->isUndeducedType())
494 setType(NewD->getType());
495 setDependence(computeDependence(this, NewD->getASTContext()));
496}
497
498SourceLocation DeclRefExpr::getBeginLoc() const {
499 if (hasQualifier())
500 return getQualifierLoc().getBeginLoc();
501 return getNameInfo().getBeginLoc();
502}
503SourceLocation DeclRefExpr::getEndLoc() const {
504 if (hasExplicitTemplateArgs())
505 return getRAngleLoc();
506 return getNameInfo().getEndLoc();
507}
508
509SYCLUniqueStableNameExpr::SYCLUniqueStableNameExpr(SourceLocation OpLoc,
510 SourceLocation LParen,
511 SourceLocation RParen,
512 QualType ResultTy,
513 TypeSourceInfo *TSI)
514 : Expr(SYCLUniqueStableNameExprClass, ResultTy, VK_PRValue, OK_Ordinary),
515 OpLoc(OpLoc), LParen(LParen), RParen(RParen) {
516 setTypeSourceInfo(TSI);
517 setDependence(computeDependence(this));
518}
519
520SYCLUniqueStableNameExpr::SYCLUniqueStableNameExpr(EmptyShell Empty,
521 QualType ResultTy)
522 : Expr(SYCLUniqueStableNameExprClass, ResultTy, VK_PRValue, OK_Ordinary) {}
523
524SYCLUniqueStableNameExpr *
525SYCLUniqueStableNameExpr::Create(const ASTContext &Ctx, SourceLocation OpLoc,
526 SourceLocation LParen, SourceLocation RParen,
527 TypeSourceInfo *TSI) {
528 QualType ResultTy = Ctx.getPointerType(Ctx.CharTy.withConst());
529 return new (Ctx)
530 SYCLUniqueStableNameExpr(OpLoc, LParen, RParen, ResultTy, TSI);
531}
532
533SYCLUniqueStableNameExpr *
534SYCLUniqueStableNameExpr::CreateEmpty(const ASTContext &Ctx) {
535 QualType ResultTy = Ctx.getPointerType(Ctx.CharTy.withConst());
536 return new (Ctx) SYCLUniqueStableNameExpr(EmptyShell(), ResultTy);
537}
538
539std::string SYCLUniqueStableNameExpr::ComputeName(ASTContext &Context) const {
540 return SYCLUniqueStableNameExpr::ComputeName(Context,
541 getTypeSourceInfo()->getType());
542}
543
544std::string SYCLUniqueStableNameExpr::ComputeName(ASTContext &Context,
545 QualType Ty) {
546 auto MangleCallback = [](ASTContext &Ctx,
547 const NamedDecl *ND) -> llvm::Optional<unsigned> {
548 if (const auto *RD = dyn_cast<CXXRecordDecl>(ND))
549 return RD->getDeviceLambdaManglingNumber();
550 return llvm::None;
551 };
552
553 std::unique_ptr<MangleContext> Ctx{ItaniumMangleContext::create(
554 Context, Context.getDiagnostics(), MangleCallback)};
555
556 std::string Buffer;
557 Buffer.reserve(128);
558 llvm::raw_string_ostream Out(Buffer);
559 Ctx->mangleTypeName(Ty, Out);
560
561 return Out.str();
562}
563
564PredefinedExpr::PredefinedExpr(SourceLocation L, QualType FNTy, IdentKind IK,
565 StringLiteral *SL)
566 : Expr(PredefinedExprClass, FNTy, VK_LValue, OK_Ordinary) {
567 PredefinedExprBits.Kind = IK;
568 assert((getIdentKind() == IK) &&(static_cast <bool> ((getIdentKind() == IK) && "IdentKind do not fit in PredefinedExprBitfields!"
) ? void (0) : __assert_fail ("(getIdentKind() == IK) && \"IdentKind do not fit in PredefinedExprBitfields!\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 569, __extension__ __PRETTY_FUNCTION__))
569 "IdentKind do not fit in PredefinedExprBitfields!")(static_cast <bool> ((getIdentKind() == IK) && "IdentKind do not fit in PredefinedExprBitfields!"
) ? void (0) : __assert_fail ("(getIdentKind() == IK) && \"IdentKind do not fit in PredefinedExprBitfields!\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 569, __extension__ __PRETTY_FUNCTION__))
;
570 bool HasFunctionName = SL != nullptr;
571 PredefinedExprBits.HasFunctionName = HasFunctionName;
572 PredefinedExprBits.Loc = L;
573 if (HasFunctionName)
574 setFunctionName(SL);
575 setDependence(computeDependence(this));
576}
577
578PredefinedExpr::PredefinedExpr(EmptyShell Empty, bool HasFunctionName)
579 : Expr(PredefinedExprClass, Empty) {
580 PredefinedExprBits.HasFunctionName = HasFunctionName;
581}
582
583PredefinedExpr *PredefinedExpr::Create(const ASTContext &Ctx, SourceLocation L,
584 QualType FNTy, IdentKind IK,
585 StringLiteral *SL) {
586 bool HasFunctionName = SL != nullptr;
587 void *Mem = Ctx.Allocate(totalSizeToAlloc<Stmt *>(HasFunctionName),
588 alignof(PredefinedExpr));
589 return new (Mem) PredefinedExpr(L, FNTy, IK, SL);
590}
591
592PredefinedExpr *PredefinedExpr::CreateEmpty(const ASTContext &Ctx,
593 bool HasFunctionName) {
594 void *Mem = Ctx.Allocate(totalSizeToAlloc<Stmt *>(HasFunctionName),
595 alignof(PredefinedExpr));
596 return new (Mem) PredefinedExpr(EmptyShell(), HasFunctionName);
597}
598
599StringRef PredefinedExpr::getIdentKindName(PredefinedExpr::IdentKind IK) {
600 switch (IK) {
601 case Func:
602 return "__func__";
603 case Function:
604 return "__FUNCTION__";
605 case FuncDName:
606 return "__FUNCDNAME__";
607 case LFunction:
608 return "L__FUNCTION__";
609 case PrettyFunction:
610 return "__PRETTY_FUNCTION__";
611 case FuncSig:
612 return "__FUNCSIG__";
613 case LFuncSig:
614 return "L__FUNCSIG__";
615 case PrettyFunctionNoVirtual:
616 break;
617 }
618 llvm_unreachable("Unknown ident kind for PredefinedExpr")::llvm::llvm_unreachable_internal("Unknown ident kind for PredefinedExpr"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 618)
;
619}
620
621// FIXME: Maybe this should use DeclPrinter with a special "print predefined
622// expr" policy instead.
623std::string PredefinedExpr::ComputeName(IdentKind IK, const Decl *CurrentDecl) {
624 ASTContext &Context = CurrentDecl->getASTContext();
625
626 if (IK == PredefinedExpr::FuncDName) {
1
Assuming 'IK' is not equal to FuncDName
2
Taking false branch
627 if (const NamedDecl *ND = dyn_cast<NamedDecl>(CurrentDecl)) {
628 std::unique_ptr<MangleContext> MC;
629 MC.reset(Context.createMangleContext());
630
631 if (MC->shouldMangleDeclName(ND)) {
632 SmallString<256> Buffer;
633 llvm::raw_svector_ostream Out(Buffer);
634 GlobalDecl GD;
635 if (const CXXConstructorDecl *CD = dyn_cast<CXXConstructorDecl>(ND))
636 GD = GlobalDecl(CD, Ctor_Base);
637 else if (const CXXDestructorDecl *DD = dyn_cast<CXXDestructorDecl>(ND))
638 GD = GlobalDecl(DD, Dtor_Base);
639 else if (ND->hasAttr<CUDAGlobalAttr>())
640 GD = GlobalDecl(cast<FunctionDecl>(ND));
641 else
642 GD = GlobalDecl(ND);
643 MC->mangleName(GD, Out);
644
645 if (!Buffer.empty() && Buffer.front() == '\01')
646 return std::string(Buffer.substr(1));
647 return std::string(Buffer.str());
648 }
649 return std::string(ND->getIdentifier()->getName());
650 }
651 return "";
652 }
653 if (isa<BlockDecl>(CurrentDecl)) {
3
Assuming 'CurrentDecl' is not a 'BlockDecl'
4
Taking false branch
654 // For blocks we only emit something if it is enclosed in a function
655 // For top-level block we'd like to include the name of variable, but we
656 // don't have it at this point.
657 auto DC = CurrentDecl->getDeclContext();
658 if (DC->isFileContext())
659 return "";
660
661 SmallString<256> Buffer;
662 llvm::raw_svector_ostream Out(Buffer);
663 if (auto *DCBlock = dyn_cast<BlockDecl>(DC))
664 // For nested blocks, propagate up to the parent.
665 Out << ComputeName(IK, DCBlock);
666 else if (auto *DCDecl = dyn_cast<Decl>(DC))
667 Out << ComputeName(IK, DCDecl) << "_block_invoke";
668 return std::string(Out.str());
669 }
670 if (const FunctionDecl *FD
5.1
'FD' is non-null
5.1
'FD' is non-null
= dyn_cast<FunctionDecl>(CurrentDecl)) {
5
Assuming 'CurrentDecl' is a 'FunctionDecl'
671 if (IK != PrettyFunction && IK != PrettyFunctionNoVirtual &&
6
Assuming 'IK' is equal to PrettyFunction
672 IK != FuncSig && IK != LFuncSig)
673 return FD->getNameAsString();
674
675 SmallString<256> Name;
676 llvm::raw_svector_ostream Out(Name);
677
678 if (const CXXMethodDecl *MD
7.1
'MD' is null
7.1
'MD' is null
= dyn_cast<CXXMethodDecl>(FD)) {
7
Assuming 'FD' is not a 'CXXMethodDecl'
8
Taking false branch
679 if (MD->isVirtual() && IK != PrettyFunctionNoVirtual)
680 Out << "virtual ";
681 if (MD->isStatic())
682 Out << "static ";
683 }
684
685 PrintingPolicy Policy(Context.getLangOpts());
686 std::string Proto;
687 llvm::raw_string_ostream POut(Proto);
688
689 const FunctionDecl *Decl = FD;
690 if (const FunctionDecl* Pattern = FD->getTemplateInstantiationPattern())
9
Assuming 'Pattern' is null
10
Taking false branch
691 Decl = Pattern;
692 const FunctionType *AFT = Decl->getType()->getAs<FunctionType>();
11
Assuming the object is not a 'FunctionType'
12
'AFT' initialized to a null pointer value
693 const FunctionProtoType *FT = nullptr;
694 if (FD->hasWrittenPrototype())
13
Assuming the condition is false
695 FT = dyn_cast<FunctionProtoType>(AFT);
696
697 if (IK
13.1
'IK' is not equal to FuncSig
13.1
'IK' is not equal to FuncSig
== FuncSig || IK
13.2
'IK' is not equal to LFuncSig
13.2
'IK' is not equal to LFuncSig
== LFuncSig) {
14
Taking false branch
698 switch (AFT->getCallConv()) {
699 case CC_C: POut << "__cdecl "; break;
700 case CC_X86StdCall: POut << "__stdcall "; break;
701 case CC_X86FastCall: POut << "__fastcall "; break;
702 case CC_X86ThisCall: POut << "__thiscall "; break;
703 case CC_X86VectorCall: POut << "__vectorcall "; break;
704 case CC_X86RegCall: POut << "__regcall "; break;
705 // Only bother printing the conventions that MSVC knows about.
706 default: break;
707 }
708 }
709
710 FD->printQualifiedName(POut, Policy);
711
712 POut << "(";
713 if (FT
14.1
'FT' is null
14.1
'FT' is null
) {
15
Taking false branch
714 for (unsigned i = 0, e = Decl->getNumParams(); i != e; ++i) {
715 if (i) POut << ", ";
716 POut << Decl->getParamDecl(i)->getType().stream(Policy);
717 }
718
719 if (FT->isVariadic()) {
720 if (FD->getNumParams()) POut << ", ";
721 POut << "...";
722 } else if ((IK == FuncSig || IK == LFuncSig ||
723 !Context.getLangOpts().CPlusPlus) &&
724 !Decl->getNumParams()) {
725 POut << "void";
726 }
727 }
728 POut << ")";
729
730 if (const CXXMethodDecl *MD
16.1
'MD' is null
16.1
'MD' is null
= dyn_cast<CXXMethodDecl>(FD)) {
16
'FD' is not a 'CXXMethodDecl'
17
Taking false branch
731 assert(FT && "We must have a written prototype in this case.")(static_cast <bool> (FT && "We must have a written prototype in this case."
) ? void (0) : __assert_fail ("FT && \"We must have a written prototype in this case.\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 731, __extension__ __PRETTY_FUNCTION__))
;
732 if (FT->isConst())
733 POut << " const";
734 if (FT->isVolatile())
735 POut << " volatile";
736 RefQualifierKind Ref = MD->getRefQualifier();
737 if (Ref == RQ_LValue)
738 POut << " &";
739 else if (Ref == RQ_RValue)
740 POut << " &&";
741 }
742
743 typedef SmallVector<const ClassTemplateSpecializationDecl *, 8> SpecsTy;
744 SpecsTy Specs;
745 const DeclContext *Ctx = FD->getDeclContext();
746 while (Ctx && isa<NamedDecl>(Ctx)) {
18
Assuming 'Ctx' is null
747 const ClassTemplateSpecializationDecl *Spec
748 = dyn_cast<ClassTemplateSpecializationDecl>(Ctx);
749 if (Spec && !Spec->isExplicitSpecialization())
750 Specs.push_back(Spec);
751 Ctx = Ctx->getParent();
752 }
753
754 std::string TemplateParams;
755 llvm::raw_string_ostream TOut(TemplateParams);
756 for (SpecsTy::reverse_iterator I = Specs.rbegin(), E = Specs.rend();
26
Loop condition is false. Execution continues on line 774
757 I != E; ++I) {
19
Calling 'operator!=<const clang::ClassTemplateSpecializationDecl **>'
25
Returning from 'operator!=<const clang::ClassTemplateSpecializationDecl **>'
758 const TemplateParameterList *Params
759 = (*I)->getSpecializedTemplate()->getTemplateParameters();
760 const TemplateArgumentList &Args = (*I)->getTemplateArgs();
761 assert(Params->size() == Args.size())(static_cast <bool> (Params->size() == Args.size()) ?
void (0) : __assert_fail ("Params->size() == Args.size()"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 761, __extension__ __PRETTY_FUNCTION__))
;
762 for (unsigned i = 0, numParams = Params->size(); i != numParams; ++i) {
763 StringRef Param = Params->getParam(i)->getName();
764 if (Param.empty()) continue;
765 TOut << Param << " = ";
766 Args.get(i).print(Policy, TOut,
767 TemplateParameterList::shouldIncludeTypeForArgument(
768 Policy, Params, i));
769 TOut << ", ";
770 }
771 }
772
773 FunctionTemplateSpecializationInfo *FSI
774 = FD->getTemplateSpecializationInfo();
775 if (FSI && !FSI->isExplicitSpecialization()) {
27
Assuming 'FSI' is null
776 const TemplateParameterList* Params
777 = FSI->getTemplate()->getTemplateParameters();
778 const TemplateArgumentList* Args = FSI->TemplateArguments;
779 assert(Params->size() == Args->size())(static_cast <bool> (Params->size() == Args->size
()) ? void (0) : __assert_fail ("Params->size() == Args->size()"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 779, __extension__ __PRETTY_FUNCTION__))
;
780 for (unsigned i = 0, e = Params->size(); i != e; ++i) {
781 StringRef Param = Params->getParam(i)->getName();
782 if (Param.empty()) continue;
783 TOut << Param << " = ";
784 Args->get(i).print(Policy, TOut, /*IncludeType*/ true);
785 TOut << ", ";
786 }
787 }
788
789 TOut.flush();
790 if (!TemplateParams.empty()) {
28
Assuming the condition is false
29
Taking false branch
791 // remove the trailing comma and space
792 TemplateParams.resize(TemplateParams.size() - 2);
793 POut << " [" << TemplateParams << "]";
794 }
795
796 POut.flush();
797
798 // Print "auto" for all deduced return types. This includes C++1y return
799 // type deduction and lambdas. For trailing return types resolve the
800 // decltype expression. Otherwise print the real type when this is
801 // not a constructor or destructor.
802 if (isa<CXXMethodDecl>(FD) &&
30
'FD' is not a 'CXXMethodDecl'
803 cast<CXXMethodDecl>(FD)->getParent()->isLambda())
804 Proto = "auto " + Proto;
805 else if (FT
30.1
'FT' is null
30.1
'FT' is null
&& FT->getReturnType()->getAs<DecltypeType>())
806 FT->getReturnType()
807 ->getAs<DecltypeType>()
808 ->getUnderlyingType()
809 .getAsStringInternal(Proto, Policy);
810 else if (!isa<CXXConstructorDecl>(FD) && !isa<CXXDestructorDecl>(FD))
31
Assuming 'FD' is not a 'CXXConstructorDecl'
32
Assuming 'FD' is not a 'CXXDestructorDecl'
33
Taking true branch
811 AFT->getReturnType().getAsStringInternal(Proto, Policy);
34
Called C++ object pointer is null
812
813 Out << Proto;
814
815 return std::string(Name);
816 }
817 if (const CapturedDecl *CD = dyn_cast<CapturedDecl>(CurrentDecl)) {
818 for (const DeclContext *DC = CD->getParent(); DC; DC = DC->getParent())
819 // Skip to its enclosing function or method, but not its enclosing
820 // CapturedDecl.
821 if (DC->isFunctionOrMethod() && (DC->getDeclKind() != Decl::Captured)) {
822 const Decl *D = Decl::castFromDeclContext(DC);
823 return ComputeName(IK, D);
824 }
825 llvm_unreachable("CapturedDecl not inside a function or method")::llvm::llvm_unreachable_internal("CapturedDecl not inside a function or method"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 825)
;
826 }
827 if (const ObjCMethodDecl *MD = dyn_cast<ObjCMethodDecl>(CurrentDecl)) {
828 SmallString<256> Name;
829 llvm::raw_svector_ostream Out(Name);
830 Out << (MD->isInstanceMethod() ? '-' : '+');
831 Out << '[';
832
833 // For incorrect code, there might not be an ObjCInterfaceDecl. Do
834 // a null check to avoid a crash.
835 if (const ObjCInterfaceDecl *ID = MD->getClassInterface())
836 Out << *ID;
837
838 if (const ObjCCategoryImplDecl *CID =
839 dyn_cast<ObjCCategoryImplDecl>(MD->getDeclContext()))
840 Out << '(' << *CID << ')';
841
842 Out << ' ';
843 MD->getSelector().print(Out);
844 Out << ']';
845
846 return std::string(Name);
847 }
848 if (isa<TranslationUnitDecl>(CurrentDecl) && IK == PrettyFunction) {
849 // __PRETTY_FUNCTION__ -> "top level", the others produce an empty string.
850 return "top level";
851 }
852 return "";
853}
854
855void APNumericStorage::setIntValue(const ASTContext &C,
856 const llvm::APInt &Val) {
857 if (hasAllocation())
858 C.Deallocate(pVal);
859
860 BitWidth = Val.getBitWidth();
861 unsigned NumWords = Val.getNumWords();
862 const uint64_t* Words = Val.getRawData();
863 if (NumWords > 1) {
864 pVal = new (C) uint64_t[NumWords];
865 std::copy(Words, Words + NumWords, pVal);
866 } else if (NumWords == 1)
867 VAL = Words[0];
868 else
869 VAL = 0;
870}
871
872IntegerLiteral::IntegerLiteral(const ASTContext &C, const llvm::APInt &V,
873 QualType type, SourceLocation l)
874 : Expr(IntegerLiteralClass, type, VK_PRValue, OK_Ordinary), Loc(l) {
875 assert(type->isIntegerType() && "Illegal type in IntegerLiteral")(static_cast <bool> (type->isIntegerType() &&
"Illegal type in IntegerLiteral") ? void (0) : __assert_fail
("type->isIntegerType() && \"Illegal type in IntegerLiteral\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 875, __extension__ __PRETTY_FUNCTION__))
;
876 assert(V.getBitWidth() == C.getIntWidth(type) &&(static_cast <bool> (V.getBitWidth() == C.getIntWidth(type
) && "Integer type is not the correct size for constant."
) ? void (0) : __assert_fail ("V.getBitWidth() == C.getIntWidth(type) && \"Integer type is not the correct size for constant.\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 877, __extension__ __PRETTY_FUNCTION__))
877 "Integer type is not the correct size for constant.")(static_cast <bool> (V.getBitWidth() == C.getIntWidth(type
) && "Integer type is not the correct size for constant."
) ? void (0) : __assert_fail ("V.getBitWidth() == C.getIntWidth(type) && \"Integer type is not the correct size for constant.\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 877, __extension__ __PRETTY_FUNCTION__))
;
878 setValue(C, V);
879 setDependence(ExprDependence::None);
880}
881
882IntegerLiteral *
883IntegerLiteral::Create(const ASTContext &C, const llvm::APInt &V,
884 QualType type, SourceLocation l) {
885 return new (C) IntegerLiteral(C, V, type, l);
886}
887
888IntegerLiteral *
889IntegerLiteral::Create(const ASTContext &C, EmptyShell Empty) {
890 return new (C) IntegerLiteral(Empty);
891}
892
893FixedPointLiteral::FixedPointLiteral(const ASTContext &C, const llvm::APInt &V,
894 QualType type, SourceLocation l,
895 unsigned Scale)
896 : Expr(FixedPointLiteralClass, type, VK_PRValue, OK_Ordinary), Loc(l),
897 Scale(Scale) {
898 assert(type->isFixedPointType() && "Illegal type in FixedPointLiteral")(static_cast <bool> (type->isFixedPointType() &&
"Illegal type in FixedPointLiteral") ? void (0) : __assert_fail
("type->isFixedPointType() && \"Illegal type in FixedPointLiteral\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 898, __extension__ __PRETTY_FUNCTION__))
;
899 assert(V.getBitWidth() == C.getTypeInfo(type).Width &&(static_cast <bool> (V.getBitWidth() == C.getTypeInfo(type
).Width && "Fixed point type is not the correct size for constant."
) ? void (0) : __assert_fail ("V.getBitWidth() == C.getTypeInfo(type).Width && \"Fixed point type is not the correct size for constant.\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 900, __extension__ __PRETTY_FUNCTION__))
900 "Fixed point type is not the correct size for constant.")(static_cast <bool> (V.getBitWidth() == C.getTypeInfo(type
).Width && "Fixed point type is not the correct size for constant."
) ? void (0) : __assert_fail ("V.getBitWidth() == C.getTypeInfo(type).Width && \"Fixed point type is not the correct size for constant.\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 900, __extension__ __PRETTY_FUNCTION__))
;
901 setValue(C, V);
902 setDependence(ExprDependence::None);
903}
904
905FixedPointLiteral *FixedPointLiteral::CreateFromRawInt(const ASTContext &C,
906 const llvm::APInt &V,
907 QualType type,
908 SourceLocation l,
909 unsigned Scale) {
910 return new (C) FixedPointLiteral(C, V, type, l, Scale);
911}
912
913FixedPointLiteral *FixedPointLiteral::Create(const ASTContext &C,
914 EmptyShell Empty) {
915 return new (C) FixedPointLiteral(Empty);
916}
917
918std::string FixedPointLiteral::getValueAsString(unsigned Radix) const {
919 // Currently the longest decimal number that can be printed is the max for an
920 // unsigned long _Accum: 4294967295.99999999976716935634613037109375
921 // which is 43 characters.
922 SmallString<64> S;
923 FixedPointValueToString(
924 S, llvm::APSInt::getUnsigned(getValue().getZExtValue()), Scale);
925 return std::string(S.str());
926}
927
928void CharacterLiteral::print(unsigned Val, CharacterKind Kind,
929 raw_ostream &OS) {
930 switch (Kind) {
931 case CharacterLiteral::Ascii:
932 break; // no prefix.
933 case CharacterLiteral::Wide:
934 OS << 'L';
935 break;
936 case CharacterLiteral::UTF8:
937 OS << "u8";
938 break;
939 case CharacterLiteral::UTF16:
940 OS << 'u';
941 break;
942 case CharacterLiteral::UTF32:
943 OS << 'U';
944 break;
945 }
946
947 switch (Val) {
948 case '\\':
949 OS << "'\\\\'";
950 break;
951 case '\'':
952 OS << "'\\''";
953 break;
954 case '\a':
955 // TODO: K&R: the meaning of '\\a' is different in traditional C
956 OS << "'\\a'";
957 break;
958 case '\b':
959 OS << "'\\b'";
960 break;
961 // Nonstandard escape sequence.
962 /*case '\e':
963 OS << "'\\e'";
964 break;*/
965 case '\f':
966 OS << "'\\f'";
967 break;
968 case '\n':
969 OS << "'\\n'";
970 break;
971 case '\r':
972 OS << "'\\r'";
973 break;
974 case '\t':
975 OS << "'\\t'";
976 break;
977 case '\v':
978 OS << "'\\v'";
979 break;
980 default:
981 // A character literal might be sign-extended, which
982 // would result in an invalid \U escape sequence.
983 // FIXME: multicharacter literals such as '\xFF\xFF\xFF\xFF'
984 // are not correctly handled.
985 if ((Val & ~0xFFu) == ~0xFFu && Kind == CharacterLiteral::Ascii)
986 Val &= 0xFFu;
987 if (Val < 256 && isPrintable((unsigned char)Val))
988 OS << "'" << (char)Val << "'";
989 else if (Val < 256)
990 OS << "'\\x" << llvm::format("%02x", Val) << "'";
991 else if (Val <= 0xFFFF)
992 OS << "'\\u" << llvm::format("%04x", Val) << "'";
993 else
994 OS << "'\\U" << llvm::format("%08x", Val) << "'";
995 }
996}
997
998FloatingLiteral::FloatingLiteral(const ASTContext &C, const llvm::APFloat &V,
999 bool isexact, QualType Type, SourceLocation L)
1000 : Expr(FloatingLiteralClass, Type, VK_PRValue, OK_Ordinary), Loc(L) {
1001 setSemantics(V.getSemantics());
1002 FloatingLiteralBits.IsExact = isexact;
1003 setValue(C, V);
1004 setDependence(ExprDependence::None);
1005}
1006
1007FloatingLiteral::FloatingLiteral(const ASTContext &C, EmptyShell Empty)
1008 : Expr(FloatingLiteralClass, Empty) {
1009 setRawSemantics(llvm::APFloatBase::S_IEEEhalf);
1010 FloatingLiteralBits.IsExact = false;
1011}
1012
1013FloatingLiteral *
1014FloatingLiteral::Create(const ASTContext &C, const llvm::APFloat &V,
1015 bool isexact, QualType Type, SourceLocation L) {
1016 return new (C) FloatingLiteral(C, V, isexact, Type, L);
1017}
1018
1019FloatingLiteral *
1020FloatingLiteral::Create(const ASTContext &C, EmptyShell Empty) {
1021 return new (C) FloatingLiteral(C, Empty);
1022}
1023
1024/// getValueAsApproximateDouble - This returns the value as an inaccurate
1025/// double. Note that this may cause loss of precision, but is useful for
1026/// debugging dumps, etc.
1027double FloatingLiteral::getValueAsApproximateDouble() const {
1028 llvm::APFloat V = getValue();
1029 bool ignored;
1030 V.convert(llvm::APFloat::IEEEdouble(), llvm::APFloat::rmNearestTiesToEven,
1031 &ignored);
1032 return V.convertToDouble();
1033}
1034
1035unsigned StringLiteral::mapCharByteWidth(TargetInfo const &Target,
1036 StringKind SK) {
1037 unsigned CharByteWidth = 0;
1038 switch (SK) {
1039 case Ascii:
1040 case UTF8:
1041 CharByteWidth = Target.getCharWidth();
1042 break;
1043 case Wide:
1044 CharByteWidth = Target.getWCharWidth();
1045 break;
1046 case UTF16:
1047 CharByteWidth = Target.getChar16Width();
1048 break;
1049 case UTF32:
1050 CharByteWidth = Target.getChar32Width();
1051 break;
1052 }
1053 assert((CharByteWidth & 7) == 0 && "Assumes character size is byte multiple")(static_cast <bool> ((CharByteWidth & 7) == 0 &&
"Assumes character size is byte multiple") ? void (0) : __assert_fail
("(CharByteWidth & 7) == 0 && \"Assumes character size is byte multiple\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1053, __extension__ __PRETTY_FUNCTION__))
;
1054 CharByteWidth /= 8;
1055 assert((CharByteWidth == 1 || CharByteWidth == 2 || CharByteWidth == 4) &&(static_cast <bool> ((CharByteWidth == 1 || CharByteWidth
== 2 || CharByteWidth == 4) && "The only supported character byte widths are 1,2 and 4!"
) ? void (0) : __assert_fail ("(CharByteWidth == 1 || CharByteWidth == 2 || CharByteWidth == 4) && \"The only supported character byte widths are 1,2 and 4!\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1056, __extension__ __PRETTY_FUNCTION__))
1056 "The only supported character byte widths are 1,2 and 4!")(static_cast <bool> ((CharByteWidth == 1 || CharByteWidth
== 2 || CharByteWidth == 4) && "The only supported character byte widths are 1,2 and 4!"
) ? void (0) : __assert_fail ("(CharByteWidth == 1 || CharByteWidth == 2 || CharByteWidth == 4) && \"The only supported character byte widths are 1,2 and 4!\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1056, __extension__ __PRETTY_FUNCTION__))
;
1057 return CharByteWidth;
1058}
1059
1060StringLiteral::StringLiteral(const ASTContext &Ctx, StringRef Str,
1061 StringKind Kind, bool Pascal, QualType Ty,
1062 const SourceLocation *Loc,
1063 unsigned NumConcatenated)
1064 : Expr(StringLiteralClass, Ty, VK_LValue, OK_Ordinary) {
1065 assert(Ctx.getAsConstantArrayType(Ty) &&(static_cast <bool> (Ctx.getAsConstantArrayType(Ty) &&
"StringLiteral must be of constant array type!") ? void (0) :
__assert_fail ("Ctx.getAsConstantArrayType(Ty) && \"StringLiteral must be of constant array type!\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1066, __extension__ __PRETTY_FUNCTION__))
1066 "StringLiteral must be of constant array type!")(static_cast <bool> (Ctx.getAsConstantArrayType(Ty) &&
"StringLiteral must be of constant array type!") ? void (0) :
__assert_fail ("Ctx.getAsConstantArrayType(Ty) && \"StringLiteral must be of constant array type!\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1066, __extension__ __PRETTY_FUNCTION__))
;
1067 unsigned CharByteWidth = mapCharByteWidth(Ctx.getTargetInfo(), Kind);
1068 unsigned ByteLength = Str.size();
1069 assert((ByteLength % CharByteWidth == 0) &&(static_cast <bool> ((ByteLength % CharByteWidth == 0) &&
"The size of the data must be a multiple of CharByteWidth!")
? void (0) : __assert_fail ("(ByteLength % CharByteWidth == 0) && \"The size of the data must be a multiple of CharByteWidth!\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1070, __extension__ __PRETTY_FUNCTION__))
1070 "The size of the data must be a multiple of CharByteWidth!")(static_cast <bool> ((ByteLength % CharByteWidth == 0) &&
"The size of the data must be a multiple of CharByteWidth!")
? void (0) : __assert_fail ("(ByteLength % CharByteWidth == 0) && \"The size of the data must be a multiple of CharByteWidth!\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1070, __extension__ __PRETTY_FUNCTION__))
;
1071
1072 // Avoid the expensive division. The compiler should be able to figure it
1073 // out by itself. However as of clang 7, even with the appropriate
1074 // llvm_unreachable added just here, it is not able to do so.
1075 unsigned Length;
1076 switch (CharByteWidth) {
1077 case 1:
1078 Length = ByteLength;
1079 break;
1080 case 2:
1081 Length = ByteLength / 2;
1082 break;
1083 case 4:
1084 Length = ByteLength / 4;
1085 break;
1086 default:
1087 llvm_unreachable("Unsupported character width!")::llvm::llvm_unreachable_internal("Unsupported character width!"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1087)
;
1088 }
1089
1090 StringLiteralBits.Kind = Kind;
1091 StringLiteralBits.CharByteWidth = CharByteWidth;
1092 StringLiteralBits.IsPascal = Pascal;
1093 StringLiteralBits.NumConcatenated = NumConcatenated;
1094 *getTrailingObjects<unsigned>() = Length;
1095
1096 // Initialize the trailing array of SourceLocation.
1097 // This is safe since SourceLocation is POD-like.
1098 std::memcpy(getTrailingObjects<SourceLocation>(), Loc,
1099 NumConcatenated * sizeof(SourceLocation));
1100
1101 // Initialize the trailing array of char holding the string data.
1102 std::memcpy(getTrailingObjects<char>(), Str.data(), ByteLength);
1103
1104 setDependence(ExprDependence::None);
1105}
1106
1107StringLiteral::StringLiteral(EmptyShell Empty, unsigned NumConcatenated,
1108 unsigned Length, unsigned CharByteWidth)
1109 : Expr(StringLiteralClass, Empty) {
1110 StringLiteralBits.CharByteWidth = CharByteWidth;
1111 StringLiteralBits.NumConcatenated = NumConcatenated;
1112 *getTrailingObjects<unsigned>() = Length;
1113}
1114
1115StringLiteral *StringLiteral::Create(const ASTContext &Ctx, StringRef Str,
1116 StringKind Kind, bool Pascal, QualType Ty,
1117 const SourceLocation *Loc,
1118 unsigned NumConcatenated) {
1119 void *Mem = Ctx.Allocate(totalSizeToAlloc<unsigned, SourceLocation, char>(
1120 1, NumConcatenated, Str.size()),
1121 alignof(StringLiteral));
1122 return new (Mem)
1123 StringLiteral(Ctx, Str, Kind, Pascal, Ty, Loc, NumConcatenated);
1124}
1125
1126StringLiteral *StringLiteral::CreateEmpty(const ASTContext &Ctx,
1127 unsigned NumConcatenated,
1128 unsigned Length,
1129 unsigned CharByteWidth) {
1130 void *Mem = Ctx.Allocate(totalSizeToAlloc<unsigned, SourceLocation, char>(
1131 1, NumConcatenated, Length * CharByteWidth),
1132 alignof(StringLiteral));
1133 return new (Mem)
1134 StringLiteral(EmptyShell(), NumConcatenated, Length, CharByteWidth);
1135}
1136
1137void StringLiteral::outputString(raw_ostream &OS) const {
1138 switch (getKind()) {
1139 case Ascii: break; // no prefix.
1140 case Wide: OS << 'L'; break;
1141 case UTF8: OS << "u8"; break;
1142 case UTF16: OS << 'u'; break;
1143 case UTF32: OS << 'U'; break;
1144 }
1145 OS << '"';
1146 static const char Hex[] = "0123456789ABCDEF";
1147
1148 unsigned LastSlashX = getLength();
1149 for (unsigned I = 0, N = getLength(); I != N; ++I) {
1150 switch (uint32_t Char = getCodeUnit(I)) {
1151 default:
1152 // FIXME: Convert UTF-8 back to codepoints before rendering.
1153
1154 // Convert UTF-16 surrogate pairs back to codepoints before rendering.
1155 // Leave invalid surrogates alone; we'll use \x for those.
1156 if (getKind() == UTF16 && I != N - 1 && Char >= 0xd800 &&
1157 Char <= 0xdbff) {
1158 uint32_t Trail = getCodeUnit(I + 1);
1159 if (Trail >= 0xdc00 && Trail <= 0xdfff) {
1160 Char = 0x10000 + ((Char - 0xd800) << 10) + (Trail - 0xdc00);
1161 ++I;
1162 }
1163 }
1164
1165 if (Char > 0xff) {
1166 // If this is a wide string, output characters over 0xff using \x
1167 // escapes. Otherwise, this is a UTF-16 or UTF-32 string, and Char is a
1168 // codepoint: use \x escapes for invalid codepoints.
1169 if (getKind() == Wide ||
1170 (Char >= 0xd800 && Char <= 0xdfff) || Char >= 0x110000) {
1171 // FIXME: Is this the best way to print wchar_t?
1172 OS << "\\x";
1173 int Shift = 28;
1174 while ((Char >> Shift) == 0)
1175 Shift -= 4;
1176 for (/**/; Shift >= 0; Shift -= 4)
1177 OS << Hex[(Char >> Shift) & 15];
1178 LastSlashX = I;
1179 break;
1180 }
1181
1182 if (Char > 0xffff)
1183 OS << "\\U00"
1184 << Hex[(Char >> 20) & 15]
1185 << Hex[(Char >> 16) & 15];
1186 else
1187 OS << "\\u";
1188 OS << Hex[(Char >> 12) & 15]
1189 << Hex[(Char >> 8) & 15]
1190 << Hex[(Char >> 4) & 15]
1191 << Hex[(Char >> 0) & 15];
1192 break;
1193 }
1194
1195 // If we used \x... for the previous character, and this character is a
1196 // hexadecimal digit, prevent it being slurped as part of the \x.
1197 if (LastSlashX + 1 == I) {
1198 switch (Char) {
1199 case '0': case '1': case '2': case '3': case '4':
1200 case '5': case '6': case '7': case '8': case '9':
1201 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
1202 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
1203 OS << "\"\"";
1204 }
1205 }
1206
1207 assert(Char <= 0xff &&(static_cast <bool> (Char <= 0xff && "Characters above 0xff should already have been handled."
) ? void (0) : __assert_fail ("Char <= 0xff && \"Characters above 0xff should already have been handled.\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1208, __extension__ __PRETTY_FUNCTION__))
1208 "Characters above 0xff should already have been handled.")(static_cast <bool> (Char <= 0xff && "Characters above 0xff should already have been handled."
) ? void (0) : __assert_fail ("Char <= 0xff && \"Characters above 0xff should already have been handled.\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1208, __extension__ __PRETTY_FUNCTION__))
;
1209
1210 if (isPrintable(Char))
1211 OS << (char)Char;
1212 else // Output anything hard as an octal escape.
1213 OS << '\\'
1214 << (char)('0' + ((Char >> 6) & 7))
1215 << (char)('0' + ((Char >> 3) & 7))
1216 << (char)('0' + ((Char >> 0) & 7));
1217 break;
1218 // Handle some common non-printable cases to make dumps prettier.
1219 case '\\': OS << "\\\\"; break;
1220 case '"': OS << "\\\""; break;
1221 case '\a': OS << "\\a"; break;
1222 case '\b': OS << "\\b"; break;
1223 case '\f': OS << "\\f"; break;
1224 case '\n': OS << "\\n"; break;
1225 case '\r': OS << "\\r"; break;
1226 case '\t': OS << "\\t"; break;
1227 case '\v': OS << "\\v"; break;
1228 }
1229 }
1230 OS << '"';
1231}
1232
1233/// getLocationOfByte - Return a source location that points to the specified
1234/// byte of this string literal.
1235///
1236/// Strings are amazingly complex. They can be formed from multiple tokens and
1237/// can have escape sequences in them in addition to the usual trigraph and
1238/// escaped newline business. This routine handles this complexity.
1239///
1240/// The *StartToken sets the first token to be searched in this function and
1241/// the *StartTokenByteOffset is the byte offset of the first token. Before
1242/// returning, it updates the *StartToken to the TokNo of the token being found
1243/// and sets *StartTokenByteOffset to the byte offset of the token in the
1244/// string.
1245/// Using these two parameters can reduce the time complexity from O(n^2) to
1246/// O(n) if one wants to get the location of byte for all the tokens in a
1247/// string.
1248///
1249SourceLocation
1250StringLiteral::getLocationOfByte(unsigned ByteNo, const SourceManager &SM,
1251 const LangOptions &Features,
1252 const TargetInfo &Target, unsigned *StartToken,
1253 unsigned *StartTokenByteOffset) const {
1254 assert((getKind() == StringLiteral::Ascii ||(static_cast <bool> ((getKind() == StringLiteral::Ascii
|| getKind() == StringLiteral::UTF8) && "Only narrow string literals are currently supported"
) ? void (0) : __assert_fail ("(getKind() == StringLiteral::Ascii || getKind() == StringLiteral::UTF8) && \"Only narrow string literals are currently supported\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1256, __extension__ __PRETTY_FUNCTION__))
1255 getKind() == StringLiteral::UTF8) &&(static_cast <bool> ((getKind() == StringLiteral::Ascii
|| getKind() == StringLiteral::UTF8) && "Only narrow string literals are currently supported"
) ? void (0) : __assert_fail ("(getKind() == StringLiteral::Ascii || getKind() == StringLiteral::UTF8) && \"Only narrow string literals are currently supported\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1256, __extension__ __PRETTY_FUNCTION__))
1256 "Only narrow string literals are currently supported")(static_cast <bool> ((getKind() == StringLiteral::Ascii
|| getKind() == StringLiteral::UTF8) && "Only narrow string literals are currently supported"
) ? void (0) : __assert_fail ("(getKind() == StringLiteral::Ascii || getKind() == StringLiteral::UTF8) && \"Only narrow string literals are currently supported\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1256, __extension__ __PRETTY_FUNCTION__))
;
1257
1258 // Loop over all of the tokens in this string until we find the one that
1259 // contains the byte we're looking for.
1260 unsigned TokNo = 0;
1261 unsigned StringOffset = 0;
1262 if (StartToken)
1263 TokNo = *StartToken;
1264 if (StartTokenByteOffset) {
1265 StringOffset = *StartTokenByteOffset;
1266 ByteNo -= StringOffset;
1267 }
1268 while (1) {
1269 assert(TokNo < getNumConcatenated() && "Invalid byte number!")(static_cast <bool> (TokNo < getNumConcatenated() &&
"Invalid byte number!") ? void (0) : __assert_fail ("TokNo < getNumConcatenated() && \"Invalid byte number!\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1269, __extension__ __PRETTY_FUNCTION__))
;
1270 SourceLocation StrTokLoc = getStrTokenLoc(TokNo);
1271
1272 // Get the spelling of the string so that we can get the data that makes up
1273 // the string literal, not the identifier for the macro it is potentially
1274 // expanded through.
1275 SourceLocation StrTokSpellingLoc = SM.getSpellingLoc(StrTokLoc);
1276
1277 // Re-lex the token to get its length and original spelling.
1278 std::pair<FileID, unsigned> LocInfo =
1279 SM.getDecomposedLoc(StrTokSpellingLoc);
1280 bool Invalid = false;
1281 StringRef Buffer = SM.getBufferData(LocInfo.first, &Invalid);
1282 if (Invalid) {
1283 if (StartTokenByteOffset != nullptr)
1284 *StartTokenByteOffset = StringOffset;
1285 if (StartToken != nullptr)
1286 *StartToken = TokNo;
1287 return StrTokSpellingLoc;
1288 }
1289
1290 const char *StrData = Buffer.data()+LocInfo.second;
1291
1292 // Create a lexer starting at the beginning of this token.
1293 Lexer TheLexer(SM.getLocForStartOfFile(LocInfo.first), Features,
1294 Buffer.begin(), StrData, Buffer.end());
1295 Token TheTok;
1296 TheLexer.LexFromRawLexer(TheTok);
1297
1298 // Use the StringLiteralParser to compute the length of the string in bytes.
1299 StringLiteralParser SLP(TheTok, SM, Features, Target);
1300 unsigned TokNumBytes = SLP.GetStringLength();
1301
1302 // If the byte is in this token, return the location of the byte.
1303 if (ByteNo < TokNumBytes ||
1304 (ByteNo == TokNumBytes && TokNo == getNumConcatenated() - 1)) {
1305 unsigned Offset = SLP.getOffsetOfStringByte(TheTok, ByteNo);
1306
1307 // Now that we know the offset of the token in the spelling, use the
1308 // preprocessor to get the offset in the original source.
1309 if (StartTokenByteOffset != nullptr)
1310 *StartTokenByteOffset = StringOffset;
1311 if (StartToken != nullptr)
1312 *StartToken = TokNo;
1313 return Lexer::AdvanceToTokenCharacter(StrTokLoc, Offset, SM, Features);
1314 }
1315
1316 // Move to the next string token.
1317 StringOffset += TokNumBytes;
1318 ++TokNo;
1319 ByteNo -= TokNumBytes;
1320 }
1321}
1322
1323/// getOpcodeStr - Turn an Opcode enum value into the punctuation char it
1324/// corresponds to, e.g. "sizeof" or "[pre]++".
1325StringRef UnaryOperator::getOpcodeStr(Opcode Op) {
1326 switch (Op) {
1327#define UNARY_OPERATION(Name, Spelling) case UO_##Name: return Spelling;
1328#include "clang/AST/OperationKinds.def"
1329 }
1330 llvm_unreachable("Unknown unary operator")::llvm::llvm_unreachable_internal("Unknown unary operator", "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1330)
;
1331}
1332
1333UnaryOperatorKind
1334UnaryOperator::getOverloadedOpcode(OverloadedOperatorKind OO, bool Postfix) {
1335 switch (OO) {
1336 default: llvm_unreachable("No unary operator for overloaded function")::llvm::llvm_unreachable_internal("No unary operator for overloaded function"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1336)
;
1337 case OO_PlusPlus: return Postfix ? UO_PostInc : UO_PreInc;
1338 case OO_MinusMinus: return Postfix ? UO_PostDec : UO_PreDec;
1339 case OO_Amp: return UO_AddrOf;
1340 case OO_Star: return UO_Deref;
1341 case OO_Plus: return UO_Plus;
1342 case OO_Minus: return UO_Minus;
1343 case OO_Tilde: return UO_Not;
1344 case OO_Exclaim: return UO_LNot;
1345 case OO_Coawait: return UO_Coawait;
1346 }
1347}
1348
1349OverloadedOperatorKind UnaryOperator::getOverloadedOperator(Opcode Opc) {
1350 switch (Opc) {
1351 case UO_PostInc: case UO_PreInc: return OO_PlusPlus;
1352 case UO_PostDec: case UO_PreDec: return OO_MinusMinus;
1353 case UO_AddrOf: return OO_Amp;
1354 case UO_Deref: return OO_Star;
1355 case UO_Plus: return OO_Plus;
1356 case UO_Minus: return OO_Minus;
1357 case UO_Not: return OO_Tilde;
1358 case UO_LNot: return OO_Exclaim;
1359 case UO_Coawait: return OO_Coawait;
1360 default: return OO_None;
1361 }
1362}
1363
1364
1365//===----------------------------------------------------------------------===//
1366// Postfix Operators.
1367//===----------------------------------------------------------------------===//
1368
1369CallExpr::CallExpr(StmtClass SC, Expr *Fn, ArrayRef<Expr *> PreArgs,
1370 ArrayRef<Expr *> Args, QualType Ty, ExprValueKind VK,
1371 SourceLocation RParenLoc, FPOptionsOverride FPFeatures,
1372 unsigned MinNumArgs, ADLCallKind UsesADL)
1373 : Expr(SC, Ty, VK, OK_Ordinary), RParenLoc(RParenLoc) {
1374 NumArgs = std::max<unsigned>(Args.size(), MinNumArgs);
1375 unsigned NumPreArgs = PreArgs.size();
1376 CallExprBits.NumPreArgs = NumPreArgs;
1377 assert((NumPreArgs == getNumPreArgs()) && "NumPreArgs overflow!")(static_cast <bool> ((NumPreArgs == getNumPreArgs()) &&
"NumPreArgs overflow!") ? void (0) : __assert_fail ("(NumPreArgs == getNumPreArgs()) && \"NumPreArgs overflow!\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1377, __extension__ __PRETTY_FUNCTION__))
;
1378
1379 unsigned OffsetToTrailingObjects = offsetToTrailingObjects(SC);
1380 CallExprBits.OffsetToTrailingObjects = OffsetToTrailingObjects;
1381 assert((CallExprBits.OffsetToTrailingObjects == OffsetToTrailingObjects) &&(static_cast <bool> ((CallExprBits.OffsetToTrailingObjects
== OffsetToTrailingObjects) && "OffsetToTrailingObjects overflow!"
) ? void (0) : __assert_fail ("(CallExprBits.OffsetToTrailingObjects == OffsetToTrailingObjects) && \"OffsetToTrailingObjects overflow!\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1382, __extension__ __PRETTY_FUNCTION__))
1382 "OffsetToTrailingObjects overflow!")(static_cast <bool> ((CallExprBits.OffsetToTrailingObjects
== OffsetToTrailingObjects) && "OffsetToTrailingObjects overflow!"
) ? void (0) : __assert_fail ("(CallExprBits.OffsetToTrailingObjects == OffsetToTrailingObjects) && \"OffsetToTrailingObjects overflow!\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1382, __extension__ __PRETTY_FUNCTION__))
;
1383
1384 CallExprBits.UsesADL = static_cast<bool>(UsesADL);
1385
1386 setCallee(Fn);
1387 for (unsigned I = 0; I != NumPreArgs; ++I)
1388 setPreArg(I, PreArgs[I]);
1389 for (unsigned I = 0; I != Args.size(); ++I)
1390 setArg(I, Args[I]);
1391 for (unsigned I = Args.size(); I != NumArgs; ++I)
1392 setArg(I, nullptr);
1393
1394 this->computeDependence();
1395
1396 CallExprBits.HasFPFeatures = FPFeatures.requiresTrailingStorage();
1397 if (hasStoredFPFeatures())
1398 setStoredFPFeatures(FPFeatures);
1399}
1400
1401CallExpr::CallExpr(StmtClass SC, unsigned NumPreArgs, unsigned NumArgs,
1402 bool HasFPFeatures, EmptyShell Empty)
1403 : Expr(SC, Empty), NumArgs(NumArgs) {
1404 CallExprBits.NumPreArgs = NumPreArgs;
1405 assert((NumPreArgs == getNumPreArgs()) && "NumPreArgs overflow!")(static_cast <bool> ((NumPreArgs == getNumPreArgs()) &&
"NumPreArgs overflow!") ? void (0) : __assert_fail ("(NumPreArgs == getNumPreArgs()) && \"NumPreArgs overflow!\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1405, __extension__ __PRETTY_FUNCTION__))
;
1406
1407 unsigned OffsetToTrailingObjects = offsetToTrailingObjects(SC);
1408 CallExprBits.OffsetToTrailingObjects = OffsetToTrailingObjects;
1409 assert((CallExprBits.OffsetToTrailingObjects == OffsetToTrailingObjects) &&(static_cast <bool> ((CallExprBits.OffsetToTrailingObjects
== OffsetToTrailingObjects) && "OffsetToTrailingObjects overflow!"
) ? void (0) : __assert_fail ("(CallExprBits.OffsetToTrailingObjects == OffsetToTrailingObjects) && \"OffsetToTrailingObjects overflow!\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1410, __extension__ __PRETTY_FUNCTION__))
1410 "OffsetToTrailingObjects overflow!")(static_cast <bool> ((CallExprBits.OffsetToTrailingObjects
== OffsetToTrailingObjects) && "OffsetToTrailingObjects overflow!"
) ? void (0) : __assert_fail ("(CallExprBits.OffsetToTrailingObjects == OffsetToTrailingObjects) && \"OffsetToTrailingObjects overflow!\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1410, __extension__ __PRETTY_FUNCTION__))
;
1411 CallExprBits.HasFPFeatures = HasFPFeatures;
1412}
1413
1414CallExpr *CallExpr::Create(const ASTContext &Ctx, Expr *Fn,
1415 ArrayRef<Expr *> Args, QualType Ty, ExprValueKind VK,
1416 SourceLocation RParenLoc,
1417 FPOptionsOverride FPFeatures, unsigned MinNumArgs,
1418 ADLCallKind UsesADL) {
1419 unsigned NumArgs = std::max<unsigned>(Args.size(), MinNumArgs);
1420 unsigned SizeOfTrailingObjects = CallExpr::sizeOfTrailingObjects(
1421 /*NumPreArgs=*/0, NumArgs, FPFeatures.requiresTrailingStorage());
1422 void *Mem =
1423 Ctx.Allocate(sizeof(CallExpr) + SizeOfTrailingObjects, alignof(CallExpr));
1424 return new (Mem) CallExpr(CallExprClass, Fn, /*PreArgs=*/{}, Args, Ty, VK,
1425 RParenLoc, FPFeatures, MinNumArgs, UsesADL);
1426}
1427
1428CallExpr *CallExpr::CreateTemporary(void *Mem, Expr *Fn, QualType Ty,
1429 ExprValueKind VK, SourceLocation RParenLoc,
1430 ADLCallKind UsesADL) {
1431 assert(!(reinterpret_cast<uintptr_t>(Mem) % alignof(CallExpr)) &&(static_cast <bool> (!(reinterpret_cast<uintptr_t>
(Mem) % alignof(CallExpr)) && "Misaligned memory in CallExpr::CreateTemporary!"
) ? void (0) : __assert_fail ("!(reinterpret_cast<uintptr_t>(Mem) % alignof(CallExpr)) && \"Misaligned memory in CallExpr::CreateTemporary!\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1432, __extension__ __PRETTY_FUNCTION__))
1432 "Misaligned memory in CallExpr::CreateTemporary!")(static_cast <bool> (!(reinterpret_cast<uintptr_t>
(Mem) % alignof(CallExpr)) && "Misaligned memory in CallExpr::CreateTemporary!"
) ? void (0) : __assert_fail ("!(reinterpret_cast<uintptr_t>(Mem) % alignof(CallExpr)) && \"Misaligned memory in CallExpr::CreateTemporary!\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1432, __extension__ __PRETTY_FUNCTION__))
;
1433 return new (Mem) CallExpr(CallExprClass, Fn, /*PreArgs=*/{}, /*Args=*/{}, Ty,
1434 VK, RParenLoc, FPOptionsOverride(),
1435 /*MinNumArgs=*/0, UsesADL);
1436}
1437
1438CallExpr *CallExpr::CreateEmpty(const ASTContext &Ctx, unsigned NumArgs,
1439 bool HasFPFeatures, EmptyShell Empty) {
1440 unsigned SizeOfTrailingObjects =
1441 CallExpr::sizeOfTrailingObjects(/*NumPreArgs=*/0, NumArgs, HasFPFeatures);
1442 void *Mem =
1443 Ctx.Allocate(sizeof(CallExpr) + SizeOfTrailingObjects, alignof(CallExpr));
1444 return new (Mem)
1445 CallExpr(CallExprClass, /*NumPreArgs=*/0, NumArgs, HasFPFeatures, Empty);
1446}
1447
1448unsigned CallExpr::offsetToTrailingObjects(StmtClass SC) {
1449 switch (SC) {
1450 case CallExprClass:
1451 return sizeof(CallExpr);
1452 case CXXOperatorCallExprClass:
1453 return sizeof(CXXOperatorCallExpr);
1454 case CXXMemberCallExprClass:
1455 return sizeof(CXXMemberCallExpr);
1456 case UserDefinedLiteralClass:
1457 return sizeof(UserDefinedLiteral);
1458 case CUDAKernelCallExprClass:
1459 return sizeof(CUDAKernelCallExpr);
1460 default:
1461 llvm_unreachable("unexpected class deriving from CallExpr!")::llvm::llvm_unreachable_internal("unexpected class deriving from CallExpr!"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1461)
;
1462 }
1463}
1464
1465Decl *Expr::getReferencedDeclOfCallee() {
1466 Expr *CEE = IgnoreParenImpCasts();
1467
1468 while (SubstNonTypeTemplateParmExpr *NTTP =
1469 dyn_cast<SubstNonTypeTemplateParmExpr>(CEE)) {
1470 CEE = NTTP->getReplacement()->IgnoreParenImpCasts();
1471 }
1472
1473 // If we're calling a dereference, look at the pointer instead.
1474 while (true) {
1475 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(CEE)) {
1476 if (BO->isPtrMemOp()) {
1477 CEE = BO->getRHS()->IgnoreParenImpCasts();
1478 continue;
1479 }
1480 } else if (UnaryOperator *UO = dyn_cast<UnaryOperator>(CEE)) {
1481 if (UO->getOpcode() == UO_Deref || UO->getOpcode() == UO_AddrOf ||
1482 UO->getOpcode() == UO_Plus) {
1483 CEE = UO->getSubExpr()->IgnoreParenImpCasts();
1484 continue;
1485 }
1486 }
1487 break;
1488 }
1489
1490 if (DeclRefExpr *DRE = dyn_cast<DeclRefExpr>(CEE))
1491 return DRE->getDecl();
1492 if (MemberExpr *ME = dyn_cast<MemberExpr>(CEE))
1493 return ME->getMemberDecl();
1494 if (auto *BE = dyn_cast<BlockExpr>(CEE))
1495 return BE->getBlockDecl();
1496
1497 return nullptr;
1498}
1499
1500/// If this is a call to a builtin, return the builtin ID. If not, return 0.
1501unsigned CallExpr::getBuiltinCallee() const {
1502 auto *FDecl =
1503 dyn_cast_or_null<FunctionDecl>(getCallee()->getReferencedDeclOfCallee());
1504 return FDecl ? FDecl->getBuiltinID() : 0;
1505}
1506
1507bool CallExpr::isUnevaluatedBuiltinCall(const ASTContext &Ctx) const {
1508 if (unsigned BI = getBuiltinCallee())
1509 return Ctx.BuiltinInfo.isUnevaluated(BI);
1510 return false;
1511}
1512
1513QualType CallExpr::getCallReturnType(const ASTContext &Ctx) const {
1514 const Expr *Callee = getCallee();
1515 QualType CalleeType = Callee->getType();
1516 if (const auto *FnTypePtr = CalleeType->getAs<PointerType>()) {
1517 CalleeType = FnTypePtr->getPointeeType();
1518 } else if (const auto *BPT = CalleeType->getAs<BlockPointerType>()) {
1519 CalleeType = BPT->getPointeeType();
1520 } else if (CalleeType->isSpecificPlaceholderType(BuiltinType::BoundMember)) {
1521 if (isa<CXXPseudoDestructorExpr>(Callee->IgnoreParens()))
1522 return Ctx.VoidTy;
1523
1524 if (isa<UnresolvedMemberExpr>(Callee->IgnoreParens()))
1525 return Ctx.DependentTy;
1526
1527 // This should never be overloaded and so should never return null.
1528 CalleeType = Expr::findBoundMemberType(Callee);
1529 assert(!CalleeType.isNull())(static_cast <bool> (!CalleeType.isNull()) ? void (0) :
__assert_fail ("!CalleeType.isNull()", "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1529, __extension__ __PRETTY_FUNCTION__))
;
1530 } else if (CalleeType->isDependentType() ||
1531 CalleeType->isSpecificPlaceholderType(BuiltinType::Overload)) {
1532 return Ctx.DependentTy;
1533 }
1534
1535 const FunctionType *FnType = CalleeType->castAs<FunctionType>();
1536 return FnType->getReturnType();
1537}
1538
1539const Attr *CallExpr::getUnusedResultAttr(const ASTContext &Ctx) const {
1540 // If the return type is a struct, union, or enum that is marked nodiscard,
1541 // then return the return type attribute.
1542 if (const TagDecl *TD = getCallReturnType(Ctx)->getAsTagDecl())
1543 if (const auto *A = TD->getAttr<WarnUnusedResultAttr>())
1544 return A;
1545
1546 // Otherwise, see if the callee is marked nodiscard and return that attribute
1547 // instead.
1548 const Decl *D = getCalleeDecl();
1549 return D ? D->getAttr<WarnUnusedResultAttr>() : nullptr;
1550}
1551
1552SourceLocation CallExpr::getBeginLoc() const {
1553 if (isa<CXXOperatorCallExpr>(this))
1554 return cast<CXXOperatorCallExpr>(this)->getBeginLoc();
1555
1556 SourceLocation begin = getCallee()->getBeginLoc();
1557 if (begin.isInvalid() && getNumArgs() > 0 && getArg(0))
1558 begin = getArg(0)->getBeginLoc();
1559 return begin;
1560}
1561SourceLocation CallExpr::getEndLoc() const {
1562 if (isa<CXXOperatorCallExpr>(this))
1563 return cast<CXXOperatorCallExpr>(this)->getEndLoc();
1564
1565 SourceLocation end = getRParenLoc();
1566 if (end.isInvalid() && getNumArgs() > 0 && getArg(getNumArgs() - 1))
1567 end = getArg(getNumArgs() - 1)->getEndLoc();
1568 return end;
1569}
1570
1571OffsetOfExpr *OffsetOfExpr::Create(const ASTContext &C, QualType type,
1572 SourceLocation OperatorLoc,
1573 TypeSourceInfo *tsi,
1574 ArrayRef<OffsetOfNode> comps,
1575 ArrayRef<Expr*> exprs,
1576 SourceLocation RParenLoc) {
1577 void *Mem = C.Allocate(
1578 totalSizeToAlloc<OffsetOfNode, Expr *>(comps.size(), exprs.size()));
1579
1580 return new (Mem) OffsetOfExpr(C, type, OperatorLoc, tsi, comps, exprs,
1581 RParenLoc);
1582}
1583
1584OffsetOfExpr *OffsetOfExpr::CreateEmpty(const ASTContext &C,
1585 unsigned numComps, unsigned numExprs) {
1586 void *Mem =
1587 C.Allocate(totalSizeToAlloc<OffsetOfNode, Expr *>(numComps, numExprs));
1588 return new (Mem) OffsetOfExpr(numComps, numExprs);
1589}
1590
1591OffsetOfExpr::OffsetOfExpr(const ASTContext &C, QualType type,
1592 SourceLocation OperatorLoc, TypeSourceInfo *tsi,
1593 ArrayRef<OffsetOfNode> comps, ArrayRef<Expr *> exprs,
1594 SourceLocation RParenLoc)
1595 : Expr(OffsetOfExprClass, type, VK_PRValue, OK_Ordinary),
1596 OperatorLoc(OperatorLoc), RParenLoc(RParenLoc), TSInfo(tsi),
1597 NumComps(comps.size()), NumExprs(exprs.size()) {
1598 for (unsigned i = 0; i != comps.size(); ++i)
1599 setComponent(i, comps[i]);
1600 for (unsigned i = 0; i != exprs.size(); ++i)
1601 setIndexExpr(i, exprs[i]);
1602
1603 setDependence(computeDependence(this));
1604}
1605
1606IdentifierInfo *OffsetOfNode::getFieldName() const {
1607 assert(getKind() == Field || getKind() == Identifier)(static_cast <bool> (getKind() == Field || getKind() ==
Identifier) ? void (0) : __assert_fail ("getKind() == Field || getKind() == Identifier"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1607, __extension__ __PRETTY_FUNCTION__))
;
1608 if (getKind() == Field)
1609 return getField()->getIdentifier();
1610
1611 return reinterpret_cast<IdentifierInfo *> (Data & ~(uintptr_t)Mask);
1612}
1613
1614UnaryExprOrTypeTraitExpr::UnaryExprOrTypeTraitExpr(
1615 UnaryExprOrTypeTrait ExprKind, Expr *E, QualType resultType,
1616 SourceLocation op, SourceLocation rp)
1617 : Expr(UnaryExprOrTypeTraitExprClass, resultType, VK_PRValue, OK_Ordinary),
1618 OpLoc(op), RParenLoc(rp) {
1619 assert(ExprKind <= UETT_Last && "invalid enum value!")(static_cast <bool> (ExprKind <= UETT_Last &&
"invalid enum value!") ? void (0) : __assert_fail ("ExprKind <= UETT_Last && \"invalid enum value!\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1619, __extension__ __PRETTY_FUNCTION__))
;
1620 UnaryExprOrTypeTraitExprBits.Kind = ExprKind;
1621 assert(static_cast<unsigned>(ExprKind) == UnaryExprOrTypeTraitExprBits.Kind &&(static_cast <bool> (static_cast<unsigned>(ExprKind
) == UnaryExprOrTypeTraitExprBits.Kind && "UnaryExprOrTypeTraitExprBits.Kind overflow!"
) ? void (0) : __assert_fail ("static_cast<unsigned>(ExprKind) == UnaryExprOrTypeTraitExprBits.Kind && \"UnaryExprOrTypeTraitExprBits.Kind overflow!\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1622, __extension__ __PRETTY_FUNCTION__))
1622 "UnaryExprOrTypeTraitExprBits.Kind overflow!")(static_cast <bool> (static_cast<unsigned>(ExprKind
) == UnaryExprOrTypeTraitExprBits.Kind && "UnaryExprOrTypeTraitExprBits.Kind overflow!"
) ? void (0) : __assert_fail ("static_cast<unsigned>(ExprKind) == UnaryExprOrTypeTraitExprBits.Kind && \"UnaryExprOrTypeTraitExprBits.Kind overflow!\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1622, __extension__ __PRETTY_FUNCTION__))
;
1623 UnaryExprOrTypeTraitExprBits.IsType = false;
1624 Argument.Ex = E;
1625 setDependence(computeDependence(this));
1626}
1627
1628MemberExpr::MemberExpr(Expr *Base, bool IsArrow, SourceLocation OperatorLoc,
1629 ValueDecl *MemberDecl,
1630 const DeclarationNameInfo &NameInfo, QualType T,
1631 ExprValueKind VK, ExprObjectKind OK,
1632 NonOdrUseReason NOUR)
1633 : Expr(MemberExprClass, T, VK, OK), Base(Base), MemberDecl(MemberDecl),
1634 MemberDNLoc(NameInfo.getInfo()), MemberLoc(NameInfo.getLoc()) {
1635 assert(!NameInfo.getName() ||(static_cast <bool> (!NameInfo.getName() || MemberDecl->
getDeclName() == NameInfo.getName()) ? void (0) : __assert_fail
("!NameInfo.getName() || MemberDecl->getDeclName() == NameInfo.getName()"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1636, __extension__ __PRETTY_FUNCTION__))
1636 MemberDecl->getDeclName() == NameInfo.getName())(static_cast <bool> (!NameInfo.getName() || MemberDecl->
getDeclName() == NameInfo.getName()) ? void (0) : __assert_fail
("!NameInfo.getName() || MemberDecl->getDeclName() == NameInfo.getName()"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1636, __extension__ __PRETTY_FUNCTION__))
;
1637 MemberExprBits.IsArrow = IsArrow;
1638 MemberExprBits.HasQualifierOrFoundDecl = false;
1639 MemberExprBits.HasTemplateKWAndArgsInfo = false;
1640 MemberExprBits.HadMultipleCandidates = false;
1641 MemberExprBits.NonOdrUseReason = NOUR;
1642 MemberExprBits.OperatorLoc = OperatorLoc;
1643 setDependence(computeDependence(this));
1644}
1645
1646MemberExpr *MemberExpr::Create(
1647 const ASTContext &C, Expr *Base, bool IsArrow, SourceLocation OperatorLoc,
1648 NestedNameSpecifierLoc QualifierLoc, SourceLocation TemplateKWLoc,
1649 ValueDecl *MemberDecl, DeclAccessPair FoundDecl,
1650 DeclarationNameInfo NameInfo, const TemplateArgumentListInfo *TemplateArgs,
1651 QualType T, ExprValueKind VK, ExprObjectKind OK, NonOdrUseReason NOUR) {
1652 bool HasQualOrFound = QualifierLoc || FoundDecl.getDecl() != MemberDecl ||
1653 FoundDecl.getAccess() != MemberDecl->getAccess();
1654 bool HasTemplateKWAndArgsInfo = TemplateArgs || TemplateKWLoc.isValid();
1655 std::size_t Size =
1656 totalSizeToAlloc<MemberExprNameQualifier, ASTTemplateKWAndArgsInfo,
1657 TemplateArgumentLoc>(
1658 HasQualOrFound ? 1 : 0, HasTemplateKWAndArgsInfo ? 1 : 0,
1659 TemplateArgs ? TemplateArgs->size() : 0);
1660
1661 void *Mem = C.Allocate(Size, alignof(MemberExpr));
1662 MemberExpr *E = new (Mem) MemberExpr(Base, IsArrow, OperatorLoc, MemberDecl,
1663 NameInfo, T, VK, OK, NOUR);
1664
1665 // FIXME: remove remaining dependence computation to computeDependence().
1666 auto Deps = E->getDependence();
1667 if (HasQualOrFound) {
1668 // FIXME: Wrong. We should be looking at the member declaration we found.
1669 if (QualifierLoc && QualifierLoc.getNestedNameSpecifier()->isDependent())
1670 Deps |= ExprDependence::TypeValueInstantiation;
1671 else if (QualifierLoc &&
1672 QualifierLoc.getNestedNameSpecifier()->isInstantiationDependent())
1673 Deps |= ExprDependence::Instantiation;
1674
1675 E->MemberExprBits.HasQualifierOrFoundDecl = true;
1676
1677 MemberExprNameQualifier *NQ =
1678 E->getTrailingObjects<MemberExprNameQualifier>();
1679 NQ->QualifierLoc = QualifierLoc;
1680 NQ->FoundDecl = FoundDecl;
1681 }
1682
1683 E->MemberExprBits.HasTemplateKWAndArgsInfo =
1684 TemplateArgs || TemplateKWLoc.isValid();
1685
1686 if (TemplateArgs) {
1687 auto TemplateArgDeps = TemplateArgumentDependence::None;
1688 E->getTrailingObjects<ASTTemplateKWAndArgsInfo>()->initializeFrom(
1689 TemplateKWLoc, *TemplateArgs,
1690 E->getTrailingObjects<TemplateArgumentLoc>(), TemplateArgDeps);
1691 if (TemplateArgDeps & TemplateArgumentDependence::Instantiation)
1692 Deps |= ExprDependence::Instantiation;
1693 } else if (TemplateKWLoc.isValid()) {
1694 E->getTrailingObjects<ASTTemplateKWAndArgsInfo>()->initializeFrom(
1695 TemplateKWLoc);
1696 }
1697 E->setDependence(Deps);
1698
1699 return E;
1700}
1701
1702MemberExpr *MemberExpr::CreateEmpty(const ASTContext &Context,
1703 bool HasQualifier, bool HasFoundDecl,
1704 bool HasTemplateKWAndArgsInfo,
1705 unsigned NumTemplateArgs) {
1706 assert((!NumTemplateArgs || HasTemplateKWAndArgsInfo) &&(static_cast <bool> ((!NumTemplateArgs || HasTemplateKWAndArgsInfo
) && "template args but no template arg info?") ? void
(0) : __assert_fail ("(!NumTemplateArgs || HasTemplateKWAndArgsInfo) && \"template args but no template arg info?\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1707, __extension__ __PRETTY_FUNCTION__))
1707 "template args but no template arg info?")(static_cast <bool> ((!NumTemplateArgs || HasTemplateKWAndArgsInfo
) && "template args but no template arg info?") ? void
(0) : __assert_fail ("(!NumTemplateArgs || HasTemplateKWAndArgsInfo) && \"template args but no template arg info?\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1707, __extension__ __PRETTY_FUNCTION__))
;
1708 bool HasQualOrFound = HasQualifier || HasFoundDecl;
1709 std::size_t Size =
1710 totalSizeToAlloc<MemberExprNameQualifier, ASTTemplateKWAndArgsInfo,
1711 TemplateArgumentLoc>(HasQualOrFound ? 1 : 0,
1712 HasTemplateKWAndArgsInfo ? 1 : 0,
1713 NumTemplateArgs);
1714 void *Mem = Context.Allocate(Size, alignof(MemberExpr));
1715 return new (Mem) MemberExpr(EmptyShell());
1716}
1717
1718void MemberExpr::setMemberDecl(ValueDecl *NewD) {
1719 MemberDecl = NewD;
1720 if (getType()->isUndeducedType())
1721 setType(NewD->getType());
1722 setDependence(computeDependence(this));
1723}
1724
1725SourceLocation MemberExpr::getBeginLoc() const {
1726 if (isImplicitAccess()) {
1727 if (hasQualifier())
1728 return getQualifierLoc().getBeginLoc();
1729 return MemberLoc;
1730 }
1731
1732 // FIXME: We don't want this to happen. Rather, we should be able to
1733 // detect all kinds of implicit accesses more cleanly.
1734 SourceLocation BaseStartLoc = getBase()->getBeginLoc();
1735 if (BaseStartLoc.isValid())
1736 return BaseStartLoc;
1737 return MemberLoc;
1738}
1739SourceLocation MemberExpr::getEndLoc() const {
1740 SourceLocation EndLoc = getMemberNameInfo().getEndLoc();
1741 if (hasExplicitTemplateArgs())
1742 EndLoc = getRAngleLoc();
1743 else if (EndLoc.isInvalid())
1744 EndLoc = getBase()->getEndLoc();
1745 return EndLoc;
1746}
1747
1748bool CastExpr::CastConsistency() const {
1749 switch (getCastKind()) {
1750 case CK_DerivedToBase:
1751 case CK_UncheckedDerivedToBase:
1752 case CK_DerivedToBaseMemberPointer:
1753 case CK_BaseToDerived:
1754 case CK_BaseToDerivedMemberPointer:
1755 assert(!path_empty() && "Cast kind should have a base path!")(static_cast <bool> (!path_empty() && "Cast kind should have a base path!"
) ? void (0) : __assert_fail ("!path_empty() && \"Cast kind should have a base path!\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1755, __extension__ __PRETTY_FUNCTION__))
;
1756 break;
1757
1758 case CK_CPointerToObjCPointerCast:
1759 assert(getType()->isObjCObjectPointerType())(static_cast <bool> (getType()->isObjCObjectPointerType
()) ? void (0) : __assert_fail ("getType()->isObjCObjectPointerType()"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1759, __extension__ __PRETTY_FUNCTION__))
;
1760 assert(getSubExpr()->getType()->isPointerType())(static_cast <bool> (getSubExpr()->getType()->isPointerType
()) ? void (0) : __assert_fail ("getSubExpr()->getType()->isPointerType()"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1760, __extension__ __PRETTY_FUNCTION__))
;
1761 goto CheckNoBasePath;
1762
1763 case CK_BlockPointerToObjCPointerCast:
1764 assert(getType()->isObjCObjectPointerType())(static_cast <bool> (getType()->isObjCObjectPointerType
()) ? void (0) : __assert_fail ("getType()->isObjCObjectPointerType()"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1764, __extension__ __PRETTY_FUNCTION__))
;
1765 assert(getSubExpr()->getType()->isBlockPointerType())(static_cast <bool> (getSubExpr()->getType()->isBlockPointerType
()) ? void (0) : __assert_fail ("getSubExpr()->getType()->isBlockPointerType()"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1765, __extension__ __PRETTY_FUNCTION__))
;
1766 goto CheckNoBasePath;
1767
1768 case CK_ReinterpretMemberPointer:
1769 assert(getType()->isMemberPointerType())(static_cast <bool> (getType()->isMemberPointerType(
)) ? void (0) : __assert_fail ("getType()->isMemberPointerType()"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1769, __extension__ __PRETTY_FUNCTION__))
;
1770 assert(getSubExpr()->getType()->isMemberPointerType())(static_cast <bool> (getSubExpr()->getType()->isMemberPointerType
()) ? void (0) : __assert_fail ("getSubExpr()->getType()->isMemberPointerType()"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1770, __extension__ __PRETTY_FUNCTION__))
;
1771 goto CheckNoBasePath;
1772
1773 case CK_BitCast:
1774 // Arbitrary casts to C pointer types count as bitcasts.
1775 // Otherwise, we should only have block and ObjC pointer casts
1776 // here if they stay within the type kind.
1777 if (!getType()->isPointerType()) {
1778 assert(getType()->isObjCObjectPointerType() ==(static_cast <bool> (getType()->isObjCObjectPointerType
() == getSubExpr()->getType()->isObjCObjectPointerType(
)) ? void (0) : __assert_fail ("getType()->isObjCObjectPointerType() == getSubExpr()->getType()->isObjCObjectPointerType()"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1779, __extension__ __PRETTY_FUNCTION__))
1779 getSubExpr()->getType()->isObjCObjectPointerType())(static_cast <bool> (getType()->isObjCObjectPointerType
() == getSubExpr()->getType()->isObjCObjectPointerType(
)) ? void (0) : __assert_fail ("getType()->isObjCObjectPointerType() == getSubExpr()->getType()->isObjCObjectPointerType()"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1779, __extension__ __PRETTY_FUNCTION__))
;
1780 assert(getType()->isBlockPointerType() ==(static_cast <bool> (getType()->isBlockPointerType()
== getSubExpr()->getType()->isBlockPointerType()) ? void
(0) : __assert_fail ("getType()->isBlockPointerType() == getSubExpr()->getType()->isBlockPointerType()"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1781, __extension__ __PRETTY_FUNCTION__))
1781 getSubExpr()->getType()->isBlockPointerType())(static_cast <bool> (getType()->isBlockPointerType()
== getSubExpr()->getType()->isBlockPointerType()) ? void
(0) : __assert_fail ("getType()->isBlockPointerType() == getSubExpr()->getType()->isBlockPointerType()"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1781, __extension__ __PRETTY_FUNCTION__))
;
1782 }
1783 goto CheckNoBasePath;
1784
1785 case CK_AnyPointerToBlockPointerCast:
1786 assert(getType()->isBlockPointerType())(static_cast <bool> (getType()->isBlockPointerType()
) ? void (0) : __assert_fail ("getType()->isBlockPointerType()"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1786, __extension__ __PRETTY_FUNCTION__))
;
1787 assert(getSubExpr()->getType()->isAnyPointerType() &&(static_cast <bool> (getSubExpr()->getType()->isAnyPointerType
() && !getSubExpr()->getType()->isBlockPointerType
()) ? void (0) : __assert_fail ("getSubExpr()->getType()->isAnyPointerType() && !getSubExpr()->getType()->isBlockPointerType()"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1788, __extension__ __PRETTY_FUNCTION__))
1788 !getSubExpr()->getType()->isBlockPointerType())(static_cast <bool> (getSubExpr()->getType()->isAnyPointerType
() && !getSubExpr()->getType()->isBlockPointerType
()) ? void (0) : __assert_fail ("getSubExpr()->getType()->isAnyPointerType() && !getSubExpr()->getType()->isBlockPointerType()"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1788, __extension__ __PRETTY_FUNCTION__))
;
1789 goto CheckNoBasePath;
1790
1791 case CK_CopyAndAutoreleaseBlockObject:
1792 assert(getType()->isBlockPointerType())(static_cast <bool> (getType()->isBlockPointerType()
) ? void (0) : __assert_fail ("getType()->isBlockPointerType()"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1792, __extension__ __PRETTY_FUNCTION__))
;
1793 assert(getSubExpr()->getType()->isBlockPointerType())(static_cast <bool> (getSubExpr()->getType()->isBlockPointerType
()) ? void (0) : __assert_fail ("getSubExpr()->getType()->isBlockPointerType()"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1793, __extension__ __PRETTY_FUNCTION__))
;
1794 goto CheckNoBasePath;
1795
1796 case CK_FunctionToPointerDecay:
1797 assert(getType()->isPointerType())(static_cast <bool> (getType()->isPointerType()) ? void
(0) : __assert_fail ("getType()->isPointerType()", "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1797, __extension__ __PRETTY_FUNCTION__))
;
1798 assert(getSubExpr()->getType()->isFunctionType())(static_cast <bool> (getSubExpr()->getType()->isFunctionType
()) ? void (0) : __assert_fail ("getSubExpr()->getType()->isFunctionType()"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1798, __extension__ __PRETTY_FUNCTION__))
;
1799 goto CheckNoBasePath;
1800
1801 case CK_AddressSpaceConversion: {
1802 auto Ty = getType();
1803 auto SETy = getSubExpr()->getType();
1804 assert(getValueKindForType(Ty) == Expr::getValueKindForType(SETy))(static_cast <bool> (getValueKindForType(Ty) == Expr::getValueKindForType
(SETy)) ? void (0) : __assert_fail ("getValueKindForType(Ty) == Expr::getValueKindForType(SETy)"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1804, __extension__ __PRETTY_FUNCTION__))
;
1805 if (isPRValue() && !Ty->isDependentType() && !SETy->isDependentType()) {
1806 Ty = Ty->getPointeeType();
1807 SETy = SETy->getPointeeType();
1808 }
1809 assert((Ty->isDependentType() || SETy->isDependentType()) ||(static_cast <bool> ((Ty->isDependentType() || SETy->
isDependentType()) || (!Ty.isNull() && !SETy.isNull()
&& Ty.getAddressSpace() != SETy.getAddressSpace())) ?
void (0) : __assert_fail ("(Ty->isDependentType() || SETy->isDependentType()) || (!Ty.isNull() && !SETy.isNull() && Ty.getAddressSpace() != SETy.getAddressSpace())"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1811, __extension__ __PRETTY_FUNCTION__))
1810 (!Ty.isNull() && !SETy.isNull() &&(static_cast <bool> ((Ty->isDependentType() || SETy->
isDependentType()) || (!Ty.isNull() && !SETy.isNull()
&& Ty.getAddressSpace() != SETy.getAddressSpace())) ?
void (0) : __assert_fail ("(Ty->isDependentType() || SETy->isDependentType()) || (!Ty.isNull() && !SETy.isNull() && Ty.getAddressSpace() != SETy.getAddressSpace())"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1811, __extension__ __PRETTY_FUNCTION__))
1811 Ty.getAddressSpace() != SETy.getAddressSpace()))(static_cast <bool> ((Ty->isDependentType() || SETy->
isDependentType()) || (!Ty.isNull() && !SETy.isNull()
&& Ty.getAddressSpace() != SETy.getAddressSpace())) ?
void (0) : __assert_fail ("(Ty->isDependentType() || SETy->isDependentType()) || (!Ty.isNull() && !SETy.isNull() && Ty.getAddressSpace() != SETy.getAddressSpace())"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1811, __extension__ __PRETTY_FUNCTION__))
;
1812 goto CheckNoBasePath;
1813 }
1814 // These should not have an inheritance path.
1815 case CK_Dynamic:
1816 case CK_ToUnion:
1817 case CK_ArrayToPointerDecay:
1818 case CK_NullToMemberPointer:
1819 case CK_NullToPointer:
1820 case CK_ConstructorConversion:
1821 case CK_IntegralToPointer:
1822 case CK_PointerToIntegral:
1823 case CK_ToVoid:
1824 case CK_VectorSplat:
1825 case CK_IntegralCast:
1826 case CK_BooleanToSignedIntegral:
1827 case CK_IntegralToFloating:
1828 case CK_FloatingToIntegral:
1829 case CK_FloatingCast:
1830 case CK_ObjCObjectLValueCast:
1831 case CK_FloatingRealToComplex:
1832 case CK_FloatingComplexToReal:
1833 case CK_FloatingComplexCast:
1834 case CK_FloatingComplexToIntegralComplex:
1835 case CK_IntegralRealToComplex:
1836 case CK_IntegralComplexToReal:
1837 case CK_IntegralComplexCast:
1838 case CK_IntegralComplexToFloatingComplex:
1839 case CK_ARCProduceObject:
1840 case CK_ARCConsumeObject:
1841 case CK_ARCReclaimReturnedObject:
1842 case CK_ARCExtendBlockObject:
1843 case CK_ZeroToOCLOpaqueType:
1844 case CK_IntToOCLSampler:
1845 case CK_FloatingToFixedPoint:
1846 case CK_FixedPointToFloating:
1847 case CK_FixedPointCast:
1848 case CK_FixedPointToIntegral:
1849 case CK_IntegralToFixedPoint:
1850 case CK_MatrixCast:
1851 assert(!getType()->isBooleanType() && "unheralded conversion to bool")(static_cast <bool> (!getType()->isBooleanType() &&
"unheralded conversion to bool") ? void (0) : __assert_fail (
"!getType()->isBooleanType() && \"unheralded conversion to bool\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1851, __extension__ __PRETTY_FUNCTION__))
;
1852 goto CheckNoBasePath;
1853
1854 case CK_Dependent:
1855 case CK_LValueToRValue:
1856 case CK_NoOp:
1857 case CK_AtomicToNonAtomic:
1858 case CK_NonAtomicToAtomic:
1859 case CK_PointerToBoolean:
1860 case CK_IntegralToBoolean:
1861 case CK_FloatingToBoolean:
1862 case CK_MemberPointerToBoolean:
1863 case CK_FloatingComplexToBoolean:
1864 case CK_IntegralComplexToBoolean:
1865 case CK_LValueBitCast: // -> bool&
1866 case CK_LValueToRValueBitCast:
1867 case CK_UserDefinedConversion: // operator bool()
1868 case CK_BuiltinFnToFnPtr:
1869 case CK_FixedPointToBoolean:
1870 CheckNoBasePath:
1871 assert(path_empty() && "Cast kind should not have a base path!")(static_cast <bool> (path_empty() && "Cast kind should not have a base path!"
) ? void (0) : __assert_fail ("path_empty() && \"Cast kind should not have a base path!\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1871, __extension__ __PRETTY_FUNCTION__))
;
1872 break;
1873 }
1874 return true;
1875}
1876
1877const char *CastExpr::getCastKindName(CastKind CK) {
1878 switch (CK) {
1879#define CAST_OPERATION(Name) case CK_##Name: return #Name;
1880#include "clang/AST/OperationKinds.def"
1881 }
1882 llvm_unreachable("Unhandled cast kind!")::llvm::llvm_unreachable_internal("Unhandled cast kind!", "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1882)
;
1883}
1884
1885namespace {
1886 const Expr *skipImplicitTemporary(const Expr *E) {
1887 // Skip through reference binding to temporary.
1888 if (auto *Materialize = dyn_cast<MaterializeTemporaryExpr>(E))
1889 E = Materialize->getSubExpr();
1890
1891 // Skip any temporary bindings; they're implicit.
1892 if (auto *Binder = dyn_cast<CXXBindTemporaryExpr>(E))
1893 E = Binder->getSubExpr();
1894
1895 return E;
1896 }
1897}
1898
1899Expr *CastExpr::getSubExprAsWritten() {
1900 const Expr *SubExpr = nullptr;
1901 const CastExpr *E = this;
1902 do {
1903 SubExpr = skipImplicitTemporary(E->getSubExpr());
1904
1905 // Conversions by constructor and conversion functions have a
1906 // subexpression describing the call; strip it off.
1907 if (E->getCastKind() == CK_ConstructorConversion)
1908 SubExpr =
1909 skipImplicitTemporary(cast<CXXConstructExpr>(SubExpr->IgnoreImplicit())->getArg(0));
1910 else if (E->getCastKind() == CK_UserDefinedConversion) {
1911 SubExpr = SubExpr->IgnoreImplicit();
1912 assert((isa<CXXMemberCallExpr>(SubExpr) ||(static_cast <bool> ((isa<CXXMemberCallExpr>(SubExpr
) || isa<BlockExpr>(SubExpr)) && "Unexpected SubExpr for CK_UserDefinedConversion."
) ? void (0) : __assert_fail ("(isa<CXXMemberCallExpr>(SubExpr) || isa<BlockExpr>(SubExpr)) && \"Unexpected SubExpr for CK_UserDefinedConversion.\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1914, __extension__ __PRETTY_FUNCTION__))
1913 isa<BlockExpr>(SubExpr)) &&(static_cast <bool> ((isa<CXXMemberCallExpr>(SubExpr
) || isa<BlockExpr>(SubExpr)) && "Unexpected SubExpr for CK_UserDefinedConversion."
) ? void (0) : __assert_fail ("(isa<CXXMemberCallExpr>(SubExpr) || isa<BlockExpr>(SubExpr)) && \"Unexpected SubExpr for CK_UserDefinedConversion.\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1914, __extension__ __PRETTY_FUNCTION__))
1914 "Unexpected SubExpr for CK_UserDefinedConversion.")(static_cast <bool> ((isa<CXXMemberCallExpr>(SubExpr
) || isa<BlockExpr>(SubExpr)) && "Unexpected SubExpr for CK_UserDefinedConversion."
) ? void (0) : __assert_fail ("(isa<CXXMemberCallExpr>(SubExpr) || isa<BlockExpr>(SubExpr)) && \"Unexpected SubExpr for CK_UserDefinedConversion.\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1914, __extension__ __PRETTY_FUNCTION__))
;
1915 if (auto *MCE = dyn_cast<CXXMemberCallExpr>(SubExpr))
1916 SubExpr = MCE->getImplicitObjectArgument();
1917 }
1918
1919 // If the subexpression we're left with is an implicit cast, look
1920 // through that, too.
1921 } while ((E = dyn_cast<ImplicitCastExpr>(SubExpr)));
1922
1923 return const_cast<Expr*>(SubExpr);
1924}
1925
1926NamedDecl *CastExpr::getConversionFunction() const {
1927 const Expr *SubExpr = nullptr;
1928
1929 for (const CastExpr *E = this; E; E = dyn_cast<ImplicitCastExpr>(SubExpr)) {
1930 SubExpr = skipImplicitTemporary(E->getSubExpr());
1931
1932 if (E->getCastKind() == CK_ConstructorConversion)
1933 return cast<CXXConstructExpr>(SubExpr)->getConstructor();
1934
1935 if (E->getCastKind() == CK_UserDefinedConversion) {
1936 if (auto *MCE = dyn_cast<CXXMemberCallExpr>(SubExpr))
1937 return MCE->getMethodDecl();
1938 }
1939 }
1940
1941 return nullptr;
1942}
1943
1944CXXBaseSpecifier **CastExpr::path_buffer() {
1945 switch (getStmtClass()) {
1946#define ABSTRACT_STMT(x)
1947#define CASTEXPR(Type, Base) \
1948 case Stmt::Type##Class: \
1949 return static_cast<Type *>(this)->getTrailingObjects<CXXBaseSpecifier *>();
1950#define STMT(Type, Base)
1951#include "clang/AST/StmtNodes.inc"
1952 default:
1953 llvm_unreachable("non-cast expressions not possible here")::llvm::llvm_unreachable_internal("non-cast expressions not possible here"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1953)
;
1954 }
1955}
1956
1957const FieldDecl *CastExpr::getTargetFieldForToUnionCast(QualType unionType,
1958 QualType opType) {
1959 auto RD = unionType->castAs<RecordType>()->getDecl();
1960 return getTargetFieldForToUnionCast(RD, opType);
1961}
1962
1963const FieldDecl *CastExpr::getTargetFieldForToUnionCast(const RecordDecl *RD,
1964 QualType OpType) {
1965 auto &Ctx = RD->getASTContext();
1966 RecordDecl::field_iterator Field, FieldEnd;
1967 for (Field = RD->field_begin(), FieldEnd = RD->field_end();
1968 Field != FieldEnd; ++Field) {
1969 if (Ctx.hasSameUnqualifiedType(Field->getType(), OpType) &&
1970 !Field->isUnnamedBitfield()) {
1971 return *Field;
1972 }
1973 }
1974 return nullptr;
1975}
1976
1977FPOptionsOverride *CastExpr::getTrailingFPFeatures() {
1978 assert(hasStoredFPFeatures())(static_cast <bool> (hasStoredFPFeatures()) ? void (0) :
__assert_fail ("hasStoredFPFeatures()", "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1978, __extension__ __PRETTY_FUNCTION__))
;
1979 switch (getStmtClass()) {
1980 case ImplicitCastExprClass:
1981 return static_cast<ImplicitCastExpr *>(this)
1982 ->getTrailingObjects<FPOptionsOverride>();
1983 case CStyleCastExprClass:
1984 return static_cast<CStyleCastExpr *>(this)
1985 ->getTrailingObjects<FPOptionsOverride>();
1986 case CXXFunctionalCastExprClass:
1987 return static_cast<CXXFunctionalCastExpr *>(this)
1988 ->getTrailingObjects<FPOptionsOverride>();
1989 case CXXStaticCastExprClass:
1990 return static_cast<CXXStaticCastExpr *>(this)
1991 ->getTrailingObjects<FPOptionsOverride>();
1992 default:
1993 llvm_unreachable("Cast does not have FPFeatures")::llvm::llvm_unreachable_internal("Cast does not have FPFeatures"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 1993)
;
1994 }
1995}
1996
1997ImplicitCastExpr *ImplicitCastExpr::Create(const ASTContext &C, QualType T,
1998 CastKind Kind, Expr *Operand,
1999 const CXXCastPath *BasePath,
2000 ExprValueKind VK,
2001 FPOptionsOverride FPO) {
2002 unsigned PathSize = (BasePath ? BasePath->size() : 0);
2003 void *Buffer =
2004 C.Allocate(totalSizeToAlloc<CXXBaseSpecifier *, FPOptionsOverride>(
2005 PathSize, FPO.requiresTrailingStorage()));
2006 // Per C++ [conv.lval]p3, lvalue-to-rvalue conversions on class and
2007 // std::nullptr_t have special semantics not captured by CK_LValueToRValue.
2008 assert((Kind != CK_LValueToRValue ||(static_cast <bool> ((Kind != CK_LValueToRValue || !(T->
isNullPtrType() || T->getAsCXXRecordDecl())) && "invalid type for lvalue-to-rvalue conversion"
) ? void (0) : __assert_fail ("(Kind != CK_LValueToRValue || !(T->isNullPtrType() || T->getAsCXXRecordDecl())) && \"invalid type for lvalue-to-rvalue conversion\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 2010, __extension__ __PRETTY_FUNCTION__))
2009 !(T->isNullPtrType() || T->getAsCXXRecordDecl())) &&(static_cast <bool> ((Kind != CK_LValueToRValue || !(T->
isNullPtrType() || T->getAsCXXRecordDecl())) && "invalid type for lvalue-to-rvalue conversion"
) ? void (0) : __assert_fail ("(Kind != CK_LValueToRValue || !(T->isNullPtrType() || T->getAsCXXRecordDecl())) && \"invalid type for lvalue-to-rvalue conversion\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 2010, __extension__ __PRETTY_FUNCTION__))
2010 "invalid type for lvalue-to-rvalue conversion")(static_cast <bool> ((Kind != CK_LValueToRValue || !(T->
isNullPtrType() || T->getAsCXXRecordDecl())) && "invalid type for lvalue-to-rvalue conversion"
) ? void (0) : __assert_fail ("(Kind != CK_LValueToRValue || !(T->isNullPtrType() || T->getAsCXXRecordDecl())) && \"invalid type for lvalue-to-rvalue conversion\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 2010, __extension__ __PRETTY_FUNCTION__))
;
2011 ImplicitCastExpr *E =
2012 new (Buffer) ImplicitCastExpr(T, Kind, Operand, PathSize, FPO, VK);
2013 if (PathSize)
2014 std::uninitialized_copy_n(BasePath->data(), BasePath->size(),
2015 E->getTrailingObjects<CXXBaseSpecifier *>());
2016 return E;
2017}
2018
2019ImplicitCastExpr *ImplicitCastExpr::CreateEmpty(const ASTContext &C,
2020 unsigned PathSize,
2021 bool HasFPFeatures) {
2022 void *Buffer =
2023 C.Allocate(totalSizeToAlloc<CXXBaseSpecifier *, FPOptionsOverride>(
2024 PathSize, HasFPFeatures));
2025 return new (Buffer) ImplicitCastExpr(EmptyShell(), PathSize, HasFPFeatures);
2026}
2027
2028CStyleCastExpr *CStyleCastExpr::Create(const ASTContext &C, QualType T,
2029 ExprValueKind VK, CastKind K, Expr *Op,
2030 const CXXCastPath *BasePath,
2031 FPOptionsOverride FPO,
2032 TypeSourceInfo *WrittenTy,
2033 SourceLocation L, SourceLocation R) {
2034 unsigned PathSize = (BasePath ? BasePath->size() : 0);
2035 void *Buffer =
2036 C.Allocate(totalSizeToAlloc<CXXBaseSpecifier *, FPOptionsOverride>(
2037 PathSize, FPO.requiresTrailingStorage()));
2038 CStyleCastExpr *E =
2039 new (Buffer) CStyleCastExpr(T, VK, K, Op, PathSize, FPO, WrittenTy, L, R);
2040 if (PathSize)
2041 std::uninitialized_copy_n(BasePath->data(), BasePath->size(),
2042 E->getTrailingObjects<CXXBaseSpecifier *>());
2043 return E;
2044}
2045
2046CStyleCastExpr *CStyleCastExpr::CreateEmpty(const ASTContext &C,
2047 unsigned PathSize,
2048 bool HasFPFeatures) {
2049 void *Buffer =
2050 C.Allocate(totalSizeToAlloc<CXXBaseSpecifier *, FPOptionsOverride>(
2051 PathSize, HasFPFeatures));
2052 return new (Buffer) CStyleCastExpr(EmptyShell(), PathSize, HasFPFeatures);
2053}
2054
2055/// getOpcodeStr - Turn an Opcode enum value into the punctuation char it
2056/// corresponds to, e.g. "<<=".
2057StringRef BinaryOperator::getOpcodeStr(Opcode Op) {
2058 switch (Op) {
2059#define BINARY_OPERATION(Name, Spelling) case BO_##Name: return Spelling;
2060#include "clang/AST/OperationKinds.def"
2061 }
2062 llvm_unreachable("Invalid OpCode!")::llvm::llvm_unreachable_internal("Invalid OpCode!", "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 2062)
;
2063}
2064
2065BinaryOperatorKind
2066BinaryOperator::getOverloadedOpcode(OverloadedOperatorKind OO) {
2067 switch (OO) {
2068 default: llvm_unreachable("Not an overloadable binary operator")::llvm::llvm_unreachable_internal("Not an overloadable binary operator"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 2068)
;
2069 case OO_Plus: return BO_Add;
2070 case OO_Minus: return BO_Sub;
2071 case OO_Star: return BO_Mul;
2072 case OO_Slash: return BO_Div;
2073 case OO_Percent: return BO_Rem;
2074 case OO_Caret: return BO_Xor;
2075 case OO_Amp: return BO_And;
2076 case OO_Pipe: return BO_Or;
2077 case OO_Equal: return BO_Assign;
2078 case OO_Spaceship: return BO_Cmp;
2079 case OO_Less: return BO_LT;
2080 case OO_Greater: return BO_GT;
2081 case OO_PlusEqual: return BO_AddAssign;
2082 case OO_MinusEqual: return BO_SubAssign;
2083 case OO_StarEqual: return BO_MulAssign;
2084 case OO_SlashEqual: return BO_DivAssign;
2085 case OO_PercentEqual: return BO_RemAssign;
2086 case OO_CaretEqual: return BO_XorAssign;
2087 case OO_AmpEqual: return BO_AndAssign;
2088 case OO_PipeEqual: return BO_OrAssign;
2089 case OO_LessLess: return BO_Shl;
2090 case OO_GreaterGreater: return BO_Shr;
2091 case OO_LessLessEqual: return BO_ShlAssign;
2092 case OO_GreaterGreaterEqual: return BO_ShrAssign;
2093 case OO_EqualEqual: return BO_EQ;
2094 case OO_ExclaimEqual: return BO_NE;
2095 case OO_LessEqual: return BO_LE;
2096 case OO_GreaterEqual: return BO_GE;
2097 case OO_AmpAmp: return BO_LAnd;
2098 case OO_PipePipe: return BO_LOr;
2099 case OO_Comma: return BO_Comma;
2100 case OO_ArrowStar: return BO_PtrMemI;
2101 }
2102}
2103
2104OverloadedOperatorKind BinaryOperator::getOverloadedOperator(Opcode Opc) {
2105 static const OverloadedOperatorKind OverOps[] = {
2106 /* .* Cannot be overloaded */OO_None, OO_ArrowStar,
2107 OO_Star, OO_Slash, OO_Percent,
2108 OO_Plus, OO_Minus,
2109 OO_LessLess, OO_GreaterGreater,
2110 OO_Spaceship,
2111 OO_Less, OO_Greater, OO_LessEqual, OO_GreaterEqual,
2112 OO_EqualEqual, OO_ExclaimEqual,
2113 OO_Amp,
2114 OO_Caret,
2115 OO_Pipe,
2116 OO_AmpAmp,
2117 OO_PipePipe,
2118 OO_Equal, OO_StarEqual,
2119 OO_SlashEqual, OO_PercentEqual,
2120 OO_PlusEqual, OO_MinusEqual,
2121 OO_LessLessEqual, OO_GreaterGreaterEqual,
2122 OO_AmpEqual, OO_CaretEqual,
2123 OO_PipeEqual,
2124 OO_Comma
2125 };
2126 return OverOps[Opc];
2127}
2128
2129bool BinaryOperator::isNullPointerArithmeticExtension(ASTContext &Ctx,
2130 Opcode Opc,
2131 Expr *LHS, Expr *RHS) {
2132 if (Opc != BO_Add)
2133 return false;
2134
2135 // Check that we have one pointer and one integer operand.
2136 Expr *PExp;
2137 if (LHS->getType()->isPointerType()) {
2138 if (!RHS->getType()->isIntegerType())
2139 return false;
2140 PExp = LHS;
2141 } else if (RHS->getType()->isPointerType()) {
2142 if (!LHS->getType()->isIntegerType())
2143 return false;
2144 PExp = RHS;
2145 } else {
2146 return false;
2147 }
2148
2149 // Check that the pointer is a nullptr.
2150 if (!PExp->IgnoreParenCasts()
2151 ->isNullPointerConstant(Ctx, Expr::NPC_ValueDependentIsNotNull))
2152 return false;
2153
2154 // Check that the pointee type is char-sized.
2155 const PointerType *PTy = PExp->getType()->getAs<PointerType>();
2156 if (!PTy || !PTy->getPointeeType()->isCharType())
2157 return false;
2158
2159 return true;
2160}
2161
2162static QualType getDecayedSourceLocExprType(const ASTContext &Ctx,
2163 SourceLocExpr::IdentKind Kind) {
2164 switch (Kind) {
2165 case SourceLocExpr::File:
2166 case SourceLocExpr::Function: {
2167 QualType ArrTy = Ctx.getStringLiteralArrayType(Ctx.CharTy, 0);
2168 return Ctx.getPointerType(ArrTy->getAsArrayTypeUnsafe()->getElementType());
2169 }
2170 case SourceLocExpr::Line:
2171 case SourceLocExpr::Column:
2172 return Ctx.UnsignedIntTy;
2173 }
2174 llvm_unreachable("unhandled case")::llvm::llvm_unreachable_internal("unhandled case", "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 2174)
;
2175}
2176
2177SourceLocExpr::SourceLocExpr(const ASTContext &Ctx, IdentKind Kind,
2178 SourceLocation BLoc, SourceLocation RParenLoc,
2179 DeclContext *ParentContext)
2180 : Expr(SourceLocExprClass, getDecayedSourceLocExprType(Ctx, Kind),
2181 VK_PRValue, OK_Ordinary),
2182 BuiltinLoc(BLoc), RParenLoc(RParenLoc), ParentContext(ParentContext) {
2183 SourceLocExprBits.Kind = Kind;
2184 setDependence(ExprDependence::None);
2185}
2186
2187StringRef SourceLocExpr::getBuiltinStr() const {
2188 switch (getIdentKind()) {
2189 case File:
2190 return "__builtin_FILE";
2191 case Function:
2192 return "__builtin_FUNCTION";
2193 case Line:
2194 return "__builtin_LINE";
2195 case Column:
2196 return "__builtin_COLUMN";
2197 }
2198 llvm_unreachable("unexpected IdentKind!")::llvm::llvm_unreachable_internal("unexpected IdentKind!", "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 2198)
;
2199}
2200
2201APValue SourceLocExpr::EvaluateInContext(const ASTContext &Ctx,
2202 const Expr *DefaultExpr) const {
2203 SourceLocation Loc;
2204 const DeclContext *Context;
2205
2206 std::tie(Loc,
2207 Context) = [&]() -> std::pair<SourceLocation, const DeclContext *> {
2208 if (auto *DIE = dyn_cast_or_null<CXXDefaultInitExpr>(DefaultExpr))
2209 return {DIE->getUsedLocation(), DIE->getUsedContext()};
2210 if (auto *DAE = dyn_cast_or_null<CXXDefaultArgExpr>(DefaultExpr))
2211 return {DAE->getUsedLocation(), DAE->getUsedContext()};
2212 return {this->getLocation(), this->getParentContext()};
2213 }();
2214
2215 PresumedLoc PLoc = Ctx.getSourceManager().getPresumedLoc(
2216 Ctx.getSourceManager().getExpansionRange(Loc).getEnd());
2217
2218 auto MakeStringLiteral = [&](StringRef Tmp) {
2219 using LValuePathEntry = APValue::LValuePathEntry;
2220 StringLiteral *Res = Ctx.getPredefinedStringLiteralFromCache(Tmp);
2221 // Decay the string to a pointer to the first character.
2222 LValuePathEntry Path[1] = {LValuePathEntry::ArrayIndex(0)};
2223 return APValue(Res, CharUnits::Zero(), Path, /*OnePastTheEnd=*/false);
2224 };
2225
2226 switch (getIdentKind()) {
2227 case SourceLocExpr::File: {
2228 SmallString<256> Path(PLoc.getFilename());
2229 Ctx.getLangOpts().remapPathPrefix(Path);
2230 return MakeStringLiteral(Path);
2231 }
2232 case SourceLocExpr::Function: {
2233 const Decl *CurDecl = dyn_cast_or_null<Decl>(Context);
2234 return MakeStringLiteral(
2235 CurDecl ? PredefinedExpr::ComputeName(PredefinedExpr::Function, CurDecl)
2236 : std::string(""));
2237 }
2238 case SourceLocExpr::Line:
2239 case SourceLocExpr::Column: {
2240 llvm::APSInt IntVal(Ctx.getIntWidth(Ctx.UnsignedIntTy),
2241 /*isUnsigned=*/true);
2242 IntVal = getIdentKind() == SourceLocExpr::Line ? PLoc.getLine()
2243 : PLoc.getColumn();
2244 return APValue(IntVal);
2245 }
2246 }
2247 llvm_unreachable("unhandled case")::llvm::llvm_unreachable_internal("unhandled case", "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 2247)
;
2248}
2249
2250InitListExpr::InitListExpr(const ASTContext &C, SourceLocation lbraceloc,
2251 ArrayRef<Expr *> initExprs, SourceLocation rbraceloc)
2252 : Expr(InitListExprClass, QualType(), VK_PRValue, OK_Ordinary),
2253 InitExprs(C, initExprs.size()), LBraceLoc(lbraceloc),
2254 RBraceLoc(rbraceloc), AltForm(nullptr, true) {
2255 sawArrayRangeDesignator(false);
2256 InitExprs.insert(C, InitExprs.end(), initExprs.begin(), initExprs.end());
2257
2258 setDependence(computeDependence(this));
2259}
2260
2261void InitListExpr::reserveInits(const ASTContext &C, unsigned NumInits) {
2262 if (NumInits > InitExprs.size())
2263 InitExprs.reserve(C, NumInits);
2264}
2265
2266void InitListExpr::resizeInits(const ASTContext &C, unsigned NumInits) {
2267 InitExprs.resize(C, NumInits, nullptr);
2268}
2269
2270Expr *InitListExpr::updateInit(const ASTContext &C, unsigned Init, Expr *expr) {
2271 if (Init >= InitExprs.size()) {
2272 InitExprs.insert(C, InitExprs.end(), Init - InitExprs.size() + 1, nullptr);
2273 setInit(Init, expr);
2274 return nullptr;
2275 }
2276
2277 Expr *Result = cast_or_null<Expr>(InitExprs[Init]);
2278 setInit(Init, expr);
2279 return Result;
2280}
2281
2282void InitListExpr::setArrayFiller(Expr *filler) {
2283 assert(!hasArrayFiller() && "Filler already set!")(static_cast <bool> (!hasArrayFiller() && "Filler already set!"
) ? void (0) : __assert_fail ("!hasArrayFiller() && \"Filler already set!\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 2283, __extension__ __PRETTY_FUNCTION__))
;
2284 ArrayFillerOrUnionFieldInit = filler;
2285 // Fill out any "holes" in the array due to designated initializers.
2286 Expr **inits = getInits();
2287 for (unsigned i = 0, e = getNumInits(); i != e; ++i)
2288 if (inits[i] == nullptr)
2289 inits[i] = filler;
2290}
2291
2292bool InitListExpr::isStringLiteralInit() const {
2293 if (getNumInits() != 1)
2294 return false;
2295 const ArrayType *AT = getType()->getAsArrayTypeUnsafe();
2296 if (!AT || !AT->getElementType()->isIntegerType())
2297 return false;
2298 // It is possible for getInit() to return null.
2299 const Expr *Init = getInit(0);
2300 if (!Init)
2301 return false;
2302 Init = Init->IgnoreParenImpCasts();
2303 return isa<StringLiteral>(Init) || isa<ObjCEncodeExpr>(Init);
2304}
2305
2306bool InitListExpr::isTransparent() const {
2307 assert(isSemanticForm() && "syntactic form never semantically transparent")(static_cast <bool> (isSemanticForm() && "syntactic form never semantically transparent"
) ? void (0) : __assert_fail ("isSemanticForm() && \"syntactic form never semantically transparent\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 2307, __extension__ __PRETTY_FUNCTION__))
;
2308
2309 // A glvalue InitListExpr is always just sugar.
2310 if (isGLValue()) {
2311 assert(getNumInits() == 1 && "multiple inits in glvalue init list")(static_cast <bool> (getNumInits() == 1 && "multiple inits in glvalue init list"
) ? void (0) : __assert_fail ("getNumInits() == 1 && \"multiple inits in glvalue init list\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 2311, __extension__ __PRETTY_FUNCTION__))
;
2312 return true;
2313 }
2314
2315 // Otherwise, we're sugar if and only if we have exactly one initializer that
2316 // is of the same type.
2317 if (getNumInits() != 1 || !getInit(0))
2318 return false;
2319
2320 // Don't confuse aggregate initialization of a struct X { X &x; }; with a
2321 // transparent struct copy.
2322 if (!getInit(0)->isPRValue() && getType()->isRecordType())
2323 return false;
2324
2325 return getType().getCanonicalType() ==
2326 getInit(0)->getType().getCanonicalType();
2327}
2328
2329bool InitListExpr::isIdiomaticZeroInitializer(const LangOptions &LangOpts) const {
2330 assert(isSyntacticForm() && "only test syntactic form as zero initializer")(static_cast <bool> (isSyntacticForm() && "only test syntactic form as zero initializer"
) ? void (0) : __assert_fail ("isSyntacticForm() && \"only test syntactic form as zero initializer\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 2330, __extension__ __PRETTY_FUNCTION__))
;
2331
2332 if (LangOpts.CPlusPlus || getNumInits() != 1 || !getInit(0)) {
2333 return false;
2334 }
2335
2336 const IntegerLiteral *Lit = dyn_cast<IntegerLiteral>(getInit(0)->IgnoreImplicit());
2337 return Lit && Lit->getValue() == 0;
2338}
2339
2340SourceLocation InitListExpr::getBeginLoc() const {
2341 if (InitListExpr *SyntacticForm = getSyntacticForm())
2342 return SyntacticForm->getBeginLoc();
2343 SourceLocation Beg = LBraceLoc;
2344 if (Beg.isInvalid()) {
2345 // Find the first non-null initializer.
2346 for (InitExprsTy::const_iterator I = InitExprs.begin(),
2347 E = InitExprs.end();
2348 I != E; ++I) {
2349 if (Stmt *S = *I) {
2350 Beg = S->getBeginLoc();
2351 break;
2352 }
2353 }
2354 }
2355 return Beg;
2356}
2357
2358SourceLocation InitListExpr::getEndLoc() const {
2359 if (InitListExpr *SyntacticForm = getSyntacticForm())
2360 return SyntacticForm->getEndLoc();
2361 SourceLocation End = RBraceLoc;
2362 if (End.isInvalid()) {
2363 // Find the first non-null initializer from the end.
2364 for (InitExprsTy::const_reverse_iterator I = InitExprs.rbegin(),
2365 E = InitExprs.rend();
2366 I != E; ++I) {
2367 if (Stmt *S = *I) {
2368 End = S->getEndLoc();
2369 break;
2370 }
2371 }
2372 }
2373 return End;
2374}
2375
2376/// getFunctionType - Return the underlying function type for this block.
2377///
2378const FunctionProtoType *BlockExpr::getFunctionType() const {
2379 // The block pointer is never sugared, but the function type might be.
2380 return cast<BlockPointerType>(getType())
2381 ->getPointeeType()->castAs<FunctionProtoType>();
2382}
2383
2384SourceLocation BlockExpr::getCaretLocation() const {
2385 return TheBlock->getCaretLocation();
2386}
2387const Stmt *BlockExpr::getBody() const {
2388 return TheBlock->getBody();
2389}
2390Stmt *BlockExpr::getBody() {
2391 return TheBlock->getBody();
2392}
2393
2394
2395//===----------------------------------------------------------------------===//
2396// Generic Expression Routines
2397//===----------------------------------------------------------------------===//
2398
2399bool Expr::isReadIfDiscardedInCPlusPlus11() const {
2400 // In C++11, discarded-value expressions of a certain form are special,
2401 // according to [expr]p10:
2402 // The lvalue-to-rvalue conversion (4.1) is applied only if the
2403 // expression is a glvalue of volatile-qualified type and it has
2404 // one of the following forms:
2405 if (!isGLValue() || !getType().isVolatileQualified())
2406 return false;
2407
2408 const Expr *E = IgnoreParens();
2409
2410 // - id-expression (5.1.1),
2411 if (isa<DeclRefExpr>(E))
2412 return true;
2413
2414 // - subscripting (5.2.1),
2415 if (isa<ArraySubscriptExpr>(E))
2416 return true;
2417
2418 // - class member access (5.2.5),
2419 if (isa<MemberExpr>(E))
2420 return true;
2421
2422 // - indirection (5.3.1),
2423 if (auto *UO = dyn_cast<UnaryOperator>(E))
2424 if (UO->getOpcode() == UO_Deref)
2425 return true;
2426
2427 if (auto *BO = dyn_cast<BinaryOperator>(E)) {
2428 // - pointer-to-member operation (5.5),
2429 if (BO->isPtrMemOp())
2430 return true;
2431
2432 // - comma expression (5.18) where the right operand is one of the above.
2433 if (BO->getOpcode() == BO_Comma)
2434 return BO->getRHS()->isReadIfDiscardedInCPlusPlus11();
2435 }
2436
2437 // - conditional expression (5.16) where both the second and the third
2438 // operands are one of the above, or
2439 if (auto *CO = dyn_cast<ConditionalOperator>(E))
2440 return CO->getTrueExpr()->isReadIfDiscardedInCPlusPlus11() &&
2441 CO->getFalseExpr()->isReadIfDiscardedInCPlusPlus11();
2442 // The related edge case of "*x ?: *x".
2443 if (auto *BCO =
2444 dyn_cast<BinaryConditionalOperator>(E)) {
2445 if (auto *OVE = dyn_cast<OpaqueValueExpr>(BCO->getTrueExpr()))
2446 return OVE->getSourceExpr()->isReadIfDiscardedInCPlusPlus11() &&
2447 BCO->getFalseExpr()->isReadIfDiscardedInCPlusPlus11();
2448 }
2449
2450 // Objective-C++ extensions to the rule.
2451 if (isa<PseudoObjectExpr>(E) || isa<ObjCIvarRefExpr>(E))
2452 return true;
2453
2454 return false;
2455}
2456
2457/// isUnusedResultAWarning - Return true if this immediate expression should
2458/// be warned about if the result is unused. If so, fill in Loc and Ranges
2459/// with location to warn on and the source range[s] to report with the
2460/// warning.
2461bool Expr::isUnusedResultAWarning(const Expr *&WarnE, SourceLocation &Loc,
2462 SourceRange &R1, SourceRange &R2,
2463 ASTContext &Ctx) const {
2464 // Don't warn if the expr is type dependent. The type could end up
2465 // instantiating to void.
2466 if (isTypeDependent())
2467 return false;
2468
2469 switch (getStmtClass()) {
2470 default:
2471 if (getType()->isVoidType())
2472 return false;
2473 WarnE = this;
2474 Loc = getExprLoc();
2475 R1 = getSourceRange();
2476 return true;
2477 case ParenExprClass:
2478 return cast<ParenExpr>(this)->getSubExpr()->
2479 isUnusedResultAWarning(WarnE, Loc, R1, R2, Ctx);
2480 case GenericSelectionExprClass:
2481 return cast<GenericSelectionExpr>(this)->getResultExpr()->
2482 isUnusedResultAWarning(WarnE, Loc, R1, R2, Ctx);
2483 case CoawaitExprClass:
2484 case CoyieldExprClass:
2485 return cast<CoroutineSuspendExpr>(this)->getResumeExpr()->
2486 isUnusedResultAWarning(WarnE, Loc, R1, R2, Ctx);
2487 case ChooseExprClass:
2488 return cast<ChooseExpr>(this)->getChosenSubExpr()->
2489 isUnusedResultAWarning(WarnE, Loc, R1, R2, Ctx);
2490 case UnaryOperatorClass: {
2491 const UnaryOperator *UO = cast<UnaryOperator>(this);
2492
2493 switch (UO->getOpcode()) {
2494 case UO_Plus:
2495 case UO_Minus:
2496 case UO_AddrOf:
2497 case UO_Not:
2498 case UO_LNot:
2499 case UO_Deref:
2500 break;
2501 case UO_Coawait:
2502 // This is just the 'operator co_await' call inside the guts of a
2503 // dependent co_await call.
2504 case UO_PostInc:
2505 case UO_PostDec:
2506 case UO_PreInc:
2507 case UO_PreDec: // ++/--
2508 return false; // Not a warning.
2509 case UO_Real:
2510 case UO_Imag:
2511 // accessing a piece of a volatile complex is a side-effect.
2512 if (Ctx.getCanonicalType(UO->getSubExpr()->getType())
2513 .isVolatileQualified())
2514 return false;
2515 break;
2516 case UO_Extension:
2517 return UO->getSubExpr()->isUnusedResultAWarning(WarnE, Loc, R1, R2, Ctx);
2518 }
2519 WarnE = this;
2520 Loc = UO->getOperatorLoc();
2521 R1 = UO->getSubExpr()->getSourceRange();
2522 return true;
2523 }
2524 case BinaryOperatorClass: {
2525 const BinaryOperator *BO = cast<BinaryOperator>(this);
2526 switch (BO->getOpcode()) {
2527 default:
2528 break;
2529 // Consider the RHS of comma for side effects. LHS was checked by
2530 // Sema::CheckCommaOperands.
2531 case BO_Comma:
2532 // ((foo = <blah>), 0) is an idiom for hiding the result (and
2533 // lvalue-ness) of an assignment written in a macro.
2534 if (IntegerLiteral *IE =
2535 dyn_cast<IntegerLiteral>(BO->getRHS()->IgnoreParens()))
2536 if (IE->getValue() == 0)
2537 return false;
2538 return BO->getRHS()->isUnusedResultAWarning(WarnE, Loc, R1, R2, Ctx);
2539 // Consider '||', '&&' to have side effects if the LHS or RHS does.
2540 case BO_LAnd:
2541 case BO_LOr:
2542 if (!BO->getLHS()->isUnusedResultAWarning(WarnE, Loc, R1, R2, Ctx) ||
2543 !BO->getRHS()->isUnusedResultAWarning(WarnE, Loc, R1, R2, Ctx))
2544 return false;
2545 break;
2546 }
2547 if (BO->isAssignmentOp())
2548 return false;
2549 WarnE = this;
2550 Loc = BO->getOperatorLoc();
2551 R1 = BO->getLHS()->getSourceRange();
2552 R2 = BO->getRHS()->getSourceRange();
2553 return true;
2554 }
2555 case CompoundAssignOperatorClass:
2556 case VAArgExprClass:
2557 case AtomicExprClass:
2558 return false;
2559
2560 case ConditionalOperatorClass: {
2561 // If only one of the LHS or RHS is a warning, the operator might
2562 // be being used for control flow. Only warn if both the LHS and
2563 // RHS are warnings.
2564 const auto *Exp = cast<ConditionalOperator>(this);
2565 return Exp->getLHS()->isUnusedResultAWarning(WarnE, Loc, R1, R2, Ctx) &&
2566 Exp->getRHS()->isUnusedResultAWarning(WarnE, Loc, R1, R2, Ctx);
2567 }
2568 case BinaryConditionalOperatorClass: {
2569 const auto *Exp = cast<BinaryConditionalOperator>(this);
2570 return Exp->getFalseExpr()->isUnusedResultAWarning(WarnE, Loc, R1, R2, Ctx);
2571 }
2572
2573 case MemberExprClass:
2574 WarnE = this;
2575 Loc = cast<MemberExpr>(this)->getMemberLoc();
2576 R1 = SourceRange(Loc, Loc);
2577 R2 = cast<MemberExpr>(this)->getBase()->getSourceRange();
2578 return true;
2579
2580 case ArraySubscriptExprClass:
2581 WarnE = this;
2582 Loc = cast<ArraySubscriptExpr>(this)->getRBracketLoc();
2583 R1 = cast<ArraySubscriptExpr>(this)->getLHS()->getSourceRange();
2584 R2 = cast<ArraySubscriptExpr>(this)->getRHS()->getSourceRange();
2585 return true;
2586
2587 case CXXOperatorCallExprClass: {
2588 // Warn about operator ==,!=,<,>,<=, and >= even when user-defined operator
2589 // overloads as there is no reasonable way to define these such that they
2590 // have non-trivial, desirable side-effects. See the -Wunused-comparison
2591 // warning: operators == and != are commonly typo'ed, and so warning on them
2592 // provides additional value as well. If this list is updated,
2593 // DiagnoseUnusedComparison should be as well.
2594 const CXXOperatorCallExpr *Op = cast<CXXOperatorCallExpr>(this);
2595 switch (Op->getOperator()) {
2596 default:
2597 break;
2598 case OO_EqualEqual:
2599 case OO_ExclaimEqual:
2600 case OO_Less:
2601 case OO_Greater:
2602 case OO_GreaterEqual:
2603 case OO_LessEqual:
2604 if (Op->getCallReturnType(Ctx)->isReferenceType() ||
2605 Op->getCallReturnType(Ctx)->isVoidType())
2606 break;
2607 WarnE = this;
2608 Loc = Op->getOperatorLoc();
2609 R1 = Op->getSourceRange();
2610 return true;
2611 }
2612
2613 // Fallthrough for generic call handling.
2614 LLVM_FALLTHROUGH[[gnu::fallthrough]];
2615 }
2616 case CallExprClass:
2617 case CXXMemberCallExprClass:
2618 case UserDefinedLiteralClass: {
2619 // If this is a direct call, get the callee.
2620 const CallExpr *CE = cast<CallExpr>(this);
2621 if (const Decl *FD = CE->getCalleeDecl()) {
2622 // If the callee has attribute pure, const, or warn_unused_result, warn
2623 // about it. void foo() { strlen("bar"); } should warn.
2624 //
2625 // Note: If new cases are added here, DiagnoseUnusedExprResult should be
2626 // updated to match for QoI.
2627 if (CE->hasUnusedResultAttr(Ctx) ||
2628 FD->hasAttr<PureAttr>() || FD->hasAttr<ConstAttr>()) {
2629 WarnE = this;
2630 Loc = CE->getCallee()->getBeginLoc();
2631 R1 = CE->getCallee()->getSourceRange();
2632
2633 if (unsigned NumArgs = CE->getNumArgs())
2634 R2 = SourceRange(CE->getArg(0)->getBeginLoc(),
2635 CE->getArg(NumArgs - 1)->getEndLoc());
2636 return true;
2637 }
2638 }
2639 return false;
2640 }
2641
2642 // If we don't know precisely what we're looking at, let's not warn.
2643 case UnresolvedLookupExprClass:
2644 case CXXUnresolvedConstructExprClass:
2645 case RecoveryExprClass:
2646 return false;
2647
2648 case CXXTemporaryObjectExprClass:
2649 case CXXConstructExprClass: {
2650 if (const CXXRecordDecl *Type = getType()->getAsCXXRecordDecl()) {
2651 const auto *WarnURAttr = Type->getAttr<WarnUnusedResultAttr>();
2652 if (Type->hasAttr<WarnUnusedAttr>() ||
2653 (WarnURAttr && WarnURAttr->IsCXX11NoDiscard())) {
2654 WarnE = this;
2655 Loc = getBeginLoc();
2656 R1 = getSourceRange();
2657 return true;
2658 }
2659 }
2660
2661 const auto *CE = cast<CXXConstructExpr>(this);
2662 if (const CXXConstructorDecl *Ctor = CE->getConstructor()) {
2663 const auto *WarnURAttr = Ctor->getAttr<WarnUnusedResultAttr>();
2664 if (WarnURAttr && WarnURAttr->IsCXX11NoDiscard()) {
2665 WarnE = this;
2666 Loc = getBeginLoc();
2667 R1 = getSourceRange();
2668
2669 if (unsigned NumArgs = CE->getNumArgs())
2670 R2 = SourceRange(CE->getArg(0)->getBeginLoc(),
2671 CE->getArg(NumArgs - 1)->getEndLoc());
2672 return true;
2673 }
2674 }
2675
2676 return false;
2677 }
2678
2679 case ObjCMessageExprClass: {
2680 const ObjCMessageExpr *ME = cast<ObjCMessageExpr>(this);
2681 if (Ctx.getLangOpts().ObjCAutoRefCount &&
2682 ME->isInstanceMessage() &&
2683 !ME->getType()->isVoidType() &&
2684 ME->getMethodFamily() == OMF_init) {
2685 WarnE = this;
2686 Loc = getExprLoc();
2687 R1 = ME->getSourceRange();
2688 return true;
2689 }
2690
2691 if (const ObjCMethodDecl *MD = ME->getMethodDecl())
2692 if (MD->hasAttr<WarnUnusedResultAttr>()) {
2693 WarnE = this;
2694 Loc = getExprLoc();
2695 return true;
2696 }
2697
2698 return false;
2699 }
2700
2701 case ObjCPropertyRefExprClass:
2702 WarnE = this;
2703 Loc = getExprLoc();
2704 R1 = getSourceRange();
2705 return true;
2706
2707 case PseudoObjectExprClass: {
2708 const PseudoObjectExpr *PO = cast<PseudoObjectExpr>(this);
2709
2710 // Only complain about things that have the form of a getter.
2711 if (isa<UnaryOperator>(PO->getSyntacticForm()) ||
2712 isa<BinaryOperator>(PO->getSyntacticForm()))
2713 return false;
2714
2715 WarnE = this;
2716 Loc = getExprLoc();
2717 R1 = getSourceRange();
2718 return true;
2719 }
2720
2721 case StmtExprClass: {
2722 // Statement exprs don't logically have side effects themselves, but are
2723 // sometimes used in macros in ways that give them a type that is unused.
2724 // For example ({ blah; foo(); }) will end up with a type if foo has a type.
2725 // however, if the result of the stmt expr is dead, we don't want to emit a
2726 // warning.
2727 const CompoundStmt *CS = cast<StmtExpr>(this)->getSubStmt();
2728 if (!CS->body_empty()) {
2729 if (const Expr *E = dyn_cast<Expr>(CS->body_back()))
2730 return E->isUnusedResultAWarning(WarnE, Loc, R1, R2, Ctx);
2731 if (const LabelStmt *Label = dyn_cast<LabelStmt>(CS->body_back()))
2732 if (const Expr *E = dyn_cast<Expr>(Label->getSubStmt()))
2733 return E->isUnusedResultAWarning(WarnE, Loc, R1, R2, Ctx);
2734 }
2735
2736 if (getType()->isVoidType())
2737 return false;
2738 WarnE = this;
2739 Loc = cast<StmtExpr>(this)->getLParenLoc();
2740 R1 = getSourceRange();
2741 return true;
2742 }
2743 case CXXFunctionalCastExprClass:
2744 case CStyleCastExprClass: {
2745 // Ignore an explicit cast to void, except in C++98 if the operand is a
2746 // volatile glvalue for which we would trigger an implicit read in any
2747 // other language mode. (Such an implicit read always happens as part of
2748 // the lvalue conversion in C, and happens in C++ for expressions of all
2749 // forms where it seems likely the user intended to trigger a volatile
2750 // load.)
2751 const CastExpr *CE = cast<CastExpr>(this);
2752 const Expr *SubE = CE->getSubExpr()->IgnoreParens();
2753 if (CE->getCastKind() == CK_ToVoid) {
2754 if (Ctx.getLangOpts().CPlusPlus && !Ctx.getLangOpts().CPlusPlus11 &&
2755 SubE->isReadIfDiscardedInCPlusPlus11()) {
2756 // Suppress the "unused value" warning for idiomatic usage of
2757 // '(void)var;' used to suppress "unused variable" warnings.
2758 if (auto *DRE = dyn_cast<DeclRefExpr>(SubE))
2759 if (auto *VD = dyn_cast<VarDecl>(DRE->getDecl()))
2760 if (!VD->isExternallyVisible())
2761 return false;
2762
2763 // The lvalue-to-rvalue conversion would have no effect for an array.
2764 // It's implausible that the programmer expected this to result in a
2765 // volatile array load, so don't warn.
2766 if (SubE->getType()->isArrayType())
2767 return false;
2768
2769 return SubE->isUnusedResultAWarning(WarnE, Loc, R1, R2, Ctx);
2770 }
2771 return false;
2772 }
2773
2774 // If this is a cast to a constructor conversion, check the operand.
2775 // Otherwise, the result of the cast is unused.
2776 if (CE->getCastKind() == CK_ConstructorConversion)
2777 return CE->getSubExpr()->isUnusedResultAWarning(WarnE, Loc, R1, R2, Ctx);
2778 if (CE->getCastKind() == CK_Dependent)
2779 return false;
2780
2781 WarnE = this;
2782 if (const CXXFunctionalCastExpr *CXXCE =
2783 dyn_cast<CXXFunctionalCastExpr>(this)) {
2784 Loc = CXXCE->getBeginLoc();
2785 R1 = CXXCE->getSubExpr()->getSourceRange();
2786 } else {
2787 const CStyleCastExpr *CStyleCE = cast<CStyleCastExpr>(this);
2788 Loc = CStyleCE->getLParenLoc();
2789 R1 = CStyleCE->getSubExpr()->getSourceRange();
2790 }
2791 return true;
2792 }
2793 case ImplicitCastExprClass: {
2794 const CastExpr *ICE = cast<ImplicitCastExpr>(this);
2795
2796 // lvalue-to-rvalue conversion on a volatile lvalue is a side-effect.
2797 if (ICE->getCastKind() == CK_LValueToRValue &&
2798 ICE->getSubExpr()->getType().isVolatileQualified())
2799 return false;
2800
2801 return ICE->getSubExpr()->isUnusedResultAWarning(WarnE, Loc, R1, R2, Ctx);
2802 }
2803 case CXXDefaultArgExprClass:
2804 return (cast<CXXDefaultArgExpr>(this)
2805 ->getExpr()->isUnusedResultAWarning(WarnE, Loc, R1, R2, Ctx));
2806 case CXXDefaultInitExprClass:
2807 return (cast<CXXDefaultInitExpr>(this)
2808 ->getExpr()->isUnusedResultAWarning(WarnE, Loc, R1, R2, Ctx));
2809
2810 case CXXNewExprClass:
2811 // FIXME: In theory, there might be new expressions that don't have side
2812 // effects (e.g. a placement new with an uninitialized POD).
2813 case CXXDeleteExprClass:
2814 return false;
2815 case MaterializeTemporaryExprClass:
2816 return cast<MaterializeTemporaryExpr>(this)
2817 ->getSubExpr()
2818 ->isUnusedResultAWarning(WarnE, Loc, R1, R2, Ctx);
2819 case CXXBindTemporaryExprClass:
2820 return cast<CXXBindTemporaryExpr>(this)->getSubExpr()
2821 ->isUnusedResultAWarning(WarnE, Loc, R1, R2, Ctx);
2822 case ExprWithCleanupsClass:
2823 return cast<ExprWithCleanups>(this)->getSubExpr()
2824 ->isUnusedResultAWarning(WarnE, Loc, R1, R2, Ctx);
2825 }
2826}
2827
2828/// isOBJCGCCandidate - Check if an expression is objc gc'able.
2829/// returns true, if it is; false otherwise.
2830bool Expr::isOBJCGCCandidate(ASTContext &Ctx) const {
2831 const Expr *E = IgnoreParens();
2832 switch (E->getStmtClass()) {
2833 default:
2834 return false;
2835 case ObjCIvarRefExprClass:
2836 return true;
2837 case Expr::UnaryOperatorClass:
2838 return cast<UnaryOperator>(E)->getSubExpr()->isOBJCGCCandidate(Ctx);
2839 case ImplicitCastExprClass:
2840 return cast<ImplicitCastExpr>(E)->getSubExpr()->isOBJCGCCandidate(Ctx);
2841 case MaterializeTemporaryExprClass:
2842 return cast<MaterializeTemporaryExpr>(E)->getSubExpr()->isOBJCGCCandidate(
2843 Ctx);
2844 case CStyleCastExprClass:
2845 return cast<CStyleCastExpr>(E)->getSubExpr()->isOBJCGCCandidate(Ctx);
2846 case DeclRefExprClass: {
2847 const Decl *D = cast<DeclRefExpr>(E)->getDecl();
2848
2849 if (const VarDecl *VD = dyn_cast<VarDecl>(D)) {
2850 if (VD->hasGlobalStorage())
2851 return true;
2852 QualType T = VD->getType();
2853 // dereferencing to a pointer is always a gc'able candidate,
2854 // unless it is __weak.
2855 return T->isPointerType() &&
2856 (Ctx.getObjCGCAttrKind(T) != Qualifiers::Weak);
2857 }
2858 return false;
2859 }
2860 case MemberExprClass: {
2861 const MemberExpr *M = cast<MemberExpr>(E);
2862 return M->getBase()->isOBJCGCCandidate(Ctx);
2863 }
2864 case ArraySubscriptExprClass:
2865 return cast<ArraySubscriptExpr>(E)->getBase()->isOBJCGCCandidate(Ctx);
2866 }
2867}
2868
2869bool Expr::isBoundMemberFunction(ASTContext &Ctx) const {
2870 if (isTypeDependent())
2871 return false;
2872 return ClassifyLValue(Ctx) == Expr::LV_MemberFunction;
2873}
2874
2875QualType Expr::findBoundMemberType(const Expr *expr) {
2876 assert(expr->hasPlaceholderType(BuiltinType::BoundMember))(static_cast <bool> (expr->hasPlaceholderType(BuiltinType
::BoundMember)) ? void (0) : __assert_fail ("expr->hasPlaceholderType(BuiltinType::BoundMember)"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 2876, __extension__ __PRETTY_FUNCTION__))
;
2877
2878 // Bound member expressions are always one of these possibilities:
2879 // x->m x.m x->*y x.*y
2880 // (possibly parenthesized)
2881
2882 expr = expr->IgnoreParens();
2883 if (const MemberExpr *mem = dyn_cast<MemberExpr>(expr)) {
2884 assert(isa<CXXMethodDecl>(mem->getMemberDecl()))(static_cast <bool> (isa<CXXMethodDecl>(mem->getMemberDecl
())) ? void (0) : __assert_fail ("isa<CXXMethodDecl>(mem->getMemberDecl())"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 2884, __extension__ __PRETTY_FUNCTION__))
;
2885 return mem->getMemberDecl()->getType();
2886 }
2887
2888 if (const BinaryOperator *op = dyn_cast<BinaryOperator>(expr)) {
2889 QualType type = op->getRHS()->getType()->castAs<MemberPointerType>()
2890 ->getPointeeType();
2891 assert(type->isFunctionType())(static_cast <bool> (type->isFunctionType()) ? void (
0) : __assert_fail ("type->isFunctionType()", "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 2891, __extension__ __PRETTY_FUNCTION__))
;
2892 return type;
2893 }
2894
2895 assert(isa<UnresolvedMemberExpr>(expr) || isa<CXXPseudoDestructorExpr>(expr))(static_cast <bool> (isa<UnresolvedMemberExpr>(expr
) || isa<CXXPseudoDestructorExpr>(expr)) ? void (0) : __assert_fail
("isa<UnresolvedMemberExpr>(expr) || isa<CXXPseudoDestructorExpr>(expr)"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 2895, __extension__ __PRETTY_FUNCTION__))
;
2896 return QualType();
2897}
2898
2899Expr *Expr::IgnoreImpCasts() {
2900 return IgnoreExprNodes(this, IgnoreImplicitCastsSingleStep);
2901}
2902
2903Expr *Expr::IgnoreCasts() {
2904 return IgnoreExprNodes(this, IgnoreCastsSingleStep);
2905}
2906
2907Expr *Expr::IgnoreImplicit() {
2908 return IgnoreExprNodes(this, IgnoreImplicitSingleStep);
2909}
2910
2911Expr *Expr::IgnoreImplicitAsWritten() {
2912 return IgnoreExprNodes(this, IgnoreImplicitAsWrittenSingleStep);
2913}
2914
2915Expr *Expr::IgnoreParens() {
2916 return IgnoreExprNodes(this, IgnoreParensSingleStep);
2917}
2918
2919Expr *Expr::IgnoreParenImpCasts() {
2920 return IgnoreExprNodes(this, IgnoreParensSingleStep,
2921 IgnoreImplicitCastsExtraSingleStep);
2922}
2923
2924Expr *Expr::IgnoreParenCasts() {
2925 return IgnoreExprNodes(this, IgnoreParensSingleStep, IgnoreCastsSingleStep);
2926}
2927
2928Expr *Expr::IgnoreConversionOperatorSingleStep() {
2929 if (auto *MCE = dyn_cast<CXXMemberCallExpr>(this)) {
2930 if (MCE->getMethodDecl() && isa<CXXConversionDecl>(MCE->getMethodDecl()))
2931 return MCE->getImplicitObjectArgument();
2932 }
2933 return this;
2934}
2935
2936Expr *Expr::IgnoreParenLValueCasts() {
2937 return IgnoreExprNodes(this, IgnoreParensSingleStep,
2938 IgnoreLValueCastsSingleStep);
2939}
2940
2941Expr *Expr::IgnoreParenBaseCasts() {
2942 return IgnoreExprNodes(this, IgnoreParensSingleStep,
2943 IgnoreBaseCastsSingleStep);
2944}
2945
2946Expr *Expr::IgnoreParenNoopCasts(const ASTContext &Ctx) {
2947 auto IgnoreNoopCastsSingleStep = [&Ctx](Expr *E) {
2948 if (auto *CE = dyn_cast<CastExpr>(E)) {
2949 // We ignore integer <-> casts that are of the same width, ptr<->ptr and
2950 // ptr<->int casts of the same width. We also ignore all identity casts.
2951 Expr *SubExpr = CE->getSubExpr();
2952 bool IsIdentityCast =
2953 Ctx.hasSameUnqualifiedType(E->getType(), SubExpr->getType());
2954 bool IsSameWidthCast = (E->getType()->isPointerType() ||
2955 E->getType()->isIntegralType(Ctx)) &&
2956 (SubExpr->getType()->isPointerType() ||
2957 SubExpr->getType()->isIntegralType(Ctx)) &&
2958 (Ctx.getTypeSize(E->getType()) ==
2959 Ctx.getTypeSize(SubExpr->getType()));
2960
2961 if (IsIdentityCast || IsSameWidthCast)
2962 return SubExpr;
2963 } else if (auto *NTTP = dyn_cast<SubstNonTypeTemplateParmExpr>(E))
2964 return NTTP->getReplacement();
2965
2966 return E;
2967 };
2968 return IgnoreExprNodes(this, IgnoreParensSingleStep,
2969 IgnoreNoopCastsSingleStep);
2970}
2971
2972Expr *Expr::IgnoreUnlessSpelledInSource() {
2973 auto IgnoreImplicitConstructorSingleStep = [](Expr *E) {
2974 if (auto *Cast = dyn_cast<CXXFunctionalCastExpr>(E)) {
2975 auto *SE = Cast->getSubExpr();
2976 if (SE->getSourceRange() == E->getSourceRange())
2977 return SE;
2978 }
2979
2980 if (auto *C = dyn_cast<CXXConstructExpr>(E)) {
2981 auto NumArgs = C->getNumArgs();
2982 if (NumArgs == 1 ||
2983 (NumArgs > 1 && isa<CXXDefaultArgExpr>(C->getArg(1)))) {
2984 Expr *A = C->getArg(0);
2985 if (A->getSourceRange() == E->getSourceRange() || C->isElidable())
2986 return A;
2987 }
2988 }
2989 return E;
2990 };
2991 auto IgnoreImplicitMemberCallSingleStep = [](Expr *E) {
2992 if (auto *C = dyn_cast<CXXMemberCallExpr>(E)) {
2993 Expr *ExprNode = C->getImplicitObjectArgument();
2994 if (ExprNode->getSourceRange() == E->getSourceRange()) {
2995 return ExprNode;
2996 }
2997 if (auto *PE = dyn_cast<ParenExpr>(ExprNode)) {
2998 if (PE->getSourceRange() == C->getSourceRange()) {
2999 return cast<Expr>(PE);
3000 }
3001 }
3002 ExprNode = ExprNode->IgnoreParenImpCasts();
3003 if (ExprNode->getSourceRange() == E->getSourceRange())
3004 return ExprNode;
3005 }
3006 return E;
3007 };
3008 return IgnoreExprNodes(
3009 this, IgnoreImplicitSingleStep, IgnoreImplicitCastsExtraSingleStep,
3010 IgnoreParensOnlySingleStep, IgnoreImplicitConstructorSingleStep,
3011 IgnoreImplicitMemberCallSingleStep);
3012}
3013
3014bool Expr::isDefaultArgument() const {
3015 const Expr *E = this;
3016 if (const MaterializeTemporaryExpr *M = dyn_cast<MaterializeTemporaryExpr>(E))
3017 E = M->getSubExpr();
3018
3019 while (const ImplicitCastExpr *ICE = dyn_cast<ImplicitCastExpr>(E))
3020 E = ICE->getSubExprAsWritten();
3021
3022 return isa<CXXDefaultArgExpr>(E);
3023}
3024
3025/// Skip over any no-op casts and any temporary-binding
3026/// expressions.
3027static const Expr *skipTemporaryBindingsNoOpCastsAndParens(const Expr *E) {
3028 if (const MaterializeTemporaryExpr *M = dyn_cast<MaterializeTemporaryExpr>(E))
3029 E = M->getSubExpr();
3030
3031 while (const ImplicitCastExpr *ICE = dyn_cast<ImplicitCastExpr>(E)) {
3032 if (ICE->getCastKind() == CK_NoOp)
3033 E = ICE->getSubExpr();
3034 else
3035 break;
3036 }
3037
3038 while (const CXXBindTemporaryExpr *BE = dyn_cast<CXXBindTemporaryExpr>(E))
3039 E = BE->getSubExpr();
3040
3041 while (const ImplicitCastExpr *ICE = dyn_cast<ImplicitCastExpr>(E)) {
3042 if (ICE->getCastKind() == CK_NoOp)
3043 E = ICE->getSubExpr();
3044 else
3045 break;
3046 }
3047
3048 return E->IgnoreParens();
3049}
3050
3051/// isTemporaryObject - Determines if this expression produces a
3052/// temporary of the given class type.
3053bool Expr::isTemporaryObject(ASTContext &C, const CXXRecordDecl *TempTy) const {
3054 if (!C.hasSameUnqualifiedType(getType(), C.getTypeDeclType(TempTy)))
3055 return false;
3056
3057 const Expr *E = skipTemporaryBindingsNoOpCastsAndParens(this);
3058
3059 // Temporaries are by definition pr-values of class type.
3060 if (!E->Classify(C).isPRValue()) {
3061 // In this context, property reference is a message call and is pr-value.
3062 if (!isa<ObjCPropertyRefExpr>(E))
3063 return false;
3064 }
3065
3066 // Black-list a few cases which yield pr-values of class type that don't
3067 // refer to temporaries of that type:
3068
3069 // - implicit derived-to-base conversions
3070 if (isa<ImplicitCastExpr>(E)) {
3071 switch (cast<ImplicitCastExpr>(E)->getCastKind()) {
3072 case CK_DerivedToBase:
3073 case CK_UncheckedDerivedToBase:
3074 return false;
3075 default:
3076 break;
3077 }
3078 }
3079
3080 // - member expressions (all)
3081 if (isa<MemberExpr>(E))
3082 return false;
3083
3084 if (const BinaryOperator *BO = dyn_cast<BinaryOperator>(E))
3085 if (BO->isPtrMemOp())
3086 return false;
3087
3088 // - opaque values (all)
3089 if (isa<OpaqueValueExpr>(E))
3090 return false;
3091
3092 return true;
3093}
3094
3095bool Expr::isImplicitCXXThis() const {
3096 const Expr *E = this;
3097
3098 // Strip away parentheses and casts we don't care about.
3099 while (true) {
3100 if (const ParenExpr *Paren = dyn_cast<ParenExpr>(E)) {
3101 E = Paren->getSubExpr();
3102 continue;
3103 }
3104
3105 if (const ImplicitCastExpr *ICE = dyn_cast<ImplicitCastExpr>(E)) {
3106 if (ICE->getCastKind() == CK_NoOp ||
3107 ICE->getCastKind() == CK_LValueToRValue ||
3108 ICE->getCastKind() == CK_DerivedToBase ||
3109 ICE->getCastKind() == CK_UncheckedDerivedToBase) {
3110 E = ICE->getSubExpr();
3111 continue;
3112 }
3113 }
3114
3115 if (const UnaryOperator* UnOp = dyn_cast<UnaryOperator>(E)) {
3116 if (UnOp->getOpcode() == UO_Extension) {
3117 E = UnOp->getSubExpr();
3118 continue;
3119 }
3120 }
3121
3122 if (const MaterializeTemporaryExpr *M
3123 = dyn_cast<MaterializeTemporaryExpr>(E)) {
3124 E = M->getSubExpr();
3125 continue;
3126 }
3127
3128 break;
3129 }
3130
3131 if (const CXXThisExpr *This = dyn_cast<CXXThisExpr>(E))
3132 return This->isImplicit();
3133
3134 return false;
3135}
3136
3137/// hasAnyTypeDependentArguments - Determines if any of the expressions
3138/// in Exprs is type-dependent.
3139bool Expr::hasAnyTypeDependentArguments(ArrayRef<Expr *> Exprs) {
3140 for (unsigned I = 0; I < Exprs.size(); ++I)
3141 if (Exprs[I]->isTypeDependent())
3142 return true;
3143
3144 return false;
3145}
3146
3147bool Expr::isConstantInitializer(ASTContext &Ctx, bool IsForRef,
3148 const Expr **Culprit) const {
3149 assert(!isValueDependent() &&(static_cast <bool> (!isValueDependent() && "Expression evaluator can't be called on a dependent expression."
) ? void (0) : __assert_fail ("!isValueDependent() && \"Expression evaluator can't be called on a dependent expression.\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 3150, __extension__ __PRETTY_FUNCTION__))
3150 "Expression evaluator can't be called on a dependent expression.")(static_cast <bool> (!isValueDependent() && "Expression evaluator can't be called on a dependent expression."
) ? void (0) : __assert_fail ("!isValueDependent() && \"Expression evaluator can't be called on a dependent expression.\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 3150, __extension__ __PRETTY_FUNCTION__))
;
3151
3152 // This function is attempting whether an expression is an initializer
3153 // which can be evaluated at compile-time. It very closely parallels
3154 // ConstExprEmitter in CGExprConstant.cpp; if they don't match, it
3155 // will lead to unexpected results. Like ConstExprEmitter, it falls back
3156 // to isEvaluatable most of the time.
3157 //
3158 // If we ever capture reference-binding directly in the AST, we can
3159 // kill the second parameter.
3160
3161 if (IsForRef) {
3162 EvalResult Result;
3163 if (EvaluateAsLValue(Result, Ctx) && !Result.HasSideEffects)
3164 return true;
3165 if (Culprit)
3166 *Culprit = this;
3167 return false;
3168 }
3169
3170 switch (getStmtClass()) {
3171 default: break;
3172 case Stmt::ExprWithCleanupsClass:
3173 return cast<ExprWithCleanups>(this)->getSubExpr()->isConstantInitializer(
3174 Ctx, IsForRef, Culprit);
3175 case StringLiteralClass:
3176 case ObjCEncodeExprClass:
3177 return true;
3178 case CXXTemporaryObjectExprClass:
3179 case CXXConstructExprClass: {
3180 const CXXConstructExpr *CE = cast<CXXConstructExpr>(this);
3181
3182 if (CE->getConstructor()->isTrivial() &&
3183 CE->getConstructor()->getParent()->hasTrivialDestructor()) {
3184 // Trivial default constructor
3185 if (!CE->getNumArgs()) return true;
3186
3187 // Trivial copy constructor
3188 assert(CE->getNumArgs() == 1 && "trivial ctor with > 1 argument")(static_cast <bool> (CE->getNumArgs() == 1 &&
"trivial ctor with > 1 argument") ? void (0) : __assert_fail
("CE->getNumArgs() == 1 && \"trivial ctor with > 1 argument\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 3188, __extension__ __PRETTY_FUNCTION__))
;
3189 return CE->getArg(0)->isConstantInitializer(Ctx, false, Culprit);
3190 }
3191
3192 break;
3193 }
3194 case ConstantExprClass: {
3195 // FIXME: We should be able to return "true" here, but it can lead to extra
3196 // error messages. E.g. in Sema/array-init.c.
3197 const Expr *Exp = cast<ConstantExpr>(this)->getSubExpr();
3198 return Exp->isConstantInitializer(Ctx, false, Culprit);
3199 }
3200 case CompoundLiteralExprClass: {
3201 // This handles gcc's extension that allows global initializers like
3202 // "struct x {int x;} x = (struct x) {};".
3203 // FIXME: This accepts other cases it shouldn't!
3204 const Expr *Exp = cast<CompoundLiteralExpr>(this)->getInitializer();
3205 return Exp->isConstantInitializer(Ctx, false, Culprit);
3206 }
3207 case DesignatedInitUpdateExprClass: {
3208 const DesignatedInitUpdateExpr *DIUE = cast<DesignatedInitUpdateExpr>(this);
3209 return DIUE->getBase()->isConstantInitializer(Ctx, false, Culprit) &&
3210 DIUE->getUpdater()->isConstantInitializer(Ctx, false, Culprit);
3211 }
3212 case InitListExprClass: {
3213 const InitListExpr *ILE = cast<InitListExpr>(this);
3214 assert(ILE->isSemanticForm() && "InitListExpr must be in semantic form")(static_cast <bool> (ILE->isSemanticForm() &&
"InitListExpr must be in semantic form") ? void (0) : __assert_fail
("ILE->isSemanticForm() && \"InitListExpr must be in semantic form\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 3214, __extension__ __PRETTY_FUNCTION__))
;
3215 if (ILE->getType()->isArrayType()) {
3216 unsigned numInits = ILE->getNumInits();
3217 for (unsigned i = 0; i < numInits; i++) {
3218 if (!ILE->getInit(i)->isConstantInitializer(Ctx, false, Culprit))
3219 return false;
3220 }
3221 return true;
3222 }
3223
3224 if (ILE->getType()->isRecordType()) {
3225 unsigned ElementNo = 0;
3226 RecordDecl *RD = ILE->getType()->castAs<RecordType>()->getDecl();
3227 for (const auto *Field : RD->fields()) {
3228 // If this is a union, skip all the fields that aren't being initialized.
3229 if (RD->isUnion() && ILE->getInitializedFieldInUnion() != Field)
3230 continue;
3231
3232 // Don't emit anonymous bitfields, they just affect layout.
3233 if (Field->isUnnamedBitfield())
3234 continue;
3235
3236 if (ElementNo < ILE->getNumInits()) {
3237 const Expr *Elt = ILE->getInit(ElementNo++);
3238 if (Field->isBitField()) {
3239 // Bitfields have to evaluate to an integer.
3240 EvalResult Result;
3241 if (!Elt->EvaluateAsInt(Result, Ctx)) {
3242 if (Culprit)
3243 *Culprit = Elt;
3244 return false;
3245 }
3246 } else {
3247 bool RefType = Field->getType()->isReferenceType();
3248 if (!Elt->isConstantInitializer(Ctx, RefType, Culprit))
3249 return false;
3250 }
3251 }
3252 }
3253 return true;
3254 }
3255
3256 break;
3257 }
3258 case ImplicitValueInitExprClass:
3259 case NoInitExprClass:
3260 return true;
3261 case ParenExprClass:
3262 return cast<ParenExpr>(this)->getSubExpr()
3263 ->isConstantInitializer(Ctx, IsForRef, Culprit);
3264 case GenericSelectionExprClass:
3265 return cast<GenericSelectionExpr>(this)->getResultExpr()
3266 ->isConstantInitializer(Ctx, IsForRef, Culprit);
3267 case ChooseExprClass:
3268 if (cast<ChooseExpr>(this)->isConditionDependent()) {
3269 if (Culprit)
3270 *Culprit = this;
3271 return false;
3272 }
3273 return cast<ChooseExpr>(this)->getChosenSubExpr()
3274 ->isConstantInitializer(Ctx, IsForRef, Culprit);
3275 case UnaryOperatorClass: {
3276 const UnaryOperator* Exp = cast<UnaryOperator>(this);
3277 if (Exp->getOpcode() == UO_Extension)
3278 return Exp->getSubExpr()->isConstantInitializer(Ctx, false, Culprit);
3279 break;
3280 }
3281 case CXXFunctionalCastExprClass:
3282 case CXXStaticCastExprClass:
3283 case ImplicitCastExprClass:
3284 case CStyleCastExprClass:
3285 case ObjCBridgedCastExprClass:
3286 case CXXDynamicCastExprClass:
3287 case CXXReinterpretCastExprClass:
3288 case CXXAddrspaceCastExprClass:
3289 case CXXConstCastExprClass: {
3290 const CastExpr *CE = cast<CastExpr>(this);
3291
3292 // Handle misc casts we want to ignore.
3293 if (CE->getCastKind() == CK_NoOp ||
3294 CE->getCastKind() == CK_LValueToRValue ||
3295 CE->getCastKind() == CK_ToUnion ||
3296 CE->getCastKind() == CK_ConstructorConversion ||
3297 CE->getCastKind() == CK_NonAtomicToAtomic ||
3298 CE->getCastKind() == CK_AtomicToNonAtomic ||
3299 CE->getCastKind() == CK_IntToOCLSampler)
3300 return CE->getSubExpr()->isConstantInitializer(Ctx, false, Culprit);
3301
3302 break;
3303 }
3304 case MaterializeTemporaryExprClass:
3305 return cast<MaterializeTemporaryExpr>(this)
3306 ->getSubExpr()
3307 ->isConstantInitializer(Ctx, false, Culprit);
3308
3309 case SubstNonTypeTemplateParmExprClass:
3310 return cast<SubstNonTypeTemplateParmExpr>(this)->getReplacement()
3311 ->isConstantInitializer(Ctx, false, Culprit);
3312 case CXXDefaultArgExprClass:
3313 return cast<CXXDefaultArgExpr>(this)->getExpr()
3314 ->isConstantInitializer(Ctx, false, Culprit);
3315 case CXXDefaultInitExprClass:
3316 return cast<CXXDefaultInitExpr>(this)->getExpr()
3317 ->isConstantInitializer(Ctx, false, Culprit);
3318 }
3319 // Allow certain forms of UB in constant initializers: signed integer
3320 // overflow and floating-point division by zero. We'll give a warning on
3321 // these, but they're common enough that we have to accept them.
3322 if (isEvaluatable(Ctx, SE_AllowUndefinedBehavior))
3323 return true;
3324 if (Culprit)
3325 *Culprit = this;
3326 return false;
3327}
3328
3329bool CallExpr::isBuiltinAssumeFalse(const ASTContext &Ctx) const {
3330 const FunctionDecl* FD = getDirectCallee();
3331 if (!FD || (FD->getBuiltinID() != Builtin::BI__assume &&
3332 FD->getBuiltinID() != Builtin::BI__builtin_assume))
3333 return false;
3334
3335 const Expr* Arg = getArg(0);
3336 bool ArgVal;
3337 return !Arg->isValueDependent() &&
3338 Arg->EvaluateAsBooleanCondition(ArgVal, Ctx) && !ArgVal;
3339}
3340
3341namespace {
3342 /// Look for any side effects within a Stmt.
3343 class SideEffectFinder : public ConstEvaluatedExprVisitor<SideEffectFinder> {
3344 typedef ConstEvaluatedExprVisitor<SideEffectFinder> Inherited;
3345 const bool IncludePossibleEffects;
3346 bool HasSideEffects;
3347
3348 public:
3349 explicit SideEffectFinder(const ASTContext &Context, bool IncludePossible)
3350 : Inherited(Context),
3351 IncludePossibleEffects(IncludePossible), HasSideEffects(false) { }
3352
3353 bool hasSideEffects() const { return HasSideEffects; }
3354
3355 void VisitDecl(const Decl *D) {
3356 if (!D)
3357 return;
3358
3359 // We assume the caller checks subexpressions (eg, the initializer, VLA
3360 // bounds) for side-effects on our behalf.
3361 if (auto *VD = dyn_cast<VarDecl>(D)) {
3362 // Registering a destructor is a side-effect.
3363 if (IncludePossibleEffects && VD->isThisDeclarationADefinition() &&
3364 VD->needsDestruction(Context))
3365 HasSideEffects = true;
3366 }
3367 }
3368
3369 void VisitDeclStmt(const DeclStmt *DS) {
3370 for (auto *D : DS->decls())
3371 VisitDecl(D);
3372 Inherited::VisitDeclStmt(DS);
3373 }
3374
3375 void VisitExpr(const Expr *E) {
3376 if (!HasSideEffects &&
3377 E->HasSideEffects(Context, IncludePossibleEffects))
3378 HasSideEffects = true;
3379 }
3380 };
3381}
3382
3383bool Expr::HasSideEffects(const ASTContext &Ctx,
3384 bool IncludePossibleEffects) const {
3385 // In circumstances where we care about definite side effects instead of
3386 // potential side effects, we want to ignore expressions that are part of a
3387 // macro expansion as a potential side effect.
3388 if (!IncludePossibleEffects && getExprLoc().isMacroID())
3389 return false;
3390
3391 switch (getStmtClass()) {
3392 case NoStmtClass:
3393 #define ABSTRACT_STMT(Type)
3394 #define STMT(Type, Base) case Type##Class:
3395 #define EXPR(Type, Base)
3396 #include "clang/AST/StmtNodes.inc"
3397 llvm_unreachable("unexpected Expr kind")::llvm::llvm_unreachable_internal("unexpected Expr kind", "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 3397)
;
3398
3399 case DependentScopeDeclRefExprClass:
3400 case CXXUnresolvedConstructExprClass:
3401 case CXXDependentScopeMemberExprClass:
3402 case UnresolvedLookupExprClass:
3403 case UnresolvedMemberExprClass:
3404 case PackExpansionExprClass:
3405 case SubstNonTypeTemplateParmPackExprClass:
3406 case FunctionParmPackExprClass:
3407 case TypoExprClass:
3408 case RecoveryExprClass:
3409 case CXXFoldExprClass:
3410 // Make a conservative assumption for dependent nodes.
3411 return IncludePossibleEffects;
3412
3413 case DeclRefExprClass:
3414 case ObjCIvarRefExprClass:
3415 case PredefinedExprClass:
3416 case IntegerLiteralClass:
3417 case FixedPointLiteralClass:
3418 case FloatingLiteralClass:
3419 case ImaginaryLiteralClass:
3420 case StringLiteralClass:
3421 case CharacterLiteralClass:
3422 case OffsetOfExprClass:
3423 case ImplicitValueInitExprClass:
3424 case UnaryExprOrTypeTraitExprClass:
3425 case AddrLabelExprClass:
3426 case GNUNullExprClass:
3427 case ArrayInitIndexExprClass:
3428 case NoInitExprClass:
3429 case CXXBoolLiteralExprClass:
3430 case CXXNullPtrLiteralExprClass:
3431 case CXXThisExprClass:
3432 case CXXScalarValueInitExprClass:
3433 case TypeTraitExprClass:
3434 case ArrayTypeTraitExprClass:
3435 case ExpressionTraitExprClass:
3436 case CXXNoexceptExprClass:
3437 case SizeOfPackExprClass:
3438 case ObjCStringLiteralClass:
3439 case ObjCEncodeExprClass:
3440 case ObjCBoolLiteralExprClass:
3441 case ObjCAvailabilityCheckExprClass:
3442 case CXXUuidofExprClass:
3443 case OpaqueValueExprClass:
3444 case SourceLocExprClass:
3445 case ConceptSpecializationExprClass:
3446 case RequiresExprClass:
3447 case SYCLUniqueStableNameExprClass:
3448 // These never have a side-effect.
3449 return false;
3450
3451 case ConstantExprClass:
3452 // FIXME: Move this into the "return false;" block above.
3453 return cast<ConstantExpr>(this)->getSubExpr()->HasSideEffects(
3454 Ctx, IncludePossibleEffects);
3455
3456 case CallExprClass:
3457 case CXXOperatorCallExprClass:
3458 case CXXMemberCallExprClass:
3459 case CUDAKernelCallExprClass:
3460 case UserDefinedLiteralClass: {
3461 // We don't know a call definitely has side effects, except for calls
3462 // to pure/const functions that definitely don't.
3463 // If the call itself is considered side-effect free, check the operands.
3464 const Decl *FD = cast<CallExpr>(this)->getCalleeDecl();
3465 bool IsPure = FD && (FD->hasAttr<ConstAttr>() || FD->hasAttr<PureAttr>());
3466 if (IsPure || !IncludePossibleEffects)
3467 break;
3468 return true;
3469 }
3470
3471 case BlockExprClass:
3472 case CXXBindTemporaryExprClass:
3473 if (!IncludePossibleEffects)
3474 break;
3475 return true;
3476
3477 case MSPropertyRefExprClass:
3478 case MSPropertySubscriptExprClass:
3479 case CompoundAssignOperatorClass:
3480 case VAArgExprClass:
3481 case AtomicExprClass:
3482 case CXXThrowExprClass:
3483 case CXXNewExprClass:
3484 case CXXDeleteExprClass:
3485 case CoawaitExprClass:
3486 case DependentCoawaitExprClass:
3487 case CoyieldExprClass:
3488 // These always have a side-effect.
3489 return true;
3490
3491 case StmtExprClass: {
3492 // StmtExprs have a side-effect if any substatement does.
3493 SideEffectFinder Finder(Ctx, IncludePossibleEffects);
3494 Finder.Visit(cast<StmtExpr>(this)->getSubStmt());
3495 return Finder.hasSideEffects();
3496 }
3497
3498 case ExprWithCleanupsClass:
3499 if (IncludePossibleEffects)
3500 if (cast<ExprWithCleanups>(this)->cleanupsHaveSideEffects())
3501 return true;
3502 break;
3503
3504 case ParenExprClass:
3505 case ArraySubscriptExprClass:
3506 case MatrixSubscriptExprClass:
3507 case OMPArraySectionExprClass:
3508 case OMPArrayShapingExprClass:
3509 case OMPIteratorExprClass:
3510 case MemberExprClass:
3511 case ConditionalOperatorClass:
3512 case BinaryConditionalOperatorClass:
3513 case CompoundLiteralExprClass:
3514 case ExtVectorElementExprClass:
3515 case DesignatedInitExprClass:
3516 case DesignatedInitUpdateExprClass:
3517 case ArrayInitLoopExprClass:
3518 case ParenListExprClass:
3519 case CXXPseudoDestructorExprClass:
3520 case CXXRewrittenBinaryOperatorClass:
3521 case CXXStdInitializerListExprClass:
3522 case SubstNonTypeTemplateParmExprClass:
3523 case MaterializeTemporaryExprClass:
3524 case ShuffleVectorExprClass:
3525 case ConvertVectorExprClass:
3526 case AsTypeExprClass:
3527 // These have a side-effect if any subexpression does.
3528 break;
3529
3530 case UnaryOperatorClass:
3531 if (cast<UnaryOperator>(this)->isIncrementDecrementOp())
3532 return true;
3533 break;
3534
3535 case BinaryOperatorClass:
3536 if (cast<BinaryOperator>(this)->isAssignmentOp())
3537 return true;
3538 break;
3539
3540 case InitListExprClass:
3541 // FIXME: The children for an InitListExpr doesn't include the array filler.
3542 if (const Expr *E = cast<InitListExpr>(this)->getArrayFiller())
3543 if (E->HasSideEffects(Ctx, IncludePossibleEffects))
3544 return true;
3545 break;
3546
3547 case GenericSelectionExprClass:
3548 return cast<GenericSelectionExpr>(this)->getResultExpr()->
3549 HasSideEffects(Ctx, IncludePossibleEffects);
3550
3551 case ChooseExprClass:
3552 return cast<ChooseExpr>(this)->getChosenSubExpr()->HasSideEffects(
3553 Ctx, IncludePossibleEffects);
3554
3555 case CXXDefaultArgExprClass:
3556 return cast<CXXDefaultArgExpr>(this)->getExpr()->HasSideEffects(
3557 Ctx, IncludePossibleEffects);
3558
3559 case CXXDefaultInitExprClass: {
3560 const FieldDecl *FD = cast<CXXDefaultInitExpr>(this)->getField();
3561 if (const Expr *E = FD->getInClassInitializer())
3562 return E->HasSideEffects(Ctx, IncludePossibleEffects);
3563 // If we've not yet parsed the initializer, assume it has side-effects.
3564 return true;
3565 }
3566
3567 case CXXDynamicCastExprClass: {
3568 // A dynamic_cast expression has side-effects if it can throw.
3569 const CXXDynamicCastExpr *DCE = cast<CXXDynamicCastExpr>(this);
3570 if (DCE->getTypeAsWritten()->isReferenceType() &&
3571 DCE->getCastKind() == CK_Dynamic)
3572 return true;
3573 }
3574 LLVM_FALLTHROUGH[[gnu::fallthrough]];
3575 case ImplicitCastExprClass:
3576 case CStyleCastExprClass:
3577 case CXXStaticCastExprClass:
3578 case CXXReinterpretCastExprClass:
3579 case CXXConstCastExprClass:
3580 case CXXAddrspaceCastExprClass:
3581 case CXXFunctionalCastExprClass:
3582 case BuiltinBitCastExprClass: {
3583 // While volatile reads are side-effecting in both C and C++, we treat them
3584 // as having possible (not definite) side-effects. This allows idiomatic
3585 // code to behave without warning, such as sizeof(*v) for a volatile-
3586 // qualified pointer.
3587 if (!IncludePossibleEffects)
3588 break;
3589
3590 const CastExpr *CE = cast<CastExpr>(this);
3591 if (CE->getCastKind() == CK_LValueToRValue &&
3592 CE->getSubExpr()->getType().isVolatileQualified())
3593 return true;
3594 break;
3595 }
3596
3597 case CXXTypeidExprClass:
3598 // typeid might throw if its subexpression is potentially-evaluated, so has
3599 // side-effects in that case whether or not its subexpression does.
3600 return cast<CXXTypeidExpr>(this)->isPotentiallyEvaluated();
3601
3602 case CXXConstructExprClass:
3603 case CXXTemporaryObjectExprClass: {
3604 const CXXConstructExpr *CE = cast<CXXConstructExpr>(this);
3605 if (!CE->getConstructor()->isTrivial() && IncludePossibleEffects)
3606 return true;
3607 // A trivial constructor does not add any side-effects of its own. Just look
3608 // at its arguments.
3609 break;
3610 }
3611
3612 case CXXInheritedCtorInitExprClass: {
3613 const auto *ICIE = cast<CXXInheritedCtorInitExpr>(this);
3614 if (!ICIE->getConstructor()->isTrivial() && IncludePossibleEffects)
3615 return true;
3616 break;
3617 }
3618
3619 case LambdaExprClass: {
3620 const LambdaExpr *LE = cast<LambdaExpr>(this);
3621 for (Expr *E : LE->capture_inits())
3622 if (E && E->HasSideEffects(Ctx, IncludePossibleEffects))
3623 return true;
3624 return false;
3625 }
3626
3627 case PseudoObjectExprClass: {
3628 // Only look for side-effects in the semantic form, and look past
3629 // OpaqueValueExpr bindings in that form.
3630 const PseudoObjectExpr *PO = cast<PseudoObjectExpr>(this);
3631 for (PseudoObjectExpr::const_semantics_iterator I = PO->semantics_begin(),
3632 E = PO->semantics_end();
3633 I != E; ++I) {
3634 const Expr *Subexpr = *I;
3635 if (const OpaqueValueExpr *OVE = dyn_cast<OpaqueValueExpr>(Subexpr))
3636 Subexpr = OVE->getSourceExpr();
3637 if (Subexpr->HasSideEffects(Ctx, IncludePossibleEffects))
3638 return true;
3639 }
3640 return false;
3641 }
3642
3643 case ObjCBoxedExprClass:
3644 case ObjCArrayLiteralClass:
3645 case ObjCDictionaryLiteralClass:
3646 case ObjCSelectorExprClass:
3647 case ObjCProtocolExprClass:
3648 case ObjCIsaExprClass:
3649 case ObjCIndirectCopyRestoreExprClass:
3650 case ObjCSubscriptRefExprClass:
3651 case ObjCBridgedCastExprClass:
3652 case ObjCMessageExprClass:
3653 case ObjCPropertyRefExprClass:
3654 // FIXME: Classify these cases better.
3655 if (IncludePossibleEffects)
3656 return true;
3657 break;
3658 }
3659
3660 // Recurse to children.
3661 for (const Stmt *SubStmt : children())
3662 if (SubStmt &&
3663 cast<Expr>(SubStmt)->HasSideEffects(Ctx, IncludePossibleEffects))
3664 return true;
3665
3666 return false;
3667}
3668
3669FPOptions Expr::getFPFeaturesInEffect(const LangOptions &LO) const {
3670 if (auto Call = dyn_cast<CallExpr>(this))
3671 return Call->getFPFeaturesInEffect(LO);
3672 if (auto UO = dyn_cast<UnaryOperator>(this))
3673 return UO->getFPFeaturesInEffect(LO);
3674 if (auto BO = dyn_cast<BinaryOperator>(this))
3675 return BO->getFPFeaturesInEffect(LO);
3676 if (auto Cast = dyn_cast<CastExpr>(this))
3677 return Cast->getFPFeaturesInEffect(LO);
3678 return FPOptions::defaultWithoutTrailingStorage(LO);
3679}
3680
3681namespace {
3682 /// Look for a call to a non-trivial function within an expression.
3683 class NonTrivialCallFinder : public ConstEvaluatedExprVisitor<NonTrivialCallFinder>
3684 {
3685 typedef ConstEvaluatedExprVisitor<NonTrivialCallFinder> Inherited;
3686
3687 bool NonTrivial;
3688
3689 public:
3690 explicit NonTrivialCallFinder(const ASTContext &Context)
3691 : Inherited(Context), NonTrivial(false) { }
3692
3693 bool hasNonTrivialCall() const { return NonTrivial; }
3694
3695 void VisitCallExpr(const CallExpr *E) {
3696 if (const CXXMethodDecl *Method
3697 = dyn_cast_or_null<const CXXMethodDecl>(E->getCalleeDecl())) {
3698 if (Method->isTrivial()) {
3699 // Recurse to children of the call.
3700 Inherited::VisitStmt(E);
3701 return;
3702 }
3703 }
3704
3705 NonTrivial = true;
3706 }
3707
3708 void VisitCXXConstructExpr(const CXXConstructExpr *E) {
3709 if (E->getConstructor()->isTrivial()) {
3710 // Recurse to children of the call.
3711 Inherited::VisitStmt(E);
3712 return;
3713 }
3714
3715 NonTrivial = true;
3716 }
3717
3718 void VisitCXXBindTemporaryExpr(const CXXBindTemporaryExpr *E) {
3719 if (E->getTemporary()->getDestructor()->isTrivial()) {
3720 Inherited::VisitStmt(E);
3721 return;
3722 }
3723
3724 NonTrivial = true;
3725 }
3726 };
3727}
3728
3729bool Expr::hasNonTrivialCall(const ASTContext &Ctx) const {
3730 NonTrivialCallFinder Finder(Ctx);
3731 Finder.Visit(this);
3732 return Finder.hasNonTrivialCall();
3733}
3734
3735/// isNullPointerConstant - C99 6.3.2.3p3 - Return whether this is a null
3736/// pointer constant or not, as well as the specific kind of constant detected.
3737/// Null pointer constants can be integer constant expressions with the
3738/// value zero, casts of zero to void*, nullptr (C++0X), or __null
3739/// (a GNU extension).
3740Expr::NullPointerConstantKind
3741Expr::isNullPointerConstant(ASTContext &Ctx,
3742 NullPointerConstantValueDependence NPC) const {
3743 if (isValueDependent() &&
3744 (!Ctx.getLangOpts().CPlusPlus11 || Ctx.getLangOpts().MSVCCompat)) {
3745 // Error-dependent expr should never be a null pointer.
3746 if (containsErrors())
3747 return NPCK_NotNull;
3748 switch (NPC) {
3749 case NPC_NeverValueDependent:
3750 llvm_unreachable("Unexpected value dependent expression!")::llvm::llvm_unreachable_internal("Unexpected value dependent expression!"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 3750)
;
3751 case NPC_ValueDependentIsNull:
3752 if (isTypeDependent() || getType()->isIntegralType(Ctx))
3753 return NPCK_ZeroExpression;
3754 else
3755 return NPCK_NotNull;
3756
3757 case NPC_ValueDependentIsNotNull:
3758 return NPCK_NotNull;
3759 }
3760 }
3761
3762 // Strip off a cast to void*, if it exists. Except in C++.
3763 if (const ExplicitCastExpr *CE = dyn_cast<ExplicitCastExpr>(this)) {
3764 if (!Ctx.getLangOpts().CPlusPlus) {
3765 // Check that it is a cast to void*.
3766 if (const PointerType *PT = CE->getType()->getAs<PointerType>()) {
3767 QualType Pointee = PT->getPointeeType();
3768 Qualifiers Qs = Pointee.getQualifiers();
3769 // Only (void*)0 or equivalent are treated as nullptr. If pointee type
3770 // has non-default address space it is not treated as nullptr.
3771 // (__generic void*)0 in OpenCL 2.0 should not be treated as nullptr
3772 // since it cannot be assigned to a pointer to constant address space.
3773 if (Ctx.getLangOpts().OpenCL &&
3774 Pointee.getAddressSpace() == Ctx.getDefaultOpenCLPointeeAddrSpace())
3775 Qs.removeAddressSpace();
3776
3777 if (Pointee->isVoidType() && Qs.empty() && // to void*
3778 CE->getSubExpr()->getType()->isIntegerType()) // from int
3779 return CE->getSubExpr()->isNullPointerConstant(Ctx, NPC);
3780 }
3781 }
3782 } else if (const ImplicitCastExpr *ICE = dyn_cast<ImplicitCastExpr>(this)) {
3783 // Ignore the ImplicitCastExpr type entirely.
3784 return ICE->getSubExpr()->isNullPointerConstant(Ctx, NPC);
3785 } else if (const ParenExpr *PE = dyn_cast<ParenExpr>(this)) {
3786 // Accept ((void*)0) as a null pointer constant, as many other
3787 // implementations do.
3788 return PE->getSubExpr()->isNullPointerConstant(Ctx, NPC);
3789 } else if (const GenericSelectionExpr *GE =
3790 dyn_cast<GenericSelectionExpr>(this)) {
3791 if (GE->isResultDependent())
3792 return NPCK_NotNull;
3793 return GE->getResultExpr()->isNullPointerConstant(Ctx, NPC);
3794 } else if (const ChooseExpr *CE = dyn_cast<ChooseExpr>(this)) {
3795 if (CE->isConditionDependent())
3796 return NPCK_NotNull;
3797 return CE->getChosenSubExpr()->isNullPointerConstant(Ctx, NPC);
3798 } else if (const CXXDefaultArgExpr *DefaultArg
3799 = dyn_cast<CXXDefaultArgExpr>(this)) {
3800 // See through default argument expressions.
3801 return DefaultArg->getExpr()->isNullPointerConstant(Ctx, NPC);
3802 } else if (const CXXDefaultInitExpr *DefaultInit
3803 = dyn_cast<CXXDefaultInitExpr>(this)) {
3804 // See through default initializer expressions.
3805 return DefaultInit->getExpr()->isNullPointerConstant(Ctx, NPC);
3806 } else if (isa<GNUNullExpr>(this)) {
3807 // The GNU __null extension is always a null pointer constant.
3808 return NPCK_GNUNull;
3809 } else if (const MaterializeTemporaryExpr *M
3810 = dyn_cast<MaterializeTemporaryExpr>(this)) {
3811 return M->getSubExpr()->isNullPointerConstant(Ctx, NPC);
3812 } else if (const OpaqueValueExpr *OVE = dyn_cast<OpaqueValueExpr>(this)) {
3813 if (const Expr *Source = OVE->getSourceExpr())
3814 return Source->isNullPointerConstant(Ctx, NPC);
3815 }
3816
3817 // If the expression has no type information, it cannot be a null pointer
3818 // constant.
3819 if (getType().isNull())
3820 return NPCK_NotNull;
3821
3822 // C++11 nullptr_t is always a null pointer constant.
3823 if (getType()->isNullPtrType())
3824 return NPCK_CXX11_nullptr;
3825
3826 if (const RecordType *UT = getType()->getAsUnionType())
3827 if (!Ctx.getLangOpts().CPlusPlus11 &&
3828 UT && UT->getDecl()->hasAttr<TransparentUnionAttr>())
3829 if (const CompoundLiteralExpr *CLE = dyn_cast<CompoundLiteralExpr>(this)){
3830 const Expr *InitExpr = CLE->getInitializer();
3831 if (const InitListExpr *ILE = dyn_cast<InitListExpr>(InitExpr))
3832 return ILE->getInit(0)->isNullPointerConstant(Ctx, NPC);
3833 }
3834 // This expression must be an integer type.
3835 if (!getType()->isIntegerType() ||
3836 (Ctx.getLangOpts().CPlusPlus && getType()->isEnumeralType()))
3837 return NPCK_NotNull;
3838
3839 if (Ctx.getLangOpts().CPlusPlus11) {
3840 // C++11 [conv.ptr]p1: A null pointer constant is an integer literal with
3841 // value zero or a prvalue of type std::nullptr_t.
3842 // Microsoft mode permits C++98 rules reflecting MSVC behavior.
3843 const IntegerLiteral *Lit = dyn_cast<IntegerLiteral>(this);
3844 if (Lit && !Lit->getValue())
3845 return NPCK_ZeroLiteral;
3846 if (!Ctx.getLangOpts().MSVCCompat || !isCXX98IntegralConstantExpr(Ctx))
3847 return NPCK_NotNull;
3848 } else {
3849 // If we have an integer constant expression, we need to *evaluate* it and
3850 // test for the value 0.
3851 if (!isIntegerConstantExpr(Ctx))
3852 return NPCK_NotNull;
3853 }
3854
3855 if (EvaluateKnownConstInt(Ctx) != 0)
3856 return NPCK_NotNull;
3857
3858 if (isa<IntegerLiteral>(this))
3859 return NPCK_ZeroLiteral;
3860 return NPCK_ZeroExpression;
3861}
3862
3863/// If this expression is an l-value for an Objective C
3864/// property, find the underlying property reference expression.
3865const ObjCPropertyRefExpr *Expr::getObjCProperty() const {
3866 const Expr *E = this;
3867 while (true) {
3868 assert((E->isLValue() && E->getObjectKind() == OK_ObjCProperty) &&(static_cast <bool> ((E->isLValue() && E->
getObjectKind() == OK_ObjCProperty) && "expression is not a property reference"
) ? void (0) : __assert_fail ("(E->isLValue() && E->getObjectKind() == OK_ObjCProperty) && \"expression is not a property reference\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 3869, __extension__ __PRETTY_FUNCTION__))
3869 "expression is not a property reference")(static_cast <bool> ((E->isLValue() && E->
getObjectKind() == OK_ObjCProperty) && "expression is not a property reference"
) ? void (0) : __assert_fail ("(E->isLValue() && E->getObjectKind() == OK_ObjCProperty) && \"expression is not a property reference\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 3869, __extension__ __PRETTY_FUNCTION__))
;
3870 E = E->IgnoreParenCasts();
3871 if (const BinaryOperator *BO = dyn_cast<BinaryOperator>(E)) {
3872 if (BO->getOpcode() == BO_Comma) {
3873 E = BO->getRHS();
3874 continue;
3875 }
3876 }
3877
3878 break;
3879 }
3880
3881 return cast<ObjCPropertyRefExpr>(E);
3882}
3883
3884bool Expr::isObjCSelfExpr() const {
3885 const Expr *E = IgnoreParenImpCasts();
3886
3887 const DeclRefExpr *DRE = dyn_cast<DeclRefExpr>(E);
3888 if (!DRE)
3889 return false;
3890
3891 const ImplicitParamDecl *Param = dyn_cast<ImplicitParamDecl>(DRE->getDecl());
3892 if (!Param)
3893 return false;
3894
3895 const ObjCMethodDecl *M = dyn_cast<ObjCMethodDecl>(Param->getDeclContext());
3896 if (!M)
3897 return false;
3898
3899 return M->getSelfDecl() == Param;
3900}
3901
3902FieldDecl *Expr::getSourceBitField() {
3903 Expr *E = this->IgnoreParens();
3904
3905 while (ImplicitCastExpr *ICE = dyn_cast<ImplicitCastExpr>(E)) {
3906 if (ICE->getCastKind() == CK_LValueToRValue ||
3907 (ICE->isGLValue() && ICE->getCastKind() == CK_NoOp))
3908 E = ICE->getSubExpr()->IgnoreParens();
3909 else
3910 break;
3911 }
3912
3913 if (MemberExpr *MemRef = dyn_cast<MemberExpr>(E))
3914 if (FieldDecl *Field = dyn_cast<FieldDecl>(MemRef->getMemberDecl()))
3915 if (Field->isBitField())
3916 return Field;
3917
3918 if (ObjCIvarRefExpr *IvarRef = dyn_cast<ObjCIvarRefExpr>(E)) {
3919 FieldDecl *Ivar = IvarRef->getDecl();
3920 if (Ivar->isBitField())
3921 return Ivar;
3922 }
3923
3924 if (DeclRefExpr *DeclRef = dyn_cast<DeclRefExpr>(E)) {
3925 if (FieldDecl *Field = dyn_cast<FieldDecl>(DeclRef->getDecl()))
3926 if (Field->isBitField())
3927 return Field;
3928
3929 if (BindingDecl *BD = dyn_cast<BindingDecl>(DeclRef->getDecl()))
3930 if (Expr *E = BD->getBinding())
3931 return E->getSourceBitField();
3932 }
3933
3934 if (BinaryOperator *BinOp = dyn_cast<BinaryOperator>(E)) {
3935 if (BinOp->isAssignmentOp() && BinOp->getLHS())
3936 return BinOp->getLHS()->getSourceBitField();
3937
3938 if (BinOp->getOpcode() == BO_Comma && BinOp->getRHS())
3939 return BinOp->getRHS()->getSourceBitField();
3940 }
3941
3942 if (UnaryOperator *UnOp = dyn_cast<UnaryOperator>(E))
3943 if (UnOp->isPrefix() && UnOp->isIncrementDecrementOp())
3944 return UnOp->getSubExpr()->getSourceBitField();
3945
3946 return nullptr;
3947}
3948
3949bool Expr::refersToVectorElement() const {
3950 // FIXME: Why do we not just look at the ObjectKind here?
3951 const Expr *E = this->IgnoreParens();
3952
3953 while (const ImplicitCastExpr *ICE = dyn_cast<ImplicitCastExpr>(E)) {
3954 if (ICE->isGLValue() && ICE->getCastKind() == CK_NoOp)
3955 E = ICE->getSubExpr()->IgnoreParens();
3956 else
3957 break;
3958 }
3959
3960 if (const ArraySubscriptExpr *ASE = dyn_cast<ArraySubscriptExpr>(E))
3961 return ASE->getBase()->getType()->isVectorType();
3962
3963 if (isa<ExtVectorElementExpr>(E))
3964 return true;
3965
3966 if (auto *DRE = dyn_cast<DeclRefExpr>(E))
3967 if (auto *BD = dyn_cast<BindingDecl>(DRE->getDecl()))
3968 if (auto *E = BD->getBinding())
3969 return E->refersToVectorElement();
3970
3971 return false;
3972}
3973
3974bool Expr::refersToGlobalRegisterVar() const {
3975 const Expr *E = this->IgnoreParenImpCasts();
3976
3977 if (const DeclRefExpr *DRE = dyn_cast<DeclRefExpr>(E))
3978 if (const auto *VD = dyn_cast<VarDecl>(DRE->getDecl()))
3979 if (VD->getStorageClass() == SC_Register &&
3980 VD->hasAttr<AsmLabelAttr>() && !VD->isLocalVarDecl())
3981 return true;
3982
3983 return false;
3984}
3985
3986bool Expr::isSameComparisonOperand(const Expr* E1, const Expr* E2) {
3987 E1 = E1->IgnoreParens();
3988 E2 = E2->IgnoreParens();
3989
3990 if (E1->getStmtClass() != E2->getStmtClass())
3991 return false;
3992
3993 switch (E1->getStmtClass()) {
3994 default:
3995 return false;
3996 case CXXThisExprClass:
3997 return true;
3998 case DeclRefExprClass: {
3999 // DeclRefExpr without an ImplicitCastExpr can happen for integral
4000 // template parameters.
4001 const auto *DRE1 = cast<DeclRefExpr>(E1);
4002 const auto *DRE2 = cast<DeclRefExpr>(E2);
4003 return DRE1->isPRValue() && DRE2->isPRValue() &&
4004 DRE1->getDecl() == DRE2->getDecl();
4005 }
4006 case ImplicitCastExprClass: {
4007 // Peel off implicit casts.
4008 while (true) {
4009 const auto *ICE1 = dyn_cast<ImplicitCastExpr>(E1);
4010 const auto *ICE2 = dyn_cast<ImplicitCastExpr>(E2);
4011 if (!ICE1 || !ICE2)
4012 return false;
4013 if (ICE1->getCastKind() != ICE2->getCastKind())
4014 return false;
4015 E1 = ICE1->getSubExpr()->IgnoreParens();
4016 E2 = ICE2->getSubExpr()->IgnoreParens();
4017 // The final cast must be one of these types.
4018 if (ICE1->getCastKind() == CK_LValueToRValue ||
4019 ICE1->getCastKind() == CK_ArrayToPointerDecay ||
4020 ICE1->getCastKind() == CK_FunctionToPointerDecay) {
4021 break;
4022 }
4023 }
4024
4025 const auto *DRE1 = dyn_cast<DeclRefExpr>(E1);
4026 const auto *DRE2 = dyn_cast<DeclRefExpr>(E2);
4027 if (DRE1 && DRE2)
4028 return declaresSameEntity(DRE1->getDecl(), DRE2->getDecl());
4029
4030 const auto *Ivar1 = dyn_cast<ObjCIvarRefExpr>(E1);
4031 const auto *Ivar2 = dyn_cast<ObjCIvarRefExpr>(E2);
4032 if (Ivar1 && Ivar2) {
4033 return Ivar1->isFreeIvar() && Ivar2->isFreeIvar() &&
4034 declaresSameEntity(Ivar1->getDecl(), Ivar2->getDecl());
4035 }
4036
4037 const auto *Array1 = dyn_cast<ArraySubscriptExpr>(E1);
4038 const auto *Array2 = dyn_cast<ArraySubscriptExpr>(E2);
4039 if (Array1 && Array2) {
4040 if (!isSameComparisonOperand(Array1->getBase(), Array2->getBase()))
4041 return false;
4042
4043 auto Idx1 = Array1->getIdx();
4044 auto Idx2 = Array2->getIdx();
4045 const auto Integer1 = dyn_cast<IntegerLiteral>(Idx1);
4046 const auto Integer2 = dyn_cast<IntegerLiteral>(Idx2);
4047 if (Integer1 && Integer2) {
4048 if (!llvm::APInt::isSameValue(Integer1->getValue(),
4049 Integer2->getValue()))
4050 return false;
4051 } else {
4052 if (!isSameComparisonOperand(Idx1, Idx2))
4053 return false;
4054 }
4055
4056 return true;
4057 }
4058
4059 // Walk the MemberExpr chain.
4060 while (isa<MemberExpr>(E1) && isa<MemberExpr>(E2)) {
4061 const auto *ME1 = cast<MemberExpr>(E1);
4062 const auto *ME2 = cast<MemberExpr>(E2);
4063 if (!declaresSameEntity(ME1->getMemberDecl(), ME2->getMemberDecl()))
4064 return false;
4065 if (const auto *D = dyn_cast<VarDecl>(ME1->getMemberDecl()))
4066 if (D->isStaticDataMember())
4067 return true;
4068 E1 = ME1->getBase()->IgnoreParenImpCasts();
4069 E2 = ME2->getBase()->IgnoreParenImpCasts();
4070 }
4071
4072 if (isa<CXXThisExpr>(E1) && isa<CXXThisExpr>(E2))
4073 return true;
4074
4075 // A static member variable can end the MemberExpr chain with either
4076 // a MemberExpr or a DeclRefExpr.
4077 auto getAnyDecl = [](const Expr *E) -> const ValueDecl * {
4078 if (const auto *DRE = dyn_cast<DeclRefExpr>(E))
4079 return DRE->getDecl();
4080 if (const auto *ME = dyn_cast<MemberExpr>(E))
4081 return ME->getMemberDecl();
4082 return nullptr;
4083 };
4084
4085 const ValueDecl *VD1 = getAnyDecl(E1);
4086 const ValueDecl *VD2 = getAnyDecl(E2);
4087 return declaresSameEntity(VD1, VD2);
4088 }
4089 }
4090}
4091
4092/// isArrow - Return true if the base expression is a pointer to vector,
4093/// return false if the base expression is a vector.
4094bool ExtVectorElementExpr::isArrow() const {
4095 return getBase()->getType()->isPointerType();
4096}
4097
4098unsigned ExtVectorElementExpr::getNumElements() const {
4099 if (const VectorType *VT = getType()->getAs<VectorType>())
4100 return VT->getNumElements();
4101 return 1;
4102}
4103
4104/// containsDuplicateElements - Return true if any element access is repeated.
4105bool ExtVectorElementExpr::containsDuplicateElements() const {
4106 // FIXME: Refactor this code to an accessor on the AST node which returns the
4107 // "type" of component access, and share with code below and in Sema.
4108 StringRef Comp = Accessor->getName();
4109
4110 // Halving swizzles do not contain duplicate elements.
4111 if (Comp == "hi" || Comp == "lo" || Comp == "even" || Comp == "odd")
4112 return false;
4113
4114 // Advance past s-char prefix on hex swizzles.
4115 if (Comp[0] == 's' || Comp[0] == 'S')
4116 Comp = Comp.substr(1);
4117
4118 for (unsigned i = 0, e = Comp.size(); i != e; ++i)
4119 if (Comp.substr(i + 1).contains(Comp[i]))
4120 return true;
4121
4122 return false;
4123}
4124
4125/// getEncodedElementAccess - We encode the fields as a llvm ConstantArray.
4126void ExtVectorElementExpr::getEncodedElementAccess(
4127 SmallVectorImpl<uint32_t> &Elts) const {
4128 StringRef Comp = Accessor->getName();
4129 bool isNumericAccessor = false;
4130 if (Comp[0] == 's' || Comp[0] == 'S') {
4131 Comp = Comp.substr(1);
4132 isNumericAccessor = true;
4133 }
4134
4135 bool isHi = Comp == "hi";
4136 bool isLo = Comp == "lo";
4137 bool isEven = Comp == "even";
4138 bool isOdd = Comp == "odd";
4139
4140 for (unsigned i = 0, e = getNumElements(); i != e; ++i) {
4141 uint64_t Index;
4142
4143 if (isHi)
4144 Index = e + i;
4145 else if (isLo)
4146 Index = i;
4147 else if (isEven)
4148 Index = 2 * i;
4149 else if (isOdd)
4150 Index = 2 * i + 1;
4151 else
4152 Index = ExtVectorType::getAccessorIdx(Comp[i], isNumericAccessor);
4153
4154 Elts.push_back(Index);
4155 }
4156}
4157
4158ShuffleVectorExpr::ShuffleVectorExpr(const ASTContext &C, ArrayRef<Expr *> args,
4159 QualType Type, SourceLocation BLoc,
4160 SourceLocation RP)
4161 : Expr(ShuffleVectorExprClass, Type, VK_PRValue, OK_Ordinary),
4162 BuiltinLoc(BLoc), RParenLoc(RP), NumExprs(args.size()) {
4163 SubExprs = new (C) Stmt*[args.size()];
4164 for (unsigned i = 0; i != args.size(); i++)
4165 SubExprs[i] = args[i];
4166
4167 setDependence(computeDependence(this));
4168}
4169
4170void ShuffleVectorExpr::setExprs(const ASTContext &C, ArrayRef<Expr *> Exprs) {
4171 if (SubExprs) C.Deallocate(SubExprs);
4172
4173 this->NumExprs = Exprs.size();
4174 SubExprs = new (C) Stmt*[NumExprs];
4175 memcpy(SubExprs, Exprs.data(), sizeof(Expr *) * Exprs.size());
4176}
4177
4178GenericSelectionExpr::GenericSelectionExpr(
4179 const ASTContext &, SourceLocation GenericLoc, Expr *ControllingExpr,
4180 ArrayRef<TypeSourceInfo *> AssocTypes, ArrayRef<Expr *> AssocExprs,
4181 SourceLocation DefaultLoc, SourceLocation RParenLoc,
4182 bool ContainsUnexpandedParameterPack, unsigned ResultIndex)
4183 : Expr(GenericSelectionExprClass, AssocExprs[ResultIndex]->getType(),
4184 AssocExprs[ResultIndex]->getValueKind(),
4185 AssocExprs[ResultIndex]->getObjectKind()),
4186 NumAssocs(AssocExprs.size()), ResultIndex(ResultIndex),
4187 DefaultLoc(DefaultLoc), RParenLoc(RParenLoc) {
4188 assert(AssocTypes.size() == AssocExprs.size() &&(static_cast <bool> (AssocTypes.size() == AssocExprs.size
() && "Must have the same number of association expressions"
" and TypeSourceInfo!") ? void (0) : __assert_fail ("AssocTypes.size() == AssocExprs.size() && \"Must have the same number of association expressions\" \" and TypeSourceInfo!\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4190, __extension__ __PRETTY_FUNCTION__))
4189 "Must have the same number of association expressions"(static_cast <bool> (AssocTypes.size() == AssocExprs.size
() && "Must have the same number of association expressions"
" and TypeSourceInfo!") ? void (0) : __assert_fail ("AssocTypes.size() == AssocExprs.size() && \"Must have the same number of association expressions\" \" and TypeSourceInfo!\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4190, __extension__ __PRETTY_FUNCTION__))
4190 " and TypeSourceInfo!")(static_cast <bool> (AssocTypes.size() == AssocExprs.size
() && "Must have the same number of association expressions"
" and TypeSourceInfo!") ? void (0) : __assert_fail ("AssocTypes.size() == AssocExprs.size() && \"Must have the same number of association expressions\" \" and TypeSourceInfo!\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4190, __extension__ __PRETTY_FUNCTION__))
;
4191 assert(ResultIndex < NumAssocs && "ResultIndex is out-of-bounds!")(static_cast <bool> (ResultIndex < NumAssocs &&
"ResultIndex is out-of-bounds!") ? void (0) : __assert_fail (
"ResultIndex < NumAssocs && \"ResultIndex is out-of-bounds!\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4191, __extension__ __PRETTY_FUNCTION__))
;
4192
4193 GenericSelectionExprBits.GenericLoc = GenericLoc;
4194 getTrailingObjects<Stmt *>()[ControllingIndex] = ControllingExpr;
4195 std::copy(AssocExprs.begin(), AssocExprs.end(),
4196 getTrailingObjects<Stmt *>() + AssocExprStartIndex);
4197 std::copy(AssocTypes.begin(), AssocTypes.end(),
4198 getTrailingObjects<TypeSourceInfo *>());
4199
4200 setDependence(computeDependence(this, ContainsUnexpandedParameterPack));
4201}
4202
4203GenericSelectionExpr::GenericSelectionExpr(
4204 const ASTContext &Context, SourceLocation GenericLoc, Expr *ControllingExpr,
4205 ArrayRef<TypeSourceInfo *> AssocTypes, ArrayRef<Expr *> AssocExprs,
4206 SourceLocation DefaultLoc, SourceLocation RParenLoc,
4207 bool ContainsUnexpandedParameterPack)
4208 : Expr(GenericSelectionExprClass, Context.DependentTy, VK_PRValue,
4209 OK_Ordinary),
4210 NumAssocs(AssocExprs.size()), ResultIndex(ResultDependentIndex),
4211 DefaultLoc(DefaultLoc), RParenLoc(RParenLoc) {
4212 assert(AssocTypes.size() == AssocExprs.size() &&(static_cast <bool> (AssocTypes.size() == AssocExprs.size
() && "Must have the same number of association expressions"
" and TypeSourceInfo!") ? void (0) : __assert_fail ("AssocTypes.size() == AssocExprs.size() && \"Must have the same number of association expressions\" \" and TypeSourceInfo!\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4214, __extension__ __PRETTY_FUNCTION__))
4213 "Must have the same number of association expressions"(static_cast <bool> (AssocTypes.size() == AssocExprs.size
() && "Must have the same number of association expressions"
" and TypeSourceInfo!") ? void (0) : __assert_fail ("AssocTypes.size() == AssocExprs.size() && \"Must have the same number of association expressions\" \" and TypeSourceInfo!\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4214, __extension__ __PRETTY_FUNCTION__))
4214 " and TypeSourceInfo!")(static_cast <bool> (AssocTypes.size() == AssocExprs.size
() && "Must have the same number of association expressions"
" and TypeSourceInfo!") ? void (0) : __assert_fail ("AssocTypes.size() == AssocExprs.size() && \"Must have the same number of association expressions\" \" and TypeSourceInfo!\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4214, __extension__ __PRETTY_FUNCTION__))
;
4215
4216 GenericSelectionExprBits.GenericLoc = GenericLoc;
4217 getTrailingObjects<Stmt *>()[ControllingIndex] = ControllingExpr;
4218 std::copy(AssocExprs.begin(), AssocExprs.end(),
4219 getTrailingObjects<Stmt *>() + AssocExprStartIndex);
4220 std::copy(AssocTypes.begin(), AssocTypes.end(),
4221 getTrailingObjects<TypeSourceInfo *>());
4222
4223 setDependence(computeDependence(this, ContainsUnexpandedParameterPack));
4224}
4225
4226GenericSelectionExpr::GenericSelectionExpr(EmptyShell Empty, unsigned NumAssocs)
4227 : Expr(GenericSelectionExprClass, Empty), NumAssocs(NumAssocs) {}
4228
4229GenericSelectionExpr *GenericSelectionExpr::Create(
4230 const ASTContext &Context, SourceLocation GenericLoc, Expr *ControllingExpr,
4231 ArrayRef<TypeSourceInfo *> AssocTypes, ArrayRef<Expr *> AssocExprs,
4232 SourceLocation DefaultLoc, SourceLocation RParenLoc,
4233 bool ContainsUnexpandedParameterPack, unsigned ResultIndex) {
4234 unsigned NumAssocs = AssocExprs.size();
4235 void *Mem = Context.Allocate(
4236 totalSizeToAlloc<Stmt *, TypeSourceInfo *>(1 + NumAssocs, NumAssocs),
4237 alignof(GenericSelectionExpr));
4238 return new (Mem) GenericSelectionExpr(
4239 Context, GenericLoc, ControllingExpr, AssocTypes, AssocExprs, DefaultLoc,
4240 RParenLoc, ContainsUnexpandedParameterPack, ResultIndex);
4241}
4242
4243GenericSelectionExpr *GenericSelectionExpr::Create(
4244 const ASTContext &Context, SourceLocation GenericLoc, Expr *ControllingExpr,
4245 ArrayRef<TypeSourceInfo *> AssocTypes, ArrayRef<Expr *> AssocExprs,
4246 SourceLocation DefaultLoc, SourceLocation RParenLoc,
4247 bool ContainsUnexpandedParameterPack) {
4248 unsigned NumAssocs = AssocExprs.size();
4249 void *Mem = Context.Allocate(
4250 totalSizeToAlloc<Stmt *, TypeSourceInfo *>(1 + NumAssocs, NumAssocs),
4251 alignof(GenericSelectionExpr));
4252 return new (Mem) GenericSelectionExpr(
4253 Context, GenericLoc, ControllingExpr, AssocTypes, AssocExprs, DefaultLoc,
4254 RParenLoc, ContainsUnexpandedParameterPack);
4255}
4256
4257GenericSelectionExpr *
4258GenericSelectionExpr::CreateEmpty(const ASTContext &Context,
4259 unsigned NumAssocs) {
4260 void *Mem = Context.Allocate(
4261 totalSizeToAlloc<Stmt *, TypeSourceInfo *>(1 + NumAssocs, NumAssocs),
4262 alignof(GenericSelectionExpr));
4263 return new (Mem) GenericSelectionExpr(EmptyShell(), NumAssocs);
4264}
4265
4266//===----------------------------------------------------------------------===//
4267// DesignatedInitExpr
4268//===----------------------------------------------------------------------===//
4269
4270IdentifierInfo *DesignatedInitExpr::Designator::getFieldName() const {
4271 assert(Kind == FieldDesignator && "Only valid on a field designator")(static_cast <bool> (Kind == FieldDesignator &&
"Only valid on a field designator") ? void (0) : __assert_fail
("Kind == FieldDesignator && \"Only valid on a field designator\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4271, __extension__ __PRETTY_FUNCTION__))
;
4272 if (Field.NameOrField & 0x01)
4273 return reinterpret_cast<IdentifierInfo *>(Field.NameOrField & ~0x01);
4274 return getField()->getIdentifier();
4275}
4276
4277DesignatedInitExpr::DesignatedInitExpr(const ASTContext &C, QualType Ty,
4278 llvm::ArrayRef<Designator> Designators,
4279 SourceLocation EqualOrColonLoc,
4280 bool GNUSyntax,
4281 ArrayRef<Expr *> IndexExprs, Expr *Init)
4282 : Expr(DesignatedInitExprClass, Ty, Init->getValueKind(),
4283 Init->getObjectKind()),
4284 EqualOrColonLoc(EqualOrColonLoc), GNUSyntax(GNUSyntax),
4285 NumDesignators(Designators.size()), NumSubExprs(IndexExprs.size() + 1) {
4286 this->Designators = new (C) Designator[NumDesignators];
4287
4288 // Record the initializer itself.
4289 child_iterator Child = child_begin();
4290 *Child++ = Init;
4291
4292 // Copy the designators and their subexpressions, computing
4293 // value-dependence along the way.
4294 unsigned IndexIdx = 0;
4295 for (unsigned I = 0; I != NumDesignators; ++I) {
4296 this->Designators[I] = Designators[I];
4297 if (this->Designators[I].isArrayDesignator()) {
4298 // Copy the index expressions into permanent storage.
4299 *Child++ = IndexExprs[IndexIdx++];
4300 } else if (this->Designators[I].isArrayRangeDesignator()) {
4301 // Copy the start/end expressions into permanent storage.
4302 *Child++ = IndexExprs[IndexIdx++];
4303 *Child++ = IndexExprs[IndexIdx++];
4304 }
4305 }
4306
4307 assert(IndexIdx == IndexExprs.size() && "Wrong number of index expressions")(static_cast <bool> (IndexIdx == IndexExprs.size() &&
"Wrong number of index expressions") ? void (0) : __assert_fail
("IndexIdx == IndexExprs.size() && \"Wrong number of index expressions\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4307, __extension__ __PRETTY_FUNCTION__))
;
4308 setDependence(computeDependence(this));
4309}
4310
4311DesignatedInitExpr *
4312DesignatedInitExpr::Create(const ASTContext &C,
4313 llvm::ArrayRef<Designator> Designators,
4314 ArrayRef<Expr*> IndexExprs,
4315 SourceLocation ColonOrEqualLoc,
4316 bool UsesColonSyntax, Expr *Init) {
4317 void *Mem = C.Allocate(totalSizeToAlloc<Stmt *>(IndexExprs.size() + 1),
4318 alignof(DesignatedInitExpr));
4319 return new (Mem) DesignatedInitExpr(C, C.VoidTy, Designators,
4320 ColonOrEqualLoc, UsesColonSyntax,
4321 IndexExprs, Init);
4322}
4323
4324DesignatedInitExpr *DesignatedInitExpr::CreateEmpty(const ASTContext &C,
4325 unsigned NumIndexExprs) {
4326 void *Mem = C.Allocate(totalSizeToAlloc<Stmt *>(NumIndexExprs + 1),
4327 alignof(DesignatedInitExpr));
4328 return new (Mem) DesignatedInitExpr(NumIndexExprs + 1);
4329}
4330
4331void DesignatedInitExpr::setDesignators(const ASTContext &C,
4332 const Designator *Desigs,
4333 unsigned NumDesigs) {
4334 Designators = new (C) Designator[NumDesigs];
4335 NumDesignators = NumDesigs;
4336 for (unsigned I = 0; I != NumDesigs; ++I)
4337 Designators[I] = Desigs[I];
4338}
4339
4340SourceRange DesignatedInitExpr::getDesignatorsSourceRange() const {
4341 DesignatedInitExpr *DIE = const_cast<DesignatedInitExpr*>(this);
4342 if (size() == 1)
4343 return DIE->getDesignator(0)->getSourceRange();
4344 return SourceRange(DIE->getDesignator(0)->getBeginLoc(),
4345 DIE->getDesignator(size() - 1)->getEndLoc());
4346}
4347
4348SourceLocation DesignatedInitExpr::getBeginLoc() const {
4349 SourceLocation StartLoc;
4350 auto *DIE = const_cast<DesignatedInitExpr *>(this);
4351 Designator &First = *DIE->getDesignator(0);
4352 if (First.isFieldDesignator())
4353 StartLoc = GNUSyntax ? First.Field.FieldLoc : First.Field.DotLoc;
4354 else
4355 StartLoc = First.ArrayOrRange.LBracketLoc;
4356 return StartLoc;
4357}
4358
4359SourceLocation DesignatedInitExpr::getEndLoc() const {
4360 return getInit()->getEndLoc();
4361}
4362
4363Expr *DesignatedInitExpr::getArrayIndex(const Designator& D) const {
4364 assert(D.Kind == Designator::ArrayDesignator && "Requires array designator")(static_cast <bool> (D.Kind == Designator::ArrayDesignator
&& "Requires array designator") ? void (0) : __assert_fail
("D.Kind == Designator::ArrayDesignator && \"Requires array designator\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4364, __extension__ __PRETTY_FUNCTION__))
;
4365 return getSubExpr(D.ArrayOrRange.Index + 1);
4366}
4367
4368Expr *DesignatedInitExpr::getArrayRangeStart(const Designator &D) const {
4369 assert(D.Kind == Designator::ArrayRangeDesignator &&(static_cast <bool> (D.Kind == Designator::ArrayRangeDesignator
&& "Requires array range designator") ? void (0) : __assert_fail
("D.Kind == Designator::ArrayRangeDesignator && \"Requires array range designator\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4370, __extension__ __PRETTY_FUNCTION__))
4370 "Requires array range designator")(static_cast <bool> (D.Kind == Designator::ArrayRangeDesignator
&& "Requires array range designator") ? void (0) : __assert_fail
("D.Kind == Designator::ArrayRangeDesignator && \"Requires array range designator\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4370, __extension__ __PRETTY_FUNCTION__))
;
4371 return getSubExpr(D.ArrayOrRange.Index + 1);
4372}
4373
4374Expr *DesignatedInitExpr::getArrayRangeEnd(const Designator &D) const {
4375 assert(D.Kind == Designator::ArrayRangeDesignator &&(static_cast <bool> (D.Kind == Designator::ArrayRangeDesignator
&& "Requires array range designator") ? void (0) : __assert_fail
("D.Kind == Designator::ArrayRangeDesignator && \"Requires array range designator\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4376, __extension__ __PRETTY_FUNCTION__))
4376 "Requires array range designator")(static_cast <bool> (D.Kind == Designator::ArrayRangeDesignator
&& "Requires array range designator") ? void (0) : __assert_fail
("D.Kind == Designator::ArrayRangeDesignator && \"Requires array range designator\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4376, __extension__ __PRETTY_FUNCTION__))
;
4377 return getSubExpr(D.ArrayOrRange.Index + 2);
4378}
4379
4380/// Replaces the designator at index @p Idx with the series
4381/// of designators in [First, Last).
4382void DesignatedInitExpr::ExpandDesignator(const ASTContext &C, unsigned Idx,
4383 const Designator *First,
4384 const Designator *Last) {
4385 unsigned NumNewDesignators = Last - First;
4386 if (NumNewDesignators == 0) {
4387 std::copy_backward(Designators + Idx + 1,
4388 Designators + NumDesignators,
4389 Designators + Idx);
4390 --NumNewDesignators;
4391 return;
4392 }
4393 if (NumNewDesignators == 1) {
4394 Designators[Idx] = *First;
4395 return;
4396 }
4397
4398 Designator *NewDesignators
4399 = new (C) Designator[NumDesignators - 1 + NumNewDesignators];
4400 std::copy(Designators, Designators + Idx, NewDesignators);
4401 std::copy(First, Last, NewDesignators + Idx);
4402 std::copy(Designators + Idx + 1, Designators + NumDesignators,
4403 NewDesignators + Idx + NumNewDesignators);
4404 Designators = NewDesignators;
4405 NumDesignators = NumDesignators - 1 + NumNewDesignators;
4406}
4407
4408DesignatedInitUpdateExpr::DesignatedInitUpdateExpr(const ASTContext &C,
4409 SourceLocation lBraceLoc,
4410 Expr *baseExpr,
4411 SourceLocation rBraceLoc)
4412 : Expr(DesignatedInitUpdateExprClass, baseExpr->getType(), VK_PRValue,
4413 OK_Ordinary) {
4414 BaseAndUpdaterExprs[0] = baseExpr;
4415
4416 InitListExpr *ILE = new (C) InitListExpr(C, lBraceLoc, None, rBraceLoc);
4417 ILE->setType(baseExpr->getType());
4418 BaseAndUpdaterExprs[1] = ILE;
4419
4420 // FIXME: this is wrong, set it correctly.
4421 setDependence(ExprDependence::None);
4422}
4423
4424SourceLocation DesignatedInitUpdateExpr::getBeginLoc() const {
4425 return getBase()->getBeginLoc();
4426}
4427
4428SourceLocation DesignatedInitUpdateExpr::getEndLoc() const {
4429 return getBase()->getEndLoc();
4430}
4431
4432ParenListExpr::ParenListExpr(SourceLocation LParenLoc, ArrayRef<Expr *> Exprs,
4433 SourceLocation RParenLoc)
4434 : Expr(ParenListExprClass, QualType(), VK_PRValue, OK_Ordinary),
4435 LParenLoc(LParenLoc), RParenLoc(RParenLoc) {
4436 ParenListExprBits.NumExprs = Exprs.size();
4437
4438 for (unsigned I = 0, N = Exprs.size(); I != N; ++I)
4439 getTrailingObjects<Stmt *>()[I] = Exprs[I];
4440 setDependence(computeDependence(this));
4441}
4442
4443ParenListExpr::ParenListExpr(EmptyShell Empty, unsigned NumExprs)
4444 : Expr(ParenListExprClass, Empty) {
4445 ParenListExprBits.NumExprs = NumExprs;
4446}
4447
4448ParenListExpr *ParenListExpr::Create(const ASTContext &Ctx,
4449 SourceLocation LParenLoc,
4450 ArrayRef<Expr *> Exprs,
4451 SourceLocation RParenLoc) {
4452 void *Mem = Ctx.Allocate(totalSizeToAlloc<Stmt *>(Exprs.size()),
4453 alignof(ParenListExpr));
4454 return new (Mem) ParenListExpr(LParenLoc, Exprs, RParenLoc);
4455}
4456
4457ParenListExpr *ParenListExpr::CreateEmpty(const ASTContext &Ctx,
4458 unsigned NumExprs) {
4459 void *Mem =
4460 Ctx.Allocate(totalSizeToAlloc<Stmt *>(NumExprs), alignof(ParenListExpr));
4461 return new (Mem) ParenListExpr(EmptyShell(), NumExprs);
4462}
4463
4464BinaryOperator::BinaryOperator(const ASTContext &Ctx, Expr *lhs, Expr *rhs,
4465 Opcode opc, QualType ResTy, ExprValueKind VK,
4466 ExprObjectKind OK, SourceLocation opLoc,
4467 FPOptionsOverride FPFeatures)
4468 : Expr(BinaryOperatorClass, ResTy, VK, OK) {
4469 BinaryOperatorBits.Opc = opc;
4470 assert(!isCompoundAssignmentOp() &&(static_cast <bool> (!isCompoundAssignmentOp() &&
"Use CompoundAssignOperator for compound assignments") ? void
(0) : __assert_fail ("!isCompoundAssignmentOp() && \"Use CompoundAssignOperator for compound assignments\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4471, __extension__ __PRETTY_FUNCTION__))
4471 "Use CompoundAssignOperator for compound assignments")(static_cast <bool> (!isCompoundAssignmentOp() &&
"Use CompoundAssignOperator for compound assignments") ? void
(0) : __assert_fail ("!isCompoundAssignmentOp() && \"Use CompoundAssignOperator for compound assignments\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4471, __extension__ __PRETTY_FUNCTION__))
;
4472 BinaryOperatorBits.OpLoc = opLoc;
4473 SubExprs[LHS] = lhs;
4474 SubExprs[RHS] = rhs;
4475 BinaryOperatorBits.HasFPFeatures = FPFeatures.requiresTrailingStorage();
4476 if (hasStoredFPFeatures())
4477 setStoredFPFeatures(FPFeatures);
4478 setDependence(computeDependence(this));
4479}
4480
4481BinaryOperator::BinaryOperator(const ASTContext &Ctx, Expr *lhs, Expr *rhs,
4482 Opcode opc, QualType ResTy, ExprValueKind VK,
4483 ExprObjectKind OK, SourceLocation opLoc,
4484 FPOptionsOverride FPFeatures, bool dead2)
4485 : Expr(CompoundAssignOperatorClass, ResTy, VK, OK) {
4486 BinaryOperatorBits.Opc = opc;
4487 assert(isCompoundAssignmentOp() &&(static_cast <bool> (isCompoundAssignmentOp() &&
"Use CompoundAssignOperator for compound assignments") ? void
(0) : __assert_fail ("isCompoundAssignmentOp() && \"Use CompoundAssignOperator for compound assignments\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4488, __extension__ __PRETTY_FUNCTION__))
4488 "Use CompoundAssignOperator for compound assignments")(static_cast <bool> (isCompoundAssignmentOp() &&
"Use CompoundAssignOperator for compound assignments") ? void
(0) : __assert_fail ("isCompoundAssignmentOp() && \"Use CompoundAssignOperator for compound assignments\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4488, __extension__ __PRETTY_FUNCTION__))
;
4489 BinaryOperatorBits.OpLoc = opLoc;
4490 SubExprs[LHS] = lhs;
4491 SubExprs[RHS] = rhs;
4492 BinaryOperatorBits.HasFPFeatures = FPFeatures.requiresTrailingStorage();
4493 if (hasStoredFPFeatures())
4494 setStoredFPFeatures(FPFeatures);
4495 setDependence(computeDependence(this));
4496}
4497
4498BinaryOperator *BinaryOperator::CreateEmpty(const ASTContext &C,
4499 bool HasFPFeatures) {
4500 unsigned Extra = sizeOfTrailingObjects(HasFPFeatures);
4501 void *Mem =
4502 C.Allocate(sizeof(BinaryOperator) + Extra, alignof(BinaryOperator));
4503 return new (Mem) BinaryOperator(EmptyShell());
4504}
4505
4506BinaryOperator *BinaryOperator::Create(const ASTContext &C, Expr *lhs,
4507 Expr *rhs, Opcode opc, QualType ResTy,
4508 ExprValueKind VK, ExprObjectKind OK,
4509 SourceLocation opLoc,
4510 FPOptionsOverride FPFeatures) {
4511 bool HasFPFeatures = FPFeatures.requiresTrailingStorage();
4512 unsigned Extra = sizeOfTrailingObjects(HasFPFeatures);
4513 void *Mem =
4514 C.Allocate(sizeof(BinaryOperator) + Extra, alignof(BinaryOperator));
4515 return new (Mem)
4516 BinaryOperator(C, lhs, rhs, opc, ResTy, VK, OK, opLoc, FPFeatures);
4517}
4518
4519CompoundAssignOperator *
4520CompoundAssignOperator::CreateEmpty(const ASTContext &C, bool HasFPFeatures) {
4521 unsigned Extra = sizeOfTrailingObjects(HasFPFeatures);
4522 void *Mem = C.Allocate(sizeof(CompoundAssignOperator) + Extra,
4523 alignof(CompoundAssignOperator));
4524 return new (Mem) CompoundAssignOperator(C, EmptyShell(), HasFPFeatures);
4525}
4526
4527CompoundAssignOperator *
4528CompoundAssignOperator::Create(const ASTContext &C, Expr *lhs, Expr *rhs,
4529 Opcode opc, QualType ResTy, ExprValueKind VK,
4530 ExprObjectKind OK, SourceLocation opLoc,
4531 FPOptionsOverride FPFeatures,
4532 QualType CompLHSType, QualType CompResultType) {
4533 bool HasFPFeatures = FPFeatures.requiresTrailingStorage();
4534 unsigned Extra = sizeOfTrailingObjects(HasFPFeatures);
4535 void *Mem = C.Allocate(sizeof(CompoundAssignOperator) + Extra,
4536 alignof(CompoundAssignOperator));
4537 return new (Mem)
4538 CompoundAssignOperator(C, lhs, rhs, opc, ResTy, VK, OK, opLoc, FPFeatures,
4539 CompLHSType, CompResultType);
4540}
4541
4542UnaryOperator *UnaryOperator::CreateEmpty(const ASTContext &C,
4543 bool hasFPFeatures) {
4544 void *Mem = C.Allocate(totalSizeToAlloc<FPOptionsOverride>(hasFPFeatures),
4545 alignof(UnaryOperator));
4546 return new (Mem) UnaryOperator(hasFPFeatures, EmptyShell());
4547}
4548
4549UnaryOperator::UnaryOperator(const ASTContext &Ctx, Expr *input, Opcode opc,
4550 QualType type, ExprValueKind VK, ExprObjectKind OK,
4551 SourceLocation l, bool CanOverflow,
4552 FPOptionsOverride FPFeatures)
4553 : Expr(UnaryOperatorClass, type, VK, OK), Val(input) {
4554 UnaryOperatorBits.Opc = opc;
4555 UnaryOperatorBits.CanOverflow = CanOverflow;
4556 UnaryOperatorBits.Loc = l;
4557 UnaryOperatorBits.HasFPFeatures = FPFeatures.requiresTrailingStorage();
4558 if (hasStoredFPFeatures())
4559 setStoredFPFeatures(FPFeatures);
4560 setDependence(computeDependence(this, Ctx));
4561}
4562
4563UnaryOperator *UnaryOperator::Create(const ASTContext &C, Expr *input,
4564 Opcode opc, QualType type,
4565 ExprValueKind VK, ExprObjectKind OK,
4566 SourceLocation l, bool CanOverflow,
4567 FPOptionsOverride FPFeatures) {
4568 bool HasFPFeatures = FPFeatures.requiresTrailingStorage();
4569 unsigned Size = totalSizeToAlloc<FPOptionsOverride>(HasFPFeatures);
4570 void *Mem = C.Allocate(Size, alignof(UnaryOperator));
4571 return new (Mem)
4572 UnaryOperator(C, input, opc, type, VK, OK, l, CanOverflow, FPFeatures);
4573}
4574
4575const OpaqueValueExpr *OpaqueValueExpr::findInCopyConstruct(const Expr *e) {
4576 if (const ExprWithCleanups *ewc = dyn_cast<ExprWithCleanups>(e))
4577 e = ewc->getSubExpr();
4578 if (const MaterializeTemporaryExpr *m = dyn_cast<MaterializeTemporaryExpr>(e))
4579 e = m->getSubExpr();
4580 e = cast<CXXConstructExpr>(e)->getArg(0);
4581 while (const ImplicitCastExpr *ice = dyn_cast<ImplicitCastExpr>(e))
4582 e = ice->getSubExpr();
4583 return cast<OpaqueValueExpr>(e);
4584}
4585
4586PseudoObjectExpr *PseudoObjectExpr::Create(const ASTContext &Context,
4587 EmptyShell sh,
4588 unsigned numSemanticExprs) {
4589 void *buffer =
4590 Context.Allocate(totalSizeToAlloc<Expr *>(1 + numSemanticExprs),
4591 alignof(PseudoObjectExpr));
4592 return new(buffer) PseudoObjectExpr(sh, numSemanticExprs);
4593}
4594
4595PseudoObjectExpr::PseudoObjectExpr(EmptyShell shell, unsigned numSemanticExprs)
4596 : Expr(PseudoObjectExprClass, shell) {
4597 PseudoObjectExprBits.NumSubExprs = numSemanticExprs + 1;
4598}
4599
4600PseudoObjectExpr *PseudoObjectExpr::Create(const ASTContext &C, Expr *syntax,
4601 ArrayRef<Expr*> semantics,
4602 unsigned resultIndex) {
4603 assert(syntax && "no syntactic expression!")(static_cast <bool> (syntax && "no syntactic expression!"
) ? void (0) : __assert_fail ("syntax && \"no syntactic expression!\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4603, __extension__ __PRETTY_FUNCTION__))
;
4604 assert(semantics.size() && "no semantic expressions!")(static_cast <bool> (semantics.size() && "no semantic expressions!"
) ? void (0) : __assert_fail ("semantics.size() && \"no semantic expressions!\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4604, __extension__ __PRETTY_FUNCTION__))
;
4605
4606 QualType type;
4607 ExprValueKind VK;
4608 if (resultIndex == NoResult) {
4609 type = C.VoidTy;
4610 VK = VK_PRValue;
4611 } else {
4612 assert(resultIndex < semantics.size())(static_cast <bool> (resultIndex < semantics.size())
? void (0) : __assert_fail ("resultIndex < semantics.size()"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4612, __extension__ __PRETTY_FUNCTION__))
;
4613 type = semantics[resultIndex]->getType();
4614 VK = semantics[resultIndex]->getValueKind();
4615 assert(semantics[resultIndex]->getObjectKind() == OK_Ordinary)(static_cast <bool> (semantics[resultIndex]->getObjectKind
() == OK_Ordinary) ? void (0) : __assert_fail ("semantics[resultIndex]->getObjectKind() == OK_Ordinary"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4615, __extension__ __PRETTY_FUNCTION__))
;
4616 }
4617
4618 void *buffer = C.Allocate(totalSizeToAlloc<Expr *>(semantics.size() + 1),
4619 alignof(PseudoObjectExpr));
4620 return new(buffer) PseudoObjectExpr(type, VK, syntax, semantics,
4621 resultIndex);
4622}
4623
4624PseudoObjectExpr::PseudoObjectExpr(QualType type, ExprValueKind VK,
4625 Expr *syntax, ArrayRef<Expr *> semantics,
4626 unsigned resultIndex)
4627 : Expr(PseudoObjectExprClass, type, VK, OK_Ordinary) {
4628 PseudoObjectExprBits.NumSubExprs = semantics.size() + 1;
4629 PseudoObjectExprBits.ResultIndex = resultIndex + 1;
4630
4631 for (unsigned i = 0, e = semantics.size() + 1; i != e; ++i) {
4632 Expr *E = (i == 0 ? syntax : semantics[i-1]);
4633 getSubExprsBuffer()[i] = E;
4634
4635 if (isa<OpaqueValueExpr>(E))
4636 assert(cast<OpaqueValueExpr>(E)->getSourceExpr() != nullptr &&(static_cast <bool> (cast<OpaqueValueExpr>(E)->
getSourceExpr() != nullptr && "opaque-value semantic expressions for pseudo-object "
"operations must have sources") ? void (0) : __assert_fail (
"cast<OpaqueValueExpr>(E)->getSourceExpr() != nullptr && \"opaque-value semantic expressions for pseudo-object \" \"operations must have sources\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4638, __extension__ __PRETTY_FUNCTION__))
4637 "opaque-value semantic expressions for pseudo-object "(static_cast <bool> (cast<OpaqueValueExpr>(E)->
getSourceExpr() != nullptr && "opaque-value semantic expressions for pseudo-object "
"operations must have sources") ? void (0) : __assert_fail (
"cast<OpaqueValueExpr>(E)->getSourceExpr() != nullptr && \"opaque-value semantic expressions for pseudo-object \" \"operations must have sources\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4638, __extension__ __PRETTY_FUNCTION__))
4638 "operations must have sources")(static_cast <bool> (cast<OpaqueValueExpr>(E)->
getSourceExpr() != nullptr && "opaque-value semantic expressions for pseudo-object "
"operations must have sources") ? void (0) : __assert_fail (
"cast<OpaqueValueExpr>(E)->getSourceExpr() != nullptr && \"opaque-value semantic expressions for pseudo-object \" \"operations must have sources\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4638, __extension__ __PRETTY_FUNCTION__))
;
4639 }
4640
4641 setDependence(computeDependence(this));
4642}
4643
4644//===----------------------------------------------------------------------===//
4645// Child Iterators for iterating over subexpressions/substatements
4646//===----------------------------------------------------------------------===//
4647
4648// UnaryExprOrTypeTraitExpr
4649Stmt::child_range UnaryExprOrTypeTraitExpr::children() {
4650 const_child_range CCR =
4651 const_cast<const UnaryExprOrTypeTraitExpr *>(this)->children();
4652 return child_range(cast_away_const(CCR.begin()), cast_away_const(CCR.end()));
4653}
4654
4655Stmt::const_child_range UnaryExprOrTypeTraitExpr::children() const {
4656 // If this is of a type and the type is a VLA type (and not a typedef), the
4657 // size expression of the VLA needs to be treated as an executable expression.
4658 // Why isn't this weirdness documented better in StmtIterator?
4659 if (isArgumentType()) {
4660 if (const VariableArrayType *T =
4661 dyn_cast<VariableArrayType>(getArgumentType().getTypePtr()))
4662 return const_child_range(const_child_iterator(T), const_child_iterator());
4663 return const_child_range(const_child_iterator(), const_child_iterator());
4664 }
4665 return const_child_range(&Argument.Ex, &Argument.Ex + 1);
4666}
4667
4668AtomicExpr::AtomicExpr(SourceLocation BLoc, ArrayRef<Expr *> args, QualType t,
4669 AtomicOp op, SourceLocation RP)
4670 : Expr(AtomicExprClass, t, VK_PRValue, OK_Ordinary),
4671 NumSubExprs(args.size()), BuiltinLoc(BLoc), RParenLoc(RP), Op(op) {
4672 assert(args.size() == getNumSubExprs(op) && "wrong number of subexpressions")(static_cast <bool> (args.size() == getNumSubExprs(op) &&
"wrong number of subexpressions") ? void (0) : __assert_fail
("args.size() == getNumSubExprs(op) && \"wrong number of subexpressions\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4672, __extension__ __PRETTY_FUNCTION__))
;
4673 for (unsigned i = 0; i != args.size(); i++)
4674 SubExprs[i] = args[i];
4675 setDependence(computeDependence(this));
4676}
4677
4678unsigned AtomicExpr::getNumSubExprs(AtomicOp Op) {
4679 switch (Op) {
4680 case AO__c11_atomic_init:
4681 case AO__opencl_atomic_init:
4682 case AO__c11_atomic_load:
4683 case AO__atomic_load_n:
4684 return 2;
4685
4686 case AO__opencl_atomic_load:
4687 case AO__c11_atomic_store:
4688 case AO__c11_atomic_exchange:
4689 case AO__atomic_load:
4690 case AO__atomic_store:
4691 case AO__atomic_store_n:
4692 case AO__atomic_exchange_n:
4693 case AO__c11_atomic_fetch_add:
4694 case AO__c11_atomic_fetch_sub:
4695 case AO__c11_atomic_fetch_and:
4696 case AO__c11_atomic_fetch_or:
4697 case AO__c11_atomic_fetch_xor:
4698 case AO__c11_atomic_fetch_nand:
4699 case AO__c11_atomic_fetch_max:
4700 case AO__c11_atomic_fetch_min:
4701 case AO__atomic_fetch_add:
4702 case AO__atomic_fetch_sub:
4703 case AO__atomic_fetch_and:
4704 case AO__atomic_fetch_or:
4705 case AO__atomic_fetch_xor:
4706 case AO__atomic_fetch_nand:
4707 case AO__atomic_add_fetch:
4708 case AO__atomic_sub_fetch:
4709 case AO__atomic_and_fetch:
4710 case AO__atomic_or_fetch:
4711 case AO__atomic_xor_fetch:
4712 case AO__atomic_nand_fetch:
4713 case AO__atomic_min_fetch:
4714 case AO__atomic_max_fetch:
4715 case AO__atomic_fetch_min:
4716 case AO__atomic_fetch_max:
4717 return 3;
4718
4719 case AO__opencl_atomic_store:
4720 case AO__opencl_atomic_exchange:
4721 case AO__opencl_atomic_fetch_add:
4722 case AO__opencl_atomic_fetch_sub:
4723 case AO__opencl_atomic_fetch_and:
4724 case AO__opencl_atomic_fetch_or:
4725 case AO__opencl_atomic_fetch_xor:
4726 case AO__opencl_atomic_fetch_min:
4727 case AO__opencl_atomic_fetch_max:
4728 case AO__atomic_exchange:
4729 return 4;
4730
4731 case AO__c11_atomic_compare_exchange_strong:
4732 case AO__c11_atomic_compare_exchange_weak:
4733 return 5;
4734
4735 case AO__opencl_atomic_compare_exchange_strong:
4736 case AO__opencl_atomic_compare_exchange_weak:
4737 case AO__atomic_compare_exchange:
4738 case AO__atomic_compare_exchange_n:
4739 return 6;
4740 }
4741 llvm_unreachable("unknown atomic op")::llvm::llvm_unreachable_internal("unknown atomic op", "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4741)
;
4742}
4743
4744QualType AtomicExpr::getValueType() const {
4745 auto T = getPtr()->getType()->castAs<PointerType>()->getPointeeType();
4746 if (auto AT = T->getAs<AtomicType>())
4747 return AT->getValueType();
4748 return T;
4749}
4750
4751QualType OMPArraySectionExpr::getBaseOriginalType(const Expr *Base) {
4752 unsigned ArraySectionCount = 0;
4753 while (auto *OASE = dyn_cast<OMPArraySectionExpr>(Base->IgnoreParens())) {
4754 Base = OASE->getBase();
4755 ++ArraySectionCount;
4756 }
4757 while (auto *ASE =
4758 dyn_cast<ArraySubscriptExpr>(Base->IgnoreParenImpCasts())) {
4759 Base = ASE->getBase();
4760 ++ArraySectionCount;
4761 }
4762 Base = Base->IgnoreParenImpCasts();
4763 auto OriginalTy = Base->getType();
4764 if (auto *DRE = dyn_cast<DeclRefExpr>(Base))
4765 if (auto *PVD = dyn_cast<ParmVarDecl>(DRE->getDecl()))
4766 OriginalTy = PVD->getOriginalType().getNonReferenceType();
4767
4768 for (unsigned Cnt = 0; Cnt < ArraySectionCount; ++Cnt) {
4769 if (OriginalTy->isAnyPointerType())
4770 OriginalTy = OriginalTy->getPointeeType();
4771 else {
4772 assert (OriginalTy->isArrayType())(static_cast <bool> (OriginalTy->isArrayType()) ? void
(0) : __assert_fail ("OriginalTy->isArrayType()", "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4772, __extension__ __PRETTY_FUNCTION__))
;
4773 OriginalTy = OriginalTy->castAsArrayTypeUnsafe()->getElementType();
4774 }
4775 }
4776 return OriginalTy;
4777}
4778
4779RecoveryExpr::RecoveryExpr(ASTContext &Ctx, QualType T, SourceLocation BeginLoc,
4780 SourceLocation EndLoc, ArrayRef<Expr *> SubExprs)
4781 : Expr(RecoveryExprClass, T.getNonReferenceType(),
4782 T->isDependentType() ? VK_LValue : getValueKindForType(T),
4783 OK_Ordinary),
4784 BeginLoc(BeginLoc), EndLoc(EndLoc), NumExprs(SubExprs.size()) {
4785 assert(!T.isNull())(static_cast <bool> (!T.isNull()) ? void (0) : __assert_fail
("!T.isNull()", "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4785, __extension__ __PRETTY_FUNCTION__))
;
4786 assert(llvm::all_of(SubExprs, [](Expr* E) { return E != nullptr; }))(static_cast <bool> (llvm::all_of(SubExprs, [](Expr* E)
{ return E != nullptr; })) ? void (0) : __assert_fail ("llvm::all_of(SubExprs, [](Expr* E) { return E != nullptr; })"
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4786, __extension__ __PRETTY_FUNCTION__))
;
4787
4788 llvm::copy(SubExprs, getTrailingObjects<Expr *>());
4789 setDependence(computeDependence(this));
4790}
4791
4792RecoveryExpr *RecoveryExpr::Create(ASTContext &Ctx, QualType T,
4793 SourceLocation BeginLoc,
4794 SourceLocation EndLoc,
4795 ArrayRef<Expr *> SubExprs) {
4796 void *Mem = Ctx.Allocate(totalSizeToAlloc<Expr *>(SubExprs.size()),
4797 alignof(RecoveryExpr));
4798 return new (Mem) RecoveryExpr(Ctx, T, BeginLoc, EndLoc, SubExprs);
4799}
4800
4801RecoveryExpr *RecoveryExpr::CreateEmpty(ASTContext &Ctx, unsigned NumSubExprs) {
4802 void *Mem = Ctx.Allocate(totalSizeToAlloc<Expr *>(NumSubExprs),
4803 alignof(RecoveryExpr));
4804 return new (Mem) RecoveryExpr(EmptyShell(), NumSubExprs);
4805}
4806
4807void OMPArrayShapingExpr::setDimensions(ArrayRef<Expr *> Dims) {
4808 assert((static_cast <bool> (NumDims == Dims.size() && "Preallocated number of dimensions is different from the provided one."
) ? void (0) : __assert_fail ("NumDims == Dims.size() && \"Preallocated number of dimensions is different from the provided one.\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4810, __extension__ __PRETTY_FUNCTION__))
4809 NumDims == Dims.size() &&(static_cast <bool> (NumDims == Dims.size() && "Preallocated number of dimensions is different from the provided one."
) ? void (0) : __assert_fail ("NumDims == Dims.size() && \"Preallocated number of dimensions is different from the provided one.\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4810, __extension__ __PRETTY_FUNCTION__))
4810 "Preallocated number of dimensions is different from the provided one.")(static_cast <bool> (NumDims == Dims.size() && "Preallocated number of dimensions is different from the provided one."
) ? void (0) : __assert_fail ("NumDims == Dims.size() && \"Preallocated number of dimensions is different from the provided one.\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4810, __extension__ __PRETTY_FUNCTION__))
;
4811 llvm::copy(Dims, getTrailingObjects<Expr *>());
4812}
4813
4814void OMPArrayShapingExpr::setBracketsRanges(ArrayRef<SourceRange> BR) {
4815 assert((static_cast <bool> (NumDims == BR.size() && "Preallocated number of dimensions is different from the provided one."
) ? void (0) : __assert_fail ("NumDims == BR.size() && \"Preallocated number of dimensions is different from the provided one.\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4817, __extension__ __PRETTY_FUNCTION__))
4816 NumDims == BR.size() &&(static_cast <bool> (NumDims == BR.size() && "Preallocated number of dimensions is different from the provided one."
) ? void (0) : __assert_fail ("NumDims == BR.size() && \"Preallocated number of dimensions is different from the provided one.\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4817, __extension__ __PRETTY_FUNCTION__))
4817 "Preallocated number of dimensions is different from the provided one.")(static_cast <bool> (NumDims == BR.size() && "Preallocated number of dimensions is different from the provided one."
) ? void (0) : __assert_fail ("NumDims == BR.size() && \"Preallocated number of dimensions is different from the provided one.\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4817, __extension__ __PRETTY_FUNCTION__))
;
4818 llvm::copy(BR, getTrailingObjects<SourceRange>());
4819}
4820
4821OMPArrayShapingExpr::OMPArrayShapingExpr(QualType ExprTy, Expr *Op,
4822 SourceLocation L, SourceLocation R,
4823 ArrayRef<Expr *> Dims)
4824 : Expr(OMPArrayShapingExprClass, ExprTy, VK_LValue, OK_Ordinary), LPLoc(L),
4825 RPLoc(R), NumDims(Dims.size()) {
4826 setBase(Op);
4827 setDimensions(Dims);
4828 setDependence(computeDependence(this));
4829}
4830
4831OMPArrayShapingExpr *
4832OMPArrayShapingExpr::Create(const ASTContext &Context, QualType T, Expr *Op,
4833 SourceLocation L, SourceLocation R,
4834 ArrayRef<Expr *> Dims,
4835 ArrayRef<SourceRange> BracketRanges) {
4836 assert(Dims.size() == BracketRanges.size() &&(static_cast <bool> (Dims.size() == BracketRanges.size(
) && "Different number of dimensions and brackets ranges."
) ? void (0) : __assert_fail ("Dims.size() == BracketRanges.size() && \"Different number of dimensions and brackets ranges.\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4837, __extension__ __PRETTY_FUNCTION__))
4837 "Different number of dimensions and brackets ranges.")(static_cast <bool> (Dims.size() == BracketRanges.size(
) && "Different number of dimensions and brackets ranges."
) ? void (0) : __assert_fail ("Dims.size() == BracketRanges.size() && \"Different number of dimensions and brackets ranges.\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4837, __extension__ __PRETTY_FUNCTION__))
;
4838 void *Mem = Context.Allocate(
4839 totalSizeToAlloc<Expr *, SourceRange>(Dims.size() + 1, Dims.size()),
4840 alignof(OMPArrayShapingExpr));
4841 auto *E = new (Mem) OMPArrayShapingExpr(T, Op, L, R, Dims);
4842 E->setBracketsRanges(BracketRanges);
4843 return E;
4844}
4845
4846OMPArrayShapingExpr *OMPArrayShapingExpr::CreateEmpty(const ASTContext &Context,
4847 unsigned NumDims) {
4848 void *Mem = Context.Allocate(
4849 totalSizeToAlloc<Expr *, SourceRange>(NumDims + 1, NumDims),
4850 alignof(OMPArrayShapingExpr));
4851 return new (Mem) OMPArrayShapingExpr(EmptyShell(), NumDims);
4852}
4853
4854void OMPIteratorExpr::setIteratorDeclaration(unsigned I, Decl *D) {
4855 assert(I < NumIterators &&(static_cast <bool> (I < NumIterators && "Idx is greater or equal the number of iterators definitions."
) ? void (0) : __assert_fail ("I < NumIterators && \"Idx is greater or equal the number of iterators definitions.\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4856, __extension__ __PRETTY_FUNCTION__))
4856 "Idx is greater or equal the number of iterators definitions.")(static_cast <bool> (I < NumIterators && "Idx is greater or equal the number of iterators definitions."
) ? void (0) : __assert_fail ("I < NumIterators && \"Idx is greater or equal the number of iterators definitions.\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4856, __extension__ __PRETTY_FUNCTION__))
;
4857 getTrailingObjects<Decl *>()[I] = D;
4858}
4859
4860void OMPIteratorExpr::setAssignmentLoc(unsigned I, SourceLocation Loc) {
4861 assert(I < NumIterators &&(static_cast <bool> (I < NumIterators && "Idx is greater or equal the number of iterators definitions."
) ? void (0) : __assert_fail ("I < NumIterators && \"Idx is greater or equal the number of iterators definitions.\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4862, __extension__ __PRETTY_FUNCTION__))
4862 "Idx is greater or equal the number of iterators definitions.")(static_cast <bool> (I < NumIterators && "Idx is greater or equal the number of iterators definitions."
) ? void (0) : __assert_fail ("I < NumIterators && \"Idx is greater or equal the number of iterators definitions.\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4862, __extension__ __PRETTY_FUNCTION__))
;
4863 getTrailingObjects<
4864 SourceLocation>()[I * static_cast<int>(RangeLocOffset::Total) +
4865 static_cast<int>(RangeLocOffset::AssignLoc)] = Loc;
4866}
4867
4868void OMPIteratorExpr::setIteratorRange(unsigned I, Expr *Begin,
4869 SourceLocation ColonLoc, Expr *End,
4870 SourceLocation SecondColonLoc,
4871 Expr *Step) {
4872 assert(I < NumIterators &&(static_cast <bool> (I < NumIterators && "Idx is greater or equal the number of iterators definitions."
) ? void (0) : __assert_fail ("I < NumIterators && \"Idx is greater or equal the number of iterators definitions.\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4873, __extension__ __PRETTY_FUNCTION__))
4873 "Idx is greater or equal the number of iterators definitions.")(static_cast <bool> (I < NumIterators && "Idx is greater or equal the number of iterators definitions."
) ? void (0) : __assert_fail ("I < NumIterators && \"Idx is greater or equal the number of iterators definitions.\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4873, __extension__ __PRETTY_FUNCTION__))
;
4874 getTrailingObjects<Expr *>()[I * static_cast<int>(RangeExprOffset::Total) +
4875 static_cast<int>(RangeExprOffset::Begin)] =
4876 Begin;
4877 getTrailingObjects<Expr *>()[I * static_cast<int>(RangeExprOffset::Total) +
4878 static_cast<int>(RangeExprOffset::End)] = End;
4879 getTrailingObjects<Expr *>()[I * static_cast<int>(RangeExprOffset::Total) +
4880 static_cast<int>(RangeExprOffset::Step)] = Step;
4881 getTrailingObjects<
4882 SourceLocation>()[I * static_cast<int>(RangeLocOffset::Total) +
4883 static_cast<int>(RangeLocOffset::FirstColonLoc)] =
4884 ColonLoc;
4885 getTrailingObjects<
4886 SourceLocation>()[I * static_cast<int>(RangeLocOffset::Total) +
4887 static_cast<int>(RangeLocOffset::SecondColonLoc)] =
4888 SecondColonLoc;
4889}
4890
4891Decl *OMPIteratorExpr::getIteratorDecl(unsigned I) {
4892 return getTrailingObjects<Decl *>()[I];
4893}
4894
4895OMPIteratorExpr::IteratorRange OMPIteratorExpr::getIteratorRange(unsigned I) {
4896 IteratorRange Res;
4897 Res.Begin =
4898 getTrailingObjects<Expr *>()[I * static_cast<int>(
4899 RangeExprOffset::Total) +
4900 static_cast<int>(RangeExprOffset::Begin)];
4901 Res.End =
4902 getTrailingObjects<Expr *>()[I * static_cast<int>(
4903 RangeExprOffset::Total) +
4904 static_cast<int>(RangeExprOffset::End)];
4905 Res.Step =
4906 getTrailingObjects<Expr *>()[I * static_cast<int>(
4907 RangeExprOffset::Total) +
4908 static_cast<int>(RangeExprOffset::Step)];
4909 return Res;
4910}
4911
4912SourceLocation OMPIteratorExpr::getAssignLoc(unsigned I) const {
4913 return getTrailingObjects<
4914 SourceLocation>()[I * static_cast<int>(RangeLocOffset::Total) +
4915 static_cast<int>(RangeLocOffset::AssignLoc)];
4916}
4917
4918SourceLocation OMPIteratorExpr::getColonLoc(unsigned I) const {
4919 return getTrailingObjects<
4920 SourceLocation>()[I * static_cast<int>(RangeLocOffset::Total) +
4921 static_cast<int>(RangeLocOffset::FirstColonLoc)];
4922}
4923
4924SourceLocation OMPIteratorExpr::getSecondColonLoc(unsigned I) const {
4925 return getTrailingObjects<
4926 SourceLocation>()[I * static_cast<int>(RangeLocOffset::Total) +
4927 static_cast<int>(RangeLocOffset::SecondColonLoc)];
4928}
4929
4930void OMPIteratorExpr::setHelper(unsigned I, const OMPIteratorHelperData &D) {
4931 getTrailingObjects<OMPIteratorHelperData>()[I] = D;
4932}
4933
4934OMPIteratorHelperData &OMPIteratorExpr::getHelper(unsigned I) {
4935 return getTrailingObjects<OMPIteratorHelperData>()[I];
4936}
4937
4938const OMPIteratorHelperData &OMPIteratorExpr::getHelper(unsigned I) const {
4939 return getTrailingObjects<OMPIteratorHelperData>()[I];
4940}
4941
4942OMPIteratorExpr::OMPIteratorExpr(
4943 QualType ExprTy, SourceLocation IteratorKwLoc, SourceLocation L,
4944 SourceLocation R, ArrayRef<OMPIteratorExpr::IteratorDefinition> Data,
4945 ArrayRef<OMPIteratorHelperData> Helpers)
4946 : Expr(OMPIteratorExprClass, ExprTy, VK_LValue, OK_Ordinary),
4947 IteratorKwLoc(IteratorKwLoc), LPLoc(L), RPLoc(R),
4948 NumIterators(Data.size()) {
4949 for (unsigned I = 0, E = Data.size(); I < E; ++I) {
4950 const IteratorDefinition &D = Data[I];
4951 setIteratorDeclaration(I, D.IteratorDecl);
4952 setAssignmentLoc(I, D.AssignmentLoc);
4953 setIteratorRange(I, D.Range.Begin, D.ColonLoc, D.Range.End,
4954 D.SecondColonLoc, D.Range.Step);
4955 setHelper(I, Helpers[I]);
4956 }
4957 setDependence(computeDependence(this));
4958}
4959
4960OMPIteratorExpr *
4961OMPIteratorExpr::Create(const ASTContext &Context, QualType T,
4962 SourceLocation IteratorKwLoc, SourceLocation L,
4963 SourceLocation R,
4964 ArrayRef<OMPIteratorExpr::IteratorDefinition> Data,
4965 ArrayRef<OMPIteratorHelperData> Helpers) {
4966 assert(Data.size() == Helpers.size() &&(static_cast <bool> (Data.size() == Helpers.size() &&
"Data and helpers must have the same size.") ? void (0) : __assert_fail
("Data.size() == Helpers.size() && \"Data and helpers must have the same size.\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4967, __extension__ __PRETTY_FUNCTION__))
4967 "Data and helpers must have the same size.")(static_cast <bool> (Data.size() == Helpers.size() &&
"Data and helpers must have the same size.") ? void (0) : __assert_fail
("Data.size() == Helpers.size() && \"Data and helpers must have the same size.\""
, "/build/llvm-toolchain-snapshot-14~++20211107111407+70986ea3d6ae/clang/lib/AST/Expr.cpp"
, 4967, __extension__ __PRETTY_FUNCTION__))
;
4968 void *Mem = Context.Allocate(
4969 totalSizeToAlloc<Decl *, Expr *, SourceLocation, OMPIteratorHelperData>(
4970 Data.size(), Data.size() * static_cast<int>(RangeExprOffset::Total),
4971 Data.size() * static_cast<int>(RangeLocOffset::Total),
4972 Helpers.size()),
4973 alignof(OMPIteratorExpr));
4974 return new (Mem) OMPIteratorExpr(T, IteratorKwLoc, L, R, Data, Helpers);
4975}
4976
4977OMPIteratorExpr *OMPIteratorExpr::CreateEmpty(const ASTContext &Context,
4978 unsigned NumIterators) {
4979 void *Mem = Context.Allocate(
4980 totalSizeToAlloc<Decl *, Expr *, SourceLocation, OMPIteratorHelperData>(
4981 NumIterators, NumIterators * static_cast<int>(RangeExprOffset::Total),
4982 NumIterators * static_cast<int>(RangeLocOffset::Total), NumIterators),
4983 alignof(OMPIteratorExpr));
4984 return new (Mem) OMPIteratorExpr(EmptyShell(), NumIterators);
4985}

/usr/lib/gcc/x86_64-linux-gnu/10/../../../../include/c++/10/bits/stl_iterator.h

1// Iterators -*- C++ -*-
2
3// Copyright (C) 2001-2020 Free Software Foundation, Inc.
4//
5// This file is part of the GNU ISO C++ Library. This library is free
6// software; you can redistribute it and/or modify it under the
7// terms of the GNU General Public License as published by the
8// Free Software Foundation; either version 3, or (at your option)
9// any later version.
10
11// This library is distributed in the hope that it will be useful,
12// but WITHOUT ANY WARRANTY; without even the implied warranty of
13// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14// GNU General Public License for more details.
15
16// Under Section 7 of GPL version 3, you are granted additional
17// permissions described in the GCC Runtime Library Exception, version
18// 3.1, as published by the Free Software Foundation.
19
20// You should have received a copy of the GNU General Public License and
21// a copy of the GCC Runtime Library Exception along with this program;
22// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
23// <http://www.gnu.org/licenses/>.
24
25/*
26 *
27 * Copyright (c) 1994
28 * Hewlett-Packard Company
29 *
30 * Permission to use, copy, modify, distribute and sell this software
31 * and its documentation for any purpose is hereby granted without fee,
32 * provided that the above copyright notice appear in all copies and
33 * that both that copyright notice and this permission notice appear
34 * in supporting documentation. Hewlett-Packard Company makes no
35 * representations about the suitability of this software for any
36 * purpose. It is provided "as is" without express or implied warranty.
37 *
38 *
39 * Copyright (c) 1996-1998
40 * Silicon Graphics Computer Systems, Inc.
41 *
42 * Permission to use, copy, modify, distribute and sell this software
43 * and its documentation for any purpose is hereby granted without fee,
44 * provided that the above copyright notice appear in all copies and
45 * that both that copyright notice and this permission notice appear
46 * in supporting documentation. Silicon Graphics makes no
47 * representations about the suitability of this software for any
48 * purpose. It is provided "as is" without express or implied warranty.
49 */
50
51/** @file bits/stl_iterator.h
52 * This is an internal header file, included by other library headers.
53 * Do not attempt to use it directly. @headername{iterator}
54 *
55 * This file implements reverse_iterator, back_insert_iterator,
56 * front_insert_iterator, insert_iterator, __normal_iterator, and their
57 * supporting functions and overloaded operators.
58 */
59
60#ifndef _STL_ITERATOR_H1
61#define _STL_ITERATOR_H1 1
62
63#include <bits/cpp_type_traits.h>
64#include <ext/type_traits.h>
65#include <bits/move.h>
66#include <bits/ptr_traits.h>
67
68#if __cplusplus201402L >= 201103L
69# include <type_traits>
70#endif
71
72#if __cplusplus201402L > 201703L
73# define __cpp_lib_array_constexpr 201811L
74# define __cpp_lib_constexpr_iterator 201811L
75#elif __cplusplus201402L == 201703L
76# define __cpp_lib_array_constexpr 201803L
77#endif
78
79#if __cplusplus201402L > 201703L
80# include <compare>
81# include <new>
82# include <bits/iterator_concepts.h>
83#endif
84
85namespace std _GLIBCXX_VISIBILITY(default)__attribute__ ((__visibility__ ("default")))
86{
87_GLIBCXX_BEGIN_NAMESPACE_VERSION
88
89 /**
90 * @addtogroup iterators
91 * @{
92 */
93
94#if __cplusplus201402L > 201703L && __cpp_lib_concepts
95 namespace __detail
96 {
97 // Weaken iterator_category _Cat to _Limit if it is derived from that,
98 // otherwise use _Otherwise.
99 template<typename _Cat, typename _Limit, typename _Otherwise = _Cat>
100 using __clamp_iter_cat
101 = conditional_t<derived_from<_Cat, _Limit>, _Limit, _Otherwise>;
102 }
103#endif
104
105 // 24.4.1 Reverse iterators
106 /**
107 * Bidirectional and random access iterators have corresponding reverse
108 * %iterator adaptors that iterate through the data structure in the
109 * opposite direction. They have the same signatures as the corresponding
110 * iterators. The fundamental relation between a reverse %iterator and its
111 * corresponding %iterator @c i is established by the identity:
112 * @code
113 * &*(reverse_iterator(i)) == &*(i - 1)
114 * @endcode
115 *
116 * <em>This mapping is dictated by the fact that while there is always a
117 * pointer past the end of an array, there might not be a valid pointer
118 * before the beginning of an array.</em> [24.4.1]/1,2
119 *
120 * Reverse iterators can be tricky and surprising at first. Their
121 * semantics make sense, however, and the trickiness is a side effect of
122 * the requirement that the iterators must be safe.
123 */
124 template<typename _Iterator>
125 class reverse_iterator
126 : public iterator<typename iterator_traits<_Iterator>::iterator_category,
127 typename iterator_traits<_Iterator>::value_type,
128 typename iterator_traits<_Iterator>::difference_type,
129 typename iterator_traits<_Iterator>::pointer,
130 typename iterator_traits<_Iterator>::reference>
131 {
132 protected:
133 _Iterator current;
134
135 typedef iterator_traits<_Iterator> __traits_type;
136
137 public:
138 typedef _Iterator iterator_type;
139 typedef typename __traits_type::difference_type difference_type;
140 typedef typename __traits_type::pointer pointer;
141 typedef typename __traits_type::reference reference;
142
143#if __cplusplus201402L > 201703L && __cpp_lib_concepts
144 using iterator_concept
145 = conditional_t<random_access_iterator<_Iterator>,
146 random_access_iterator_tag,
147 bidirectional_iterator_tag>;
148 using iterator_category
149 = __detail::__clamp_iter_cat<typename __traits_type::iterator_category,
150 random_access_iterator_tag>;
151#endif
152
153 /**
154 * The default constructor value-initializes member @p current.
155 * If it is a pointer, that means it is zero-initialized.
156 */
157 // _GLIBCXX_RESOLVE_LIB_DEFECTS
158 // 235 No specification of default ctor for reverse_iterator
159 // 1012. reverse_iterator default ctor should value initialize
160 _GLIBCXX17_CONSTEXPR
161 reverse_iterator() : current() { }
162
163 /**
164 * This %iterator will move in the opposite direction that @p x does.
165 */
166 explicit _GLIBCXX17_CONSTEXPR
167 reverse_iterator(iterator_type __x) : current(__x) { }
168
169 /**
170 * The copy constructor is normal.
171 */
172 _GLIBCXX17_CONSTEXPR
173 reverse_iterator(const reverse_iterator& __x)
174 : current(__x.current) { }
175
176#if __cplusplus201402L >= 201103L
177 reverse_iterator& operator=(const reverse_iterator&) = default;
178#endif
179
180 /**
181 * A %reverse_iterator across other types can be copied if the
182 * underlying %iterator can be converted to the type of @c current.
183 */
184 template<typename _Iter>
185 _GLIBCXX17_CONSTEXPR
186 reverse_iterator(const reverse_iterator<_Iter>& __x)
187 : current(__x.base()) { }
188
189 /**
190 * @return @c current, the %iterator used for underlying work.
191 */
192 _GLIBCXX17_CONSTEXPR iterator_type
193 base() const
194 { return current; }
195
196 /**
197 * @return A reference to the value at @c --current
198 *
199 * This requires that @c --current is dereferenceable.
200 *
201 * @warning This implementation requires that for an iterator of the
202 * underlying iterator type, @c x, a reference obtained by
203 * @c *x remains valid after @c x has been modified or
204 * destroyed. This is a bug: http://gcc.gnu.org/PR51823
205 */
206 _GLIBCXX17_CONSTEXPR reference
207 operator*() const
208 {
209 _Iterator __tmp = current;
210 return *--__tmp;
211 }
212
213 /**
214 * @return A pointer to the value at @c --current
215 *
216 * This requires that @c --current is dereferenceable.
217 */
218 _GLIBCXX17_CONSTEXPR pointer
219 operator->() const
220#if __cplusplus201402L > 201703L && __cpp_concepts >= 201907L
221 requires is_pointer_v<_Iterator>
222 || requires(const _Iterator __i) { __i.operator->(); }
223#endif
224 {
225 // _GLIBCXX_RESOLVE_LIB_DEFECTS
226 // 1052. operator-> should also support smart pointers
227 _Iterator __tmp = current;
228 --__tmp;
229 return _S_to_pointer(__tmp);
230 }
231
232 /**
233 * @return @c *this
234 *
235 * Decrements the underlying iterator.
236 */
237 _GLIBCXX17_CONSTEXPR reverse_iterator&
238 operator++()
239 {
240 --current;
241 return *this;
242 }
243
244 /**
245 * @return The original value of @c *this
246 *
247 * Decrements the underlying iterator.
248 */
249 _GLIBCXX17_CONSTEXPR reverse_iterator
250 operator++(int)
251 {
252 reverse_iterator __tmp = *this;
253 --current;
254 return __tmp;
255 }
256
257 /**
258 * @return @c *this
259 *
260 * Increments the underlying iterator.
261 */
262 _GLIBCXX17_CONSTEXPR reverse_iterator&
263 operator--()
264 {
265 ++current;
266 return *this;
267 }
268
269 /**
270 * @return A reverse_iterator with the previous value of @c *this
271 *
272 * Increments the underlying iterator.
273 */
274 _GLIBCXX17_CONSTEXPR reverse_iterator
275 operator--(int)
276 {
277 reverse_iterator __tmp = *this;
278 ++current;
279 return __tmp;
280 }
281
282 /**
283 * @return A reverse_iterator that refers to @c current - @a __n
284 *
285 * The underlying iterator must be a Random Access Iterator.
286 */
287 _GLIBCXX17_CONSTEXPR reverse_iterator
288 operator+(difference_type __n) const
289 { return reverse_iterator(current - __n); }
290
291 /**
292 * @return *this
293 *
294 * Moves the underlying iterator backwards @a __n steps.
295 * The underlying iterator must be a Random Access Iterator.
296 */
297 _GLIBCXX17_CONSTEXPR reverse_iterator&
298 operator+=(difference_type __n)
299 {
300 current -= __n;
301 return *this;
302 }
303
304 /**
305 * @return A reverse_iterator that refers to @c current - @a __n
306 *
307 * The underlying iterator must be a Random Access Iterator.
308 */
309 _GLIBCXX17_CONSTEXPR reverse_iterator
310 operator-(difference_type __n) const
311 { return reverse_iterator(current + __n); }
312
313 /**
314 * @return *this
315 *
316 * Moves the underlying iterator forwards @a __n steps.
317 * The underlying iterator must be a Random Access Iterator.
318 */
319 _GLIBCXX17_CONSTEXPR reverse_iterator&
320 operator-=(difference_type __n)
321 {
322 current += __n;
323 return *this;
324 }
325
326 /**
327 * @return The value at @c current - @a __n - 1
328 *
329 * The underlying iterator must be a Random Access Iterator.
330 */
331 _GLIBCXX17_CONSTEXPR reference
332 operator[](difference_type __n) const
333 { return *(*this + __n); }
334
335#if __cplusplus201402L > 201703L && __cpp_lib_concepts
336 friend constexpr iter_rvalue_reference_t<_Iterator>
337 iter_move(const reverse_iterator& __i)
338 noexcept(is_nothrow_copy_constructible_v<_Iterator>
339 && noexcept(ranges::iter_move(--std::declval<_Iterator&>())))
340 {
341 auto __tmp = __i.base();
342 return ranges::iter_move(--__tmp);
343 }
344
345 template<indirectly_swappable<_Iterator> _Iter2>
346 friend constexpr void
347 iter_swap(const reverse_iterator& __x,
348 const reverse_iterator<_Iter2>& __y)
349 noexcept(is_nothrow_copy_constructible_v<_Iterator>
350 && is_nothrow_copy_constructible_v<_Iter2>
351 && noexcept(ranges::iter_swap(--std::declval<_Iterator&>(),
352 --std::declval<_Iter2&>())))
353 {
354 auto __xtmp = __x.base();
355 auto __ytmp = __y.base();
356 ranges::iter_swap(--__xtmp, --__ytmp);
357 }
358#endif
359
360 private:
361 template<typename _Tp>
362 static _GLIBCXX17_CONSTEXPR _Tp*
363 _S_to_pointer(_Tp* __p)
364 { return __p; }
365
366 template<typename _Tp>
367 static _GLIBCXX17_CONSTEXPR pointer
368 _S_to_pointer(_Tp __t)
369 { return __t.operator->(); }
370 };
371
372 //@{
373 /**
374 * @param __x A %reverse_iterator.
375 * @param __y A %reverse_iterator.
376 * @return A simple bool.
377 *
378 * Reverse iterators forward comparisons to their underlying base()
379 * iterators.
380 *
381 */
382#if __cplusplus201402L <= 201703L || ! defined __cpp_lib_concepts
383 template<typename _Iterator>
384 inline _GLIBCXX17_CONSTEXPR bool
385 operator==(const reverse_iterator<_Iterator>& __x,
386 const reverse_iterator<_Iterator>& __y)
387 { return __x.base() == __y.base(); }
21
Assuming the condition is true
22
Returning the value 1, which participates in a condition later
388
389 template<typename _Iterator>
390 inline _GLIBCXX17_CONSTEXPR bool
391 operator<(const reverse_iterator<_Iterator>& __x,
392 const reverse_iterator<_Iterator>& __y)
393 { return __y.base() < __x.base(); }
394
395 template<typename _Iterator>
396 inline _GLIBCXX17_CONSTEXPR bool
397 operator!=(const reverse_iterator<_Iterator>& __x,
398 const reverse_iterator<_Iterator>& __y)
399 { return !(__x == __y); }
20
Calling 'operator==<const clang::ClassTemplateSpecializationDecl **>'
23
Returning from 'operator==<const clang::ClassTemplateSpecializationDecl **>'
24
Returning zero, which participates in a condition later
400
401 template<typename _Iterator>
402 inline _GLIBCXX17_CONSTEXPR bool
403 operator>(const reverse_iterator<_Iterator>& __x,
404 const reverse_iterator<_Iterator>& __y)
405 { return __y < __x; }
406
407 template<typename _Iterator>
408 inline _GLIBCXX17_CONSTEXPR bool
409 operator<=(const reverse_iterator<_Iterator>& __x,
410 const reverse_iterator<_Iterator>& __y)
411 { return !(__y < __x); }
412
413 template<typename _Iterator>
414 inline _GLIBCXX17_CONSTEXPR bool
415 operator>=(const reverse_iterator<_Iterator>& __x,
416 const reverse_iterator<_Iterator>& __y)
417 { return !(__x < __y); }
418
419 // _GLIBCXX_RESOLVE_LIB_DEFECTS
420 // DR 280. Comparison of reverse_iterator to const reverse_iterator.
421 template<typename _IteratorL, typename _IteratorR>
422 inline _GLIBCXX17_CONSTEXPR bool
423 operator==(const reverse_iterator<_IteratorL>& __x,
424 const reverse_iterator<_IteratorR>& __y)
425 { return __x.base() == __y.base(); }
426
427 template<typename _IteratorL, typename _IteratorR>
428 inline _GLIBCXX17_CONSTEXPR bool
429 operator<(const reverse_iterator<_IteratorL>& __x,
430 const reverse_iterator<_IteratorR>& __y)
431 { return __y.base() < __x.base(); }
432
433 template<typename _IteratorL, typename _IteratorR>
434 inline _GLIBCXX17_CONSTEXPR bool
435 operator!=(const reverse_iterator<_IteratorL>& __x,
436 const reverse_iterator<_IteratorR>& __y)
437 { return !(__x == __y); }
438
439 template<typename _IteratorL, typename _IteratorR>
440 inline _GLIBCXX17_CONSTEXPR bool
441 operator>(const reverse_iterator<_IteratorL>& __x,
442 const reverse_iterator<_IteratorR>& __y)
443 { return __y < __x; }
444
445 template<typename _IteratorL, typename _IteratorR>
446 inline _GLIBCXX17_CONSTEXPR bool
447 operator<=(const reverse_iterator<_IteratorL>& __x,
448 const reverse_iterator<_IteratorR>& __y)
449 { return !(__y < __x); }
450
451 template<typename _IteratorL, typename _IteratorR>
452 inline _GLIBCXX17_CONSTEXPR bool
453 operator>=(const reverse_iterator<_IteratorL>& __x,
454 const reverse_iterator<_IteratorR>& __y)
455 { return !(__x < __y); }
456#else // C++20
457 template<typename _IteratorL, typename _IteratorR>
458 constexpr bool
459 operator==(const reverse_iterator<_IteratorL>& __x,
460 const reverse_iterator<_IteratorR>& __y)
461 requires requires { { __x.base() == __y.base() } -> convertible_to<bool>; }
462 { return __x.base() == __y.base(); }
463
464 template<typename _IteratorL, typename _IteratorR>
465 constexpr bool
466 operator!=(const reverse_iterator<_IteratorL>& __x,
467 const reverse_iterator<_IteratorR>& __y)
468 requires requires { { __x.base() != __y.base() } -> convertible_to<bool>; }
469 { return __x.base() != __y.base(); }
470
471 template<typename _IteratorL, typename _IteratorR>
472 constexpr bool
473 operator<(const reverse_iterator<_IteratorL>& __x,
474 const reverse_iterator<_IteratorR>& __y)
475 requires requires { { __x.base() > __y.base() } -> convertible_to<bool>; }
476 { return __x.base() > __y.base(); }
477
478 template<typename _IteratorL, typename _IteratorR>
479 constexpr bool
480 operator>(const reverse_iterator<_IteratorL>& __x,
481 const reverse_iterator<_IteratorR>& __y)
482 requires requires { { __x.base() < __y.base() } -> convertible_to<bool>; }
483 { return __x.base() < __y.base(); }
484
485 template<typename _IteratorL, typename _IteratorR>
486 constexpr bool
487 operator<=(const reverse_iterator<_IteratorL>& __x,
488 const reverse_iterator<_IteratorR>& __y)
489 requires requires { { __x.base() >= __y.base() } -> convertible_to<bool>; }
490 { return __x.base() >= __y.base(); }
491
492 template<typename _IteratorL, typename _IteratorR>
493 constexpr bool
494 operator>=(const reverse_iterator<_IteratorL>& __x,
495 const reverse_iterator<_IteratorR>& __y)
496 requires requires { { __x.base() <= __y.base() } -> convertible_to<bool>; }
497 { return __x.base() <= __y.base(); }
498
499 template<typename _IteratorL,
500 three_way_comparable_with<_IteratorL> _IteratorR>
501 constexpr compare_three_way_result_t<_IteratorL, _IteratorR>
502 operator<=>(const reverse_iterator<_IteratorL>& __x,
503 const reverse_iterator<_IteratorR>& __y)
504 { return __y.base() <=> __x.base(); }
505#endif // C++20
506 //@}
507
508#if __cplusplus201402L < 201103L
509 template<typename _Iterator>
510 inline typename reverse_iterator<_Iterator>::difference_type
511 operator-(const reverse_iterator<_Iterator>& __x,
512 const reverse_iterator<_Iterator>& __y)
513 { return __y.base() - __x.base(); }
514
515 template<typename _IteratorL, typename _IteratorR>
516 inline typename reverse_iterator<_IteratorL>::difference_type
517 operator-(const reverse_iterator<_IteratorL>& __x,
518 const reverse_iterator<_IteratorR>& __y)
519 { return __y.base() - __x.base(); }
520#else
521 // _GLIBCXX_RESOLVE_LIB_DEFECTS
522 // DR 685. reverse_iterator/move_iterator difference has invalid signatures
523 template<typename _IteratorL, typename _IteratorR>
524 inline _GLIBCXX17_CONSTEXPR auto
525 operator-(const reverse_iterator<_IteratorL>& __x,
526 const reverse_iterator<_IteratorR>& __y)
527 -> decltype(__y.base() - __x.base())
528 { return __y.base() - __x.base(); }
529#endif
530
531 template<typename _Iterator>
532 inline _GLIBCXX17_CONSTEXPR reverse_iterator<_Iterator>
533 operator+(typename reverse_iterator<_Iterator>::difference_type __n,
534 const reverse_iterator<_Iterator>& __x)
535 { return reverse_iterator<_Iterator>(__x.base() - __n); }
536
537#if __cplusplus201402L >= 201103L
538 // Same as C++14 make_reverse_iterator but used in C++11 mode too.
539 template<typename _Iterator>
540 inline _GLIBCXX17_CONSTEXPR reverse_iterator<_Iterator>
541 __make_reverse_iterator(_Iterator __i)
542 { return reverse_iterator<_Iterator>(__i); }
543
544# if __cplusplus201402L >= 201402L
545# define __cpp_lib_make_reverse_iterator201402 201402
546
547 // _GLIBCXX_RESOLVE_LIB_DEFECTS
548 // DR 2285. make_reverse_iterator
549 /// Generator function for reverse_iterator.
550 template<typename _Iterator>
551 inline _GLIBCXX17_CONSTEXPR reverse_iterator<_Iterator>
552 make_reverse_iterator(_Iterator __i)
553 { return reverse_iterator<_Iterator>(__i); }
554
555# if __cplusplus201402L > 201703L && defined __cpp_lib_concepts
556 template<typename _Iterator1, typename _Iterator2>
557 requires (!sized_sentinel_for<_Iterator1, _Iterator2>)
558 inline constexpr bool
559 disable_sized_sentinel_for<reverse_iterator<_Iterator1>,
560 reverse_iterator<_Iterator2>> = true;
561# endif // C++20
562# endif // C++14
563
564 template<typename _Iterator>
565 _GLIBCXX20_CONSTEXPR
566 auto
567 __niter_base(reverse_iterator<_Iterator> __it)
568 -> decltype(__make_reverse_iterator(__niter_base(__it.base())))
569 { return __make_reverse_iterator(__niter_base(__it.base())); }
570
571 template<typename _Iterator>
572 struct __is_move_iterator<reverse_iterator<_Iterator> >
573 : __is_move_iterator<_Iterator>
574 { };
575
576 template<typename _Iterator>
577 _GLIBCXX20_CONSTEXPR
578 auto
579 __miter_base(reverse_iterator<_Iterator> __it)
580 -> decltype(__make_reverse_iterator(__miter_base(__it.base())))
581 { return __make_reverse_iterator(__miter_base(__it.base())); }
582#endif // C++11
583
584 // 24.4.2.2.1 back_insert_iterator
585 /**
586 * @brief Turns assignment into insertion.
587 *
588 * These are output iterators, constructed from a container-of-T.
589 * Assigning a T to the iterator appends it to the container using
590 * push_back.
591 *
592 * Tip: Using the back_inserter function to create these iterators can
593 * save typing.
594 */
595 template<typename _Container>
596 class back_insert_iterator
597 : public iterator<output_iterator_tag, void, void, void, void>
598 {
599 protected:
600 _Container* container;
601
602 public:
603 /// A nested typedef for the type of whatever container you used.
604 typedef _Container container_type;
605#if __cplusplus201402L > 201703L
606 using difference_type = ptrdiff_t;
607
608 constexpr back_insert_iterator() noexcept : container(nullptr) { }
609#endif
610
611 /// The only way to create this %iterator is with a container.
612 explicit _GLIBCXX20_CONSTEXPR
613 back_insert_iterator(_Container& __x)
614 : container(std::__addressof(__x)) { }
615
616 /**
617 * @param __value An instance of whatever type
618 * container_type::const_reference is; presumably a
619 * reference-to-const T for container<T>.
620 * @return This %iterator, for chained operations.
621 *
622 * This kind of %iterator doesn't really have a @a position in the
623 * container (you can think of the position as being permanently at
624 * the end, if you like). Assigning a value to the %iterator will
625 * always append the value to the end of the container.
626 */
627#if __cplusplus201402L < 201103L
628 back_insert_iterator&
629 operator=(typename _Container::const_reference __value)
630 {
631 container->push_back(__value);
632 return *this;
633 }
634#else
635 _GLIBCXX20_CONSTEXPR
636 back_insert_iterator&
637 operator=(const typename _Container::value_type& __value)
638 {
639 container->push_back(__value);
640 return *this;
641 }
642
643 _GLIBCXX20_CONSTEXPR
644 back_insert_iterator&
645 operator=(typename _Container::value_type&& __value)
646 {
647 container->push_back(std::move(__value));
648 return *this;
649 }
650#endif
651
652 /// Simply returns *this.
653 _GLIBCXX20_CONSTEXPR
654 back_insert_iterator&
655 operator*()
656 { return *this; }
657
658 /// Simply returns *this. (This %iterator does not @a move.)
659 _GLIBCXX20_CONSTEXPR
660 back_insert_iterator&
661 operator++()
662 { return *this; }
663
664 /// Simply returns *this. (This %iterator does not @a move.)
665 _GLIBCXX20_CONSTEXPR
666 back_insert_iterator
667 operator++(int)
668 { return *this; }
669 };
670
671 /**
672 * @param __x A container of arbitrary type.
673 * @return An instance of back_insert_iterator working on @p __x.
674 *
675 * This wrapper function helps in creating back_insert_iterator instances.
676 * Typing the name of the %iterator requires knowing the precise full
677 * type of the container, which can be tedious and impedes generic
678 * programming. Using this function lets you take advantage of automatic
679 * template parameter deduction, making the compiler match the correct
680 * types for you.
681 */
682 template<typename _Container>
683 _GLIBCXX20_CONSTEXPR
684 inline back_insert_iterator<_Container>
685 back_inserter(_Container& __x)
686 { return back_insert_iterator<_Container>(__x); }
687
688 /**
689 * @brief Turns assignment into insertion.
690 *
691 * These are output iterators, constructed from a container-of-T.
692 * Assigning a T to the iterator prepends it to the container using
693 * push_front.
694 *
695 * Tip: Using the front_inserter function to create these iterators can
696 * save typing.
697 */
698 template<typename _Container>
699 class front_insert_iterator
700 : public iterator<output_iterator_tag, void, void, void, void>
701 {
702 protected:
703 _Container* container;
704
705 public:
706 /// A nested typedef for the type of whatever container you used.
707 typedef _Container container_type;
708#if __cplusplus201402L > 201703L
709 using difference_type = ptrdiff_t;
710
711 constexpr front_insert_iterator() noexcept : container(nullptr) { }
712#endif
713
714 /// The only way to create this %iterator is with a container.
715 explicit _GLIBCXX20_CONSTEXPR
716 front_insert_iterator(_Container& __x)
717 : container(std::__addressof(__x)) { }
718
719 /**
720 * @param __value An instance of whatever type
721 * container_type::const_reference is; presumably a
722 * reference-to-const T for container<T>.
723 * @return This %iterator, for chained operations.
724 *
725 * This kind of %iterator doesn't really have a @a position in the
726 * container (you can think of the position as being permanently at
727 * the front, if you like). Assigning a value to the %iterator will
728 * always prepend the value to the front of the container.
729 */
730#if __cplusplus201402L < 201103L
731 front_insert_iterator&
732 operator=(typename _Container::const_reference __value)
733 {
734 container->push_front(__value);
735 return *this;
736 }
737#else
738 _GLIBCXX20_CONSTEXPR
739 front_insert_iterator&
740 operator=(const typename _Container::value_type& __value)
741 {
742 container->push_front(__value);
743 return *this;
744 }
745
746 _GLIBCXX20_CONSTEXPR
747 front_insert_iterator&
748 operator=(typename _Container::value_type&& __value)
749 {
750 container->push_front(std::move(__value));
751 return *this;
752 }
753#endif
754
755 /// Simply returns *this.
756 _GLIBCXX20_CONSTEXPR
757 front_insert_iterator&
758 operator*()
759 { return *this; }
760
761 /// Simply returns *this. (This %iterator does not @a move.)
762 _GLIBCXX20_CONSTEXPR
763 front_insert_iterator&
764 operator++()
765 { return *this; }
766
767 /// Simply returns *this. (This %iterator does not @a move.)
768 _GLIBCXX20_CONSTEXPR
769 front_insert_iterator
770 operator++(int)
771 { return *this; }
772 };
773
774 /**
775 * @param __x A container of arbitrary type.
776 * @return An instance of front_insert_iterator working on @p x.
777 *
778 * This wrapper function helps in creating front_insert_iterator instances.
779 * Typing the name of the %iterator requires knowing the precise full
780 * type of the container, which can be tedious and impedes generic
781 * programming. Using this function lets you take advantage of automatic
782 * template parameter deduction, making the compiler match the correct
783 * types for you.
784 */
785 template<typename _Container>
786 _GLIBCXX20_CONSTEXPR
787 inline front_insert_iterator<_Container>
788 front_inserter(_Container& __x)
789 { return front_insert_iterator<_Container>(__x); }
790
791 /**
792 * @brief Turns assignment into insertion.
793 *
794 * These are output iterators, constructed from a container-of-T.
795 * Assigning a T to the iterator inserts it in the container at the
796 * %iterator's position, rather than overwriting the value at that
797 * position.
798 *
799 * (Sequences will actually insert a @e copy of the value before the
800 * %iterator's position.)
801 *
802 * Tip: Using the inserter function to create these iterators can
803 * save typing.
804 */
805 template<typename _Container>
806 class insert_iterator
807 : public iterator<output_iterator_tag, void, void, void, void>
808 {
809#if __cplusplus201402L > 201703L && defined __cpp_lib_concepts
810 using _Iter = std::__detail::__range_iter_t<_Container>;
811
812 protected:
813 _Container* container = nullptr;
814 _Iter iter = _Iter();
815#else
816 typedef typename _Container::iterator _Iter;
817
818 protected:
819 _Container* container;
820 _Iter iter;
821#endif
822
823 public:
824 /// A nested typedef for the type of whatever container you used.
825 typedef _Container container_type;
826
827#if __cplusplus201402L > 201703L && defined __cpp_lib_concepts
828 using difference_type = ptrdiff_t;
829
830 insert_iterator() = default;
831#endif
832
833 /**
834 * The only way to create this %iterator is with a container and an
835 * initial position (a normal %iterator into the container).
836 */
837 _GLIBCXX20_CONSTEXPR
838 insert_iterator(_Container& __x, _Iter __i)
839 : container(std::__addressof(__x)), iter(__i) {}
840
841 /**
842 * @param __value An instance of whatever type
843 * container_type::const_reference is; presumably a
844 * reference-to-const T for container<T>.
845 * @return This %iterator, for chained operations.
846 *
847 * This kind of %iterator maintains its own position in the
848 * container. Assigning a value to the %iterator will insert the
849 * value into the container at the place before the %iterator.
850 *
851 * The position is maintained such that subsequent assignments will
852 * insert values immediately after one another. For example,
853 * @code
854 * // vector v contains A and Z
855 *
856 * insert_iterator i (v, ++v.begin());
857 * i = 1;
858 * i = 2;
859 * i = 3;
860 *
861 * // vector v contains A, 1, 2, 3, and Z
862 * @endcode
863 */
864#if __cplusplus201402L < 201103L
865 insert_iterator&
866 operator=(typename _Container::const_reference __value)
867 {
868 iter = container->insert(iter, __value);
869 ++iter;
870 return *this;
871 }
872#else
873 _GLIBCXX20_CONSTEXPR
874 insert_iterator&
875 operator=(const typename _Container::value_type& __value)
876 {
877 iter = container->insert(iter, __value);
878 ++iter;
879 return *this;
880 }
881
882 _GLIBCXX20_CONSTEXPR
883 insert_iterator&
884 operator=(typename _Container::value_type&& __value)
885 {
886 iter = container->insert(iter, std::move(__value));
887 ++iter;
888 return *this;
889 }
890#endif
891
892 /// Simply returns *this.
893 _GLIBCXX20_CONSTEXPR
894 insert_iterator&
895 operator*()
896 { return *this; }
897
898 /// Simply returns *this. (This %iterator does not @a move.)
899 _GLIBCXX20_CONSTEXPR
900 insert_iterator&
901 operator++()
902 { return *this; }
903
904 /// Simply returns *this. (This %iterator does not @a move.)
905 _GLIBCXX20_CONSTEXPR
906 insert_iterator&
907 operator++(int)
908 { return *this; }
909 };
910
911 /**
912 * @param __x A container of arbitrary type.
913 * @param __i An iterator into the container.
914 * @return An instance of insert_iterator working on @p __x.
915 *
916 * This wrapper function helps in creating insert_iterator instances.
917 * Typing the name of the %iterator requires knowing the precise full
918 * type of the container, which can be tedious and impedes generic
919 * programming. Using this function lets you take advantage of automatic
920 * template parameter deduction, making the compiler match the correct
921 * types for you.
922 */
923#if __cplusplus201402L > 201703L && defined __cpp_lib_concepts
924 template<typename _Container>
925 constexpr insert_iterator<_Container>
926 inserter(_Container& __x, std::__detail::__range_iter_t<_Container> __i)
927 { return insert_iterator<_Container>(__x, __i); }
928#else
929 template<typename _Container, typename _Iterator>
930 inline insert_iterator<_Container>
931 inserter(_Container& __x, _Iterator __i)
932 {
933 return insert_iterator<_Container>(__x,
934 typename _Container::iterator(__i));
935 }
936#endif
937
938 // @} group iterators
939
940_GLIBCXX_END_NAMESPACE_VERSION
941} // namespace
942
943namespace __gnu_cxx _GLIBCXX_VISIBILITY(default)__attribute__ ((__visibility__ ("default")))
944{
945_GLIBCXX_BEGIN_NAMESPACE_VERSION
946
947 // This iterator adapter is @a normal in the sense that it does not
948 // change the semantics of any of the operators of its iterator
949 // parameter. Its primary purpose is to convert an iterator that is
950 // not a class, e.g. a pointer, into an iterator that is a class.
951 // The _Container parameter exists solely so that different containers
952 // using this template can instantiate different types, even if the
953 // _Iterator parameter is the same.
954 template<typename _Iterator, typename _Container>
955 class __normal_iterator
956 {
957 protected:
958 _Iterator _M_current;
959
960 typedef std::iterator_traits<_Iterator> __traits_type;
961
962 public:
963 typedef _Iterator iterator_type;
964 typedef typename __traits_type::iterator_category iterator_category;
965 typedef typename __traits_type::value_type value_type;
966 typedef typename __traits_type::difference_type difference_type;
967 typedef typename __traits_type::reference reference;
968 typedef typename __traits_type::pointer pointer;
969
970#if __cplusplus201402L > 201703L && __cpp_lib_concepts
971 using iterator_concept = std::__detail::__iter_concept<_Iterator>;
972#endif
973
974 _GLIBCXX_CONSTEXPRconstexpr __normal_iterator() _GLIBCXX_NOEXCEPTnoexcept
975 : _M_current(_Iterator()) { }
976
977 explicit _GLIBCXX20_CONSTEXPR
978 __normal_iterator(const _Iterator& __i) _GLIBCXX_NOEXCEPTnoexcept
979 : _M_current(__i) { }
980
981 // Allow iterator to const_iterator conversion
982 template<typename _Iter>
983 _GLIBCXX20_CONSTEXPR
984 __normal_iterator(const __normal_iterator<_Iter,
985 typename __enable_if<
986 (std::__are_same<_Iter, typename _Container::pointer>::__value),
987 _Container>::__type>& __i) _GLIBCXX_NOEXCEPTnoexcept
988 : _M_current(__i.base()) { }
989
990 // Forward iterator requirements
991 _GLIBCXX20_CONSTEXPR
992 reference
993 operator*() const _GLIBCXX_NOEXCEPTnoexcept
994 { return *_M_current; }
995
996 _GLIBCXX20_CONSTEXPR
997 pointer
998 operator->() const _GLIBCXX_NOEXCEPTnoexcept
999 { return _M_current; }
1000
1001 _GLIBCXX20_CONSTEXPR
1002 __normal_iterator&
1003 operator++() _GLIBCXX_NOEXCEPTnoexcept
1004 {
1005 ++_M_current;
1006 return *this;
1007 }
1008
1009 _GLIBCXX20_CONSTEXPR
1010 __normal_iterator
1011 operator++(int) _GLIBCXX_NOEXCEPTnoexcept
1012 { return __normal_iterator(_M_current++); }
1013
1014 // Bidirectional iterator requirements
1015 _GLIBCXX20_CONSTEXPR
1016 __normal_iterator&
1017 operator--() _GLIBCXX_NOEXCEPTnoexcept
1018 {
1019 --_M_current;
1020 return *this;
1021 }
1022
1023 _GLIBCXX20_CONSTEXPR
1024 __normal_iterator
1025 operator--(int) _GLIBCXX_NOEXCEPTnoexcept
1026 { return __normal_iterator(_M_current--); }
1027
1028 // Random access iterator requirements
1029 _GLIBCXX20_CONSTEXPR
1030 reference
1031 operator[](difference_type __n) const _GLIBCXX_NOEXCEPTnoexcept
1032 { return _M_current[__n]; }
1033
1034 _GLIBCXX20_CONSTEXPR
1035 __normal_iterator&
1036 operator+=(difference_type __n) _GLIBCXX_NOEXCEPTnoexcept
1037 { _M_current += __n; return *this; }
1038
1039 _GLIBCXX20_CONSTEXPR
1040 __normal_iterator
1041 operator+(difference_type __n) const _GLIBCXX_NOEXCEPTnoexcept
1042 { return __normal_iterator(_M_current + __n); }
1043
1044 _GLIBCXX20_CONSTEXPR
1045 __normal_iterator&
1046 operator-=(difference_type __n) _GLIBCXX_NOEXCEPTnoexcept
1047 { _M_current -= __n; return *this; }
1048
1049 _GLIBCXX20_CONSTEXPR
1050 __normal_iterator
1051 operator-(difference_type __n) const _GLIBCXX_NOEXCEPTnoexcept
1052 { return __normal_iterator(_M_current - __n); }
1053
1054 _GLIBCXX20_CONSTEXPR
1055 const _Iterator&
1056 base() const _GLIBCXX_NOEXCEPTnoexcept
1057 { return _M_current; }
1058 };
1059
1060 // Note: In what follows, the left- and right-hand-side iterators are
1061 // allowed to vary in types (conceptually in cv-qualification) so that
1062 // comparison between cv-qualified and non-cv-qualified iterators be
1063 // valid. However, the greedy and unfriendly operators in std::rel_ops
1064 // will make overload resolution ambiguous (when in scope) if we don't
1065 // provide overloads whose operands are of the same type. Can someone
1066 // remind me what generic programming is about? -- Gaby
1067
1068#if __cpp_lib_three_way_comparison
1069 template<typename _IteratorL, typename _IteratorR, typename _Container>
1070 requires requires (_IteratorL __lhs, _IteratorR __rhs)
1071 { { __lhs == __rhs } -> std::convertible_to<bool>; }
1072 constexpr bool
1073 operator==(const __normal_iterator<_IteratorL, _Container>& __lhs,
1074 const __normal_iterator<_IteratorR, _Container>& __rhs)
1075 noexcept(noexcept(__lhs.base() == __rhs.base()))
1076 { return __lhs.base() == __rhs.base(); }
1077
1078 template<typename _IteratorL, typename _IteratorR, typename _Container>
1079 constexpr std::__detail::__synth3way_t<_IteratorR, _IteratorL>
1080 operator<=>(const __normal_iterator<_IteratorL, _Container>& __lhs,
1081 const __normal_iterator<_IteratorR, _Container>& __rhs)
1082 noexcept(noexcept(std::__detail::__synth3way(__lhs.base(), __rhs.base())))
1083 { return std::__detail::__synth3way(__lhs.base(), __rhs.base()); }
1084#else
1085 // Forward iterator requirements
1086 template<typename _IteratorL, typename _IteratorR, typename _Container>
1087 _GLIBCXX20_CONSTEXPR
1088 inline bool
1089 operator==(const __normal_iterator<_IteratorL, _Container>& __lhs,
1090 const __normal_iterator<_IteratorR, _Container>& __rhs)
1091 _GLIBCXX_NOEXCEPTnoexcept
1092 { return __lhs.base() == __rhs.base(); }
1093
1094 template<typename _Iterator, typename _Container>
1095 _GLIBCXX20_CONSTEXPR
1096 inline bool
1097 operator==(const __normal_iterator<_Iterator, _Container>& __lhs,
1098 const __normal_iterator<_Iterator, _Container>& __rhs)
1099 _GLIBCXX_NOEXCEPTnoexcept
1100 { return __lhs.base() == __rhs.base(); }
1101
1102 template<typename _IteratorL, typename _IteratorR, typename _Container>
1103 _GLIBCXX20_CONSTEXPR
1104 inline bool
1105 operator!=(const __normal_iterator<_IteratorL, _Container>& __lhs,
1106 const __normal_iterator<_IteratorR, _Container>& __rhs)
1107 _GLIBCXX_NOEXCEPTnoexcept
1108 { return __lhs.base() != __rhs.base(); }
1109
1110 template<typename _Iterator, typename _Container>
1111 _GLIBCXX20_CONSTEXPR
1112 inline bool
1113 operator!=(const __normal_iterator<_Iterator, _Container>& __lhs,
1114 const __normal_iterator<_Iterator, _Container>& __rhs)
1115 _GLIBCXX_NOEXCEPTnoexcept
1116 { return __lhs.base() != __rhs.base(); }
1117
1118 // Random access iterator requirements
1119 template<typename _IteratorL, typename _IteratorR, typename _Container>
1120 inline bool
1121 operator<(const __normal_iterator<_IteratorL, _Container>& __lhs,
1122 const __normal_iterator<_IteratorR, _Container>& __rhs)
1123 _GLIBCXX_NOEXCEPTnoexcept
1124 { return __lhs.base() < __rhs.base(); }
1125
1126 template<typename _Iterator, typename _Container>
1127 _GLIBCXX20_CONSTEXPR
1128 inline bool
1129 operator<(const __normal_iterator<_Iterator, _Container>& __lhs,
1130 const __normal_iterator<_Iterator, _Container>& __rhs)
1131 _GLIBCXX_NOEXCEPTnoexcept
1132 { return __lhs.base() < __rhs.base(); }
1133
1134 template<typename _IteratorL, typename _IteratorR, typename _Container>
1135 inline bool
1136 operator>(const __normal_iterator<_IteratorL, _Container>& __lhs,
1137 const __normal_iterator<_IteratorR, _Container>& __rhs)
1138 _GLIBCXX_NOEXCEPTnoexcept
1139 { return __lhs.base() > __rhs.base(); }
1140
1141 template<typename _Iterator, typename _Container>
1142 _GLIBCXX20_CONSTEXPR
1143 inline bool
1144 operator>(const __normal_iterator<_Iterator, _Container>& __lhs,
1145 const __normal_iterator<_Iterator, _Container>& __rhs)
1146 _GLIBCXX_NOEXCEPTnoexcept
1147 { return __lhs.base() > __rhs.base(); }
1148
1149 template<typename _IteratorL, typename _IteratorR, typename _Container>
1150 inline bool
1151 operator<=(const __normal_iterator<_IteratorL, _Container>& __lhs,
1152 const __normal_iterator<_IteratorR, _Container>& __rhs)
1153 _GLIBCXX_NOEXCEPTnoexcept
1154 { return __lhs.base() <= __rhs.base(); }
1155
1156 template<typename _Iterator, typename _Container>
1157 _GLIBCXX20_CONSTEXPR
1158 inline bool
1159 operator<=(const __normal_iterator<_Iterator, _Container>& __lhs,
1160 const __normal_iterator<_Iterator, _Container>& __rhs)
1161 _GLIBCXX_NOEXCEPTnoexcept
1162 { return __lhs.base() <= __rhs.base(); }
1163
1164 template<typename _IteratorL, typename _IteratorR, typename _Container>
1165 inline bool
1166 operator>=(const __normal_iterator<_IteratorL, _Container>& __lhs,
1167 const __normal_iterator<_IteratorR, _Container>& __rhs)
1168 _GLIBCXX_NOEXCEPTnoexcept
1169 { return __lhs.base() >= __rhs.base(); }
1170
1171 template<typename _Iterator, typename _Container>
1172 _GLIBCXX20_CONSTEXPR
1173 inline bool
1174 operator>=(const __normal_iterator<_Iterator, _Container>& __lhs,
1175 const __normal_iterator<_Iterator, _Container>& __rhs)
1176 _GLIBCXX_NOEXCEPTnoexcept
1177 { return __lhs.base() >= __rhs.base(); }
1178#endif // three-way comparison
1179
1180 // _GLIBCXX_RESOLVE_LIB_DEFECTS
1181 // According to the resolution of DR179 not only the various comparison
1182 // operators but also operator- must accept mixed iterator/const_iterator
1183 // parameters.
1184 template<typename _IteratorL, typename _IteratorR, typename _Container>
1185#if __cplusplus201402L >= 201103L
1186 // DR 685.
1187 _GLIBCXX20_CONSTEXPR
1188 inline auto
1189 operator-(const __normal_iterator<_IteratorL, _Container>& __lhs,
1190 const __normal_iterator<_IteratorR, _Container>& __rhs) noexcept
1191 -> decltype(__lhs.base() - __rhs.base())
1192#else
1193 inline typename __normal_iterator<_IteratorL, _Container>::difference_type
1194 operator-(const __normal_iterator<_IteratorL, _Container>& __lhs,
1195 const __normal_iterator<_IteratorR, _Container>& __rhs)
1196#endif
1197 { return __lhs.base() - __rhs.base(); }
1198
1199 template<typename _Iterator, typename _Container>
1200 _GLIBCXX20_CONSTEXPR
1201 inline typename __normal_iterator<_Iterator, _Container>::difference_type
1202 operator-(const __normal_iterator<_Iterator, _Container>& __lhs,
1203 const __normal_iterator<_Iterator, _Container>& __rhs)
1204 _GLIBCXX_NOEXCEPTnoexcept
1205 { return __lhs.base() - __rhs.base(); }
1206
1207 template<typename _Iterator, typename _Container>
1208 _GLIBCXX20_CONSTEXPR
1209 inline __normal_iterator<_Iterator, _Container>
1210 operator+(typename __normal_iterator<_Iterator, _Container>::difference_type
1211 __n, const __normal_iterator<_Iterator, _Container>& __i)
1212 _GLIBCXX_NOEXCEPTnoexcept
1213 { return __normal_iterator<_Iterator, _Container>(__i.base() + __n); }
1214
1215_GLIBCXX_END_NAMESPACE_VERSION
1216} // namespace
1217
1218namespace std _GLIBCXX_VISIBILITY(default)__attribute__ ((__visibility__ ("default")))
1219{
1220_GLIBCXX_BEGIN_NAMESPACE_VERSION
1221
1222 template<typename _Iterator, typename _Container>
1223 _GLIBCXX20_CONSTEXPR
1224 _Iterator
1225 __niter_base(__gnu_cxx::__normal_iterator<_Iterator, _Container> __it)
1226 _GLIBCXX_NOEXCEPT_IF(std::is_nothrow_copy_constructible<_Iterator>::value)noexcept(std::is_nothrow_copy_constructible<_Iterator>::
value)
1227 { return __it.base(); }
1228
1229#if __cplusplus201402L >= 201103L
1230 /**
1231 * @addtogroup iterators
1232 * @{
1233 */
1234
1235#if __cplusplus201402L > 201703L && __cpp_lib_concepts
1236 template<semiregular _Sent>
1237 class move_sentinel
1238 {
1239 public:
1240 constexpr
1241 move_sentinel()
1242 noexcept(is_nothrow_default_constructible_v<_Sent>)
1243 : _M_last() { }
1244
1245 constexpr explicit
1246 move_sentinel(_Sent __s)
1247 noexcept(is_nothrow_move_constructible_v<_Sent>)
1248 : _M_last(std::move(__s)) { }
1249
1250 template<typename _S2> requires convertible_to<const _S2&, _Sent>
1251 constexpr
1252 move_sentinel(const move_sentinel<_S2>& __s)
1253 noexcept(is_nothrow_constructible_v<_Sent, const _S2&>)
1254 : _M_last(__s.base())
1255 { }
1256
1257 template<typename _S2> requires assignable_from<_Sent&, const _S2&>
1258 constexpr move_sentinel&
1259 operator=(const move_sentinel<_S2>& __s)
1260 noexcept(is_nothrow_assignable_v<_Sent, const _S2&>)
1261 {
1262 _M_last = __s.base();
1263 return *this;
1264 }
1265
1266 constexpr _Sent
1267 base() const
1268 noexcept(is_nothrow_copy_constructible_v<_Sent>)
1269 { return _M_last; }
1270
1271 private:
1272 _Sent _M_last;
1273 };
1274#endif // C++20
1275
1276 // 24.4.3 Move iterators
1277 /**
1278 * Class template move_iterator is an iterator adapter with the same
1279 * behavior as the underlying iterator except that its dereference
1280 * operator implicitly converts the value returned by the underlying
1281 * iterator's dereference operator to an rvalue reference. Some
1282 * generic algorithms can be called with move iterators to replace
1283 * copying with moving.
1284 */
1285 template<typename _Iterator>
1286 class move_iterator
1287 {
1288 _Iterator _M_current;
1289
1290 using __traits_type = iterator_traits<_Iterator>;
1291#if __cplusplus201402L > 201703L && __cpp_lib_concepts
1292 using __base_cat = typename __traits_type::iterator_category;
1293#else
1294 using __base_ref = typename __traits_type::reference;
1295#endif
1296
1297 public:
1298 using iterator_type = _Iterator;
1299
1300#if __cplusplus201402L > 201703L && __cpp_lib_concepts
1301 using iterator_concept = input_iterator_tag;
1302 using iterator_category
1303 = __detail::__clamp_iter_cat<__base_cat, random_access_iterator_tag>;
1304 using value_type = iter_value_t<_Iterator>;
1305 using difference_type = iter_difference_t<_Iterator>;
1306 using pointer = _Iterator;
1307 using reference = iter_rvalue_reference_t<_Iterator>;
1308#else
1309 typedef typename __traits_type::iterator_category iterator_category;
1310 typedef typename __traits_type::value_type value_type;
1311 typedef typename __traits_type::difference_type difference_type;
1312 // NB: DR 680.
1313 typedef _Iterator pointer;
1314 // _GLIBCXX_RESOLVE_LIB_DEFECTS
1315 // 2106. move_iterator wrapping iterators returning prvalues
1316 typedef typename conditional<is_reference<__base_ref>::value,
1317 typename remove_reference<__base_ref>::type&&,
1318 __base_ref>::type reference;
1319#endif
1320
1321 _GLIBCXX17_CONSTEXPR
1322 move_iterator()
1323 : _M_current() { }
1324
1325 explicit _GLIBCXX17_CONSTEXPR
1326 move_iterator(iterator_type __i)
1327 : _M_current(std::move(__i)) { }
1328
1329 template<typename _Iter>
1330 _GLIBCXX17_CONSTEXPR
1331 move_iterator(const move_iterator<_Iter>& __i)
1332 : _M_current(__i.base()) { }
1333
1334#if __cplusplus201402L <= 201703L
1335 _GLIBCXX17_CONSTEXPR iterator_type
1336 base() const
1337 { return _M_current; }
1338#else
1339 constexpr iterator_type
1340 base() const &
1341#if __cpp_lib_concepts
1342 requires copy_constructible<iterator_type>
1343#endif
1344 { return _M_current; }
1345
1346 constexpr iterator_type
1347 base() &&
1348 { return std::move(_M_current); }
1349#endif
1350
1351 _GLIBCXX17_CONSTEXPR reference
1352 operator*() const
1353#if __cplusplus201402L > 201703L && __cpp_lib_concepts
1354 { return ranges::iter_move(_M_current); }
1355#else
1356 { return static_cast<reference>(*_M_current); }
1357#endif
1358
1359 _GLIBCXX17_CONSTEXPR pointer
1360 operator->() const
1361 { return _M_current; }
1362
1363 _GLIBCXX17_CONSTEXPR move_iterator&
1364 operator++()
1365 {
1366 ++_M_current;
1367 return *this;
1368 }
1369
1370 _GLIBCXX17_CONSTEXPR move_iterator
1371 operator++(int)
1372 {
1373 move_iterator __tmp = *this;
1374 ++_M_current;
1375 return __tmp;
1376 }
1377
1378#if __cpp_lib_concepts
1379 constexpr void
1380 operator++(int) requires (!forward_iterator<_Iterator>)
1381 { ++_M_current; }
1382#endif
1383
1384 _GLIBCXX17_CONSTEXPR move_iterator&
1385 operator--()
1386 {
1387 --_M_current;
1388 return *this;
1389 }
1390
1391 _GLIBCXX17_CONSTEXPR move_iterator
1392 operator--(int)
1393 {
1394 move_iterator __tmp = *this;
1395 --_M_current;
1396 return __tmp;
1397 }
1398
1399 _GLIBCXX17_CONSTEXPR move_iterator
1400 operator+(difference_type __n) const
1401 { return move_iterator(_M_current + __n); }
1402
1403 _GLIBCXX17_CONSTEXPR move_iterator&
1404 operator+=(difference_type __n)
1405 {
1406 _M_current += __n;
1407 return *this;
1408 }
1409
1410 _GLIBCXX17_CONSTEXPR move_iterator
1411 operator-(difference_type __n) const
1412 { return move_iterator(_M_current - __n); }
1413
1414 _GLIBCXX17_CONSTEXPR move_iterator&
1415 operator-=(difference_type __n)
1416 {
1417 _M_current -= __n;
1418 return *this;
1419 }
1420
1421 _GLIBCXX17_CONSTEXPR reference
1422 operator[](difference_type __n) const
1423#if __cplusplus201402L > 201703L && __cpp_lib_concepts
1424 { return ranges::iter_move(_M_current + __n); }
1425#else
1426 { return std::move(_M_current[__n]); }
1427#endif
1428
1429#if __cplusplus201402L > 201703L && __cpp_lib_concepts
1430 template<sentinel_for<_Iterator> _Sent>
1431 friend constexpr bool
1432 operator==(const move_iterator& __x, const move_sentinel<_Sent>& __y)
1433 { return __x.base() == __y.base(); }
1434
1435 template<sized_sentinel_for<_Iterator> _Sent>
1436 friend constexpr iter_difference_t<_Iterator>
1437 operator-(const move_sentinel<_Sent>& __x, const move_iterator& __y)
1438 { return __x.base() - __y.base(); }
1439
1440 template<sized_sentinel_for<_Iterator> _Sent>
1441 friend constexpr iter_difference_t<_Iterator>
1442 operator-(const move_iterator& __x, const move_sentinel<_Sent>& __y)
1443 { return __x.base() - __y.base(); }
1444
1445 friend constexpr iter_rvalue_reference_t<_Iterator>
1446 iter_move(const move_iterator& __i)
1447 noexcept(noexcept(ranges::iter_move(__i._M_current)))
1448 { return ranges::iter_move(__i._M_current); }
1449
1450 template<indirectly_swappable<_Iterator> _Iter2>
1451 friend constexpr void
1452 iter_swap(const move_iterator& __x, const move_iterator<_Iter2>& __y)
1453 noexcept(noexcept(ranges::iter_swap(__x._M_current, __y._M_current)))
1454 { return ranges::iter_swap(__x._M_current, __y._M_current); }
1455#endif // C++20
1456 };
1457
1458 template<typename _IteratorL, typename _IteratorR>
1459 inline _GLIBCXX17_CONSTEXPR bool
1460 operator==(const move_iterator<_IteratorL>& __x,
1461 const move_iterator<_IteratorR>& __y)
1462#if __cplusplus201402L > 201703L && __cpp_lib_concepts
1463 requires requires { { __x.base() == __y.base() } -> convertible_to<bool>; }
1464#endif
1465 { return __x.base() == __y.base(); }
1466
1467#if __cpp_lib_three_way_comparison
1468 template<typename _IteratorL,
1469 three_way_comparable_with<_IteratorL> _IteratorR>
1470 constexpr compare_three_way_result_t<_IteratorL, _IteratorR>
1471 operator<=>(const move_iterator<_IteratorL>& __x,
1472 const move_iterator<_IteratorR>& __y)
1473 { return __x.base() <=> __y.base(); }
1474#else
1475 template<typename _IteratorL, typename _IteratorR>
1476 inline _GLIBCXX17_CONSTEXPR bool
1477 operator!=(const move_iterator<_IteratorL>& __x,
1478 const move_iterator<_IteratorR>& __y)
1479 { return !(__x == __y); }
1480#endif
1481
1482 template<typename _IteratorL, typename _IteratorR>
1483 inline _GLIBCXX17_CONSTEXPR bool
1484 operator<(const move_iterator<_IteratorL>& __x,
1485 const move_iterator<_IteratorR>& __y)
1486#if __cplusplus201402L > 201703L && __cpp_lib_concepts
1487 requires requires { { __x.base() < __y.base() } -> convertible_to<bool>; }
1488#endif
1489 { return __x.base() < __y.base(); }
1490
1491 template<typename _IteratorL, typename _IteratorR>
1492 inline _GLIBCXX17_CONSTEXPR bool
1493 operator<=(const move_iterator<_IteratorL>& __x,
1494 const move_iterator<_IteratorR>& __y)
1495#if __cplusplus201402L > 201703L && __cpp_lib_concepts
1496 requires requires { { __y.base() < __x.base() } -> convertible_to<bool>; }
1497#endif
1498 { return !(__y < __x); }
1499
1500 template<typename _IteratorL, typename _IteratorR>
1501 inline _GLIBCXX17_CONSTEXPR bool
1502 operator>(const move_iterator<_IteratorL>& __x,
1503 const move_iterator<_IteratorR>& __y)
1504#if __cplusplus201402L > 201703L && __cpp_lib_concepts
1505 requires requires { { __y.base() < __x.base() } -> convertible_to<bool>; }
1506#endif
1507 { return __y < __x; }
1508
1509 template<typename _IteratorL, typename _IteratorR>
1510 inline _GLIBCXX17_CONSTEXPR bool
1511 operator>=(const move_iterator<_IteratorL>& __x,
1512 const move_iterator<_IteratorR>& __y)
1513#if __cplusplus201402L > 201703L && __cpp_lib_concepts
1514 requires requires { { __x.base() < __y.base() } -> convertible_to<bool>; }
1515#endif
1516 { return !(__x < __y); }
1517
1518#if ! (__cplusplus201402L > 201703L && __cpp_lib_concepts)
1519 // Note: See __normal_iterator operators note from Gaby to understand
1520 // why we have these extra overloads for some move_iterator operators.
1521
1522 // These extra overloads are not needed in C++20, because the ones above
1523 // are constrained with a requires-clause and so overload resolution will
1524 // prefer them to greedy unconstrained function templates.
1525
1526 template<typename _Iterator>
1527 inline _GLIBCXX17_CONSTEXPR bool
1528 operator==(const move_iterator<_Iterator>& __x,
1529 const move_iterator<_Iterator>& __y)
1530 { return __x.base() == __y.base(); }
1531
1532 template<typename _Iterator>
1533 inline _GLIBCXX17_CONSTEXPR bool
1534 operator!=(const move_iterator<_Iterator>& __x,
1535 const move_iterator<_Iterator>& __y)
1536 { return !(__x == __y); }
1537
1538 template<typename _Iterator>
1539 inline _GLIBCXX17_CONSTEXPR bool
1540 operator<(const move_iterator<_Iterator>& __x,
1541 const move_iterator<_Iterator>& __y)
1542 { return __x.base() < __y.base(); }
1543
1544 template<typename _Iterator>
1545 inline _GLIBCXX17_CONSTEXPR bool
1546 operator<=(const move_iterator<_Iterator>& __x,
1547 const move_iterator<_Iterator>& __y)
1548 { return !(__y < __x); }
1549
1550 template<typename _Iterator>
1551 inline _GLIBCXX17_CONSTEXPR bool
1552 operator>(const move_iterator<_Iterator>& __x,
1553 const move_iterator<_Iterator>& __y)
1554 { return __y < __x; }
1555
1556 template<typename _Iterator>
1557 inline _GLIBCXX17_CONSTEXPR bool
1558 operator>=(const move_iterator<_Iterator>& __x,
1559 const move_iterator<_Iterator>& __y)
1560 { return !(__x < __y); }
1561#endif // ! C++20
1562
1563 // DR 685.
1564 template<typename _IteratorL, typename _IteratorR>
1565 inline _GLIBCXX17_CONSTEXPR auto
1566 operator-(const move_iterator<_IteratorL>& __x,
1567 const move_iterator<_IteratorR>& __y)
1568 -> decltype(__x.base() - __y.base())
1569 { return __x.base() - __y.base(); }
1570
1571 template<typename _Iterator>
1572 inline _GLIBCXX17_CONSTEXPR move_iterator<_Iterator>
1573 operator+(typename move_iterator<_Iterator>::difference_type __n,
1574 const move_iterator<_Iterator>& __x)
1575 { return __x + __n; }
1576
1577 template<typename _Iterator>
1578 inline _GLIBCXX17_CONSTEXPR move_iterator<_Iterator>
1579 make_move_iterator(_Iterator __i)
1580 { return move_iterator<_Iterator>(std::move(__i)); }
1581
1582 template<typename _Iterator, typename _ReturnType
1583 = typename conditional<__move_if_noexcept_cond
1584 <typename iterator_traits<_Iterator>::value_type>::value,
1585 _Iterator, move_iterator<_Iterator>>::type>
1586 inline _GLIBCXX17_CONSTEXPR _ReturnType
1587 __make_move_if_noexcept_iterator(_Iterator __i)
1588 { return _ReturnType(__i); }
1589
1590 // Overload for pointers that matches std::move_if_noexcept more closely,
1591 // returning a constant iterator when we don't want to move.
1592 template<typename _Tp, typename _ReturnType
1593 = typename conditional<__move_if_noexcept_cond<_Tp>::value,
1594 const _Tp*, move_iterator<_Tp*>>::type>
1595 inline _GLIBCXX17_CONSTEXPR _ReturnType
1596 __make_move_if_noexcept_iterator(_Tp* __i)
1597 { return _ReturnType(__i); }
1598
1599#if __cplusplus201402L > 201703L && __cpp_lib_concepts
1600 // [iterators.common] Common iterators
1601
1602 namespace __detail
1603 {
1604 template<typename _It>
1605 concept __common_iter_has_arrow = indirectly_readable<const _It>
1606 && (requires(const _It& __it) { __it.operator->(); }
1607 || is_reference_v<iter_reference_t<_It>>
1608 || constructible_from<iter_value_t<_It>, iter_reference_t<_It>>);
1609
1610 } // namespace __detail
1611
1612 /// An iterator/sentinel adaptor for representing a non-common range.
1613 template<input_or_output_iterator _It, sentinel_for<_It> _Sent>
1614 requires (!same_as<_It, _Sent>) && copyable<_It>
1615 class common_iterator
1616 {
1617 template<typename _Tp, typename _Up>
1618 static constexpr bool
1619 _S_noexcept1()
1620 {
1621 if constexpr (is_trivially_default_constructible_v<_Tp>)
1622 return is_nothrow_assignable_v<_Tp, _Up>;
1623 else
1624 return is_nothrow_constructible_v<_Tp, _Up>;
1625 }
1626
1627 template<typename _It2, typename _Sent2>
1628 static constexpr bool
1629 _S_noexcept()
1630 { return _S_noexcept1<_It, _It2>() && _S_noexcept1<_Sent, _Sent2>(); }
1631
1632 class _Proxy
1633 {
1634 iter_value_t<_It> _M_keep;
1635
1636 _Proxy(iter_reference_t<_It>&& __x)
1637 : _M_keep(std::move(__x)) { }
1638
1639 friend class common_iterator;
1640
1641 public:
1642 const iter_value_t<_It>*
1643 operator->() const
1644 { return std::__addressof(_M_keep); }
1645 };
1646
1647 public:
1648 constexpr
1649 common_iterator()
1650 noexcept(is_nothrow_default_constructible_v<_It>)
1651 : _M_it(), _M_index(0)
1652 { }
1653
1654 constexpr
1655 common_iterator(_It __i)
1656 noexcept(is_nothrow_move_constructible_v<_It>)
1657 : _M_it(std::move(__i)), _M_index(0)
1658 { }
1659
1660 constexpr
1661 common_iterator(_Sent __s)
1662 noexcept(is_nothrow_move_constructible_v<_Sent>)
1663 : _M_sent(std::move(__s)), _M_index(1)
1664 { }
1665
1666 template<typename _It2, typename _Sent2>
1667 requires convertible_to<const _It2&, _It>
1668 && convertible_to<const _Sent2&, _Sent>
1669 constexpr
1670 common_iterator(const common_iterator<_It2, _Sent2>& __x)
1671 noexcept(_S_noexcept<const _It2&, const _Sent2&>())
1672 : _M_valueless(), _M_index(__x._M_index)
1673 {
1674 if (_M_index == 0)
1675 {
1676 if constexpr (is_trivially_default_constructible_v<_It>)
1677 _M_it = std::move(__x._M_it);
1678 else
1679 ::new((void*)std::__addressof(_M_it)) _It(__x._M_it);
1680 }
1681 else if (_M_index == 1)
1682 {
1683 if constexpr (is_trivially_default_constructible_v<_Sent>)
1684 _M_sent = std::move(__x._M_sent);
1685 else
1686 ::new((void*)std::__addressof(_M_sent)) _Sent(__x._M_sent);
1687 }
1688 }
1689
1690 constexpr
1691 common_iterator(const common_iterator& __x)
1692 noexcept(_S_noexcept<const _It&, const _Sent&>())
1693 : _M_valueless(), _M_index(__x._M_index)
1694 {
1695 if (_M_index == 0)
1696 {
1697 if constexpr (is_trivially_default_constructible_v<_It>)
1698 _M_it = std::move(__x._M_it);
1699 else
1700 ::new((void*)std::__addressof(_M_it)) _It(__x._M_it);
1701 }
1702 else if (_M_index == 1)
1703 {
1704 if constexpr (is_trivially_default_constructible_v<_Sent>)
1705 _M_sent = std::move(__x._M_sent);
1706 else
1707 ::new((void*)std::__addressof(_M_sent)) _Sent(__x._M_sent);
1708 }
1709 }
1710
1711 common_iterator&
1712 operator=(const common_iterator& __x)
1713 noexcept(is_nothrow_copy_assignable_v<_It>
1714 && is_nothrow_copy_assignable_v<_Sent>
1715 && is_nothrow_copy_constructible_v<_It>
1716 && is_nothrow_copy_constructible_v<_Sent>)
1717 {
1718 return this->operator=<_It, _Sent>(__x);
1719 }
1720
1721 template<typename _It2, typename _Sent2>
1722 requires convertible_to<const _It2&, _It>
1723 && convertible_to<const _Sent2&, _Sent>
1724 && assignable_from<_It&, const _It2&>
1725 && assignable_from<_Sent&, const _Sent2&>
1726 common_iterator&
1727 operator=(const common_iterator<_It2, _Sent2>& __x)
1728 noexcept(is_nothrow_constructible_v<_It, const _It2&>
1729 && is_nothrow_constructible_v<_Sent, const _Sent2&>
1730 && is_nothrow_assignable_v<_It, const _It2&>
1731 && is_nothrow_assignable_v<_Sent, const _Sent2&>)
1732 {
1733 switch(_M_index << 2 | __x._M_index)
1734 {
1735 case 0b0000:
1736 _M_it = __x._M_it;
1737 break;
1738 case 0b0101:
1739 _M_sent = __x._M_sent;
1740 break;
1741 case 0b0001:
1742 _M_it.~_It();
1743 _M_index = -1;
1744 [[fallthrough]];
1745 case 0b1001:
1746 ::new((void*)std::__addressof(_M_sent)) _Sent(__x._M_sent);
1747 _M_index = 1;
1748 break;
1749 case 0b0100:
1750 _M_sent.~_Sent();
1751 _M_index = -1;
1752 [[fallthrough]];
1753 case 0b1000:
1754 ::new((void*)std::__addressof(_M_it)) _It(__x._M_it);
1755 _M_index = 0;
1756 break;
1757 default:
1758 __glibcxx_assert(__x._M_has_value());
1759 __builtin_unreachable();
1760 }
1761 return *this;
1762 }
1763
1764 ~common_iterator()
1765 {
1766 switch (_M_index)
1767 {
1768 case 0:
1769 _M_it.~_It();
1770 break;
1771 case 1:
1772 _M_sent.~_Sent();
1773 break;
1774 }
1775 }
1776
1777 decltype(auto)
1778 operator*()
1779 {
1780 __glibcxx_assert(_M_index == 0);
1781 return *_M_it;
1782 }
1783
1784 decltype(auto)
1785 operator*() const requires __detail::__dereferenceable<const _It>
1786 {
1787 __glibcxx_assert(_M_index == 0);
1788 return *_M_it;
1789 }
1790
1791 decltype(auto)
1792 operator->() const requires __detail::__common_iter_has_arrow<_It>
1793 {
1794 __glibcxx_assert(_M_index == 0);
1795 if constexpr (is_pointer_v<_It> || requires { _M_it.operator->(); })
1796 return _M_it;
1797 else if constexpr (is_reference_v<iter_reference_t<_It>>)
1798 {
1799 auto&& __tmp = *_M_it;
1800 return std::__addressof(__tmp);
1801 }
1802 else
1803 return _Proxy{*_M_it};
1804 }
1805
1806 common_iterator&
1807 operator++()
1808 {
1809 __glibcxx_assert(_M_index == 0);
1810 ++_M_it;
1811 return *this;
1812 }
1813
1814 decltype(auto)
1815 operator++(int)
1816 {
1817 __glibcxx_assert(_M_index == 0);
1818 if constexpr (forward_iterator<_It>)
1819 {
1820 common_iterator __tmp = *this;
1821 ++*this;
1822 return __tmp;
1823 }
1824 else
1825 return _M_it++;
1826 }
1827
1828 template<typename _It2, sentinel_for<_It> _Sent2>
1829 requires sentinel_for<_Sent, _It2>
1830 friend bool
1831 operator==(const common_iterator& __x,
1832 const common_iterator<_It2, _Sent2>& __y)
1833 {
1834 switch(__x._M_index << 2 | __y._M_index)
1835 {
1836 case 0b0000:
1837 case 0b0101:
1838 return true;
1839 case 0b0001:
1840 return __x._M_it == __y._M_sent;
1841 case 0b0100:
1842 return __x._M_sent == __y._M_it;
1843 default:
1844 __glibcxx_assert(__x._M_has_value());
1845 __glibcxx_assert(__y._M_has_value());
1846 __builtin_unreachable();
1847 }
1848 }
1849
1850 template<typename _It2, sentinel_for<_It> _Sent2>
1851 requires sentinel_for<_Sent, _It2> && equality_comparable_with<_It, _It2>
1852 friend bool
1853 operator==(const common_iterator& __x,
1854 const common_iterator<_It2, _Sent2>& __y)
1855 {
1856 switch(__x._M_index << 2 | __y._M_index)
1857 {
1858 case 0b0101:
1859 return true;
1860 case 0b0000:
1861 return __x._M_it == __y._M_it;
1862 case 0b0001:
1863 return __x._M_it == __y._M_sent;
1864 case 0b0100:
1865 return __x._M_sent == __y._M_it;
1866 default:
1867 __glibcxx_assert(__x._M_has_value());
1868 __glibcxx_assert(__y._M_has_value());
1869 __builtin_unreachable();
1870 }
1871 }
1872
1873 template<sized_sentinel_for<_It> _It2, sized_sentinel_for<_It> _Sent2>
1874 requires sized_sentinel_for<_Sent, _It2>
1875 friend iter_difference_t<_It2>
1876 operator-(const common_iterator& __x,
1877 const common_iterator<_It2, _Sent2>& __y)
1878 {
1879 switch(__x._M_index << 2 | __y._M_index)
1880 {
1881 case 0b0101:
1882 return 0;
1883 case 0b0000:
1884 return __x._M_it - __y._M_it;
1885 case 0b0001:
1886 return __x._M_it - __y._M_sent;
1887 case 0b0100:
1888 return __x._M_sent - __y._M_it;
1889 default:
1890 __glibcxx_assert(__x._M_has_value());
1891 __glibcxx_assert(__y._M_has_value());
1892 __builtin_unreachable();
1893 }
1894 }
1895
1896 friend iter_rvalue_reference_t<_It>
1897 iter_move(const common_iterator& __i)
1898 noexcept(noexcept(ranges::iter_move(std::declval<const _It&>())))
1899 requires input_iterator<_It>
1900 {
1901 __glibcxx_assert(__i._M_index == 0);
1902 return ranges::iter_move(__i._M_it);
1903 }
1904
1905 template<indirectly_swappable<_It> _It2, typename _Sent2>
1906 friend void
1907 iter_swap(const common_iterator& __x,
1908 const common_iterator<_It2, _Sent2>& __y)
1909 noexcept(noexcept(ranges::iter_swap(std::declval<const _It&>(),
1910 std::declval<const _It2&>())))
1911 {
1912 __glibcxx_assert(__x._M_index == 0);
1913 __glibcxx_assert(__y._M_index == 0);
1914 return ranges::iter_swap(__x._M_it, __y._M_it);
1915 }
1916
1917 private:
1918 template<input_or_output_iterator _It2, sentinel_for<_It2> _Sent2>
1919 friend class common_iterator;
1920
1921 bool _M_has_value() const noexcept { return _M_index < 2; }
1922
1923 union
1924 {
1925 _It _M_it;
1926 _Sent _M_sent;
1927 unsigned char _M_valueless;
1928 };
1929 unsigned char _M_index; // 0==_M_it, 1==_M_sent, 2==valueless
1930 };
1931
1932 template<typename _It, typename _Sent>
1933 struct incrementable_traits<common_iterator<_It, _Sent>>
1934 {
1935 using difference_type = iter_difference_t<_It>;
1936 };
1937
1938 template<input_iterator _It, typename _Sent>
1939 struct iterator_traits<common_iterator<_It, _Sent>>
1940 {
1941 private:
1942 template<typename _Iter>
1943 struct __ptr
1944 {
1945 using type = void;
1946 };
1947
1948 template<typename _Iter>
1949 requires __detail::__common_iter_has_arrow<_Iter>
1950 struct __ptr<_Iter>
1951 {
1952 using _CIter = common_iterator<_Iter, _Sent>;
1953 using type = decltype(std::declval<const _CIter&>().operator->());
1954 };
1955
1956 public:
1957 using iterator_concept = conditional_t<forward_iterator<_It>,
1958 forward_iterator_tag, input_iterator_tag>;
1959 using iterator_category = __detail::__clamp_iter_cat<
1960 typename iterator_traits<_It>::iterator_category,
1961 forward_iterator_tag, input_iterator_tag>;
1962 using value_type = iter_value_t<_It>;
1963 using difference_type = iter_difference_t<_It>;
1964 using pointer = typename __ptr<_It>::type;
1965 using reference = iter_reference_t<_It>;
1966 };
1967
1968 // [iterators.counted] Counted iterators
1969
1970 /// An iterator adaptor that keeps track of the distance to the end.
1971 template<input_or_output_iterator _It>
1972 class counted_iterator
1973 {
1974 public:
1975 using iterator_type = _It;
1976
1977 constexpr counted_iterator() = default;
1978
1979 constexpr
1980 counted_iterator(_It __i, iter_difference_t<_It> __n)
1981 : _M_current(std::move(__i)), _M_length(__n)
1982 { __glibcxx_assert(__n >= 0); }
1983
1984 template<typename _It2>
1985 requires convertible_to<const _It2&, _It>
1986 constexpr
1987 counted_iterator(const counted_iterator<_It2>& __x)
1988 : _M_current(__x._M_current), _M_length(__x._M_length)
1989 { }
1990
1991 template<typename _It2>
1992 requires assignable_from<_It&, const _It2&>
1993 constexpr counted_iterator&
1994 operator=(const counted_iterator<_It2>& __x)
1995 {
1996 _M_current = __x._M_current;
1997 _M_length = __x._M_length;
1998 return *this;
1999 }
2000
2001 constexpr _It
2002 base() const &
2003 noexcept(is_nothrow_copy_constructible_v<_It>)
2004 requires copy_constructible<_It>
2005 { return _M_current; }
2006
2007 constexpr _It
2008 base() &&
2009 noexcept(is_nothrow_move_constructible_v<_It>)
2010 { return std::move(_M_current); }
2011
2012 constexpr iter_difference_t<_It>
2013 count() const noexcept { return _M_length; }
2014
2015 constexpr decltype(auto)
2016 operator*()
2017 noexcept(noexcept(*_M_current))
2018 { return *_M_current; }
2019
2020 constexpr decltype(auto)
2021 operator*() const
2022 noexcept(noexcept(*_M_current))
2023 requires __detail::__dereferenceable<const _It>
2024 { return *_M_current; }
2025
2026 constexpr counted_iterator&
2027 operator++()
2028 {
2029 __glibcxx_assert(_M_length > 0);
2030 ++_M_current;
2031 --_M_length;
2032 return *this;
2033 }
2034
2035 decltype(auto)
2036 operator++(int)
2037 {
2038 __glibcxx_assert(_M_length > 0);
2039 --_M_length;
2040 __tryif (true)
2041 {
2042 return _M_current++;
2043 } __catch(...)if (false) {
2044 ++_M_length;
2045 __throw_exception_again;
2046 }
2047
2048 }
2049
2050 constexpr counted_iterator
2051 operator++(int) requires forward_iterator<_It>
2052 {
2053 auto __tmp = *this;
2054 ++*this;
2055 return __tmp;
2056 }
2057
2058 constexpr counted_iterator&
2059 operator--() requires bidirectional_iterator<_It>
2060 {
2061 --_M_current;
2062 ++_M_length;
2063 return *this;
2064 }
2065
2066 constexpr counted_iterator
2067 operator--(int) requires bidirectional_iterator<_It>
2068 {
2069 auto __tmp = *this;
2070 --*this;
2071 return __tmp;
2072 }
2073
2074 constexpr counted_iterator
2075 operator+(iter_difference_t<_It> __n) const
2076 requires random_access_iterator<_It>
2077 { return counted_iterator(_M_current + __n, _M_length - __n); }
2078
2079 friend constexpr counted_iterator
2080 operator+(iter_difference_t<_It> __n, const counted_iterator& __x)
2081 requires random_access_iterator<_It>
2082 { return __x + __n; }
2083
2084 constexpr counted_iterator&
2085 operator+=(iter_difference_t<_It> __n)
2086 requires random_access_iterator<_It>
2087 {
2088 __glibcxx_assert(__n <= _M_length);
2089 _M_current += __n;
2090 _M_length -= __n;
2091 return *this;
2092 }
2093
2094 constexpr counted_iterator
2095 operator-(iter_difference_t<_It> __n) const
2096 requires random_access_iterator<_It>
2097 { return counted_iterator(_M_current - __n, _M_length + __n); }
2098
2099 template<common_with<_It> _It2>
2100 friend constexpr iter_difference_t<_It2>
2101 operator-(const counted_iterator& __x,
2102 const counted_iterator<_It2>& __y)
2103 { return __y._M_length - __x._M_length; }
2104
2105 friend constexpr iter_difference_t<_It>
2106 operator-(const counted_iterator& __x, default_sentinel_t)
2107 { return -__x._M_length; }
2108
2109 friend constexpr iter_difference_t<_It>
2110 operator-(default_sentinel_t, const counted_iterator& __y)
2111 { return __y._M_length; }
2112
2113 constexpr counted_iterator&
2114 operator-=(iter_difference_t<_It> __n)
2115 requires random_access_iterator<_It>
2116 {
2117 __glibcxx_assert(-__n <= _M_length);
2118 _M_current -= __n;
2119 _M_length += __n;
2120 return *this;
2121 }
2122
2123 constexpr decltype(auto)
2124 operator[](iter_difference_t<_It> __n) const
2125 noexcept(noexcept(_M_current[__n]))
2126 requires random_access_iterator<_It>
2127 {
2128 __glibcxx_assert(__n < _M_length);
2129 return _M_current[__n];
2130 }
2131
2132 template<common_with<_It> _It2>
2133 friend constexpr bool
2134 operator==(const counted_iterator& __x,
2135 const counted_iterator<_It2>& __y)
2136 { return __x._M_length == __y._M_length; }
2137
2138 friend constexpr bool
2139 operator==(const counted_iterator& __x, default_sentinel_t)
2140 { return __x._M_length == 0; }
2141
2142 template<common_with<_It> _It2>
2143 friend constexpr strong_ordering
2144 operator<=>(const counted_iterator& __x,
2145 const counted_iterator<_It2>& __y)
2146 { return __y._M_length <=> __x._M_length; }
2147
2148 friend constexpr iter_rvalue_reference_t<_It>
2149 iter_move(const counted_iterator& __i)
2150 noexcept(noexcept(ranges::iter_move(__i._M_current)))
2151 requires input_iterator<_It>
2152 { return ranges::iter_move(__i._M_current); }
2153
2154 template<indirectly_swappable<_It> _It2>
2155 friend constexpr void
2156 iter_swap(const counted_iterator& __x,
2157 const counted_iterator<_It2>& __y)
2158 noexcept(noexcept(ranges::iter_swap(__x._M_current, __y._M_current)))
2159 { ranges::iter_swap(__x._M_current, __y._M_current); }
2160
2161 private:
2162 template<input_or_output_iterator _It2> friend class counted_iterator;
2163
2164 _It _M_current = _It();
2165 iter_difference_t<_It> _M_length = 0;
2166 };
2167
2168 template<typename _It>
2169 struct incrementable_traits<counted_iterator<_It>>
2170 {
2171 using difference_type = iter_difference_t<_It>;
2172 };
2173
2174 template<input_iterator _It>
2175 struct iterator_traits<counted_iterator<_It>> : iterator_traits<_It>
2176 {
2177 using pointer = void;
2178 };
2179#endif // C++20
2180
2181 // @} group iterators
2182
2183 template<typename _Iterator>
2184 auto
2185 __niter_base(move_iterator<_Iterator> __it)
2186 -> decltype(make_move_iterator(__niter_base(__it.base())))
2187 { return make_move_iterator(__niter_base(__it.base())); }
2188
2189 template<typename _Iterator>
2190 struct __is_move_iterator<move_iterator<_Iterator> >
2191 {
2192 enum { __value = 1 };
2193 typedef __true_type __type;
2194 };
2195
2196 template<typename _Iterator>
2197 auto
2198 __miter_base(move_iterator<_Iterator> __it)
2199 -> decltype(__miter_base(__it.base()))
2200 { return __miter_base(__it.base()); }
2201
2202#define _GLIBCXX_MAKE_MOVE_ITERATOR(_Iter)std::make_move_iterator(_Iter) std::make_move_iterator(_Iter)
2203#define _GLIBCXX_MAKE_MOVE_IF_NOEXCEPT_ITERATOR(_Iter)std::__make_move_if_noexcept_iterator(_Iter) \
2204 std::__make_move_if_noexcept_iterator(_Iter)
2205#else
2206#define _GLIBCXX_MAKE_MOVE_ITERATOR(_Iter)std::make_move_iterator(_Iter) (_Iter)
2207#define _GLIBCXX_MAKE_MOVE_IF_NOEXCEPT_ITERATOR(_Iter)std::__make_move_if_noexcept_iterator(_Iter) (_Iter)
2208#endif // C++11
2209
2210#if __cpp_deduction_guides >= 201606
2211 // These helper traits are used for deduction guides
2212 // of associative containers.
2213 template<typename _InputIterator>
2214 using __iter_key_t = remove_const_t<
2215 typename iterator_traits<_InputIterator>::value_type::first_type>;
2216
2217 template<typename _InputIterator>
2218 using __iter_val_t =
2219 typename iterator_traits<_InputIterator>::value_type::second_type;
2220
2221 template<typename _T1, typename _T2>
2222 struct pair;
2223
2224 template<typename _InputIterator>
2225 using __iter_to_alloc_t =
2226 pair<add_const_t<__iter_key_t<_InputIterator>>,
2227 __iter_val_t<_InputIterator>>;
2228#endif // __cpp_deduction_guides
2229
2230_GLIBCXX_END_NAMESPACE_VERSION
2231} // namespace
2232
2233#ifdef _GLIBCXX_DEBUG
2234# include <debug/stl_iterator.h>
2235#endif
2236
2237#endif