International Business Machines Corporation

Khoa D Nguyen

Robert John Urquhart

Larry K Loucks

Gary Michael Beauregard

Rex A McCaskill

Vivek Sarkar

Roy E Karnes, Jr

Farhad H Fatahalian

Larry A Halliday

A loop unrolling trasformation specified by loop unrolling factors UF[1], . . . , UF[k] is performed on a perfect nest of k multiple loops to produce an unrolled loop representation as follows. Moving from the outermost loop to the innermost loop of the nest, the unroll factor UF[j] of the current loop is examined. First, the separate unrolled loop body is expanded by the specified unroll factor UF[j]. Second, the loop header for the current loop is adjusted so that if the loop's iteration count, COUNT[j], is known to be less than or equal to the unroll factor, UP[j], then the loop header is simply an assignment of the index variable to the lower-bound expression; otherwise, the loop header is adjusted so that the unrolled loop's iteration count equals .left brkt-bot.COUNT[J]/UF[J].right brkt-bot. a rounded down truncation of the division. Third, a remainder loop nest is generated, if needed. The size of the generated code when unrolling multiple nested loops is substantially reduced. The proportion of the object code comprising lower execution frequency remainder loops is also substantially reduced. The compile-time of unrolled multiple nested loops is also substantially reduced.

Method and system for generating compact code for the loop unrolling

Two polygon fill algorithms are presented for filling polygons on a graphics display. The first polygon fill algorithm fills polygons that are strictly convex. The second polygon fill algorithm fills a larger class of polygons than the first polygon fill algorithm which includes polygons being concave in the x direction, and polygons having crossing lines. The first polygon fill algorithm tests the polygon for strict convexity by testing for a consistent turning direction, and by testing for once around in the y direction. The first polygon fill algorithm then stores the maximum and minimum value of the pel selected by the Bresenham algorithm for each scan line of the polygon. The fill line is drawn from the pel having the minimum value to the pel having the maximum value for each scan line of the polygon. The second polygon fill algorithm tests the polygon to ensure that it can be filled with one unique fill line for each scan line of the polygon. The second polygon fill algorithm stores both a minimum value and maximum value for each scan line of the polygon for each line of the polygon. A fill line is then drawn from the least minimum value to the greatest maximum value for each scan line of the polygon.

Computer program product for utilizing fast polygon fill routines in a

A data processing system gives an application running on the operating system direct access to the output display. The system is operable in two modes. In the first mode, if the application displays text to the output display, the output data must go through every layer of the processing system before it reaches the output display. In the second mode, the application can output data directly to the output display without going through the many layers of the processing system. In this second mode, a buffer is defined by the application. Input data from the input devices are stored in this buffer. The application accesses the buffer for direct output to the display.

System and method for controlling physical resources allocated to a

Two polygon fill algorithms are presented for filling polygons on a graphics display. The first polygon fill algorithm fills polygons that are strictly convex. The second polygon fill algorithm fills a larger class of polygons than the first polygon fill algorithm which includes polygons being concave in the x direction, and polygons having crossing lines. The first polygon fill algorithm tests the polygon for strict convexity by testing for a consistent turning direction, and by testing for once around in the y direction. The first polygon fill algorithm then stores the maximum and minimum value of the pel selected by the Bresenham algorithm for each scan line of the polygon. The fill line is drawn from the pel having the minimum value to the pel having the maximum value for each scan line of the polygon. The second polygon fill algorithm tests the polygon to ensure that it can be filled with one unique fill line for each scan line of the polygon. The second polygon fill algorithm stores both a minimum value and maximum value for each scan line line of the polygon for each line of the polygon. A fill line is then drawn from the least minimum value to the greatest maximum value for each scan line of the polygon.

System and method for utilizing fast polygon fill routines in a graphics

A word processing system is provided with printing means for printing on a character by character basis a data stream including merged graphic and alphanumeric data. The word processing system is provided with an interactive display for displaying by character generation a data stream representative of alphanumeric characters to be printed together with means for printing the characters on a document on a character by character basis. Operator interactive apparatus is provided whereby the operator can form a graphics data stream which is displayable on said display by character generation. This graphics data stream may then be integrated into the existing alphanumeric data stream, and the data in this integrated data stream may then be applied to the printing means whereby the alphanumeric characters and the graphic characters represented by this data stream are printed character by character to provide a document having the integrated alphanumeric and graphic information.

Growing community of inventors

Austin, TX, United States of America

Khoa D Nguyen