Revision 04c21bf6e5a9d75724a269fff725b82f973813c3 authored by Volodymyr Kysenko on 21 November 2023, 21:56:45 UTC, committed by GitHub on 21 November 2023, 21:56:45 UTC
1 parent f5a4e49
AddAtomicMutex.h
#ifndef HALIDE_ADD_ATOMIC_MUTEX_H
#define HALIDE_ADD_ATOMIC_MUTEX_H
#include "Expr.h"
#include <map>
/** \file
* Defines the lowering pass that insert mutex allocation code & locks
* for the atomic nodes that require mutex locks. It also checks whether
* the atomic operation is valid. It rejects algorithms that have indexing
* on left-hand-side which references the buffer itself, e.g.
* f(clamp(f(r), 0, 100)) = f(r) + 1
* If the SplitTuple pass does not lift out the Provide value as a let
* expression. This is confirmed by checking whether the Provide nodes
* inside an Atomic node have let binding values accessing the buffers
* inside the atomic node.
* Finally, it lifts the store indexing expressions inside the atomic node
* outside of the atomic to avoid side-effects inside those expressions
* being evaluated twice. */
namespace Halide {
namespace Internal {
class Function;
Stmt add_atomic_mutex(Stmt s, const std::map<std::string, Function> &env);
} // namespace Internal
} // namespace Halide
#endif
![swh spinner](/static/img/swh-spinner.gif)
Computing file changes ...