| /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/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 __anon72abc7ab0111::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/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/node/deps/npm/node_modules/@npmcli/arborist/lib/ |
| D | node.js | 397 name: this.isProjectRoot || this.isTop ? this.packageName : this.name,
877 const { globalTop, isTop, path, sourceReference } = this
880 isTop: srcTop,
883 const thisDev = isTop && !globalTop && path
1022 if (!this.isTop &&
1396 if (this.isTop) {
1402 get isTop () { getter in Node
1407 if (this.isTop) {
|
| D | place-dep.js | 83 if (!target.isTop && targetEdge && targetEdge.peer) {
231 if (p.matches(this.dep) && !p.isTop) {
277 if (node.isDescendantOf(target) && !node.isTop) {
|
| D | peer-entry-sets.js | 37 if (!edge.peer || edge.from.isTop) {
|
| D | query-selector-all.js | 252 return this.initialItems.filter(node => node.isLink || (node.isTop && !node.isRoot))
784 if (node.isTop && (node.resolveParent === compareNode)) {
805 if (node.isTop && node.resolveParent) {
|
| D | tree-check.js | 81 if (!node.isTop && devEdges.length) {
|
| D | edge.js | 237 } else if (this.peer && this.#from === this.#to.parent && !this.#from.isTop) {
|
| D | can-place-dep.js | 144 if (targetEdge && targetEdge.peer && !target.isTop) {
|
| D | audit-report.js | 173 if (dep.isTop && !vuln.topNodes.has(dep)) {
|
| D | shrinkwrap.js | 240 if (node.isTop && node.package.devDependencies) {
|
| /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/minimatch/src/node_modules/brace-expansion/ |
| D | index.js | 95 function expand(str, isTop) { argument
195 if (!isTop || isSequence || expansion)
|
| /third_party/node/deps/npm/node_modules/brace-expansion/ |
| D | index.js | 95 function expand(str, isTop) { argument
195 if (!isTop || isSequence || expansion)
|
| /third_party/node/deps/npm/node_modules/@npmcli/arborist/lib/arborist/ |
| D | isolated-reifier.js | 266 isTop: true,
303 isTop: false, property
401 isTop: false, property
|
| D | rebuild.js | 393 top: !!(node.isTop || node.globalTop),
|
| /third_party/parse5/packages/parse5/lib/parser/ |
| D | open-element-stack.ts | 45 onItemPush: (node: T['parentNode'], tid: number, isTop: boolean) => void;
46 onItemPop: (node: T['parentNode'], isTop: boolean) => void;
|
| D | index.ts | 257 onItemPush(node: T['parentNode'], tid: number, isTop: boolean): void {
259 if (isTop && this.openElements.stackTop > 0) this._setContextModes(node, tid);
262 onItemPop(node: T['parentNode'], isTop: boolean): void {
269 if (isTop) {
|
| /third_party/vk-gl-cts/modules/gles2/accuracy/ |
| D | es2aTextureFilteringTests.cpp | 489 bool isTop = face >= 3; in renderFaces() local
493 int curH = isTop ? (height-curY) : (height / 2); in renderFaces()
|
| /third_party/vk-gl-cts/modules/gles3/accuracy/ |
| D | es3aTextureFilteringTests.cpp | 498 bool isTop = face >= 3; in renderFaces() local
502 int curH = isTop ? (height-curY) : (height / 2); in renderFaces()
|
| /third_party/node/deps/minimatch/ |
| D | index.js | 154 function expand(str, isTop) { argument
236 if (!isTop || isSequence || expansion)
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AMDGPU/ |
| D | GCNSchedStrategy.cpp | 154 initCandidate(TryCand, SU, Zone.isTop(), RPTracker, SRI, in pickNodeFromQueue()
|