A new iteration mechanism for the C++ programming language

Kim, Myung Ho

doi:10.1145/199818.199841

Cited by 2 publications

(2 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are difficulties with the cursor approach to iterators, not least the problems of nested iterations, when it is not easy to keep track of several cursors, and the problem of robust iterations, when elements may be added or removed during an iteration. There has been work reported to solve these problems: [10] proposes a CLU-like mechanism for Eiffel and [11] does the same for C ++ , while [13] is concerned with robust iterators in a C ++ class library.…”

Section: Object-oriented Languagesmentioning

confidence: 99%

An Iterator Construct for the Refinement Calculus

King

Morgan

2000

Electronic Workshops in Computing

View full text Add to dashboard Cite

This paper concerns the introduction of an iterator into the refinement calculus. The construct is based on concepts from functional programming, and the work gives an interesting example of cross-fertilisation between the functional and imperative programming worlds. Specifically, the iterator construct it..ti uses the idea of a catamorphism -the unique homomorphism from an initial algebra. The datatype for which the iterator is to be defined is considered as an initial algebra of an appropriate functor. The it..ti construct is formally defined as a recursive procedure, and it is shown that, if the value to be obtained by an iteration can be expressed as a catamorphism, then the it..ti construct provides a very natural implementation. Examples are given to show typical uses of the new construct.

show abstract

Section: Object-oriented Languagesmentioning

confidence: 99%

An Iterator Construct for the Refinement Calculus

King

Morgan

2000

Electronic Workshops in Computing

View full text Add to dashboard Cite

show abstract

“…Object-oriented Iterators. Iterators have a different meaning in the OOP community [7,27] where constructs such as C++ STL iterators are considered. Specifically, in C++ an iterator is any object that, pointing to some element in a range of elements (e.g.…”

Section: Introductionmentioning

confidence: 99%

Generalized profile-guided iterator recognition

Manilov

Vasiladiotis

Franke

2018

Proceedings of the 27th International Conference on Compiler Construction

View full text Add to dashboard Cite

Iterators prescribe the traversal of data structures and determine loop termination, and many loop analyses and transformations require their exact identification. While recognition of iterators is a straight-forward task for affine loops, the situation is different for loops iterating over dynamic data structures or involving control flow dependent computations to determine the next data element. In this paper we propose a compiler analysis for recognizing loop iterators code for a wide class of loops. We initially develop a static analysis, which is then enhanced with profiling information to support speculative code optimizations. We have prototyped our analysis in the LLVM framework and demonstrate its capabilities using the SPEC CPU2006 benchmarks. Our approach is applicable to all loops and we show that we can recognize iterators in, on average, 88.1% of over 75,000 loops using static analysis alone, and up to 94.9% using additional profiling information. Existing techniques perform substantially worse, especially for C and C++ applications, and cover only 35-44% of the loops. Our analysis enables advanced loop optimizations such as decoupled software pipelining, commutativity analysis and source code rejuvenation for real-world applications, which escape analysis and transformation if loop iterators are not recognized accurately.

show abstract

A new iteration mechanism for the C++ programming language

Cited by 2 publications

References 4 publications

An Iterator Construct for the Refinement Calculus

An Iterator Construct for the Refinement Calculus

Generalized profile-guided iterator recognition

Contact Info

Product

Resources

About