head	1.1;
branch	1.1.1;
access;
symbols
	netbsd-11-0-RC4:1.1.1.2
	netbsd-11-0-RC3:1.1.1.2
	netbsd-11-0-RC2:1.1.1.2
	netbsd-11-0-RC1:1.1.1.2
	perseant-exfatfs-base-20250801:1.1.1.2
	netbsd-11:1.1.1.2.0.14
	netbsd-11-base:1.1.1.2
	netbsd-10-1-RELEASE:1.1.1.2
	perseant-exfatfs-base-20240630:1.1.1.2
	perseant-exfatfs:1.1.1.2.0.12
	perseant-exfatfs-base:1.1.1.2
	netbsd-8-3-RELEASE:1.1.1.1
	netbsd-9-4-RELEASE:1.1.1.2
	netbsd-10-0-RELEASE:1.1.1.2
	netbsd-10-0-RC6:1.1.1.2
	netbsd-10-0-RC5:1.1.1.2
	netbsd-10-0-RC4:1.1.1.2
	netbsd-10-0-RC3:1.1.1.2
	netbsd-10-0-RC2:1.1.1.2
	netbsd-10-0-RC1:1.1.1.2
	netbsd-10:1.1.1.2.0.10
	netbsd-10-base:1.1.1.2
	netbsd-9-3-RELEASE:1.1.1.2
	cjep_sun2x:1.1.1.2.0.8
	cjep_sun2x-base:1.1.1.2
	cjep_staticlib_x-base1:1.1.1.2
	netbsd-9-2-RELEASE:1.1.1.2
	cjep_staticlib_x:1.1.1.2.0.6
	cjep_staticlib_x-base:1.1.1.2
	netbsd-9-1-RELEASE:1.1.1.2
	phil-wifi-20200421:1.1.1.2
	phil-wifi-20200411:1.1.1.2
	phil-wifi-20200406:1.1.1.2
	netbsd-8-2-RELEASE:1.1.1.1
	netbsd-9-0-RELEASE:1.1.1.2
	netbsd-9-0-RC2:1.1.1.2
	netbsd-9-0-RC1:1.1.1.2
	netbsd-9:1.1.1.2.0.4
	netbsd-9-base:1.1.1.2
	netbsd-8-1-RELEASE:1.1.1.1
	netbsd-8-1-RC1:1.1.1.1
	pgoyette-compat-merge-20190127:1.1.1.2
	pgoyette-compat-20190127:1.1.1.2
	pgoyette-compat-20190118:1.1.1.2
	pgoyette-compat-1226:1.1.1.2
	pgoyette-compat-1126:1.1.1.2
	pgoyette-compat-1020:1.1.1.2
	pgoyette-compat-0930:1.1.1.2
	pgoyette-compat-0906:1.1.1.2
	pgoyette-compat-0728:1.1.1.2
	netbsd-8-0-RELEASE:1.1.1.1
	pgoyette-compat-0625:1.1.1.2
	netbsd-8-0-RC2:1.1.1.1
	pgoyette-compat-0521:1.1.1.2
	pgoyette-compat-0502:1.1.1.2
	pgoyette-compat-0422:1.1.1.2
	netbsd-8-0-RC1:1.1.1.1
	pgoyette-compat-0415:1.1.1.2
	pgoyette-compat-0407:1.1.1.2
	pgoyette-compat-0330:1.1.1.2
	pgoyette-compat-0322:1.1.1.2
	pgoyette-compat-0315:1.1.1.2
	pgoyette-compat:1.1.1.2.0.2
	pgoyette-compat-base:1.1.1.2
	matt-nb8-mediatek:1.1.1.1.0.12
	matt-nb8-mediatek-base:1.1.1.1
	perseant-stdc-iso10646:1.1.1.1.0.10
	perseant-stdc-iso10646-base:1.1.1.1
	netbsd-8:1.1.1.1.0.8
	netbsd-8-base:1.1.1.1
	prg-localcount2-base3:1.1.1.1
	prg-localcount2-base2:1.1.1.1
	prg-localcount2-base1:1.1.1.1
	prg-localcount2:1.1.1.1.0.6
	prg-localcount2-base:1.1.1.1
	pgoyette-localcount-20170426:1.1.1.1
	bouyer-socketcan-base1:1.1.1.1
	pgoyette-localcount:1.1.1.1.0.4
	pgoyette-localcount-20170320:1.1.1.1
	clang-294123:1.1.1.1
	bouyer-socketcan:1.1.1.1.0.2
	bouyer-socketcan-base:1.1.1.1
	clang-291444:1.1.1.1
	LLVM:1.1.1;
locks; strict;
comment	@// @;


1.1
date	2017.01.11.10.37.15;	author joerg;	state Exp;
branches
	1.1.1.1;
next	;
commitid	CNnUNfII1jgNmxBz;

1.1.1.1
date	2017.01.11.10.37.15;	author joerg;	state Exp;
branches
	1.1.1.1.4.1;
next	1.1.1.2;
commitid	CNnUNfII1jgNmxBz;

1.1.1.2
date	2017.08.01.10.54.02;	author joerg;	state dead;
branches;
next	;
commitid	8fbWrGIjoiyAZu1A;

1.1.1.1.4.1
date	2017.01.11.10.37.15;	author pgoyette;	state dead;
branches;
next	1.1.1.1.4.2;
commitid	jjw7cAwgyKq7RfKz;

1.1.1.1.4.2
date	2017.03.20.06.52.47;	author pgoyette;	state Exp;
branches;
next	;
commitid	jjw7cAwgyKq7RfKz;


desc
@@


1.1
log
@Initial revision
@
text
@// RUN: %clang_cc1 -std=c++11 -analyze -analyzer-checker=core,cplusplus,alpha.cplusplus.IteratorPastEnd -analyzer-eagerly-assume -analyzer-config c++-container-inlining=false %s -verify
// RUN: %clang_cc1 -std=c++11 -analyze -analyzer-checker=core,cplusplus,alpha.cplusplus.IteratorPastEnd -analyzer-eagerly-assume -analyzer-config c++-container-inlining=true -DINLINE=1 %s -verify

#include "Inputs/system-header-simulator-cxx.h"

void simple_good(const std::vector<int> &v) {
  auto i = v.end();
  if (i != v.end())
    *i; // no-warning
}

void simple_good_negated(const std::vector<int> &v) {
  auto i = v.end();
  if (!(i == v.end()))
    *i; // no-warning
}

void simple_bad(const std::vector<int> &v) {
  auto i = v.end();
  *i; // expected-warning{{Iterator accessed past its end}}
}

void copy(const std::vector<int> &v) {
  auto i1 = v.end();
  auto i2 = i1;
  *i2; // expected-warning{{Iterator accessed past its end}}
}

void decrease(const std::vector<int> &v) {
  auto i = v.end();
  --i;
  *i; // no-warning
}

void copy_and_decrease1(const std::vector<int> &v) {
  auto i1 = v.end();
  auto i2 = i1;
  --i1;
  *i1; // no-warning
}

void copy_and_decrease2(const std::vector<int> &v) {
  auto i1 = v.end();
  auto i2 = i1;
  --i1;
  *i2; // expected-warning{{Iterator accessed past its end}}
}

void copy_and_increase1(const std::vector<int> &v) {
  auto i1 = v.begin();
  auto i2 = i1;
  ++i1;
  if (i1 == v.end())
    *i2; // no-warning
}

void copy_and_increase2(const std::vector<int> &v) {
  auto i1 = v.begin();
  auto i2 = i1;
  ++i1;
  if (i2 == v.end())
    *i2; // expected-warning{{Iterator accessed past its end}}
}

void good_find(std::vector<int> &vec, int e) {
  auto first = std::find(vec.begin(), vec.end(), e);
  if (vec.end() != first)
    *first; // no-warning
}

void bad_find(std::vector<int> &vec, int e) {
  auto first = std::find(vec.begin(), vec.end(), e);
  *first; // expected-warning{{Iterator accessed past its end}}
}

void good_find_end(std::vector<int> &vec, std::vector<int> &seq) {
  auto last = std::find_end(vec.begin(), vec.end(), seq.begin(), seq.end());
  if (vec.end() != last)
    *last; // no-warning
}

void bad_find_end(std::vector<int> &vec, std::vector<int> &seq) {
  auto last = std::find_end(vec.begin(), vec.end(), seq.begin(), seq.end());
  *last; // expected-warning{{Iterator accessed past its end}}
}

void good_find_first_of(std::vector<int> &vec, std::vector<int> &seq) {
  auto first =
      std::find_first_of(vec.begin(), vec.end(), seq.begin(), seq.end());
  if (vec.end() != first)
    *first; // no-warning
}

void bad_find_first_of(std::vector<int> &vec, std::vector<int> &seq) {
  auto first = std::find_end(vec.begin(), vec.end(), seq.begin(), seq.end());
  *first; // expected-warning{{Iterator accessed past its end}}
}

bool odd(int i) { return i % 2; }

void good_find_if(std::vector<int> &vec) {
  auto first = std::find_if(vec.begin(), vec.end(), odd);
  if (vec.end() != first)
    *first; // no-warning
}

void bad_find_if(std::vector<int> &vec, int e) {
  auto first = std::find_if(vec.begin(), vec.end(), odd);
  *first; // expected-warning{{Iterator accessed past its end}}
}

void good_find_if_not(std::vector<int> &vec) {
  auto first = std::find_if_not(vec.begin(), vec.end(), odd);
  if (vec.end() != first)
    *first; // no-warning
}

void bad_find_if_not(std::vector<int> &vec, int e) {
  auto first = std::find_if_not(vec.begin(), vec.end(), odd);
  *first; // expected-warning{{Iterator accessed past its end}}
}

void good_lower_bound(std::vector<int> &vec, int e) {
  auto first = std::lower_bound(vec.begin(), vec.end(), e);
  if (vec.end() != first)
    *first; // no-warning
}

void bad_lower_bound(std::vector<int> &vec, int e) {
  auto first = std::lower_bound(vec.begin(), vec.end(), e);
  *first; // expected-warning{{Iterator accessed past its end}}
}

void good_upper_bound(std::vector<int> &vec, int e) {
  auto last = std::lower_bound(vec.begin(), vec.end(), e);
  if (vec.end() != last)
    *last; // no-warning
}

void bad_upper_bound(std::vector<int> &vec, int e) {
  auto last = std::lower_bound(vec.begin(), vec.end(), e);
  *last; // expected-warning{{Iterator accessed past its end}}
}

void good_search(std::vector<int> &vec, std::vector<int> &seq) {
  auto first = std::search(vec.begin(), vec.end(), seq.begin(), seq.end());
  if (vec.end() != first)
    *first; // no-warning
}

void bad_search(std::vector<int> &vec, std::vector<int> &seq) {
  auto first = std::search(vec.begin(), vec.end(), seq.begin(), seq.end());
  *first; // expected-warning{{Iterator accessed past its end}}
}

void good_search_n(std::vector<int> &vec, std::vector<int> &seq) {
  auto nth = std::search_n(vec.begin(), vec.end(), seq.begin(), seq.end());
  if (vec.end() != nth)
    *nth; // no-warning
}

void bad_search_n(std::vector<int> &vec, std::vector<int> &seq) {
  auto nth = std::search_n(vec.begin(), vec.end(), seq.begin(), seq.end());
  *nth; // expected-warning{{Iterator accessed past its end}}
}

template <class InputIterator, class T>
InputIterator nonStdFind(InputIterator first, InputIterator last,
                         const T &val) {
  for (auto i = first; i != last; ++i) {
    if (*i == val) {
      return i;
    }
  }
  return last;
}

void good_non_std_find(std::vector<int> &vec, int e) {
  auto first = nonStdFind(vec.begin(), vec.end(), e);
  if (vec.end() != first)
    *first; // no-warning
}

void bad_non_std_find(std::vector<int> &vec, int e) {
  auto first = nonStdFind(vec.begin(), vec.end(), e);
  *first; // expected-warning{{Iterator accessed past its end}}
}

void tricky(std::vector<int> &vec, int e) {
  const auto first = vec.begin();
  const auto comp1 = (first != vec.end()), comp2 = (first == vec.end());
  if (comp1)
    *first;
}

void loop(std::vector<int> &vec, int e) {
  auto start = vec.begin();
  while (true) {
    auto item = std::find(start, vec.end(), e);
    if (item == vec.end())
      break;
    *item;          // no-warning
    start = ++item; // no-warning
  }
}
@


1.1.1.1
log
@Import Clang pre-4.0.0 r291444.
@
text
@@


1.1.1.2
log
@Mark files not present in 309604 as dead.
@
text
@@


1.1.1.1.4.1
log
@file iterator-past-end.cpp was added on branch pgoyette-localcount on 2017-03-20 06:52:47 +0000
@
text
@d1 205
@


1.1.1.1.4.2
log
@Sync with HEAD
@
text
@a0 205
// RUN: %clang_cc1 -std=c++11 -analyze -analyzer-checker=core,cplusplus,alpha.cplusplus.IteratorPastEnd -analyzer-eagerly-assume -analyzer-config c++-container-inlining=false %s -verify
// RUN: %clang_cc1 -std=c++11 -analyze -analyzer-checker=core,cplusplus,alpha.cplusplus.IteratorPastEnd -analyzer-eagerly-assume -analyzer-config c++-container-inlining=true -DINLINE=1 %s -verify

#include "Inputs/system-header-simulator-cxx.h"

void simple_good(const std::vector<int> &v) {
  auto i = v.end();
  if (i != v.end())
    *i; // no-warning
}

void simple_good_negated(const std::vector<int> &v) {
  auto i = v.end();
  if (!(i == v.end()))
    *i; // no-warning
}

void simple_bad(const std::vector<int> &v) {
  auto i = v.end();
  *i; // expected-warning{{Iterator accessed past its end}}
}

void copy(const std::vector<int> &v) {
  auto i1 = v.end();
  auto i2 = i1;
  *i2; // expected-warning{{Iterator accessed past its end}}
}

void decrease(const std::vector<int> &v) {
  auto i = v.end();
  --i;
  *i; // no-warning
}

void copy_and_decrease1(const std::vector<int> &v) {
  auto i1 = v.end();
  auto i2 = i1;
  --i1;
  *i1; // no-warning
}

void copy_and_decrease2(const std::vector<int> &v) {
  auto i1 = v.end();
  auto i2 = i1;
  --i1;
  *i2; // expected-warning{{Iterator accessed past its end}}
}

void copy_and_increase1(const std::vector<int> &v) {
  auto i1 = v.begin();
  auto i2 = i1;
  ++i1;
  if (i1 == v.end())
    *i2; // no-warning
}

void copy_and_increase2(const std::vector<int> &v) {
  auto i1 = v.begin();
  auto i2 = i1;
  ++i1;
  if (i2 == v.end())
    *i2; // expected-warning{{Iterator accessed past its end}}
}

void good_find(std::vector<int> &vec, int e) {
  auto first = std::find(vec.begin(), vec.end(), e);
  if (vec.end() != first)
    *first; // no-warning
}

void bad_find(std::vector<int> &vec, int e) {
  auto first = std::find(vec.begin(), vec.end(), e);
  *first; // expected-warning{{Iterator accessed past its end}}
}

void good_find_end(std::vector<int> &vec, std::vector<int> &seq) {
  auto last = std::find_end(vec.begin(), vec.end(), seq.begin(), seq.end());
  if (vec.end() != last)
    *last; // no-warning
}

void bad_find_end(std::vector<int> &vec, std::vector<int> &seq) {
  auto last = std::find_end(vec.begin(), vec.end(), seq.begin(), seq.end());
  *last; // expected-warning{{Iterator accessed past its end}}
}

void good_find_first_of(std::vector<int> &vec, std::vector<int> &seq) {
  auto first =
      std::find_first_of(vec.begin(), vec.end(), seq.begin(), seq.end());
  if (vec.end() != first)
    *first; // no-warning
}

void bad_find_first_of(std::vector<int> &vec, std::vector<int> &seq) {
  auto first = std::find_end(vec.begin(), vec.end(), seq.begin(), seq.end());
  *first; // expected-warning{{Iterator accessed past its end}}
}

bool odd(int i) { return i % 2; }

void good_find_if(std::vector<int> &vec) {
  auto first = std::find_if(vec.begin(), vec.end(), odd);
  if (vec.end() != first)
    *first; // no-warning
}

void bad_find_if(std::vector<int> &vec, int e) {
  auto first = std::find_if(vec.begin(), vec.end(), odd);
  *first; // expected-warning{{Iterator accessed past its end}}
}

void good_find_if_not(std::vector<int> &vec) {
  auto first = std::find_if_not(vec.begin(), vec.end(), odd);
  if (vec.end() != first)
    *first; // no-warning
}

void bad_find_if_not(std::vector<int> &vec, int e) {
  auto first = std::find_if_not(vec.begin(), vec.end(), odd);
  *first; // expected-warning{{Iterator accessed past its end}}
}

void good_lower_bound(std::vector<int> &vec, int e) {
  auto first = std::lower_bound(vec.begin(), vec.end(), e);
  if (vec.end() != first)
    *first; // no-warning
}

void bad_lower_bound(std::vector<int> &vec, int e) {
  auto first = std::lower_bound(vec.begin(), vec.end(), e);
  *first; // expected-warning{{Iterator accessed past its end}}
}

void good_upper_bound(std::vector<int> &vec, int e) {
  auto last = std::lower_bound(vec.begin(), vec.end(), e);
  if (vec.end() != last)
    *last; // no-warning
}

void bad_upper_bound(std::vector<int> &vec, int e) {
  auto last = std::lower_bound(vec.begin(), vec.end(), e);
  *last; // expected-warning{{Iterator accessed past its end}}
}

void good_search(std::vector<int> &vec, std::vector<int> &seq) {
  auto first = std::search(vec.begin(), vec.end(), seq.begin(), seq.end());
  if (vec.end() != first)
    *first; // no-warning
}

void bad_search(std::vector<int> &vec, std::vector<int> &seq) {
  auto first = std::search(vec.begin(), vec.end(), seq.begin(), seq.end());
  *first; // expected-warning{{Iterator accessed past its end}}
}

void good_search_n(std::vector<int> &vec, std::vector<int> &seq) {
  auto nth = std::search_n(vec.begin(), vec.end(), seq.begin(), seq.end());
  if (vec.end() != nth)
    *nth; // no-warning
}

void bad_search_n(std::vector<int> &vec, std::vector<int> &seq) {
  auto nth = std::search_n(vec.begin(), vec.end(), seq.begin(), seq.end());
  *nth; // expected-warning{{Iterator accessed past its end}}
}

template <class InputIterator, class T>
InputIterator nonStdFind(InputIterator first, InputIterator last,
                         const T &val) {
  for (auto i = first; i != last; ++i) {
    if (*i == val) {
      return i;
    }
  }
  return last;
}

void good_non_std_find(std::vector<int> &vec, int e) {
  auto first = nonStdFind(vec.begin(), vec.end(), e);
  if (vec.end() != first)
    *first; // no-warning
}

void bad_non_std_find(std::vector<int> &vec, int e) {
  auto first = nonStdFind(vec.begin(), vec.end(), e);
  *first; // expected-warning{{Iterator accessed past its end}}
}

void tricky(std::vector<int> &vec, int e) {
  const auto first = vec.begin();
  const auto comp1 = (first != vec.end()), comp2 = (first == vec.end());
  if (comp1)
    *first;
}

void loop(std::vector<int> &vec, int e) {
  auto start = vec.begin();
  while (true) {
    auto item = std::find(start, vec.end(), e);
    if (item == vec.end())
      break;
    *item;          // no-warning
    start = ++item; // no-warning
  }
}
@