Home
last modified time | relevance | path

Searched refs:C_0 (Results 1 – 4 of 4) sorted by relevance

/external/u-boot/arch/arm/lib/
Duldivmod.S21 C_0 .req r4 label
43 subs C_0, B_0, #1
45 tst C_0, B_0
55 mov C_0, #1
81 ARM( orrmi C_1, C_1, C_0, lsr ip )
82 THUMB( lsrmi TMP, C_0, ip )
84 movpl C_1, C_0, lsl D_1
85 mov C_0, C_0, lsl D_0
92 mov C_0, #1
107 orr C_1, C_1, C_0, lsr #28
[all …]
/external/skqp/site/dev/design/conical/
Dindex.md33 Let two circles be $C_0, r_0$ and $C_1, r_1$ where $C$ is the center and $r$ is the radius. For any
35 is on the linearly interpolated circle with center $C_t = (1-t) \cdot C_0 + t \cdot C_1$ and radius
41 1. $C_0 = C_1$ so the gradient is essentially a simple radial gradient.
46 They are easy to handle so we won't cover them here. From now on, we assume $C_0 \neq C_1$ and $r_0
49 As $r_0 \neq r_1$, we can find a focal point $C_f = (1-f) \cdot C_0 + f \cdot C_1$ where its
53 As $C_0 \neq C_1$, focal point $C_f$ is different from $C_1$ unless $r_1 = 0$. If $r_1 = 0$, we can
54 swap $C_0, r_0$ with $C_1, r_1$, compute swapped gradient $t_s$ as if $r_1 \neq 0$, and finally set
68 always the bigger one (note that $f \neq 1$, otherwise we'll swap $C_0, r_0$ with $C_1, r_1$).
91 3. we still need to handle the swapped case (we swap $C_0, r_0$ with $C_1, r_1$ if $r_1 = 0$);
117 1. Let $C'_0, r'_0, C'_1, r'_1 = C_0, r_0, C_1, r_1$ if there is no swapping and $C'_0,
[all …]
/external/skia/site/dev/design/conical/
Dindex.md33 Let two circles be $C_0, r_0$ and $C_1, r_1$ where $C$ is the center and $r$ is the radius. For any
35 is on the linearly interpolated circle with center $C_t = (1-t) \cdot C_0 + t \cdot C_1$ and radius
41 1. $C_0 = C_1$ so the gradient is essentially a simple radial gradient.
46 They are easy to handle so we won't cover them here. From now on, we assume $C_0 \neq C_1$ and $r_0
49 As $r_0 \neq r_1$, we can find a focal point $C_f = (1-f) \cdot C_0 + f \cdot C_1$ where its
53 As $C_0 \neq C_1$, focal point $C_f$ is different from $C_1$ unless $r_1 = 0$. If $r_1 = 0$, we can
54 swap $C_0, r_0$ with $C_1, r_1$, compute swapped gradient $t_s$ as if $r_1 \neq 0$, and finally set
68 always the bigger one (note that $f \neq 1$, otherwise we'll swap $C_0, r_0$ with $C_1, r_1$).
91 3. we still need to handle the swapped case (we swap $C_0, r_0$ with $C_1, r_1$ if $r_1 = 0$);
117 1. Let $C'_0, r'_0, C'_1, r'_1 = C_0, r_0, C_1, r_1$ if there is no swapping and $C'_0,
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/CorrelatedValuePropagation/
Dpointer.ll17 ; CHECK-NEXT: [[C_0:%.*]] = phi i16* [ undef, [[ENTRY:%.*]] ], [ [[CALL6]], [[FOR_END:%.*]] ]