Abstract: A linker is described and the method of forming an executable program from object code modules using the linker. The linker uses a linker control language in the form of an ordered sequence of relaxation instructions. The relaxation instructions include a jump relaxation instruction which specifies the instruction count of the relaxation instruction which is subsequently read. In this way, more flexibility can be provided for linkers.

Abstract: An implantable prosthesis for repairing or augmenting anatomical defects, including an inguinal hernia. The prosthesis includes a repair fabric having a body portion and a support member that may be arranged in or on the repair fabric to help deploy the repair fabric at the surgical site and/or help inhibit folding or buckling of the repair fabric. The support member may substantially surround the body portion to help deploy and/or hold the body portion in a spread out configuration for covering the defect. The support member may include first and second ends that are spaced apart to form an interruption so that a slit or keyhole arrangement may be formed in the repair fabric through the interruption and into an interior region of the body portion to receive a body structure, including a cord structure such as the spermatic cord.

Abstract: This patent describes a method of compiling a computer program from a sequence of computer instructions including a plurality of first, set branch, instructions which each identify a target address for a branch and a plurality of associated second, effect branch instructions which each implement a branch to a target address. The method comprising the steps of: reading the computer instructions in blocks; allocating each set branch instruction to an initial node in a dominator tree, the initial node being the node which contains the corresponding effect branch instruction; for the first determining the effect of migrating set branch instructions to each of a set of ancestor nodes in the dominator tree based on a performance cost parameter and selecting an ancestor node with the best performance cost parameter; locating said set branch instruction at the selected ancestor node.

Abstract: A compound of formula (I): wherein: Ring A is a nitrogen linked mono or bicyclic heterocyclic ring as defined within; R1 and R2 are independently C1-3alkyl optionally substituted by fluoro or chloro; or R1 and R2 together with the carbon atom to which they are attached, form a C3-5cycloalkyl ring optionally substituted by fluoro; R3 is defined within; and n is 0-5; wherein the values of R3 may be the same or different; or a pharmaceutically acceptable salt or an in vivo hydrolysable ester thereof is described. The use of compounds of formula (I) in the production of an elevation of PDH activity in a warm-blooded animal such as a human being are also described. Pharmaceutical compositions, methods and processes for preparation of compounds of formula (I) are detailed.

Abstract: This patent describes a method of compiling a computer program from a sequence of computer instructions including a plurality of first, set branch, instructions which each identify a target address for a branch and a plurality of associated second, effect branch instructions which each implement a branch to a target address. The method comprising the steps of; reading the computer instructions in blocks; defining a set of target registers associated with each block for holding target addresses for the set branch instructions in that block; defining as a live range of blocks a set of blocks for which a target address of a particular set branch instruction is in a live state; and using the set of target registers and the live range to ensure that target registers holding target addresses in a live state are not available for other uses.

Abstract: This patent describes a method of compiling a computer program from a sequence of computer instructions including a plurality of first, set branch, instructions which each identify a target address for a branch and a plurality of associated second, effect branch instructions which each implement a branch to a target address. The method comprising the steps of: reading the computer instructions in blocks; allocating each set branch instruction to an initial node in a dominator tree, the initial node being the node which contains the corresponding effect branch instruction; for the first determining the effect of migrating set branch instructions to each of a set of ancestor nodes in the dominator tree based on a performance cost parameter and selecting an ancestor node with the best performance cost parameter; locating said set branch instruction at the selected ancestor node.