nixpkgs/pkgs/by-name/bu/bupc/package.nix
Silvan Mosberger 4f0dadbf38 treewide: format all inactive Nix files
After final improvements to the official formatter implementation,
this commit now performs the first treewide reformat of Nix files using it.
This is part of the implementation of RFC 166.

Only "inactive" files are reformatted, meaning only files that
aren't being touched by any PR with activity in the past 2 months.
This is to avoid conflicts for PRs that might soon be merged.
Later we can do a full treewide reformat to get the rest,
which should not cause as many conflicts.

A CI check has already been running for some time to ensure that new and
already-formatted files are formatted, so the files being reformatted here
should also stay formatted.

This commit was automatically created and can be verified using

    nix-build a08b3a4d19.tar.gz \
      --argstr baseRev b32a0943687d2a5094a6d92f25a4b6e16a76b5b7
    result/bin/apply-formatting $NIXPKGS_PATH
2024-12-10 20:26:33 +01:00

47 lines
1.4 KiB
Nix

{
lib,
stdenv,
fetchurl,
perl,
coreutils,
}:
stdenv.mkDerivation rec {
pname = "berkeley_upc";
version = "2020.12.0";
src = fetchurl {
url = "http://upc.lbl.gov/download/release/berkeley_upc-${version}.tar.gz";
hash = "sha256-JdpFORlXHpCQE+TivoQQnjQlxQN7C8BNfHvTOSwXbYQ=";
};
postPatch = ''
patchShebangs .
'';
# Used during the configure phase
ENVCMD = "${coreutils}/bin/env";
buildInputs = [ perl ];
meta = with lib; {
description = "Compiler for the Berkely Unified Parallel C language";
longDescription = ''
Unified Parallel C (UPC) is an extension of the C programming language
designed for high performance computing on large-scale parallel
machines.The language provides a uniform programming model for both
shared and distributed memory hardware. The programmer is presented with
a single shared, partitioned address space, where variables may be
directly read and written by any processor, but each variable is
physically associated with a single processor. UPC uses a Single Program
Multiple Data (SPMD) model of computation in which the amount of
parallelism is fixed at program startup time, typically with a single
thread of execution per processor.
'';
homepage = "https://upc.lbl.gov/";
license = licenses.mit;
platforms = platforms.linux;
maintainers = with maintainers; [ zimbatm ];
};
}