Apple Inc.

Other

Christopher Arthur Lattner

Victor Leonel Hernandez Porras

Roger Scott Hoover

Thomas John O'Brien

Eric Marshall Christopher

Maxwell Oliver Drukman

Donald Matthew Firlik

Kenneth S Orr

Behzad Aghaei

Robert John McCall

Timothy V Isted

Pratik Solanki

Jia-Hong Chen

Francois M Jouaux

Andreas W Wendker

Michael S Ferris

Matthew M Patenaude

Sonny Falk

Samuel C Page

Joe Groff

William A Dudney, Jr

Douglas Paul Gregor

Augustin J Farrugia

Julien Lerouge

William M Bumgarner

Pierre Betouin

Ginger Marie Myles

Tanya Michelle Lattner

Gerald Blaine Garst, Jr

Fariborz Jahanian

Ted Kremenek, Jr

John McCall

Michael Alan Kahl

Theodore Merrell Kremenek

In an example method, a user interface is presented by a device on a touch sensitive surface of the device. The device presents a keyboard image on a touch sensitive surface of the device. The device then receives a first touch input selecting a key of the keyboard image and responsive to receiving the first touch input, displays a primary character associated with the selected key. While maintenance of physical contact is detected by the touch sensitive surface, the device receives a touch gesture starting at the key of the keyboard image and continuing in a diagonal direction along a face of the key. Responsive to receiving the touch gesture, the device displays an alternative character associated with the selected key.

Touch-based interactive learning environment

In an example method, a user interface is presented by a device on a touch sensitive surface of the device. The user interface includes a first portion for displaying a sequence of code and a second portion for displaying suggested bracketed functions. The device receives a first touch gesture dragging a suggested bracketed function from the second portion to the first portion of the user interface. Responsive to receiving the first touch gesture, the suggested bracketed function is inserted into the sequence of code. The bracketed function encloses at least a portion of the sequence of code. The device receives a second touch gesture dragging an end bracket associated with the inserted bracketed function. Responsive to receiving the second touch gesture, the sequence of code is modified such that the bracketed function encloses an additional portion of the sequence of code.

In an example method, a user interface is presented by a device on a touch sensitive surface of the device. The device receives a first touch input selecting a numeral presented in the user interface. Responsive to receiving the first touch input, a numeric keypad interface and a display element are presented. The device receives a second touch input selecting the display element. Responsive to receiving the second touch input, a rotary interface including the display element is presented. While the user is maintaining physical contact with the touch sensitive surface, the device receives a rotational touch gesture dragging the display element about the rotary interface. Responsive to receiving the rotational touch gesture, the numeral is modified.

In one embodiment, an improved programming system and language for application development is provided that combines elements of the C and Objective-C languages without the constraints imposed by a requirement to maintain compatibility with the C language. The language provides the functionality of the C language compatibility in certain areas to improve the inherent safety of software written in the language. The new language includes default safety considerations such as bounds and overflow checking.

Programming system and language for application development

Observation and analysis based optimization of software code is disclosed. An expected value is chosen for a dynamic attribute that cannot be determined, prior to execution of the associated software code, to be guaranteed to have that expected value at runtime. An optimized version of the software code is generated, including one or more optimizations based on an assumption that the dynamic attribute will have the expected value. Non-exhaustive examples of a dynamic attribute include a variable type; a location in memory; a location in which a global object, property, or variable is stored; the contents of a global function or method; and a value of a global property or variable. A check is performed during execution of the optimized version of the software code, prior to executing the portion that has been optimized based on the assumption, to verify that the dynamic attribute has the expected value. In the event that it is determined at runtime that the dynamic attribute does not have the expected value, execution reverts to backup code that is not based on the assumption that dynamic attribute will have the expected value.

Observation and analysis based code optimization

Techniques for processing source code written in a traditionally interpreted language such as JavaScript, or another dynamic and/or interpreted language, are disclosed. In one example, compiled code associated with the source code is constructed and executed. An assumption on which a specific aspect of the compiled code is based (e.g., an optimization) is tested at a checkpoint of the compiled code. A roll over to fallback code is performed if the test indicates the assumption is not true.

Assumption-based compilation

Delayed insertion of safepoint related code is disclosed. Optimization processing is performed with respect to an intermediate representation of a source code. The optimized intermediate representation is analyzed programmatically to identify a safepoint and insert safepoint related code associated with the safepoint. In some embodiments, analyzing the optimized intermediate representation programmatically comprises determining where to place the safepoint within a program structure of the source code as reflected in the intermediate representation.

Delayed insertion of safepoint-related code

Deferred constant pool generation is disclosed. Optimization processing is performed with respect to an intermediate representation of a source code. The optimized intermediate representation is used to generate a constant pool. In some embodiments, the source code comprises JavaScript, which is used to generate a low level virtual machine (LLVM) or other intermediate representation (IR), which intermediate representation is optimized prior to a constant pool being generated.

Deferred constant pool generation

A device-independent intermediate representation of a source code is generated and stored, e.g., in a memory or other storage mechanism. The stored intermediate representation of the source code is used to generate a device-specific machine code corresponding to the source code. The stored intermediate representation may be updated, e.g., periodically, for example by obtaining an updated version of the source code and compiling the updated source code to generate an updated intermediate representation. The stored intermediate representation may be based on source code received from a device that is synchronized with which a compiling device that generates the device-specific machine code. In some cases, the stored intermediate representation may be used to generate for each of a plurality of devices a corresponding device-specific machine code.

Converting JavaScript into a device-independent representation

Disclosed herein are systems, methods, and computer-readable storage media for obfuscating by a common function. A system configured to practice the method identifies a set of functions in source code, generates a transformed set of functions by transforming each function of the set of functions to accept a uniform set of arguments and return a uniform type, and merges the transformed set of functions into a single recursive function. The single recursive function can allocate memory in the heap. The stack can contain a pointer to the allocated memory in the heap. The single recursive function can include instructions for creating and explicitly managing a virtual stack in the heap. The virtual stack can emulate what would happen to the real stack if one of the set of functions was called. The system can further compile the source code including the single recursive function.

System and method for obfuscation by common function and common function prototype

Techniques for processing computer code are disclosed. In one example, an indication that a computer code is to begin execution at a portion of code other than a starting portion of the code is received, and a runtime state associated with the portion of the code at which execution is to begin is constructed. In some examples, execution of the portion of code is initiated. In some examples, a program counter associated with the portion of the code is used to initiate execution of the code. In some examples, the computer code comprises a fallback code associated with a previously executing code.

Constructing runtime state for inlined code

Methods, software media, compilers and programming techniques are described for creating copyable stack-based closures, such as a block, for languages which allocate automatic or local variables on a stack memory structure. In one exemplary method, a data structure of the block is first written to the stack memory structure, and this may be the automatic default operation, at run-time, for the block; then, a block copy instruction, added explicitly (in one embodiment) by a programmer during creation of the block, is executed to copy the block to a heap memory structure. The block includes a function pointer that references a function which uses data in the block.

Growing community of inventors

San Jose, CA, United States of America

Christopher Arthur Lattner