# Copyright (C) 2000, 2002, 2003, 2005, 2006, 2007
|
# Copyright (C) 2000, 2002, 2003, 2005, 2006, 2007
|
# Free Software Foundation, Inc.
|
# Free Software Foundation, Inc.
|
|
|
# This program is free software; you can redistribute it and/or modify
|
# This program is free software; you can redistribute it and/or modify
|
# it under the terms of the GNU General Public License as published by
|
# it under the terms of the GNU General Public License as published by
|
# the Free Software Foundation; either version 3 of the License, or
|
# the Free Software Foundation; either version 3 of the License, or
|
# (at your option) any later version.
|
# (at your option) any later version.
|
#
|
#
|
# This program is distributed in the hope that it will be useful,
|
# This program is distributed in the hope that it will be useful,
|
# but WITHOUT ANY WARRANTY; without even the implied warranty of
|
# but WITHOUT ANY WARRANTY; without even the implied warranty of
|
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
# GNU General Public License for more details.
|
# GNU General Public License for more details.
|
#
|
#
|
# You should have received a copy of the GNU General Public License
|
# You should have received a copy of the GNU General Public License
|
# along with GCC; see the file COPYING3. If not see
|
# along with GCC; see the file COPYING3. If not see
|
# .
|
# .
|
|
|
# Various utilities for scanning tree dump output, used by gcc-dg.exp and
|
# Various utilities for scanning tree dump output, used by gcc-dg.exp and
|
# g++-dg.exp.
|
# g++-dg.exp.
|
|
|
load_lib scandump.exp
|
load_lib scandump.exp
|
|
|
# Utility for scanning compiler result, invoked via dg-final.
|
# Utility for scanning compiler result, invoked via dg-final.
|
# Call pass if pattern is present, otherwise fail.
|
# Call pass if pattern is present, otherwise fail.
|
#
|
#
|
# Argument 0 is the regexp to match
|
# Argument 0 is the regexp to match
|
# Argument 1 is the name of the dumped tree pass
|
# Argument 1 is the name of the dumped tree pass
|
# Argument 2 handles expected failures and the like
|
# Argument 2 handles expected failures and the like
|
proc scan-tree-dump { args } {
|
proc scan-tree-dump { args } {
|
|
|
if { [llength $args] < 2 } {
|
if { [llength $args] < 2 } {
|
error "scan-tree-dump: too few arguments"
|
error "scan-tree-dump: too few arguments"
|
return
|
return
|
}
|
}
|
if { [llength $args] > 3 } {
|
if { [llength $args] > 3 } {
|
error "scan-tree-dump: too many arguments"
|
error "scan-tree-dump: too many arguments"
|
return
|
return
|
}
|
}
|
if { [llength $args] >= 3 } {
|
if { [llength $args] >= 3 } {
|
scan-dump "tree" [lindex $args 0] "\[0-9\]\[0-9\]\[0-9\]t.[lindex $args 1]" [lindex $args 2]
|
scan-dump "tree" [lindex $args 0] "\[0-9\]\[0-9\]\[0-9\]t.[lindex $args 1]" [lindex $args 2]
|
} else {
|
} else {
|
scan-dump "tree" [lindex $args 0] "\[0-9\]\[0-9\]\[0-9\]t.[lindex $args 1]"
|
scan-dump "tree" [lindex $args 0] "\[0-9\]\[0-9\]\[0-9\]t.[lindex $args 1]"
|
}
|
}
|
}
|
}
|
|
|
# Call pass if pattern is present given number of times, otherwise fail.
|
# Call pass if pattern is present given number of times, otherwise fail.
|
# Argument 0 is the regexp to match
|
# Argument 0 is the regexp to match
|
# Argument 1 is number of times the regexp must be found
|
# Argument 1 is number of times the regexp must be found
|
# Argument 2 is the name of the dumped tree pass
|
# Argument 2 is the name of the dumped tree pass
|
# Argument 3 handles expected failures and the like
|
# Argument 3 handles expected failures and the like
|
proc scan-tree-dump-times { args } {
|
proc scan-tree-dump-times { args } {
|
|
|
if { [llength $args] < 3 } {
|
if { [llength $args] < 3 } {
|
error "scan-tree-dump: too few arguments"
|
error "scan-tree-dump: too few arguments"
|
return
|
return
|
}
|
}
|
if { [llength $args] > 4 } {
|
if { [llength $args] > 4 } {
|
error "scan-tree-dump: too many arguments"
|
error "scan-tree-dump: too many arguments"
|
return
|
return
|
}
|
}
|
if { [llength $args] >= 4 } {
|
if { [llength $args] >= 4 } {
|
scan-dump-times "tree" [lindex $args 0] [lindex $args 1] \
|
scan-dump-times "tree" [lindex $args 0] [lindex $args 1] \
|
"\[0-9\]\[0-9\]\[0-9\]t.[lindex $args 2]" [lindex $args 3]
|
"\[0-9\]\[0-9\]\[0-9\]t.[lindex $args 2]" [lindex $args 3]
|
} else {
|
} else {
|
scan-dump-times "tree" [lindex $args 0] [lindex $args 1] \
|
scan-dump-times "tree" [lindex $args 0] [lindex $args 1] \
|
"\[0-9\]\[0-9\]\[0-9\]t.[lindex $args 2]"
|
"\[0-9\]\[0-9\]\[0-9\]t.[lindex $args 2]"
|
}
|
}
|
}
|
}
|
|
|
# Call pass if pattern is not present, otherwise fail.
|
# Call pass if pattern is not present, otherwise fail.
|
#
|
#
|
# Argument 0 is the regexp to match
|
# Argument 0 is the regexp to match
|
# Argument 1 is the name of the dumped tree pass
|
# Argument 1 is the name of the dumped tree pass
|
# Argument 2 handles expected failures and the like
|
# Argument 2 handles expected failures and the like
|
proc scan-tree-dump-not { args } {
|
proc scan-tree-dump-not { args } {
|
|
|
if { [llength $args] < 2 } {
|
if { [llength $args] < 2 } {
|
error "scan-tree-dump-not: too few arguments"
|
error "scan-tree-dump-not: too few arguments"
|
return
|
return
|
}
|
}
|
if { [llength $args] > 3 } {
|
if { [llength $args] > 3 } {
|
error "scan-tree-dump-not: too many arguments"
|
error "scan-tree-dump-not: too many arguments"
|
return
|
return
|
}
|
}
|
if { [llength $args] >= 3 } {
|
if { [llength $args] >= 3 } {
|
scan-dump-not "tree" [lindex $args 0] \
|
scan-dump-not "tree" [lindex $args 0] \
|
"\[0-9\]\[0-9\]\[0-9\]t.[lindex $args 1]" [lindex $args 2]
|
"\[0-9\]\[0-9\]\[0-9\]t.[lindex $args 1]" [lindex $args 2]
|
} else {
|
} else {
|
scan-dump-not "tree" [lindex $args 0] \
|
scan-dump-not "tree" [lindex $args 0] \
|
"\[0-9\]\[0-9\]\[0-9\]t.[lindex $args 1]"
|
"\[0-9\]\[0-9\]\[0-9\]t.[lindex $args 1]"
|
}
|
}
|
}
|
}
|
|
|
# Utility for scanning demangled compiler result, invoked via dg-final.
|
# Utility for scanning demangled compiler result, invoked via dg-final.
|
# Call pass if pattern is present, otherwise fail.
|
# Call pass if pattern is present, otherwise fail.
|
#
|
#
|
# Argument 0 is the regexp to match
|
# Argument 0 is the regexp to match
|
# Argument 1 is the name of the dumped tree pass
|
# Argument 1 is the name of the dumped tree pass
|
# Argument 2 handles expected failures and the like
|
# Argument 2 handles expected failures and the like
|
proc scan-tree-dump-dem { args } {
|
proc scan-tree-dump-dem { args } {
|
|
|
if { [llength $args] < 2 } {
|
if { [llength $args] < 2 } {
|
error "scan-tree-dump-dem: too few arguments"
|
error "scan-tree-dump-dem: too few arguments"
|
return
|
return
|
}
|
}
|
if { [llength $args] > 3 } {
|
if { [llength $args] > 3 } {
|
error "scan-tree-dump-dem: too many arguments"
|
error "scan-tree-dump-dem: too many arguments"
|
return
|
return
|
}
|
}
|
if { [llength $args] >= 3 } {
|
if { [llength $args] >= 3 } {
|
scan-dump-dem "tree" [lindex $args 0] \
|
scan-dump-dem "tree" [lindex $args 0] \
|
"\[0-9\]\[0-9\]\[0-9\]t.[lindex $args 1]" [lindex $args 2]
|
"\[0-9\]\[0-9\]\[0-9\]t.[lindex $args 1]" [lindex $args 2]
|
} else {
|
} else {
|
scan-dump-dem "tree" [lindex $args 0] \
|
scan-dump-dem "tree" [lindex $args 0] \
|
"\[0-9\]\[0-9\]\[0-9\]t.[lindex $args 1]"
|
"\[0-9\]\[0-9\]\[0-9\]t.[lindex $args 1]"
|
}
|
}
|
}
|
}
|
|
|
# Call pass if demangled pattern is not present, otherwise fail.
|
# Call pass if demangled pattern is not present, otherwise fail.
|
#
|
#
|
# Argument 0 is the regexp to match
|
# Argument 0 is the regexp to match
|
# Argument 1 is the name of the dumped tree pass
|
# Argument 1 is the name of the dumped tree pass
|
# Argument 2 handles expected failures and the like
|
# Argument 2 handles expected failures and the like
|
proc scan-tree-dump-dem-not { args } {
|
proc scan-tree-dump-dem-not { args } {
|
|
|
if { [llength $args] < 2 } {
|
if { [llength $args] < 2 } {
|
error "scan-tree-dump-dem-not: too few arguments"
|
error "scan-tree-dump-dem-not: too few arguments"
|
return
|
return
|
}
|
}
|
if { [llength $args] > 3 } {
|
if { [llength $args] > 3 } {
|
error "scan-tree-dump-dem-not: too many arguments"
|
error "scan-tree-dump-dem-not: too many arguments"
|
return
|
return
|
}
|
}
|
if { [llength $args] >= 3 } {
|
if { [llength $args] >= 3 } {
|
scan-dump-dem-not "tree" [lindex $args 0] \
|
scan-dump-dem-not "tree" [lindex $args 0] \
|
"\[0-9\]\[0-9\]\[0-9\]t.[lindex $args 1]" \
|
"\[0-9\]\[0-9\]\[0-9\]t.[lindex $args 1]" \
|
[lindex $args 2]
|
[lindex $args 2]
|
} else {
|
} else {
|
scan-dump-dem-not "tree" [lindex $args 0] \
|
scan-dump-dem-not "tree" [lindex $args 0] \
|
"\[0-9\]\[0-9\]\[0-9\]t.[lindex $args 1]"
|
"\[0-9\]\[0-9\]\[0-9\]t.[lindex $args 1]"
|
}
|
}
|
}
|
}
|
|
|