aprell

#!/bin/bash
# Script to install/update RCCE

usage="rcceinstall [ emulator | SCC_LINUX | SCC_BAREMETAL ]"

RCCE_src_root=$HOME/RCCE_src
RCCE_root=$HOME/RCCE
RCCE_repo=http://marcbug.scc-dc.com/svn/repository/trunk/rcce
#RCCE_repo=http://marcbug.scc-dc.com/svn/repository/tags/RCCE_v1.1.0/

aprell

#!/bin/bash

usage="Usage: findstring <string> [directory]"

if [ $# -lt 1 ] || [ $# -gt 2 ]; then
	echo $usage
	exit 0
fi

if [ $# -eq 1 ]; then

aprell

#include <stdio.h>
#include <stdlib.h>

// Found in the slow clone of Cilk procedures
// An application of Duff's device to jump directly into the middle of code
// See Cilk 5.4.6 Reference Manual
// 
// The same technique can be used to implement stack-based coroutines 
// See Simon Tatham's Coroutines in C

aprell

CC = gcc
CPPFLAGS += -D_GNU_SOURCE 
CFLAGS += -O0 -g -Wall -Wextra

SRCS = driver.c module.c
OBJS = $(SRCS:.c=.o)

all: utest

utest: $(OBJS) 

aprell

#include <stdio.h>
#include <stdlib.h>

#define N 10

static int A[N];

static unsigned int seed;

static void swap(int *a, int *b)

aprell

#include <stdio.h>
#include <stdlib.h>
#include <mpi.h>

#define WORKER(id) if (ID == (id))
#define MASTER WORKER(0)

int main(int argc, char *argv[])
{
	int numprocs, ID;

aprell

#include <stdio.h>
#include <stdlib.h>
#include <mpi.h>

#define WORKER(id) if (ID == (id))
#define MASTER WORKER(0)

int main(int argc, char *argv[])
{
	int numprocs, ID;

aprell

#include <stdio.h>
#include <stdlib.h>
#include <mpi.h>

#define WORKER(id) if (ID == (id))
#define MASTER WORKER(0)

int main(int argc, char *argv[])
{
	int numprocs, ID;

aprell

#include <stdio.h>
#include <stdlib.h>
#include <mpi.h>

#define WORKER(id) if (ID == (id))
#define MASTER WORKER(0)

int main(int argc, char *argv[])
{
	int numprocs, ID;

aprell

#include <stdio.h>
#include <stdlib.h>
#include <mpi.h>

#define WORKER(id) if (ID == (id))
#define MASTER WORKER(0)

int main(int argc, char *argv[])
{
	int numprocs, ID;