Searched refs:Adj (Results 1 – 11 of 11) sorted by relevance
| /third_party/icu/icu4c/source/data/brkitr/ |
| D | en.txt | 93 "Adj.",
|
| D | de.txt | 157 "Adj.",
|
| /third_party/flutter/skia/third_party/externals/icu/source/data/brkitr/ |
| D | en.txt | 93 "Adj.",
|
| D | de.txt | 157 "Adj.",
|
| /third_party/skia/third_party/externals/icu/source/data/brkitr/ |
| D | en.txt | 93 "Adj.",
|
| D | de.txt | 157 "Adj.",
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/ |
| D | MachineFrameInfo.h | 562 void setOffsetAdjustment(int Adj) { OffsetAdjustment = Adj; } in setOffsetAdjustment() argument
|
| /third_party/boost/libs/graph/doc/ |
| D | minimum_degree_ordering.w | 67 Adj[u] \cup \{ u \} = Adj[v] \bigcup \{ v \}
|
| D | isomorphism-impl-v3.w | 71 % Use w(u,v) = |Adj[u] \intersect Adj[v]| as an edge invariant.
353 $Adj[f(k)]$ that is also in $S$. We call \code{count\_if} to do the
402 in $Adj[f(i)]$ then we have a match for the edge $(i,j)$, and can
|
| D | transitive_closure.w | 271 $Adj[u]$ has already been computed. The successor set for a vertex $u$
278 \>\textbf{for} each vertex $v$ in $Adj[u]$ \\
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/ARM/ |
| D | ARMBaseInstrInfo.cpp | 4333 int Adj = DefAdj + UseAdj; in getOperandLatencyImpl() local
4336 Adj += adjustDefLatency(Subtarget, DefMI, DefMCID, DefAlign); in getOperandLatencyImpl()
4337 if (Adj >= 0 || (int)Latency > -Adj) { in getOperandLatencyImpl()
4338 return Latency + Adj; in getOperandLatencyImpl()
4361 int Adj = Subtarget.getPreISelOperandLatencyAdjustment(); in getOperandLatency() local
4362 int Threshold = 1 + Adj; in getOperandLatency()
4363 return Latency <= Threshold ? 1 : Latency - Adj; in getOperandLatency()
4664 int Adj = adjustDefLatency(Subtarget, MI, MCID, DefAlign); in getInstrLatency() local
4665 if (Adj >= 0 || (int)Latency > -Adj) { in getInstrLatency()
4666 return Latency + Adj; in getInstrLatency()
|