Abstract: A game server generates a parallel-reality game that users may interact with in the real-world. The game server receives user information as users interact with game content. The game server includes a content marketplace that manages the exchange value of additional content items. The content marketplace matches additional game content with users playing the game based on the exchange value of the additional content items and user information. To do so, the content marketplace determines a propensity score for each additional content item quantifying a likelihood the user will interact with the additional content item while interacting with content in the parallel-reality game. The content marketplace provides the additional content item to the user's client device for display in the parallel-reality game based on the propensity score.

Abstract: Systems and methods for generating and storing metrics are described herein. In particular, a game server may receive game activity data from one or more client devices connected to the game server via a network. The game server sends the activity data to an anticheat server that uses one or more nodes to each calculate a portion of the activity data to generate one or more metrics. The metrics may indicate whether the data is indicative of cheating behavior within a parallel reality game. The nodes add their respective generated metrics to a relational database using prepared insert statements. The anticheat server may instruct the game server to take action with respect to one or more client devices if the metrics indicate that cheating behavior was exhibited within the data.

Abstract: A message router partially decodes messages to determine how to route the messages. The message router receives a message and identifies a field of the message as a candidate field for including an envelope identifier that indicates an envelope type of the message. The envelope type of the message indicates where information, such as where to route the message, is stored within the message. The message router attempts to decode the candidate field to determine whether the candidate field includes the envelope identifier, and responsive to the candidate filed including the envelope identifier, the message router determines the envelope type of the message. The message router routes the message according to the envelope type.

Abstract: Methods, systems, and apparatus, including computer program products are provided for indexing tags in source code. Implementations provide an enhanced retrieval of source code, in which a score for each of a plurality of files is derived based on a quantity of references to each file in source code of the remaining plurality of files. A query is received identifying a source code tag. Matching files of the plurality of files that satisfy the query are identified, a ranking of the matching files is generated based on the derived scores, and the ranking is provided.

Abstract: A system and method provides turn-by-turn directions including placemarks. Each placemark represents a geographically located object such as a business or landmark. A client device may transmit an initial and a final location. Upon receipt of the locations, a server may determine a route comprised of a plurality of route segments. For each route segment associated with one or more placemark, the server may conduct an auction to choose one of the placemarks. The server may receive a plurality of bids associated with a particular route segment. Each bid is associated with a particular placemark. The server selects the placemark by determining a highest bid or other auction criteria. The selected placemark is associated with the route segment and is used to generate a turn-by-turn direction for the route segment, where information associated with the placemark is displayed on a client device.

Abstract: Methods, systems, and apparatus, including computer program products are provided for indexing tags in source code. Implementations provide an enhanced retrieval of source code, in which a score for each of a plurality of files is derived based on a quantity of references to each file in source code of the remaining plurality of files. A query is received identifying a source code tag. Matching files of the plurality of files that satisfy the query are identified, a ranking of the matching files is generated based on the derived scores, and the ranking is provided.

Abstract: TAG files are generated on a client and communicated to a server. The TAGS files are indexed and loaded into memory on the server. Search requests are run against the index and files that contain tags that satisfy the search request are ranked. The ranking is based on an include-tree of the file that contains the tag, the relative directory distance of the file containing the tag from the current context, or by using the numbers of levels of inclusion needed to reach a tag that satisfies the query. In some implementations, an extensible protocol is used to communicate the search queries and files that contain tags that satisfy the search query.

Abstract: An object code expansion profiler equips a program for execution profiling by preprocessing the object code files of the program so as to add profiling monitoring code to the beginning of all or substantially all functions. The preprocessing includes, for each function, the steps of grouping the function's instructions into basic blocks, counting the number of cycles required to execute the instructions of the basic block, and inserting special monitoring code with the basic block. The special monitoring code is executed each time the basic block is executed, and updates the profiling information to reflect the number of cycles required to execute the basic block. Special handling is provided for profiling calls to the Operating System (OS). The resultant profiling information is converted into a call graph image most useful for human users.

Abstract: An object code expansion profiler equips a program for execution profiling by preprocessing the object code files of the program so as to add profiling monitoring code to the beginning of all or substantially all functions. The preprocessing includes, for each function, the steps of grouping the function's instructions into basic blocks, counting the number of cycles required to execute the instructions of the basic block, and inserting special monitoring code with the basic block. The special monitoring code is executed each time the basic block is executed, and updates the profiling information to reflect the number of cycles required to execute the basic block. Special handling is provided for profiling calls to the Operating System (OS). The resultant profiling information is converted into a call graph image most useful for human users.

Abstract: An object code expansion profiler equips a program for execution profiling by preprocessing the object code files of the program so as to add profiling monitoring code to the beginning of all or substantially all functions. The preprocessing includes, for each function, the steps of grouping the function's instructions into basic blocks, counting the number of cycles required to execute the instructions of the basic block, and inserting special monitoring code with the basic block. The special monitoring code is executed each time the basic block is executed, and updates the profiling information to reflect the number of cycles required to execute the basic block. Special handling is provided for profiling calls to the Operating System (OS). The resultant profiling information is converted into a call graph image most useful for human users.