Searched defs:ub (Results 1 - 25 of 37) sorted by relevance

12

/external/openssh/openbsd-compat/regress/
H A Dstrtonumtest.c41 test(const char *p, long long lb, long long ub, int ok) argument
46 val = strtonum(p, lb, ub, &q);
48 fprintf(stderr, "%s [%lld-%lld] ", p, lb, ub);
52 fprintf(stderr, "%s [%lld-%lld] %lld ", p, lb, ub, val);
/external/libcxx/test/std/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.pconst/
H A Deval.pass.cpp61 I ub = std::lower_bound(u.begin(), u.end(), b[i+1]); local
62 const size_t Ni = ub - lb;
68 double mean = std::accumulate(lb, ub, 0.0) / Ni;
72 for (I j = lb; j != ub; ++j)
124 I ub = std::lower_bound(u.begin(), u.end(), b[i+1]);
125 const size_t Ni = ub - lb;
131 double mean = std::accumulate(lb, ub, 0.0) / Ni;
135 for (I j = lb; j != ub; ++j)
187 I ub = std::lower_bound(u.begin(), u.end(), b[i+1]);
188 const size_t Ni = ub
[all...]
H A Deval_param.pass.cpp64 I ub = std::lower_bound(u.begin(), u.end(), b[i+1]); local
65 const size_t Ni = ub - lb;
71 double mean = std::accumulate(lb, ub, 0.0) / Ni;
75 for (I j = lb; j != ub; ++j)
/external/swiftshader/third_party/LLVM/lib/Target/Alpha/
H A DAlphaLLRP.cpp57 bool ub = false; local
128 ub = true;
137 if (ub || AlignAll) {
/external/deqp/modules/glshared/
H A DglsRandomUniformBlockCase.hpp40 namespace ub namespace in namespace:deqp::gls
63 } // ub
81 void generateUniform (de::Random& rnd, ub::UniformBlock& block);
82 ub::VarType generateType (de::Random& rnd, int typeDepth, bool arrayOk);
H A DglsUniformBlockCase.hpp41 namespace ub namespace in namespace:deqp::gls
233 } // ub
252 bool compareStd140Blocks (const ub::UniformLayout& refLayout, const ub::UniformLayout& cmpLayout) const;
253 bool compareSharedBlocks (const ub::UniformLayout& refLayout, const ub::UniformLayout& cmpLayout) const;
254 bool compareTypes (const ub::UniformLayout& refLayout, const ub::UniformLayout& cmpLayout) const;
255 bool checkLayoutIndices (const ub::UniformLayout& layout) const;
256 bool checkLayoutBounds (const ub
[all...]
H A DglsUniformBlockCase.cpp53 namespace ub namespace in namespace:deqp::gls
1374 } // ub
1376 using namespace ub;
H A DglsVertexArrayTests.hpp389 explicit GLValue (Ubyte value) : type(Array::INPUTTYPE_UNSIGNED_BYTE), ub(value) {}
410 Ubyte ub; member in union:deqp::gls::GLValue::__anon4872
/external/mesa3d/src/gallium/auxiliary/util/
H A Du_pack_color.h52 ubyte ub; member in union:util_color
119 uc->ub = a;
125 uc->ub = r;
260 ubyte p = uc->ub;
267 ubyte p = uc->ub;
274 ubyte p = uc->ub;
402 uc->ub = a;
408 uc->ub = r;
H A Du_sse.h76 ubyte ub[16]; member in union:m128i
83 union { __m128i m; ubyte ub[16]; } u; member in union:__anon14523
104 u.ub[0], u.ub[1], u.ub[2], u.ub[3],
105 u.ub[4], u.ub[5], u.ub[6], u.ub[
[all...]
H A Du_math.h528 ubyte_to_float(ubyte ub) argument
530 return (float) ub * (1.0f / 255.0f);
/external/openssh/openbsd-compat/
H A Dbsd-misc.c110 struct utimbuf ub; local
112 ub.actime = tvp[0].tv_sec;
113 ub.modtime = tvp[1].tv_sec;
115 return (utime(filename, &ub));
/external/valgrind/drd/tests/
H A Dunit_bitmap.c201 const Addr ub = make_address(2, 0) + 2 * BITS_PER_UWORD; local
210 for (i = lb; i < ub; i += outer_loop_step)
212 for (j = i + ADDR_GRANULARITY; j < ub; j += inner_loop_step)
276 for (j = i + 1; j < ub; j += inner_loop_step)
/external/valgrind/mpi/
H A Dmpiwrap_type_test.c122 MPI_Aint lb, ub, ex; local
149 r = MPI_Type_ub( *tyP, &ub );
153 printf("sendToMyself: ex=%d (%d,%d)\n", (int)ex, (int)lb, (int)ub);
157 sbuf = malloc(ub);
159 for (i = 0; i < ub; i++)
166 rbuf = malloc(ub);
168 for (i = 0; i < ub; i++)
180 rbuf_walk = malloc(ub);
182 for (i = 0; i < ub; i++)
192 for (i = 0; i < ub;
[all...]
/external/clang/test/CodeGen/
H A Dxcore-stringtype.c167 int unionTypeB(union UB ub) {return UnionAnon.A;} argument
/external/openssh/
H A Dge25519.c154 unsigned char ub = b; local
156 unsigned char x = ub ^ uc; /* 0: yes; 1..255: no */
/external/clang/test/CodeGenCXX/
H A Dmangle-exprs.cpp235 Y ub; member in union:test6::Z::__anon2419
261 void f2(decltype(T(z.ub.i))) {}
281 void f6(decltype(T(zp->ub.i))) {}
/external/icu/icu4c/source/i18n/
H A Dnfrs.cpp735 int64_t ub = util64_fromDouble(upperBound); local
739 util64_toa(ub, ubstr, 64);
741 util64_toa(ub, ubstrhex, 64, 16);
742 fprintf(stderr, "ub: %g, i64: %s (%s)\n", upperBound, ubstr, ubstrhex);
746 if ((!fIsFractionRuleSet) && (rules[i]->getBaseValue() >= ub)) {
/external/mesa3d/src/gallium/drivers/nvc0/codegen/
H A Dnv50_ir_lowering_nvc0.cpp322 BasicBlock *ub = u->insn->bb; local
323 if (tb == ub) {
331 &ub->cfg, texCounts);
340 for (size_t j = bbFirstTex.at(ub->getId()); j < texes.size() &&
341 texes[j]->bb == ub && texes[j]->serial < u->insn->serial;
/external/icu/android_icu4j/src/main/java/android/icu/text/
H A DPluralRules.java1577 private static void addRange(StringBuilder result, double lb, double ub, boolean addSeparator) { argument
1581 if (lb == ub) {
1584 result.append(format(lb) + ".." + format(ub));
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
H A DPluralRules.java1531 private static void addRange(StringBuilder result, double lb, double ub, boolean addSeparator) { argument
1535 if (lb == ub) {
1538 result.append(format(lb) + ".." + format(ub));
/external/libedit/src/
H A Dterminal.c1307 const char *ub; local
1309 ub = ct_encode_string(ct_visual_string(
1313 ub = "(empty)";
1316 t->long_name, t->name, ub);
/external/messageformat/java/com/ibm/icu/simple/
H A DPluralRules.java1513 private static void addRange(StringBuilder result, double lb, double ub, boolean addSeparator) { argument
1517 if (lb == ub) {
1520 result.append(format(lb) + ".." + format(ub));
/external/opencv/cxcore/src/
H A Dcxdatastructs.cpp2172 CvSeqReaderPos ub; member in struct:__anon15463
2196 CV_SAVE_READER_POS( right, stack[0].ub );
2201 CV_RESTORE_READER_POS( right, stack[sp].ub );
2412 CV_SAVE_READER_POS( left0, stack[sp].ub );
2419 CV_SAVE_READER_POS( right0, stack[sp].ub );
/external/opencv/ml/src/
H A Dmlsvm.cpp801 double ub = DBL_MAX, lb = -DBL_MAX, sum_free = 0; local
810 ub = MIN(ub,yG);
817 ub = MIN(ub,yG);
828 rho = nr_free > 0 ? sum_free/nr_free : (ub + lb)*0.5;

Completed in 680 milliseconds

12