| OLD | NEW |
| 1 // Copyright (c) 2013 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2013 The Chromium Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #include "tools/gn/target.h" | 5 #include "tools/gn/target.h" |
| 6 | 6 |
| 7 #include "base/bind.h" | 7 #include "base/bind.h" |
| 8 #include "tools/gn/config_values_extractors.h" | 8 #include "tools/gn/config_values_extractors.h" |
| 9 #include "tools/gn/scheduler.h" | 9 #include "tools/gn/scheduler.h" |
| 10 | 10 |
| (...skipping 56 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 67 case UNKNOWN: | 67 case UNKNOWN: |
| 68 return "Unknown"; | 68 return "Unknown"; |
| 69 case GROUP: | 69 case GROUP: |
| 70 return "Group"; | 70 return "Group"; |
| 71 case EXECUTABLE: | 71 case EXECUTABLE: |
| 72 return "Executable"; | 72 return "Executable"; |
| 73 case SHARED_LIBRARY: | 73 case SHARED_LIBRARY: |
| 74 return "Shared library"; | 74 return "Shared library"; |
| 75 case STATIC_LIBRARY: | 75 case STATIC_LIBRARY: |
| 76 return "Static library"; | 76 return "Static library"; |
| 77 case SOURCE_SET: |
| 78 return "Source set"; |
| 77 case COPY_FILES: | 79 case COPY_FILES: |
| 78 return "Copy"; | 80 return "Copy"; |
| 79 case ACTION: | 81 case ACTION: |
| 80 return "Action"; | 82 return "Action"; |
| 81 case ACTION_FOREACH: | 83 case ACTION_FOREACH: |
| 82 return "ActionForEach"; | 84 return "ActionForEach"; |
| 83 default: | 85 default: |
| 84 return ""; | 86 return ""; |
| 85 } | 87 } |
| 86 } | 88 } |
| (...skipping 121 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 208 | 210 |
| 209 void Target::PullRecursiveHardDeps() { | 211 void Target::PullRecursiveHardDeps() { |
| 210 for (size_t dep_i = 0; dep_i < deps_.size(); dep_i++) { | 212 for (size_t dep_i = 0; dep_i < deps_.size(); dep_i++) { |
| 211 const Target* dep = deps_[dep_i].ptr; | 213 const Target* dep = deps_[dep_i].ptr; |
| 212 if (dep->hard_dep()) | 214 if (dep->hard_dep()) |
| 213 recursive_hard_deps_.insert(dep); | 215 recursive_hard_deps_.insert(dep); |
| 214 recursive_hard_deps_.insert(dep->recursive_hard_deps().begin(), | 216 recursive_hard_deps_.insert(dep->recursive_hard_deps().begin(), |
| 215 dep->recursive_hard_deps().end()); | 217 dep->recursive_hard_deps().end()); |
| 216 } | 218 } |
| 217 } | 219 } |
| OLD | NEW |