*
* From wikipedia:
*
- * The Floyd–Warshall algorithm takes as input an adjacency matrix representation of a weighted, directed graph (V, E).
+ * The Floyd-Warshall algorithm takes as input an adjacency matrix representation of a weighted, directed graph (V, E).
* The weight of a path between two vertices is the sum of the weights of the edges along that path. The edges E of the
* graph may have negative weights, but the graph must not have any negative weight cycles. The algorithm computes, for
* each pair of vertices, the minimum weight among all paths between the two vertices. The running time complexity is
#include <math.h>
#include "src/mc/mc_protocol.h"
-/* ***** Whether to use `mmalloc` of the undrlying malloc ***** */
+/* ***** Whether to use `mmalloc` of the underlying malloc ***** */
static int __malloc_use_mmalloc;
size_t count = n / sizeof(uint64_t);
if (n % sizeof(uint64_t))
count++;
- // Check that we have enough availabel memory:
+ // Check that we have enough available memory:
if (fake_alloc_index + count >= BUFFER_SIZE)
exit(127);
// Allocate it:
size_t requested_size = size; // The amount of memory requested by user, for real
- /* Work even if the user was stupid enough to ask a ridicullously small block (even 0-length),
+ /* Work even if the user was stupid enough to ask a ridiculously small block (even 0-length),
* ie return a valid block that can be realloced and freed.
* glibc malloc does not use this trick but return a constant pointer, but we need to enlist the free fragments later on.
*/
if (vasprintf(&res, fmt, ap) < 0) {
/* Do not want to use xbt_die() here, as it uses the logging
- * infrastucture and may fail to allocate memory too. */
+ * infrastructure and may fail to allocate memory too. */
fprintf(stderr, "bprintf: vasprintf failed. Aborting.\n");
xbt_abort();
}
XBT_DEBUG ("Copy a %ux%u submatrix from %ux%u(of %ux%u) to %ux%u (of %ux%u)",
lsize, rsize, lpos_src, rpos_src, src->lines, src->rows, lpos_dst, rpos_dst, dst->lines, dst->rows);
- /* everybody knows that issue is between the chair and the screen (particulary in my office) */
+ /* everybody knows that issue is between the chair and the screen (particularly in my office) */
xbt_assert(src->elmsize == dst->elmsize);
/* don't check free_f since the user may play weird games with this */
XBT_LOG_NEW_DEFAULT_SUBCATEGORY(xbt_sync_os, xbt, "Synchronization mechanism (OS-level)");
-/* use named sempahore when sem_init() does not work */
+/* use named semaphore when sem_init() does not work */
#if !HAVE_SEM_INIT
static int next_sem_ID = 0;
static xbt_os_mutex_t next_sem_ID_lock;
-/* virtu - virtualization layer for XBT to choose between GRAS and MSG implementation */
+/* virtualization layer for XBT */
-/* Copyright (c) 2007-2010, 2012-2014. The SimGrid Team.
- * All rights reserved. */
+/* Copyright (c) 2007-2014. The SimGrid Team. All rights reserved. */
/* This program is free software; you can redistribute it and/or modify it
* under the terms of the license (GNU LGPL) which comes with this package. */
${CMAKE_CURRENT_SOURCE_DIR}/basic-parsing-test/basic-parsing-test-sym-full.tesh
${CMAKE_CURRENT_SOURCE_DIR}/basic-parsing-test/basic-parsing-test-bypass.tesh
PARENT_SCOPE)
-set(xml_files ${xml_files} ${CMAKE_CURRENT_SOURCE_DIR}/platforms/ASbypass.xml
- ${CMAKE_CURRENT_SOURCE_DIR}/platforms/four_hosts_floyd.xml
+set(xml_files ${xml_files} ${CMAKE_CURRENT_SOURCE_DIR}/platforms/four_hosts_floyd.xml
${CMAKE_CURRENT_SOURCE_DIR}/platforms/two_hosts_multi_hop.xml
${CMAKE_CURRENT_SOURCE_DIR}/platforms/host_attributes.xml
${CMAKE_CURRENT_SOURCE_DIR}/platforms/link_attributes.xml
dynars
endverbatim
FIXME
+fprintf
Gbytes
+getline
GPU
hideinitializer
hpp
MCer
memcpy
memcmp
+memmove
+memset
Mflops
mmap
ModelChecker
printf
proc
pstate
+pthread
+pthreads
+realloc
RngStream
SD
simcall
smx
src
std
+strbuff
+strerror
+strlen
struct
syscall
syscalls