Andrew J Paroski

US Patent:

20130074052, Mar 21, 2013

Filed:

Jul 11, 2012

Appl. No.:

13/546893

Inventors:

Keith Adams - San Carlos CA, US
Andrew John Paroski - San Francisco CA, US
Jason Owen Evans - Palo Alto CA, US

International Classification:

G06F 9/45

US Classification:

717140

Abstract:

Scripts are incrementally compiled at runtime to generate executable code. The incremental compilation generates executable code corresponding to a basic block of the script. The executable code for a basic block of script is generated for a set of types of variables of the basic block resulting from execution of the script in response to a request. The generated executable code is stored and executed for subsequent requests if these requests result in the same types of variables for the basic block. The incremental compilation of the script is performed in a lazy fashion, such that executable code is not generated for combinations of types of variables of the script code that are not obtained from requests received at runtime. The script may dynamically generate portions of a web page that is returned in response to a request for execution of the script.

US Patent:

20180260196, Sep 13, 2018

Filed:

Mar 13, 2017

Appl. No.:

15/457688

Inventors:

- San Francisco CA, US
Andrew John PAROSKI - San Francisco CA, US
Eric Norman HANSON - Bellevue WA, US

International Classification:

G06F 9/45
G06F 9/44
G06F 17/30

Abstract:

A method includes receiving a user-defined extension configured to operate on data from a content database and comprising code expressed in a first programming language, the user-defined extension comprising at least one unresolved object and a function calling the at least one unresolved object. On a first pass through the user-defined extension code, each respective unresolved object is bound to a respective placeholder object such that the function calls each respective placeholder object and each respective placeholder object is mapped to the respective unresolved object, and delaying evaluation of the user-defined extension code until a second pass through the user-defined extension code. On the second pass, machine code corresponding to a compiled version of the user-defined extension is obtained by sequentially obtaining machine code for each respective unresolved object as each respective placeholder is called in the function. A related system and non-transitory computer-readable medium are also provided.

US Patent:

20150261553, Sep 17, 2015

Filed:

May 28, 2015

Appl. No.:

14/724329

Inventors:

- Menlo Park CA, US
Andrew John Paroski - San Francisco CA, US
Jason Owen Evans - Palo Alto CA, US

International Classification:

G06F 9/455
G06F 9/45

Abstract:

Scripts are incrementally compiled at runtime to generate executable code. The incremental compilation generates executable code corresponding to a basic block of the script. The executable code for a basic block of script is generated for a set of types of variables of the basic block resulting from execution of the script in response to a request. The generated executable code is stored and executed for subsequent requests if these requests result in the same types of variables for the basic block. The incremental compilation of the script is performed in a lazy fashion, such that executable code is not generated for combinations of types of variables of the script code that are not obtained from requests received at runtime. The script may dynamically generate portions of a web page that is returned in response to a request for execution of the script.

US Patent:

20140156708, Jun 5, 2014

Filed:

Nov 30, 2012

Appl. No.:

13/691622

Inventors:

- Menlo Park CA, US
Andrew John Paroski - San Francisco CA, US
Jason Owen Evans - Palo Alto CA, US

Assignee:

Facebook, Inc. - Menlo Park CA

International Classification:

G06F 17/30

US Classification:

707803

Abstract:

Disclosed are a method and system for implementing an array data type of a programming language using various data structures. The disclosed method includes a plurality of implementations in which the array data type may be implemented. The implementations provide an efficient way to retrieve elements from the array, especially in the order they are inserted into the array. The data structures also minimize the computing resources required to manage and access the array. The disclosed technique also selects one of the many implementations based on criteria such as access pattern or size of the array.

US Patent:

20140157291, Jun 5, 2014

Filed:

Nov 30, 2012

Appl. No.:

13/691664

Inventors:

- Menlo Park CA, US
Andrew John Paroski - San Francisco CA, US
Jason Owen Evans - Menlo Park CA, US

International Classification:

G06F 9/445

US Classification:

719331

Abstract:

Disclosed are a method and system for binding a program object in a source code to one of a number of implementations of the program object, using caching techniques. Binding a program object to a particular implementation includes performing the binding process at compile time and runtime of the source code. During compilation phase, the program objects in the source code are identified, and each of the program objects is assigned a slot in a target cache. The slot is configured to store a pointer that points to a particular implementation of a program object to which the slot is assigned. During execution phase, the particular implementation of the program object is determined based on execution flow of the source code. After the particular implementation is determined, the program object is bound to the particular implementation by updating the assigned target cache slot with a pointer pointing to the particular implementation.