aboutsummaryrefslogtreecommitdiff
path: root/gdb/testsuite/gdb.ada/complete.exp
diff options
context:
space:
mode:
Diffstat (limited to 'gdb/testsuite/gdb.ada/complete.exp')
-rw-r--r--gdb/testsuite/gdb.ada/complete.exp21
1 files changed, 21 insertions, 0 deletions
diff --git a/gdb/testsuite/gdb.ada/complete.exp b/gdb/testsuite/gdb.ada/complete.exp
index 9b64d15..c1f22c2 100644
--- a/gdb/testsuite/gdb.ada/complete.exp
+++ b/gdb/testsuite/gdb.ada/complete.exp
@@ -204,3 +204,24 @@ test_gdb_complete "ambiguous_f" \
"p ambiguous_func"
test_gdb_complete "ambiguous_func" \
"p ambiguous_func"
+
+# Perform a test intented to verify the behavior where the number
+# of possible completions is very large. The goal is not to verify
+# precisely the list returned by the complete command (this depends
+# on too many parameters -- targets, compiler version, runtime, etc).
+# However, we want to sanity-check each one of them, knowing that
+# each result should start with "break ada" and that the proposed
+# completion should look like a valid symbol name (in particular,
+# no uppercase letters...).
+
+gdb_test_no_output "set max-completions unlimited"
+
+set test "complete break ada"
+gdb_test_multiple "$test" $test {
+ -re "^$test$eol\(break ada(\[a-z0-9._\])*$eol\)+$gdb_prompt $" {
+ pass $test
+ }
+ -re "\[A-Z\].*$gdb_prompt $" {
+ kfail gdb/22670 $test
+ }
+}