Commit 02dcf7ba by Richard Guenther Committed by Richard Biener

re PR c++/34850 (Recursive BLOCK tree causes compilation to hang during diagnostics)

2008-01-21  Richard Guenther  <rguenther@suse.de>

	PR c++/34850
	cp/
	* error.c (cp_print_error_function): Deal with recursive
	BLOCK trees.

	* g++.dg/torture/pr34850.C: New testcase.

From-SVN: r131690
parent b158b5c6
2008-01-21 Richard Guenther <rguenther@suse.de>
PR c++/34850
* error.c (cp_print_error_function): Deal with recursive
BLOCK trees.
2008-01-20 Paolo Carlini <pcarlini@suse.de> 2008-01-20 Paolo Carlini <pcarlini@suse.de>
PR c++/34891 PR c++/34891
......
...@@ -2424,7 +2424,9 @@ cp_print_error_function (diagnostic_context *context, ...@@ -2424,7 +2424,9 @@ cp_print_error_function (diagnostic_context *context,
{ {
ao = BLOCK_ABSTRACT_ORIGIN (block); ao = BLOCK_ABSTRACT_ORIGIN (block);
while (TREE_CODE (ao) == BLOCK && BLOCK_ABSTRACT_ORIGIN (ao)) while (TREE_CODE (ao) == BLOCK
&& BLOCK_ABSTRACT_ORIGIN (ao)
&& BLOCK_ABSTRACT_ORIGIN (ao) != ao)
ao = BLOCK_ABSTRACT_ORIGIN (ao); ao = BLOCK_ABSTRACT_ORIGIN (ao);
if (TREE_CODE (ao) == FUNCTION_DECL) if (TREE_CODE (ao) == FUNCTION_DECL)
......
2008-01-21 Richard Guenther <rguenther@suse.de>
PR c++/34850
* g++.dg/torture/pr34850.C: New testcase.
2008-01-21 Alon Dayan <alond@il.ibm.com> 2008-01-21 Alon Dayan <alond@il.ibm.com>
Olga Golovanevsky <olga@il.ibm.com> Olga Golovanevsky <olga@il.ibm.com>
/* { dg-do compile } */
/* { dg-options "-O2" } */
typedef unsigned char uint8_t;
typedef unsigned int uint32_t;
typedef uint8_t byte;
typedef uint32_t u32bit;
typedef unsigned int size_t;
extern "C" {
extern void __warn_memset_zero_len (void) __attribute__((__warning__ ("")));
extern __inline __attribute__ ((__always_inline__)) __attribute__ ((__gnu_inline__, __artificial__))
void * memset (void *__dest, int __ch, size_t __len) throw () {
if (__builtin_constant_p (__len) && __len == 0)
__warn_memset_zero_len (); /* { dg-warning "" } */
}
}
inline void clear_mem(void* ptr, u32bit n) {
memset(ptr, 0, n);
}
template<typename T> class MemoryRegion {
public:
u32bit size() const {
}
const T* begin() const {
}
void set(const T in[], u32bit n) {
create(n);
}
void set(const MemoryRegion<T>& in) {
set(in.begin(), in.size());
}
void clear() {
clear_mem(buf, allocated);
}
void create(u32bit);
MemoryRegion() {
used = allocated = 0;
}
mutable T* buf;
mutable u32bit used;
mutable u32bit allocated;
};
template<typename T> void MemoryRegion<T>::create(u32bit n) {
if(n <= allocated) {
clear();
}
}
template<typename T> class SecureVector : public MemoryRegion<T> {
public:
SecureVector<T>& operator=(const MemoryRegion<T>& in) {
if(this != &in) set(in);
}
};
class OctetString {
public:
SecureVector<byte> bits_of() const {
}
OctetString& operator^=(const OctetString&);
void change(const MemoryRegion<byte>& in) {
bits = in;
}
OctetString(const MemoryRegion<byte>& in) {
change(in);
}
SecureVector<byte> bits;
};
OctetString& OctetString::operator^=(const OctetString& k) {
if(&k == this) {
bits.clear();
}
}
bool operator==(const OctetString& s1, const OctetString& s2) {
return (s1.bits_of() == s2.bits_of());
}
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment