diff options
author | Zachary Turner <zturner@google.com> | 2015-10-28 17:43:26 +0000 |
---|---|---|
committer | Zachary Turner <zturner@google.com> | 2015-10-28 17:43:26 +0000 |
commit | c432c8f856e0bd84de980a9d9bb2d31b06fa95b1 (patch) | |
tree | 4efa528e074a6e2df782345e4cd97f5d85d038c4 /lldb/packages/Python/lldbsuite/test/functionalities/recursion/main.cpp | |
parent | a8a3bd210086b50242903ed95048fe5e53897878 (diff) | |
download | bcm5719-llvm-c432c8f856e0bd84de980a9d9bb2d31b06fa95b1.tar.gz bcm5719-llvm-c432c8f856e0bd84de980a9d9bb2d31b06fa95b1.zip |
Move lldb/test to lldb/packages/Python/lldbsuite/test.
This is the conclusion of an effort to get LLDB's Python code
structured into a bona-fide Python package. This has a number
of benefits, but most notably the ability to more easily share
Python code between different but related pieces of LLDB's Python
infrastructure (for example, `scripts` can now share code with
`test`).
llvm-svn: 251532
Diffstat (limited to 'lldb/packages/Python/lldbsuite/test/functionalities/recursion/main.cpp')
-rw-r--r-- | lldb/packages/Python/lldbsuite/test/functionalities/recursion/main.cpp | 41 |
1 files changed, 41 insertions, 0 deletions
diff --git a/lldb/packages/Python/lldbsuite/test/functionalities/recursion/main.cpp b/lldb/packages/Python/lldbsuite/test/functionalities/recursion/main.cpp new file mode 100644 index 00000000000..f75a7f8698b --- /dev/null +++ b/lldb/packages/Python/lldbsuite/test/functionalities/recursion/main.cpp @@ -0,0 +1,41 @@ +//===-- main.cpp ------------------------------------------------*- C++ -*-===// +// +// The LLVM Compiler Infrastructure +// +// This file is distributed under the University of Illinois Open Source +// License. See LICENSE.TXT for details. +// +//===----------------------------------------------------------------------===// + +#include <stdio.h> +#include <stdlib.h> +#include <stdint.h> + +struct node; +struct node { + int value; + node* next; + node () : value(1),next(NULL) {} + node (int v) : value(v), next(NULL) {} +}; + +void make_tree(node* root, int count) +{ + int countdown=1; + if (!root) + return; + root->value = countdown; + while (count > 0) + { + root->next = new node(++countdown); + root = root->next; + count--; + } +} + +int main (int argc, const char * argv[]) +{ + node root(1); + make_tree(&root,25000); + return 0; // Set break point at this line. +} |