HomeSort by relevance Sort by last modified time
    Searched defs:lb (Results 1 - 25 of 46) sorted by null

1 2

  /bionic/libc/dns/nameser/
ns_samedomain.c 56 size_t la, lb, i; local
61 lb = strlen(b);
80 if (lb != 0U && b[lb - 1] == '.') {
82 /* note this loop doesn't get executed if lb==1 */
83 for (i = lb - 1; i > 0; i--)
92 lb--;
95 /* lb == 0 means 'b' is the root domain, so 'a' must be in 'b'. */
96 if (lb == 0U)
100 if (lb > la
    [all...]
  /external/libcxx/test/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.pconst/
eval.pass.cpp 57 I lb = std::lower_bound(u.begin(), u.end(), b[i]); local
59 const size_t Ni = ub - lb;
65 double mean = std::accumulate(lb, ub, 0.0) / Ni;
69 for (I j = lb; j != ub; ++j)
117 I lb = std::lower_bound(u.begin(), u.end(), b[i]);
119 const size_t Ni = ub - lb;
125 double mean = std::accumulate(lb, ub, 0.0) / Ni;
129 for (I j = lb; j != ub; ++j)
177 I lb = std::lower_bound(u.begin(), u.end(), b[i]);
179 const size_t Ni = ub - lb;
    [all...]
eval_param.pass.cpp 59 I lb = std::lower_bound(u.begin(), u.end(), b[i]); local
61 const size_t Ni = ub - lb;
67 double mean = std::accumulate(lb, ub, 0.0) / Ni;
71 for (I j = lb; j != ub; ++j)
  /external/openssl/crypto/bn/
bn_shift.c 137 int i,nw,lb,rb; local
147 lb=n%BN_BITS2;
148 rb=BN_BITS2-lb;
152 if (lb == 0)
160 t[nw+i]=(l<<lb)&BN_MASK2;
173 int i,j,nw,lb,rb; local
182 lb=BN_BITS2-rb;
217 *(t++) =(tmp|(l<<lb))&BN_MASK2;
  /art/compiler/dex/
global_value_numbering.cc 157 auto lb = field_index_map_.lower_bound(key); local
158 if (lb != field_index_map_.end() && !field_index_map_.key_comp()(key, lb->first)) {
159 return lb->second;
163 auto it = field_index_map_.PutBefore(lb, key, id);
171 auto lb = array_location_map_.lower_bound(key); local
172 if (lb != array_location_map_.end() && !cmp(key, lb->first)) {
173 return lb->second;
177 auto it = array_location_map_.PutBefore(lb, key, location)
    [all...]
global_value_numbering.h 88 ValueMap::iterator lb = global_value_map_.lower_bound(key); local
89 if (lb != global_value_map_.end() && lb->first == key) {
90 res = lb->second;
93 global_value_map_.PutBefore(lb, key, res);
177 auto lb = ref_set_map_.lower_bound(ref_set); local
178 if (lb != ref_set_map_.end() && !ref_set_map_.key_comp()(ref_set, lb->first)) {
179 res = lb->second;
182 ref_set_map_.PutBefore(lb, ref_set, res)
    [all...]
local_value_numbering.h 113 auto lb = map->find(s_reg); local
114 if (lb != map->end()) {
115 res = lb->second;
  /external/chromium_org/third_party/boringssl/src/crypto/bn/
shift.c 62 int i, nw, lb, rb; local
71 lb = n % BN_BITS2;
72 rb = BN_BITS2 - lb;
76 if (lb == 0) {
84 t[nw + i] = (l << lb) & BN_MASK2;
126 int i, j, nw, lb, rb; local
132 lb = BN_BITS2 - rb;
163 *(t++) = (tmp | (l << lb)) & BN_MASK2;
  /external/e2fsprogs/util/
copy_sparse.c 93 long lb, i, fd, ofd, bs, block, numblocks; local
147 for (lb = 0; !fd || lb < numblocks; lb++) {
149 block = get_bmap(fd, lb);
152 should_be = ((off64_t) lb) * bs;
  /external/openssl/crypto/cmac/
cmac.c 263 int i, bl, lb; local
274 lb = ctx->nlast_block;
276 if (lb == bl)
283 ctx->last_block[lb] = 0x80;
284 if (bl - lb > 1)
285 memset(ctx->last_block + lb + 1, 0, bl - lb - 1);
  /bionic/libm/upstream-freebsd/lib/msun/src/
s_fma.c 140 double ha, hb, la, lb, p, q; local
150 lb = b - hb;
153 q = ha * lb + la * hb;
156 ret.lo = p - ret.hi + q + la * lb;
s_fmal.c 136 long double ha, hb, la, lb, p, q; local
146 lb = b - hb;
149 q = ha * lb + la * hb;
152 ret.lo = p - ret.hi + q + la * lb;
  /external/chromium_org/third_party/yasm/source/patched-yasm/tools/re2c/
dfa.c 30 void printSpan(FILE *o, unsigned int lb, unsigned int ub){
31 if(lb > ub)
34 if((ub - lb) == 1){
35 prtCh(o, lb);
37 prtCh(o, lb);
45 Span_show(Span *s, FILE *o, unsigned int lb)
48 printSpan(o, lb, s->ub);
56 unsigned int lb, i; local
61 lb = 0;
63 lb = Span_show(&s->go.span[i], o, lb)
    [all...]
actions.c 109 for(c = r->lb; c < r->ub; ++c)
159 for(c = r->lb; c < r->ub; ++c){
247 for(c = r->lb; c < r->ub; ++c){
338 if((r->ub - r->lb) == 1){
339 prtCh(o, r->lb);
341 prtCh(o, r->lb);
352 if(r1->lb <= r2->lb){
360 if(r1->lb <= r2->lb){
398 unsigned int lb = r1->lb; local
495 unsigned char lb = unescape(s), ub; local
    [all...]
re.h 29 unsigned int lb, ub; /* [lb,ub) */ member in struct:Range
36 r->lb = l;
45 r->lb = l;
54 ro->lb = r->lb;
63 ro->lb = r->lb;
171 RegExp_new_CloseVOp(RegExp *e, int lb, int ub)
176 r->d.CloseVOp.min = lb;
    [all...]
  /external/chromium_org/ui/views/controls/button/
menu_button.cc 92 gfx::Rect lb = GetLocalBounds(); local
96 gfx::Point menu_position(lb.right(), lb.bottom());
98 menu_position.set_x(lb.x());
  /external/clang/test/CodeGen/
asm.c 177 unsigned int lb = b; local
180 __asm__ ("0:\n1:\n" : [bigres] "=la"(bigres) : [la] "0"(la), [lb] "c"(lb) :
189 unsigned int lb = b; local
191 __asm__ ("0:\n1:\n" : [res] "=la"(res) : [la] "0"(la), [lb] "c"(lb) :
  /external/iproute2/tc/
q_netem.c 538 struct rtattr *lb[NETEM_LOSS_MAX + 1]; local
540 parse_rtattr_nested(lb, NETEM_LOSS_MAX, tb[TCA_NETEM_LOSS]);
541 if (lb[NETEM_LOSS_GI])
542 gemodel = RTA_DATA(lb[NETEM_LOSS_GI]);
543 if (lb[NETEM_LOSS_GE])
544 gemodel = RTA_DATA(lb[NETEM_LOSS_GE]);
  /external/openfst/src/include/fst/
interval-set.h 107 typename vector<Interval>::const_iterator lb = local
109 if (lb == intervals_.begin())
111 return (--lb)->end > value;
  /external/openssl/crypto/bio/
bio_lib.c 422 BIO *lb; local
425 lb=b;
426 while (lb->next_bio != NULL)
427 lb=lb->next_bio;
428 lb->next_bio=bio;
430 bio->prev_bio=lb;
432 BIO_ctrl(b,BIO_CTRL_PUSH,0,lb);
  /external/ceres-solver/internal/ceres/
problem_impl.cc 116 ParameterMap::iterator lb = parameter_block_map_.lower_bound(values); local
118 // If lb is not the first block, check the previous block for aliasing.
119 if (lb != parameter_block_map_.begin()) {
120 ParameterMap::iterator previous = lb;
128 // If lb is not off the end, check lb for aliasing.
129 if (lb != parameter_block_map_.end()) {
130 CheckForNoAliasing(lb->first,
131 lb->second->Size(),
    [all...]
  /external/chromium_org/third_party/icu/source/tools/toolutil/
ucm.c 127 const uint8_t *lb, *rb; local
156 lb=UCM_GET_BYTES(lTable, l);
161 result=lb[i]-rb[i];
    [all...]
  /external/chromium_org/third_party/skia/experimental/Intersection/
NearestPoint.cpp 133 int i, j, k, m, n, ub, lb; variable
176 lb = MAX(0, k - m);
178 for (i = lb; i <= ub; i++) {
  /external/chromium_org/third_party/skia/third_party/lua/src/
loadlib.c 170 char *lb; local
173 if (n == 0 || n == nsize || (lb = strrchr(buff, '\\')) == NULL)
176 *lb = '\0';
  /external/icu/icu4c/source/tools/toolutil/
ucm.c 127 const uint8_t *lb, *rb; local
156 lb=UCM_GET_BYTES(lTable, l);
161 result=lb[i]-rb[i];
    [all...]

Completed in 822 milliseconds

1 2