| /third_party/node/deps/npm/test/tap/ |
| D | install-actions.js | 32 isTop: true property
52 isTop: true property
81 isTop: false property
89 isTop: false property
106 isTop: true property
|
| D | install-order.js | 10 isTop: true property
17 isTop: false, property
27 isTop: false, property
37 isTop: false, property
|
| D | unit-deps-earliestInstallable.js | 55 isTop: true, property
97 isTop: true, property
|
| D | unit-deps-removeObsoleteDep.js | 36 var child3 = {requiredBy: [{isTop: true}]} property
|
| /third_party/node/deps/npm/node_modules/har-validator/node_modules/ajv/lib/dot/ |
| D | validate.jst | 34 {{? it.isTop }}
46 {{? it.isTop}}
53 {{? it.isTop}}
65 {{? it.isTop}}
74 {{? it.isTop }}
76 var $top = it.isTop
82 delete it.isTop;
|
| /third_party/node/deps/npm/lib/install/ |
| D | is-extraneous.js | 11 while (!top.isTop) top = top.parent
17 if (tree.isTop || tree.userRequired) {
|
| D | mutate-into-logical-tree.js | 18 if (tree.isTop || tree.cycleTop || tree.requiredBy.length === 0) {
137 …pkg.extraneous = !tree.isTop && (!tree.parent.isTop || !tree.parent.error) && !npm.config.get('glo…
|
| D | node.js | 23 isTop: false, property
68 child.isTop = false
|
| D | deps.js | 115 tree.isTop = true
139 if (tree.isTop) {
356 if (tree.isTop && saveToDependencies) {
448 if (tree.isTop) return true
778 if (tree.isTop) return null
833 if (tree.isTop && devDeps[pkg.name]) {
842 if (tree.isTop) return tree
845 if (npm.config.get('global-style') && tree.parent.isTop) return tree
|
| D | has-modern-meta.js | 15 return child.isTop ||
|
| D | is-only-dev.js | 27 if (req.isTop) {
|
| D | flatten-tree.js | 38 if (tree.isTop) return '/'
|
| D | read-shrinkwrap.js | 21 child.isTop && maybeReadFile('package-lock.json', child),
|
| D | diff-trees.js | 119 return !node.isTop && !node.userRequired && !node.existing
|
| /third_party/node/deps/npm/node_modules/har-validator/node_modules/ajv/lib/dotjs/ |
| D | validate.js | 15 if (it.isTop) {
38 if (it.isTop) {
71 if (it.isTop) {
81 if (it.isTop) {
86 if (it.isTop) {
87 var $top = it.isTop,
93 delete it.isTop;
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/PowerPC/ |
| D | PPCMachineScheduler.cpp | 29 SchedCandidate &FirstCand = Zone.isTop() ? TryCand : Cand; in biasAddiLoadCandidate()
30 SchedCandidate &SecondCand = Zone.isTop() ? Cand : TryCand; in biasAddiLoadCandidate()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/ |
| D | HexagonMachineScheduler.h | 186 MaxPath = std::max(MaxPath, isTop() ? SU.getHeight() : SU.getDepth()); in init()
191 bool isTop() const { in isTop() function
212 unsigned PathLength = isTop() ? SU->getHeight() : SU->getDepth(); in isLatencyBound()
|
| D | HexagonMachineScheduler.cpp | 376 if (isTop()) in bumpCycle()
394 if (!isTop() && SU->isCall) { in bumpNode()
403 startNewCycle = ResourceModel->reserveResources(SU, isTop()); in bumpNode()
428 unsigned ReadyCycle = isTop() ? SU->TopReadyCycle : SU->BotReadyCycle; in releasePending()
467 return !ResourceModel->isResourceAvailable(*Available.begin(), isTop()) || in pickOnlyChoice()
468 getWeakLeft(*Available.begin(), isTop()) != 0; in pickOnlyChoice()
474 ResourceModel->reserveResources(nullptr, isTop()); in pickOnlyChoice()
|
| D | HexagonConstPropagation.cpp | 162 bool isTop() const { return Kind == Top; } in isTop() function in __anon70eddf1e0111::LatticeCell
213 assert(Top.isTop()); in CellMap()
469 uint32_t Ps = !isTop() ? properties() in convertToProperty()
506 } else if (isTop()) { in print()
526 if (isBottom() || L.isTop()) in meet()
528 if (isTop()) { in meet()
607 assert(!isTop() && "Should not call this for a top cell"); in properties()
2216 assert(!Input.isTop()); in evaluate()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| D | MachineScheduler.cpp | 1936 unsigned ReadyCycle = (isTop() ? SU->TopReadyCycle : SU->BotReadyCycle); in getLatencyStallCycles()
1951 if (!isTop()) in getNextResourceCycleByInstance()
2006 ((isTop() && SchedModel->mustBeginGroup(SU->getInstr())) || in checkHazard()
2007 (!isTop() && SchedModel->mustEndGroup(SU->getInstr())))) { in checkHazard()
2009 << (isTop() ? "begin" : "end") << " group\n"); in checkHazard()
2143 if (isTop()) in bumpCycle()
2208 if (!isTop() && SU->isCall) { in bumpNode()
2225 unsigned ReadyCycle = (isTop() ? SU->TopReadyCycle : SU->BotReadyCycle); in bumpNode()
2290 if (isTop()) { in bumpNode()
2300 unsigned &TopLatency = isTop() ? ExpectedLatency : DependentLatency; in bumpNode()
[all …]
|
| /third_party/node/deps/npm/node_modules/brace-expansion/ |
| D | index.js | 100 function expand(str, isTop) { argument
194 if (!isTop || isSequence || expansion)
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/ |
| D | MachineScheduler.h | 695 bool isTop() const { in isTop() function
716 return isTop() ? SU->getHeight() : SU->getDepth(); in getUnscheduledLatency()
932 unsigned getWeakLeft(const SUnit *SU, bool isTop);
933 int biasPhysReg(const SUnit *SU, bool isTop);
1011 void reschedulePhysReg(SUnit *SU, bool isTop);
|
| /third_party/node/deps/npm/lib/ |
| D | update.js | 61 const isTransitive = !(ww.dep.requiredBy || []).some((p) => p.isTop)
|
| D | install.js | 404 this.currentTree.isTop = true
508 var isReqByTop = pkg.requiredBy.filter(function (mod) { return mod.isTop }).length
612 isTop: true, property
727 isTop: true property
|
| /third_party/node/deps/npm/node_modules/har-validator/node_modules/ajv/lib/compile/ |
| D | index.js | 89 isTop: true, property
|