Commit 6db5ecea authored by Matthieu Schaller's avatar Matthieu Schaller
Browse files

Merge branch 'spellings' into 'master'

Fix up many and varied spelling issues, the main one being "Coypright".

Ran the comments and strings through a spelling check and came up with
all these.

See merge request !54
parents 69638826 94675457
/*******************************************************************************
* This file is part of SWIFT.
* Coypright (c) 2012 Pedro Gonnet (pedro.gonnet@durham.ac.uk)
* Copyright (c) 2012 Pedro Gonnet (pedro.gonnet@durham.ac.uk)
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published
......
/*******************************************************************************
* This file is part of SWIFT.
* Coypright (c) 2012 Pedro Gonnet (pedro.gonnet@durham.ac.uk)
* Copyright (c) 2012 Pedro Gonnet (pedro.gonnet@durham.ac.uk)
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published
......
/*******************************************************************************
* This file is part of SWIFT.
* Coypright (c) 2012 Pedro Gonnet (pedro.gonnet@durham.ac.uk)
* Copyright (c) 2012 Pedro Gonnet (pedro.gonnet@durham.ac.uk)
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published
......@@ -536,7 +536,7 @@ void runner_doghost(struct runner *r, struct cell *c) {
/* Get a direct pointer on the part. */
p = &parts[pid[i]];
/* Is this part within the timestep? */
/* Is this part within the time step? */
if (p->dt <= dt_step) {
/* Some smoothing length multiples. */
......@@ -620,7 +620,7 @@ void runner_doghost(struct runner *r, struct cell *c) {
alpha_dot = (const_viscosity_alpha_min - p->alpha) / tau +
(const_viscosity_alpha_max - p->alpha) * S;
/* Update particle's viscosity paramter */
/* Update particle's viscosity parameter */
p->alpha += alpha_dot * p->dt;
#endif
......@@ -932,7 +932,7 @@ void runner_dokick1(struct runner *r, struct cell *c) {
}
/* Otherwise, agregate data from children. */
/* Otherwise, aggregate data from children. */
else {
/* Init with the first non-null child. */
......@@ -1045,7 +1045,7 @@ void runner_dokick(struct runner *r, struct cell *c, int timer) {
xp->v_hdt[2] = (v_hdt[2] += dt * a[2]);
xp->u_hdt = (u_hdt += dt * u_dt);
/* Move the particles with the velocitie at the half-step. */
/* Move the particles with the velocity at the half-step. */
p->x[0] = x[0] += dt * v_hdt[0];
p->x[1] = x[1] += dt * v_hdt[1];
p->x[2] = x[2] += dt * v_hdt[2];
......@@ -1103,7 +1103,7 @@ void runner_dokick(struct runner *r, struct cell *c, int timer) {
}
/* Otherwise, agregate data from children. */
/* Otherwise, aggregate data from children. */
else {
/* Init with the first non-null child. */
......
/*******************************************************************************
* This file is part of SWIFT.
* Coypright (c) 2012 Pedro Gonnet (pedro.gonnet@durham.ac.uk)
* Copyright (c) 2012 Pedro Gonnet (pedro.gonnet@durham.ac.uk)
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published
......
/*******************************************************************************
* This file is part of SWIFT.
* Coypright (c) 2012 Pedro Gonnet (pedro.gonnet@durham.ac.uk)
* Copyright (c) 2012 Pedro Gonnet (pedro.gonnet@durham.ac.uk)
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published
......@@ -1299,7 +1299,7 @@ void DOPAIR2(struct runner *r, struct cell *ci, struct cell *cj) {
} else {
/* Add this interaction to the non-summetric queue. */
/* Add this interaction to the non-symmetric queue. */
r2q1[icount1] = r2;
dxq1[3 * icount1 + 0] = dx[0];
dxq1[3 * icount1 + 1] = dx[1];
......@@ -1818,7 +1818,7 @@ void DOSUB1(struct runner *r, struct cell *ci, struct cell *cj, int sid,
}
/* Otherwsie, compute self-interaction. */
/* Otherwise, compute self-interaction. */
else
DOSELF1(r, ci);
......@@ -2093,7 +2093,7 @@ void DOSUB2(struct runner *r, struct cell *ci, struct cell *cj, int sid,
}
/* Otherwsie, compute self-interaction. */
/* Otherwise, compute self-interaction. */
else
DOSELF2(r, ci);
......@@ -2382,7 +2382,7 @@ void DOSUB_SUBSET(struct runner *r, struct cell *ci, struct part *parts,
}
/* Otherwsie, compute self-interaction. */
/* Otherwise, compute self-interaction. */
else
DOSELF_SUBSET(r, ci, parts, ind, count);
......
/*******************************************************************************
* This file is part of SWIFT.
* Coypright (c) 2013 Pedro Gonnet (pedro.gonnet@durham.ac.uk)
* Copyright (c) 2013 Pedro Gonnet (pedro.gonnet@durham.ac.uk)
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published
......@@ -241,7 +241,7 @@ void runner_dograv_up(struct runner *r, struct cell *c) {
/**
* @brief Compute the recursive downward sweep, i.e. apply the multipole
* accelleration on all the particles.
* acceleration on all the particles.
*
* @param r The #runner.
* @param c The top-level #cell.
......@@ -254,7 +254,7 @@ void runner_dograv_down(struct runner *r, struct cell *c) {
/* Split? */
if (c->split) {
/* Apply this cell's accelleration on the multipoles below. */
/* Apply this cell's acceleration on the multipoles below. */
for (int k = 0; k < 8; k++)
if (c->progeny[k] != NULL) {
struct multipole *mp = &c->progeny[k]->multipole;
......@@ -272,7 +272,7 @@ void runner_dograv_down(struct runner *r, struct cell *c) {
/* No, leaf node. */
else {
/* Apply the multipole accelleration to all gparts. */
/* Apply the multipole acceleration to all gparts. */
for (int k = 0; k < c->gcount; k++) {
struct gpart *p = &c->gparts[k];
p->a[0] += m->a[0];
......@@ -590,7 +590,7 @@ void runner_dosub_grav(struct runner *r, struct cell *ci, struct cell *cj,
theta = (dx[0] * dx[0] + dx[1] * dx[1] + dx[2] * dx[2]) /
(ci->h[0] * ci->h[0] + ci->h[1] * ci->h[1] + ci->h[2] * ci->h[2]);
/* Split the interacton? */
/* Split the interaction? */
if (theta < const_theta_max * const_theta_max) {
/* Are both ci and cj split? */
......
/*******************************************************************************
* This file is part of SWIFT.
* Coypright (c) 2012 Pedro Gonnet (pedro.gonnet@durham.ac.uk)
* Copyright (c) 2012 Pedro Gonnet (pedro.gonnet@durham.ac.uk)
* Matthieu Schaller (matthieu.schaller@durham.ac.uk)
*
* This program is free software: you can redistribute it and/or modify
......@@ -421,7 +421,7 @@ __attribute__((always_inline)) INLINE static void runner_iact_force(
/* Apply balsara switch */
Pi_ij *= (pi->force.balsara + pj->force.balsara);
/* Termal conductivity */
/* Thermal conductivity */
v_sig_u = sqrtf(2.f * (const_hydro_gamma - 1.f) *
fabs(rhoi * pi->u - rhoj * pj->u) / (rhoi + rhoj));
tc = const_conductivity_alpha * v_sig_u / (rhoi + rhoj);
......@@ -622,7 +622,7 @@ __attribute__((always_inline)) INLINE static void runner_iact_vec_force(
Pi_ij.v = balsara.v * alpha_ij.v * v_sig.v * omega_ij.v / (pirho.v + pjrho.v);
Pi_ij.v *= (wi_dr.v + wj_dr.v);
/* Termal conductivity */
/* Thermal conductivity */
v_sig_u.v = vec_sqrt(vec_set1(2.f * (const_hydro_gamma - 1.f)) *
vec_fabs(pirho.v * piu.v - pjrho.v * pju.v) /
(pirho.v + pjrho.v));
......@@ -737,7 +737,7 @@ __attribute__((always_inline)) INLINE static void runner_iact_nonsym_force(
/* Apply balsara switch */
Pi_ij *= (pi->force.balsara + pj->force.balsara);
/* Termal conductivity */
/* Thermal conductivity */
v_sig_u = sqrtf(2.f * (const_hydro_gamma - 1.f) *
fabs(rhoi * pi->u - rhoj * pj->u) / (rhoi + rhoj));
tc = const_conductivity_alpha * v_sig_u / (rhoi + rhoj);
......@@ -929,7 +929,7 @@ __attribute__((always_inline)) INLINE static void runner_iact_nonsym_vec_force(
Pi_ij.v = balsara.v * alpha_ij.v * v_sig.v * omega_ij.v / (pirho.v + pjrho.v);
Pi_ij.v *= (wi_dr.v + wj_dr.v);
/* Termal conductivity */
/* Thermal conductivity */
v_sig_u.v = vec_sqrt(vec_set1(2.f * (const_hydro_gamma - 1.f)) *
vec_fabs(pirho.v * piu.v - pjrho.v * pju.v) /
(pirho.v + pjrho.v));
......
/*******************************************************************************
* This file is part of SWIFT.
* Coypright (c) 2013 Pedro Gonnet (pedro.gonnet@durham.ac.uk)
* Copyright (c) 2013 Pedro Gonnet (pedro.gonnet@durham.ac.uk)
* Matthieu Schaller (matthieu.schaller@durham.ac.uk)
*
* This program is free software: you can redistribute it and/or modify
......@@ -53,7 +53,7 @@ __attribute__((always_inline)) INLINE static void runner_iact_grav(
/* Scale the acceleration. */
acc *= const_G * ir * ir * ir;
/* Aggregate the accellerations. */
/* Aggregate the accelerations. */
for (k = 0; k < 3; k++) {
w = acc * dx[k];
pi->a[k] -= w * mj;
......@@ -101,7 +101,7 @@ __attribute__((always_inline)) INLINE static void runner_iact_vec_grav(
/* Scale the acceleration. */
acc.v *= vec_set1(const_G) * ir.v * ir.v * ir.v;
/* Aggregate the accellerations. */
/* Aggregate the accelerations. */
for (k = 0; k < 3; k++) {
w.v = acc.v * dx[k].v;
ai.v = w.v * mj.v;
......
/*******************************************************************************
* This file is part of SWIFT.
* Coypright (c) 2012 Pedro Gonnet (pedro.gonnet@durham.ac.uk)
* Copyright (c) 2012 Pedro Gonnet (pedro.gonnet@durham.ac.uk)
* Matthieu Schaller (matthieu.schaller@durham.ac.uk)
*
* This program is free software: you can redistribute it and/or modify
......
/*******************************************************************************
* This file is part of SWIFT.
* Coypright (c) 2012 Pedro Gonnet (pedro.gonnet@durham.ac.uk)
* Copyright (c) 2012 Pedro Gonnet (pedro.gonnet@durham.ac.uk)
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published
......@@ -173,7 +173,7 @@ void scheduler_splittasks(struct scheduler *s) {
/* Take a step back (we're going to recycle the current task)... */
redo = 1;
/* Add the self taks. */
/* Add the self task. */
for (k = 0; ci->progeny[k] == NULL; k++)
;
t->ci = ci->progeny[k];
......@@ -595,7 +595,7 @@ void scheduler_splittasks(struct scheduler *s) {
/* Ignore this task if the cell has no gparts. */
if (ci->gcount == 0 || cj->gcount == 0) t->type = task_type_none;
/* Split the interacton? */
/* Split the interaction? */
else if (theta < const_theta_max * const_theta_max) {
/* Are both ci and cj split? */
......@@ -703,7 +703,7 @@ void scheduler_ranktasks(struct scheduler *s) {
struct task *t, *tasks = s->tasks;
int *tid = s->tasks_ind, nr_tasks = s->nr_tasks;
/* Run throught the tasks and get all the waits right. */
/* Run through the tasks and get all the waits right. */
for (i = 0, k = 0; k < nr_tasks; k++) {
tid[k] = k;
for (j = 0; j < tasks[k].nr_unlock_tasks; j++)
......@@ -761,7 +761,7 @@ void scheduler_reset(struct scheduler *s, int size) {
/* Do we need to re-allocate? */
if (size > s->size) {
/* Free exising task lists if necessary. */
/* Free existing task lists if necessary. */
if (s->tasks != NULL) free(s->tasks);
if (s->tasks_ind != NULL) free(s->tasks_ind);
......@@ -800,7 +800,7 @@ void scheduler_reweight(struct scheduler *s) {
float wscale = 0.001;
// ticks tic;
/* Run throught the tasks backwards and set their waits and
/* Run through the tasks backwards and set their waits and
weights. */
// tic = getticks();
for (k = nr_tasks - 1; k >= 0; k--) {
......@@ -884,7 +884,7 @@ void scheduler_start(struct scheduler *s, unsigned int mask) {
struct task *t, *tasks = s->tasks;
// ticks tic;
/* Run throught the tasks and set their waits. */
/* Run through the tasks and set their waits. */
// tic = getticks();
for (k = nr_tasks - 1; k >= 0; k--) {
t = &tasks[tid[k]];
......@@ -971,7 +971,7 @@ void scheduler_enqueue(struct scheduler *s, struct task *t) {
MPI_Error_string(err, buff, &len);
error("Failed to emit irecv for particle data (%s).", buff);
}
// message( "recieving %i parts with tag=%i from %i to %i." ,
// message( "receiving %i parts with tag=%i from %i to %i." ,
// t->ci->count , t->flags , t->ci->nodeID , s->nodeID );
// fflush(stdout);
qid = 1 % s->nr_queues;
......@@ -1110,7 +1110,7 @@ struct task *scheduler_unlock(struct scheduler *s, struct task *t) {
* @brief Get a task, preferably from the given queue.
*
* @param s The #scheduler.
* @param qid The ID of the prefered #queue.
* @param qid The ID of the preferred #queue.
* @param super the super-cell
*
* @return A pointer to a #task or @c NULL if there are no available tasks.
......@@ -1141,7 +1141,7 @@ struct task *scheduler_gettask(struct scheduler *s, int qid,
if (res != NULL) break;
}
/* If unsucessful, try stealing from the other queues. */
/* If unsuccessful, try stealing from the other queues. */
if (s->flags & scheduler_flag_steal) {
int count = 0, qids[nr_queues];
for (k = 0; k < nr_queues; k++)
......
/*******************************************************************************
* This file is part of SWIFT.
* Coypright (c) 2013 Pedro Gonnet (pedro.gonnet@durham.ac.uk)
* Copyright (c) 2013 Pedro Gonnet (pedro.gonnet@durham.ac.uk)
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published
......
/*******************************************************************************
* This file is part of SWIFT.
* Coypright (c) 2012 Pedro Gonnet (pedro.gonnet@durham.ac.uk),
* Copyright (c) 2012 Pedro Gonnet (pedro.gonnet@durham.ac.uk),
* Matthieu Schaller (matthieu.schaller@durham.ac.uk).
*
* This program is free software: you can redistribute it and/or modify
......@@ -55,14 +55,14 @@
* @param type The #DATA_TYPE of the attribute.
* @param N The number of particles.
* @param dim The dimension of the data (1 for scalar, 3 for vector)
* @param part_c A (char*) pointer on the first occurence of the field of
* @param part_c A (char*) pointer on the first occurrence of the field of
*interest in the parts array
* @param importance If COMPULSORY, the data must be present in the IC file. If
*OPTIONAL, the array will be zeroed when the data is not present.
*
* @todo A better version using HDF5 hyperslabs to read the file directly into
* @todo A better version using HDF5 hyper-slabs to read the file directly into
*the part array
* will be written once the strucutres have been stabilized.
* will be written once the structures have been stabilized.
*
* Calls #error() if an error occurs.
*/
......@@ -111,7 +111,7 @@ void readArrayBackEnd(hid_t grp, char* name, enum DATA_TYPE type, int N,
temp = malloc(N * dim * typeSize);
if (temp == NULL) error("Unable to allocate memory for temporary buffer");
/* Prepare information for hyperslab */
/* Prepare information for hyper-slab */
if (dim > 1) {
rank = 2;
shape[0] = N;
......@@ -129,7 +129,7 @@ void readArrayBackEnd(hid_t grp, char* name, enum DATA_TYPE type, int N,
/* Create data space in memory */
h_memspace = H5Screate_simple(rank, shape, NULL);
/* Select hyperslab in file */
/* Select hyper-slab in file */
h_filespace = H5Dget_space(h_data);
H5Sselect_hyperslab(h_filespace, H5S_SELECT_SET, offsets, NULL, shape, NULL);
......@@ -203,7 +203,7 @@ void readArrayBackEnd(hid_t grp, char* name, enum DATA_TYPE type, int N,
* in the file.
*
* @warning Can not read snapshot distributed over more than 1 file !!!
* @todo Read snaphsots distributed in more than one file.
* @todo Read snapshots distributed in more than one file.
*
* Calls #error() if an error occurs.
*
......@@ -228,7 +228,7 @@ void read_ic_serial(char* fileName, double dim[3], struct part** parts, int* N,
/* message("Opening file '%s' as IC.", fileName); */
h_file = H5Fopen(fileName, H5F_ACC_RDONLY, H5P_DEFAULT);
if (h_file < 0)
error("Error while opening file '%s' for inital read.", fileName);
error("Error while opening file '%s' for initial read.", fileName);
/* Open header to read simulation properties */
/* message("Reading runtime parameters..."); */
......@@ -383,8 +383,8 @@ void prepareArray(hid_t grp, char* fileName, FILE* xmfFile, char* name,
conversionString(buffer, us, convFactor);
writeAttribute_d(h_data, "CGS conversion factor",
conversionFactor(us, convFactor));
writeAttribute_f(h_data, "h-scale exponant", hFactor(us, convFactor));
writeAttribute_f(h_data, "a-scale exponant", aFactor(us, convFactor));
writeAttribute_f(h_data, "h-scale exponent", hFactor(us, convFactor));
writeAttribute_f(h_data, "a-scale exponent", aFactor(us, convFactor));
writeAttribute_s(h_data, "Conversion factor", buffer);
H5Dclose(h_data);
......@@ -401,7 +401,7 @@ void prepareArray(hid_t grp, char* fileName, FILE* xmfFile, char* name,
* @param type The #DATA_TYPE of the array.
* @param N The number of particles to write.
* @param dim The dimension of the data (1 for scalar, 3 for vector)
* @param part_c A (char*) pointer on the first occurence of the field of
* @param part_c A (char*) pointer on the first occurrence of the field of
*interest in the parts array
* @param us The UnitSystem currently in use
* @param convFactor The UnitConversionFactor for this array
......@@ -432,7 +432,7 @@ void writeArrayBackEnd(hid_t grp, char* name, enum DATA_TYPE type, int N,
for (i = 0; i < N; ++i)
memcpy(&temp_c[i * copySize], part_c + i * partSize, copySize);
/* Construct information for the hyperslab */
/* Construct information for the hyper-slab */
if (dim > 1) {
rank = 2;
shape[0] = N;
......@@ -488,7 +488,7 @@ void writeArrayBackEnd(hid_t grp, char* name, enum DATA_TYPE type, int N,
* @param type The #DATA_TYPE of the array.
* @param N The number of particles to write.
* @param dim The dimension of the data (1 for scalar, 3 for vector)
* @param part A (char*) pointer on the first occurence of the field of interest
* @param part A (char*) pointer on the first occurrence of the field of interest
*in the parts array
* @param field The name (code name) of the field to read from.
* @param us The UnitSystem currently in use
......@@ -541,7 +541,7 @@ void write_output_serial(struct engine* e, struct UnitSystem* us, int mpi_rank,
MPI_Bcast(&N_total_d, 1, MPI_DOUBLE, mpi_size - 1, comm);
if (N_total_d > 1.e15)
error(
"Error while computing the offest for parallel output: Simulation has "
"Error while computing the offset for parallel output: Simulation has "
"more than 10^15 particles.\n");
N_total = (long long) N_total_d;
offset = (long long) offset_d;
......
/*******************************************************************************
* This file is part of SWIFT.
* Coypright (c) 2012 Matthieu Schaller (matthieu.schaller@durham.ac.uk).
* Copyright (c) 2012 Matthieu Schaller (matthieu.schaller@durham.ac.uk).
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published
......
/*******************************************************************************
* This file is part of SWIFT.
* Coypright (c) 2012 Pedro Gonnet (pedro.gonnet@durham.ac.uk),
* Copyright (c) 2012 Pedro Gonnet (pedro.gonnet@durham.ac.uk),
* Matthieu Schaller (matthieu.schaller@durham.ac.uk).
*
* This program is free software: you can redistribute it and/or modify
......@@ -50,14 +50,14 @@
* @param type The #DATA_TYPE of the attribute.
* @param N The number of particles.
* @param dim The dimension of the data (1 for scalar, 3 for vector)
* @param part_c A (char*) pointer on the first occurence of the field of
* @param part_c A (char*) pointer on the first occurrence of the field of
*interest in the parts array
* @param importance If COMPULSORY, the data must be present in the IC file. If
*OPTIONAL, the array will be zeroed when the data is not present.
*
* @todo A better version using HDF5 hyperslabs to read the file directly into
* @todo A better version using HDF5 hyper-slabs to read the file directly into
*the part array
* will be written once the strucutres have been stabilized.
* will be written once the structures have been stabilized.
*
* Calls #error() if an error occurs.
*/
......@@ -159,7 +159,7 @@ void readArrayBackEnd(hid_t grp, char* name, enum DATA_TYPE type, int N,
* in the file.
*
* @warning Can not read snapshot distributed over more than 1 file !!!
* @todo Read snaphsots distributed in more than one file.
* @todo Read snapshots distributed in more than one file.
*
* Calls #error() if an error occurs.
*
......@@ -257,14 +257,14 @@ void read_ic_single(char* fileName, double dim[3], struct part** parts, int* N,
* @param type The #DATA_TYPE of the array.
* @param N The number of particles to write.
* @param dim The dimension of the data (1 for scalar, 3 for vector)
* @param part_c A (char*) pointer on the first occurence of the field of
* @param part_c A (char*) pointer on the first occurrence of the field of
*interest in the parts array
* @param us The UnitSystem currently in use
* @param convFactor The UnitConversionFactor for this array
*
* @todo A better version using HDF5 hyperslabs to write the file directly from
* @todo A better version using HDF5 hyper-slabs to write the file directly from
*the part array
* will be written once the strucutres have been stabilized.
* will be written once the structures have been stabilized.
*
* Calls #error() if an error occurs.
*/
......@@ -334,8 +334,8 @@ void writeArrayBackEnd(hid_t grp, char* fileName, FILE* xmfFile, char* name,
conversionString(buffer, us, convFactor);
writeAttribute_d(h_data, "CGS conversion factor",
conversionFactor(us, convFactor));
writeAttribute_f(h_data, "h-scale exponant", hFactor(us, convFactor));
writeAttribute_f(h_data, "a-scale exponant", aFactor(us, convFactor));
writeAttribute_f(h_data, "h-scale exponent", hFactor(us, convFactor));
writeAttribute_f(h_data, "a-scale exponent", aFactor(us, convFactor));
writeAttribute_s(h_data, "Conversion factor", buffer);
/* Free and close everything */
......@@ -354,7 +354,7 @@ void writeArrayBackEnd(hid_t grp, char* fileName, FILE* xmfFile, char* name,
* @param type The #DATA_TYPE of the array.
* @param N The number of particles to write.
* @param dim The dimension of the data (1 for scalar, 3 for vector)
* @param part A (char*) pointer on the first occurence of the field of interest
* @param part A (char*) pointer on the first occurrence of the field of interest
*in the parts array
* @param field The name (code name) of the field to read from.
* @param us The UnitSystem currently in use
......
/*******************************************************************************
* This file is part of SWIFT.
* Coypright (c) 2012 Matthieu Schaller (matthieu.schaller@durham.ac.uk).
* Copyright (c) 2012 Matthieu Schaller (matthieu.schaller@durham.ac.uk).
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published
......
/*******************************************************************************
* This file is part of SWIFT.
* Coypright (c) 2012 Pedro Gonnet (pedro.gonnet@durham.ac.uk)
* Copyright (c) 2012 Pedro Gonnet (pedro.gonnet@durham.ac.uk)
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published
......@@ -179,7 +179,7 @@ void space_regrid(struct space *s, double cell_max, int verbose) {
float buff;
if (MPI_Allreduce(&h_max, &buff, 1, MPI_FLOAT, MPI_MAX, MPI_COMM_WORLD) !=
MPI_SUCCESS)
error("Failed to aggreggate the rebuild flag accross nodes.");
error("Failed to aggregate the rebuild flag across nodes.");
h_max = buff;
}
#endif
......@@ -992,7 +992,7 @@ void space_split(struct space *s, struct cell *c) {
c->dt_max = dt_max;
}
/* Set ownership accorind to the start of the parts array. */
/* Set ownership according to the start of the parts array. */
c->owner = ((c->parts - s->parts) % s->nr_parts) * s->nr_queues / s->nr_parts;
}
......@@ -1088,7 +1088,7 @@ struct cell *space_getcell(struct space *s) {
void space_init(struct space *s, double dim[3], struct part *parts, int N,
int periodic, double h_max, int verbose) {
/* Store eveything in the space. */
/* Store everything in the space. */
s->dim[0] = dim[0];
s->dim[1] = dim[1];
s->dim[2] = dim[2];
......
/*******************************************************************************
* This file is part of SWIFT.
* Coypright (c) 2012 Pedro Gonnet (pedro.gonnet@durham.ac.uk)
* Copyright (c) 2012 Pedro Gonnet (pedro.gonnet@durham.ac.uk)
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published
......
/*******************************************************************************
* This file is part of SWIFT.
* Coypright (c) 2012 Pedro Gonnet (pedro.gonnet@durham.ac.uk)
* Copyright (c) 2012 Pedro Gonnet (pedro.gonnet@durham.ac.uk)
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published
......
/*******************************************************************************
* This file is part of SWIFT.
* Coypright (c) 2012 Pedro Gonnet (pedro.gonnet@durham.ac.uk)
* Copyright (c) 2012 Pedro Gonnet (pedro.gonnet@durham.ac.uk)
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published
......
/*******************************************************************************
* This file is part of SWIFT.
* Coypright (c) 2012 Pedro Gonnet (pedro.gonnet@durham.ac.uk)
* Copyright (c) 2012 Pedro Gonnet (pedro.gonnet@durham.ac.uk)
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published
......
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment