mirror of
https://github.com/saymrwulf/pytorch.git
synced 2026-05-15 21:00:47 +00:00
4cb534f92e
Summary:
This is an automatic change generated by the following script:
```
#!/usr/bin/env python3
from subprocess import check_output, check_call
import os
def get_compiled_files_list():
import json
with open("build/compile_commands.json") as f:
data = json.load(f)
files = [os.path.relpath(node['file']) for node in data]
for idx, fname in enumerate(files):
if fname.startswith('build/') and fname.endswith('.DEFAULT.cpp'):
files[idx] = fname[len('build/'):-len('.DEFAULT.cpp')]
return files
def run_clang_tidy(fname):
check_call(["python3", "tools/clang_tidy.py", "-c", "build", "-x", fname,"-s"])
changes = check_output(["git", "ls-files", "-m"])
if len(changes) == 0:
return
check_call(["git", "commit","--all", "-m", f"NOLINT stubs for {fname}"])
def main():
git_files = check_output(["git", "ls-files"]).decode("ascii").split("\n")
compiled_files = get_compiled_files_list()
for idx, fname in enumerate(git_files):
if fname not in compiled_files:
continue
if fname.startswith("caffe2/contrib/aten/"):
continue
print(f"[{idx}/{len(git_files)}] Processing {fname}")
run_clang_tidy(fname)
if __name__ == "__main__":
main()
```
Pull Request resolved: https://github.com/pytorch/pytorch/pull/56892
Reviewed By: H-Huang
Differential Revision: D27991944
Pulled By: malfet
fbshipit-source-id: 5415e1eb2c1b34319a4f03024bfaa087007d7179
139 lines
3.8 KiB
C++
139 lines
3.8 KiB
C++
#include <gtest/gtest.h>
|
|
|
|
#include <torch/csrc/jit/ir/ir.h>
|
|
#include <torch/csrc/jit/passes/utils/memory_dag.h>
|
|
|
|
namespace torch {
|
|
namespace jit {
|
|
|
|
// NOLINTNEXTLINE(cppcoreguidelines-avoid-non-const-global-variables)
|
|
TEST(MemoryDAGTest, Basic) {
|
|
auto graph = std::make_shared<Graph>();
|
|
const Value* aValue = graph->addInput();
|
|
const Value* bValue = graph->addInput();
|
|
const Value* cValue = graph->addInput();
|
|
const Value* dValue = graph->addInput();
|
|
const Value* eValue = graph->addInput();
|
|
const Value* fValue = graph->addInput();
|
|
const Value* gValue = graph->addInput();
|
|
|
|
{
|
|
// a <- b <- c
|
|
// b <- d
|
|
// a <- e
|
|
// f <- e
|
|
// g is by itself
|
|
auto t = std::make_unique<MemoryDAGBuilder>();
|
|
auto a = t->makeFreshValue(aValue);
|
|
auto b = t->makeFreshValue(bValue);
|
|
auto c = t->makeFreshValue(cValue);
|
|
auto d = t->makeFreshValue(dValue);
|
|
auto e = t->makeFreshValue(eValue);
|
|
auto f = t->makeFreshValue(fValue);
|
|
auto g = t->makeFreshValue(gValue);
|
|
t->makePointerTo(b, a);
|
|
t->makePointerTo(c, b);
|
|
t->makePointerTo(d, b);
|
|
t->makePointerTo(e, a);
|
|
t->makePointerTo(e, f);
|
|
|
|
auto dag = std::make_unique<MemoryDAG>(std::move(t));
|
|
|
|
/**
|
|
* Test mayAlias()
|
|
*/
|
|
// Values should alias themselves
|
|
EXPECT_TRUE(dag->mayAlias(a, a));
|
|
EXPECT_TRUE(dag->mayAlias(g, g));
|
|
|
|
// Values that point to the same location should alias
|
|
EXPECT_TRUE(dag->mayAlias(a, b));
|
|
EXPECT_TRUE(dag->mayAlias(a, c));
|
|
EXPECT_TRUE(dag->mayAlias(c, d));
|
|
|
|
// e may point to a OR f
|
|
EXPECT_TRUE(dag->mayAlias(e, a));
|
|
EXPECT_TRUE(dag->mayAlias(e, f));
|
|
// But a and f don't alias
|
|
EXPECT_FALSE(dag->mayAlias(a, f));
|
|
}
|
|
{
|
|
// x(y) -> x contains y
|
|
|
|
// b(a)
|
|
// c(a)
|
|
auto t = std::make_unique<MemoryDAGBuilder>();
|
|
auto a = t->makeFreshValue(aValue);
|
|
auto b = t->makeFreshValue(bValue);
|
|
t->addToContainedElements(a, b);
|
|
|
|
auto c = t->makeFreshValue(cValue);
|
|
t->addToContainedElements(a, c);
|
|
|
|
auto dag = std::make_unique<MemoryDAG>(std::move(t));
|
|
EXPECT_TRUE(dag->mayContainAlias(a, b));
|
|
EXPECT_TRUE(dag->mayContainAlias(b, a));
|
|
|
|
EXPECT_TRUE(dag->mayContainAlias(a, c));
|
|
EXPECT_TRUE(dag->mayContainAlias(c, a));
|
|
|
|
EXPECT_TRUE(dag->mayContainAlias(b, c));
|
|
EXPECT_TRUE(dag->mayContainAlias(c, b));
|
|
|
|
// containers contain an element in themselves
|
|
EXPECT_TRUE(dag->mayContainAlias(b, b));
|
|
EXPECT_TRUE(dag->mayContainAlias(c, c));
|
|
EXPECT_TRUE(dag->mayContainAlias(a, a));
|
|
}
|
|
{
|
|
// b(a)
|
|
// c(a)
|
|
// d(b(a))
|
|
auto t = std::make_unique<MemoryDAGBuilder>();
|
|
auto a = t->makeFreshValue(aValue);
|
|
auto b = t->makeFreshValue(bValue);
|
|
t->addToContainedElements(a, b);
|
|
|
|
auto c = t->makeFreshValue(cValue);
|
|
t->addToContainedElements(a, c);
|
|
|
|
auto d = t->makeFreshValue(dValue);
|
|
t->addToContainedElements(b, d);
|
|
|
|
auto dag = std::make_unique<MemoryDAG>(std::move(t));
|
|
EXPECT_TRUE(dag->mayContainAlias(b, d));
|
|
EXPECT_TRUE(dag->mayContainAlias(d, b));
|
|
|
|
EXPECT_TRUE(dag->mayContainAlias(c, d));
|
|
EXPECT_TRUE(dag->mayContainAlias(d, c));
|
|
|
|
EXPECT_TRUE(dag->mayContainAlias(a, d));
|
|
}
|
|
{
|
|
// f(e)
|
|
auto t = std::make_unique<MemoryDAGBuilder>();
|
|
auto a = t->makeFreshValue(aValue);
|
|
auto b = t->makeFreshValue(bValue);
|
|
t->addToContainedElements(a, b);
|
|
|
|
auto c = t->makeFreshValue(cValue);
|
|
t->addToContainedElements(a, c);
|
|
|
|
auto d = t->makeFreshValue(dValue);
|
|
t->addToContainedElements(b, d);
|
|
|
|
auto f = t->makeFreshValue(aValue);
|
|
auto e = t->makeFreshValue(bValue);
|
|
|
|
t->addToContainedElements(f, e);
|
|
|
|
auto dag = std::make_unique<MemoryDAG>(std::move(t));
|
|
for (auto elem : {a, b, c, d}) {
|
|
EXPECT_FALSE(dag->mayContainAlias(f, elem));
|
|
EXPECT_FALSE(dag->mayContainAlias(e, elem));
|
|
}
|
|
}
|
|
}
|
|
|
|
} // namespace jit
|
|
} // namespace torch
|