File: merge-condition-basic.cpp

package info (click to toggle)
chromium 139.0.7258.127-1
  • links: PTS, VCS
  • area: main
  • in suites:
  • size: 6,122,068 kB
  • sloc: cpp: 35,100,771; ansic: 7,163,530; javascript: 4,103,002; python: 1,436,920; asm: 946,517; xml: 746,709; pascal: 187,653; perl: 88,691; sh: 88,436; objc: 79,953; sql: 51,488; cs: 44,583; fortran: 24,137; makefile: 22,147; tcl: 15,277; php: 13,980; yacc: 8,984; ruby: 7,485; awk: 3,720; lisp: 3,096; lex: 1,327; ada: 727; jsp: 228; sed: 36
file content (115 lines) | stat: -rw-r--r-- 2,582 bytes parent folder | download | duplicates (6)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
// Copyright 2024 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include <algorithm>
#include <vector>

bool A();
bool B();

void SameConditionInvalidatesThenValidatesIterator() {
  std::vector<int> container = {1, 2, 3};
  auto it = container.begin() + 1;
  if (it == container.end()) {
    return;
  }

  const bool a = A();

  if (a) {
    container.clear();
  }

  if (a) {
    container.push_back(1);
    container.push_back(2);
    it = container.begin() + 1;
    if (it == std::end(container)) {
      return;
    }
  }

  // This is valid because although the container was invalidated in the first
  // `if(a)` block, the second one reassigns the iterator and ensures that it
  // is different than `end`. Since the same check is made at the very
  // beginning of the function, the iterator is logically valid at this point
  // of the execution.
  *it = 10;
}

void SameConditionUncheckedIterator() {
  std::vector<int> container = {1, 2, 3};
  auto it = container.begin() + 1;
  if (it == std::end(container)) {
    return;
  }

  const bool a = A();

  if (a) {
    container.clear();
  }

  if (!a) {
    container.push_back(1);
    container.push_back(2);
    it = container.begin() + 1;
  }

  // This is invalid because although the iterator is getting reassigned in the
  // second `a` conditional block, it is not checked against the `end` iterator.
  *it = 10;  // Invalid.
}

void DifferentConditionsWithCheckedIterator() {
  std::vector<int> container = {1, 2, 3};
  auto it = container.begin() + 1;
  if (it == std::end(container)) {
    return;
  }

  const bool a = A();
  const bool b = B();

  if (a && b) {
    container.clear();
  }

  if (a || b) {
    container.push_back(1);
    container.push_back(2);
    it = container.begin() + 1;
    if (it == std::end(container)) {
      return;
    }
  }

  // Valid since in all cases it is checked against the `end` iterator.
  *it = 10;
}

void DifferentConditionsWithUncheckedIterator() {
  std::vector<int> container = {1, 2, 3};
  auto it = container.begin() + 1;
  if (it == std::end(container)) {
    return;
  }

  const bool a = A();
  const bool b = B();

  if (a && b) {
    container.clear();
  }

  if (a || b) {
    container.push_back(1);
    container.push_back(2);
    it = container.begin() + 1;
  }

  // Invalid. The difference with `DifferentConditionsWithCheckedIterator` is
  // that we do not check the iterator in the last `if` block, hence we can't
  // ensure that the iterator is valid.
  *it = 10;
}