Home
last modified time | relevance | path

Searched refs:slash_bits (Results 1 - 17 of 17) sorted by relevance

/third_party/ninja/src/
H A Dutil_test.cc227 uint64_t slash_bits; in TEST() local
230 CanonicalizePath(&path, &slash_bits); in TEST()
232 EXPECT_EQ(0, slash_bits); in TEST()
235 CanonicalizePath(&path, &slash_bits); in TEST()
237 EXPECT_EQ(1, slash_bits); in TEST()
240 CanonicalizePath(&path, &slash_bits); in TEST()
242 EXPECT_EQ(4, slash_bits); in TEST()
245 CanonicalizePath(&path, &slash_bits); in TEST()
247 EXPECT_EQ(5, slash_bits); in TEST()
250 CanonicalizePath(&path, &slash_bits); in TEST()
313 uint64_t slash_bits; TEST() local
322 uint64_t slash_bits; TEST() local
396 uint64_t slash_bits; TEST() local
[all...]
H A Dmanifest_parser.cc197 uint64_t slash_bits; // Unused because this only does lookup. in ParseDefault()
198 CanonicalizePath(&path, &slash_bits); in ParseDefault()
337 uint64_t slash_bits; in ParseEdge()
338 CanonicalizePath(&path, &slash_bits); in ParseEdge()
339 if (!state_->AddOut(edge, path, slash_bits)) { in ParseEdge()
370 uint64_t slash_bits; in ParseEdge()
371 CanonicalizePath(&path, &slash_bits); in ParseEdge()
372 state_->AddIn(edge, path, slash_bits); in ParseEdge()
383 uint64_t slash_bits; in ParseEdge()
384 CanonicalizePath(&path, &slash_bits); in ParseEdge()
412 uint64_t slash_bits; ParseEdge() local
[all...]
H A Ddyndep_parser.cc120 uint64_t slash_bits; in ParseEdge()
121 CanonicalizePath(&path, &slash_bits); in ParseEdge()
207 uint64_t slash_bits; in ParseEdge()
208 CanonicalizePath(&path, &slash_bits); in ParseEdge()
209 Node* n = state_->GetNode(path, slash_bits); in ParseEdge()
219 uint64_t slash_bits; in ParseEdge() local
220 CanonicalizePath(&path, &slash_bits); in ParseEdge()
221 Node* n = state_->GetNode(path, slash_bits); in ParseEdge()
H A Dstate.cc96 Node* State::GetNode(StringPiece path, uint64_t slash_bits) { in GetNode() argument
100 node = new Node(path.AsString(), slash_bits); in GetNode()
129 void State::AddIn(Edge* edge, StringPiece path, uint64_t slash_bits) { in AddIn() argument
130 Node* node = GetNode(path, slash_bits); in AddIn()
136 bool State::AddOut(Edge* edge, StringPiece path, uint64_t slash_bits) { in AddOut() argument
137 Node* node = GetNode(path, slash_bits); in AddOut()
147 void State::AddValidation(Edge* edge, StringPiece path, uint64_t slash_bits) { in AddValidation() argument
148 Node* node = GetNode(path, slash_bits); in AddValidation()
H A Dstate.h104 Node* GetNode(StringPiece path, uint64_t slash_bits);
111 void AddIn(Edge* edge, StringPiece path, uint64_t slash_bits);
112 bool AddOut(Edge* edge, StringPiece path, uint64_t slash_bits);
113 void AddValidation(Edge* edge, StringPiece path, uint64_t slash_bits);
H A Dutil.cc122 void CanonicalizePath(string* path, uint64_t* slash_bits) { in CanonicalizePath() argument
127 CanonicalizePath(str, &len, slash_bits); in CanonicalizePath()
139 void CanonicalizePath(char* path, size_t* len, uint64_t* slash_bits) { in CanonicalizePath() argument
304 *slash_bits = bits; in CanonicalizePath()
306 *slash_bits = 0; in CanonicalizePath()
H A Dcanon_perftest.cc37 uint64_t slash_bits; in main() local
39 CanonicalizePath(buf, &len, &slash_bits); in main()
H A Dgraph.h40 Node(const std::string& path, uint64_t slash_bits) in Node()
41 : path_(path), slash_bits_(slash_bits) {} in Node()
80 /// Get |path()| but use slash_bits to convert back to original slash styles.
85 uint64_t slash_bits);
86 uint64_t slash_bits() const { return slash_bits_; } in slash_bits() function
H A Dmissing_deps.cc54 uint64_t slash_bits; in ProcessDepfileDeps() local
55 CanonicalizePath(const_cast<char*>(i->str_), &i->len_, &slash_bits); in ProcessDepfileDeps() local
56 Node* node = state_->GetNode(*i, slash_bits); in ProcessDepfileDeps()
H A Dclparser.cc108 uint64_t slash_bits; in Parse()
109 CanonicalizePath(&normalized, &slash_bits); in Parse()
H A Dutil.h65 /// |slash_bits| has bits set starting from lowest for a backslash that was
67 void CanonicalizePath(std::string* path, uint64_t* slash_bits);
68 void CanonicalizePath(char* path, size_t* len, uint64_t* slash_bits);
H A Dincludes_normalize-win32.cc193 uint64_t slash_bits; in Normalize() local
194 CanonicalizePath(copy, &len, &slash_bits); in Normalize()
H A Dgraph.cc591 string Node::PathDecanonicalized(const string& path, uint64_t slash_bits) { in PathDecanonicalized() argument
596 if (slash_bits & mask) in PathDecanonicalized()
725 uint64_t slash_bits; in ProcessDepfileDeps() local
726 CanonicalizePath(const_cast<char*>(i->str_), &i->len_, &slash_bits); in ProcessDepfileDeps() local
727 Node* node = state_->GetNode(*i, slash_bits); in ProcessDepfileDeps()
H A Dclean.cc207 uint64_t slash_bits; in CleanTargets() local
208 CanonicalizePath(&target_name, &slash_bits); in CleanTargets()
H A Dmanifest_parser_test.cc273 EXPECT_EQ(1, node->slash_bits()); in TEST_F()
276 EXPECT_EQ(1, node->slash_bits()); in TEST_F()
326 EXPECT_EQ(0, node->slash_bits()); in TEST_F()
329 EXPECT_EQ(1, node->slash_bits()); in TEST_F()
H A Dninja.cc267 uint64_t slash_bits; // Unused because this path is only used for lookup. in RebuildManifest() local
268 CanonicalizePath(&path, &slash_bits); in RebuildManifest()
315 uint64_t slash_bits; in CollectTarget() local
316 CanonicalizePath(&path, &slash_bits); in CollectTarget()
347 "unknown target '" + Node::PathDecanonicalized(path, slash_bits) + "'"; in CollectTarget()
H A Dbuild.cc1024 uint64_t slash_bits; in ExtractDeps() local
1025 CanonicalizePath(const_cast<char*>(i->str_), &i->len_, &slash_bits); in ExtractDeps() local
1026 deps_nodes->push_back(state_->GetNode(*i, slash_bits)); in ExtractDeps()

Completed in 13 milliseconds