HomeSort by relevance Sort by last modified time
    Searched defs:at (Results 26 - 50 of 695) sorted by null

12 3 4 5 6 7 8 91011>>

  /external/compiler-rt/test/builtins/Unit/
divti3_test.c 28 twords at; local
29 at.all = a;
38 at.s.high, at.s.low, bt.s.high, bt.s.low, xt.s.high, xt.s.low,
modti3_test.c 28 twords at; local
29 at.all = a;
38 at.s.high, at.s.low, bt.s.high, bt.s.low, xt.s.high, xt.s.low,
muloti4_test.c 30 twords at; local
31 at.all = a;
43 at.s.high, at.s.low, bt.s.high, bt.s.low, xt.s.high, xt.s.low,
49 twords at; local
50 at.all = a;
59 at.s.high, at.s.low, bt.s.high, bt.s.low, xt.s.high, xt.s.low,
multi3_test.c 26 twords at; local
27 at.all = a;
36 at.s.high, at.s.low, bt.s.high, bt.s.low, xt.s.high, xt.s.low,
parityti2_test.c 38 twords at; local
39 at.all = a;
41 at.s.high, at.s.low, x, expected);
popcountti2_test.c 38 twords at; local
39 at.all = a;
41 at.s.high, at.s.low, x, expected);
subvti3_test.c 32 twords at; local
33 at.all = a;
42 at.s.high, at.s.low, bt.s.high, bt.s.low, xt.s.high, xt.s.low,
udivmodti4_test.c 30 utwords at; local
31 at.all = a;
45 at.s.high, at.s.low, bt.s.high, bt.s.low, qt.s.high, qt.s.low,
    [all...]
  /external/compiler-rt/test/tsan/
cond_version.c 19 pthread_condattr_t at; local
25 pthread_condattr_init(&at);
26 pthread_condattr_setclock(&at, CLOCK_MONOTONIC);
27 pthread_cond_init(&c, &at);
  /bionic/libc/dns/include/
resolv_stats.h 6 * You may obtain a copy of the License at
35 time_t at; // time in s at which the sample was recorded member in struct:__res_sample
  /cts/tools/cfassembler/src/dxconvext/util/
FileUtils.java 6 * You may obtain a copy of the License at
76 int at = 0; local
78 int amt = in.read(result, at, length);
82 at += amt;
  /dalvik/dexgen/src/com/android/dexgen/util/
FileUtils.java 6 * You may obtain a copy of the License at
78 int at = 0; local
80 int amt = in.read(result, at, length);
84 at += amt;
  /dalvik/dx/src/com/android/dex/util/
FileUtils.java 6 * You may obtain a copy of the License at
72 int at = 0; local
74 int amt = in.read(result, at, length);
78 at += amt;
  /external/clang/test/SemaCXX/
constexpr-nqueens.cpp 29 constexpr bool at(int Row, int Col) const { function in struct:Board
60 *p == 'o' ? at(Row, Col) && check(p+1, Row, Col+1) :
61 *p == '-' ? !at(Row, Col) && check(p+1, Row, Col+1) :
  /external/guava/guava-tests/test/com/google/common/util/concurrent/
AtomicDoubleTest.java 4 * domain, as explained at
76 AtomicDouble at = new AtomicDouble(1.0); local
77 assertBitEquals(1.0, at.get());
79 at.set(x);
80 assertBitEquals(x, at.get());
88 AtomicDouble at = new AtomicDouble(1.0); local
89 assertBitEquals(1.0, at.get());
91 at.lazySet(x);
92 assertBitEquals(x, at.get());
102 AtomicDouble at = new AtomicDouble(prev) local
119 final AtomicDouble at = new AtomicDouble(1.0); local
139 AtomicDouble at = new AtomicDouble(prev); local
157 AtomicDouble at = new AtomicDouble(prev); local
215 AtomicDouble at = new AtomicDouble(); local
227 AtomicDouble at = new AtomicDouble(); local
239 AtomicDouble at = new AtomicDouble(); local
251 AtomicDouble at = new AtomicDouble(); local
263 AtomicDouble at = new AtomicDouble(); local
275 AtomicDouble at = new AtomicDouble(+0.0); local
    [all...]
  /external/skia/include/ports/
SkRemotableFontMgr.h 41 const SkFontIdentity& at(int index) const { return fData[index]; } function in class:SkRemotableFontIdentitySet
61 * Returns empty if there are no fonts at the given index.
69 * If there are no available fonts at the given index, the return value's
  /external/webrtc/talk/app/webrtc/
jsepicecandidate.h 82 virtual const IceCandidateInterface* at(size_t index) const { function in class:webrtc::JsepCandidateCollection
streamcollection.h 58 virtual MediaStreamInterface* at(size_t index) { function in class:webrtc::StreamCollection
59 return media_streams_.at(index);
  /prebuilts/go/darwin-x86/src/index/suffixarray/
suffixarray.go 15 // offsets2 := index.Lookup(s, 3) // the list of at most 3 indices where s occurs in data
169 func (x *Index) at(i int) []byte { func
178 i := sort.Search(len(x.sa), func(i int) bool { return bytes.Compare(x.at(i), s) >= 0 })
179 // starting at i, find the first index at which s is not a prefix
180 j := i + sort.Search(len(x.sa)-i, func(j int) bool { return !bytes.HasPrefix(x.at(j+i), s) })
184 // Lookup returns an unsorted list of at most n indices where the byte string s
208 // in successive order. Otherwise, at most n matches are returned and
228 // If we don't have enough at the end, redo the search with an
  /prebuilts/go/darwin-x86/src/math/big/
decimal.go 24 // with the most-significant mantissa digit at index 0. For the zero decimal, the
32 // at returns the i'th mantissa digit, starting with the most significant digit at 0.
33 func (d *decimal) at(i int) byte { func
70 s = ntz // shift at most ntz bits
208 // round sets x to (at most) n mantissa digits by rounding it
hilbert_test.go 21 func (a *matrix) at(i, j int) *Rat { func
103 x.Add(x, new(Rat).Mul(a.at(i, k), b.at(k, j)))
117 if a.at(i, j).Cmp(b.at(i, j)) != 0 {
129 s += fmt.Sprintf("\t%s", a.at(i, j))
  /prebuilts/go/linux-x86/src/index/suffixarray/
suffixarray.go 15 // offsets2 := index.Lookup(s, 3) // the list of at most 3 indices where s occurs in data
169 func (x *Index) at(i int) []byte { func
178 i := sort.Search(len(x.sa), func(i int) bool { return bytes.Compare(x.at(i), s) >= 0 })
179 // starting at i, find the first index at which s is not a prefix
180 j := i + sort.Search(len(x.sa)-i, func(j int) bool { return !bytes.HasPrefix(x.at(j+i), s) })
184 // Lookup returns an unsorted list of at most n indices where the byte string s
208 // in successive order. Otherwise, at most n matches are returned and
228 // If we don't have enough at the end, redo the search with an
  /prebuilts/go/linux-x86/src/math/big/
decimal.go 24 // with the most-significant mantissa digit at index 0. For the zero decimal, the
32 // at returns the i'th mantissa digit, starting with the most significant digit at 0.
33 func (d *decimal) at(i int) byte { func
70 s = ntz // shift at most ntz bits
208 // round sets x to (at most) n mantissa digits by rounding it
hilbert_test.go 21 func (a *matrix) at(i, j int) *Rat { func
103 x.Add(x, new(Rat).Mul(a.at(i, k), b.at(k, j)))
117 if a.at(i, j).Cmp(b.at(i, j)) != 0 {
129 s += fmt.Sprintf("\t%s", a.at(i, j))
  /dalvik/dexgen/src/com/android/dexgen/rop/
StdAttributeList.java 6 * You may obtain a copy of the License at
70 int at; local
73 for (at = 0; at < sz; at++) {
74 Attribute att = get(at);
85 for (at++; at < sz; at++) {
86 Attribute att = get(at);
    [all...]

Completed in 791 milliseconds

12 3 4 5 6 7 8 91011>>