void m(char16_t c0, char32_t c1)
{
f_c (c0); /* { dg-warning "conversion from .char16_t. to .char. may change value" } */
fsc (c0); /* { dg-warning "change value" } */
fuc (c0); /* { dg-warning "change value" } */
f_s (c0); /* { dg-warning "change the sign" } */
fss (c0); /* { dg-warning "change the sign" } */
fus (c0);
f_i (c0);
fsi (c0);
fui (c0);
f_l (c0);
fsl (c0);
ful (c0);
f_ll (c0);
fsll (c0);
full (c0);
f_c (c1); /* { dg-warning "change value" } */
fsc (c1); /* { dg-warning "change value" } */
fuc (c1); /* { dg-warning "change value" } */
f_s (c1); /* { dg-warning "change value" } */
fss (c1); /* { dg-warning "change value" } */
fus (c1); /* { dg-warning "change value" } */
f_i (c1); /* { dg-warning "change the sign" } */
fsi (c1); /* { dg-warning "change the sign" } */
fui (c1);
f_l (c1); /* { dg-warning "change the sign" "" { target { llp64 || ilp32 } } } */
fsl (c1); /* { dg-warning "change the sign" "" { target { llp64 || ilp32 } } } */
ful (c1);
f_ll (c1);
fsll (c1);
full (c1);
}
void m (char16_t c0, char32_t c1)
{
f_c (c0); /* { dg-warning "alter its value" } */
fsc (c0); /* { dg-warning "alter its value" } */
fuc (c0); /* { dg-warning "alter its value" } */
f_s (c0); /* { dg-warning "change the sign" } */
fss (c0); /* { dg-warning "change the sign" } */
fus (c0);
f_i (c0);
fsi (c0);
fui (c0);
f_l (c0);
fsl (c0);
ful (c0);
f_ll (c0);
fsll (c0);
full (c0);
f_c (c1); /* { dg-warning "alter its value" } */
fsc (c1); /* { dg-warning "alter its value" } */
fuc (c1); /* { dg-warning "alter its value" } */
f_s (c1); /* { dg-warning "alter its value" } */
fss (c1); /* { dg-warning "alter its value" } */
fus (c1); /* { dg-warning "alter its value" } */
f_i (c1); /* { dg-warning "change the sign" "" { target { ! int16 } } } */
fsi (c1); /* { dg-warning "change the sign" "" { target { ! int16 } } } */
fui (c1);
f_l (c1); /* { dg-warning "change the sign" "" { target { llp64 || ilp32 } } } */
fsl (c1); /* { dg-warning "change the sign" "" { target { llp64 || ilp32 } } } */
ful (c1);
f_ll (c1);
fsll (c1);
full (c1);
}
br_status bvarray2uf_rewriter_cfg::reduce_app(func_decl * f, unsigned num, expr * const * args, expr_ref & result, proof_ref & result_pr) {
br_status res = BR_FAILED;
if (m_manager.is_eq(f) && is_bv_array(f->get_domain()[0])) {
SASSERT(num == 2);
// From [1]: Finally, we replace equations of the form t = s,
// where t and s are arrays, with \forall x . f_t(x) = f_s(x).
func_decl_ref f_t(mk_uf_for_array(args[0]), m_manager);
func_decl_ref f_s(mk_uf_for_array(args[1]), m_manager);
sort * sorts[1] = { get_index_sort(m_manager.get_sort(args[0])) };
symbol names[1] = { symbol("x") };
var_ref x(m_manager.mk_var(0, sorts[0]), m_manager);
expr_ref body(m_manager);
body = m_manager.mk_eq(m_manager.mk_app(f_t, x.get()), m_manager.mk_app(f_s, x.get()));
result = m_manager.mk_forall(1, sorts, names, body);
res = BR_DONE;
}
else if (m_manager.is_distinct(f) && is_bv_array(f->get_domain()[0])) {
result = m_manager.mk_distinct_expanded(num, args);
res = BR_REWRITE1;
}
else if (f->get_family_id() == null_family_id) {
TRACE("bvarray2uf_rw", tout << "UF APP: " << f->get_name() << std::endl; );
int pars_f(const char *s)
{
f__parenlvl=f__revloc=f__pc=0;
if(f_s(s,0) == NULL)
{
return(-1);
}
return(0);
}
int
pars_f (unit *ftnunit, char *s)
{
ftnunit->parenlvl = ftnunit->revloc = ftnunit->pc = 0;
if ((s = f_s (ftnunit, s, 0)) == NULL) {
return (-1);
}
return (0);
}
pars_f(char *s)
#endif
{
f__parenlvl=f__revloc=f__pc=0;
if(f_s(s,0) == NULL)
{
return(-1);
}
return(0);
}
static const char *i_tem(const char *s)
{ const char *t;
int n,curloc;
if(*s==')') return(s);
if(ne_d(s,&t)) return(t);
if(e_d(s,&t)) return(t);
s=gt_num(s,&n,1);
if((curloc=op_gen(STACK,n,0,0))<0) return(NULL);
return(f_s(s,curloc));
}
int
pars_f(const char *s)
{
f__parenlvl = 0;
f__revloc = 0;
f__pc = 0;
if (f_s(s, 0) == NULL) {
return -1;
}
return 0;
}
char *i_tem(char *s)
#endif
{
char *t;
int n, curloc;
if (*s == ')') return(s);
if (ne_d(s, &t)) return(t);
if (e_d(s, &t)) return(t);
s = gt_num(s, &n);
if ((curloc = op_gen(STACK, n, 0, 0)) < 0) return(NULL);
return(f_s(s, curloc));
}
int f_s_out(ARG1) {
if (mode == -1) {
if ((*local = (void *) ffopen(arg1,file_append ? "a" : "w")) == NULL)
fatal_error("Could not open %s", arg1);
return 0;
}
if (mode >= 0) {
f_s(CALL_ARG0);
fprintf((FILE *) *local, "%s", inv_out);
}
return 0;
}
static char *
i_tem(unit *ftnunit, char *s)
{
char *t;
int n, curloc;
if (*s == ')')
return (s);
if (ne_d (ftnunit, s, &t))
return (t);
if (e_d (ftnunit, s, &t))
return (t);
s = gt_num (ftnunit, s, &n);
if ((curloc = op_gen (ftnunit, STACK, n, 0, 0)) < 0)
return (NULL);
return (f_s (ftnunit, s, curloc));
}
const char *
i_tem(const char *s)
{
const char *t;
int n;
int curloc;
if (*s == ')')
return s;
if (ne_d(s, &t))
return t;
if (e_d(s, &t))
return t;
s = gt_num(s, &n);
if ((curloc = op_gen(STACK, n, 0, 0)) < 0)
return NULL;
return f_s(s, curloc);
}
pars_f(char *s)
#endif
{
char *e;
f__parenlvl=f__revloc=f__pc=0;
if((e=f_s(s,0)) == NULL)
{
/* Try and delimit the format string. Parens within
hollerith and quoted strings have to match for this
to work, but it's probably adequate for most needs.
Note that this is needed because a valid CHARACTER
variable passed for FMT= can contain '(I)garbage',
where `garbage' is billions and billions of junk
characters, and it's up to the run-time library to
know where the format string ends by counting parens.
Meanwhile, still treat NUL byte as "hard stop", since
f2c still appends that at end of FORMAT-statement
strings. */
int level=0;
for (f__fmtlen=0;
((*s!=')') || (--level > 0))
&& (*s!='\0')
&& (f__fmtlen<80);
++s, ++f__fmtlen)
{
if (*s=='(')
++level;
}
if (*s==')')
++f__fmtlen;
return(-1);
}
f__fmtlen = e - s;
return(0);
}
/* { dg-options "-pedantic-errors" } */
const void f_cv (void);
struct s f_s (void);
void f_v (void);
void g1 (void) { f_cv (); } /* { dg-error "qualified void" } */
void g2 (void) { f_s (); } /* { dg-error "invalid use of undefined type" } */
