| /external/sfntly/cpp/src/sfntly/data/ |
| D | memory_byte_array.cc | 24 : ByteArray(0, length), b_(NULL), allocated_(true) { in MemoryByteArray()
28 : ByteArray(filled_length, filled_length), b_(b), allocated_(false) { in MemoryByteArray()
40 os->Write(b_, offset, length); in CopyTo()
45 if (allocated_ && b_ == NULL) { in Init()
46 b_ = new byte_t[Size()]; in Init()
47 memset(b_, 0, Size()); in Init()
53 b_[index] = b; in InternalPut()
62 memcpy(b_ + index, b + offset, length); in InternalPut()
68 return b_[index]; in InternalGet()
77 memcpy(b + offset, b_ + index, length); in InternalGet()
[all …]
|
| D | growable_memory_byte_array.cc | 38 os->Write(&b_, offset, length); in CopyTo()
43 if ((size_t)index >= b_.size()) { in InternalPut()
44 b_.resize((size_t)(index + 1)); in InternalPut()
46 b_[index] = b; in InternalPut()
53 if ((size_t)index + length >= b_.size()) { in InternalPut()
56 b_.resize((size_t)(index + length + 1)); in InternalPut()
58 std::copy(b + offset, b + offset + length, b_.begin() + index); in InternalPut()
63 return b_[index]; in InternalGet()
70 memcpy(b + offset, &(b_[0]) + index, length); in InternalGet()
75 b_.clear(); in Close()
[all …]
|
| /external/freetype/src/base/ |
| D | ftcalc.c | 177 FT_Long b_, in FT_MulDiv() argument
186 FT_MOVE_SIGN( b_, s ); in FT_MulDiv()
190 b = (FT_UInt64)b_; in FT_MulDiv()
206 FT_Long b_, in FT_MulDiv_No_Round() argument
215 FT_MOVE_SIGN( b_, s ); in FT_MulDiv_No_Round()
219 b = (FT_UInt64)b_; in FT_MulDiv_No_Round()
235 FT_Long b_ ) in FT_MulFix() argument
239 return FT_MULFIX_ASSEMBLER( a_, b_ ); in FT_MulFix()
249 FT_MOVE_SIGN( b_, s ); in FT_MulFix()
252 b = (FT_UInt64)b_; in FT_MulFix()
[all …]
|
| /external/ceres-solver/include/ceres/ |
| D | loss_function.h | 177 explicit HuberLoss(double a) : a_(a), b_(a * a) { } in HuberLoss()
183 const double b_; variable
193 explicit SoftLOneLoss(double a) : b_(a * a), c_(1 / b_) { } in SoftLOneLoss()
198 const double b_;
210 explicit CauchyLoss(double a) : b_(a * a), c_(1 / b_) { } in CauchyLoss()
215 const double b_;
231 explicit ArctanLoss(double a) : a_(a), b_(1 / (a * a)) { } in ArctanLoss()
237 const double b_; variable
274 const double a_, b_, c_;
|
| /external/ceres-solver/internal/ceres/ |
| D | loss_function.cc | 47 if (s > b_) { in Evaluate()
51 rho[0] = 2.0 * a_ * r - b_; in Evaluate()
66 rho[0] = 2.0 * b_ * (tmp - 1.0); in Evaluate()
75 rho[0] = b_ * log(sum); in Evaluate()
81 const double sum = 1 + s * s * b_; in Evaluate()
86 rho[2] = -2.0 * s * b_ * (inv * inv); in Evaluate()
91 b_(b), in TolerantLoss()
98 const double x = (s - a_) / b_; in Evaluate()
110 rho[0] = b_ * log(1.0 + e_x) - c_; in Evaluate()
112 rho[2] = 0.5 / (b_ * (1.0 + cosh(x))); in Evaluate()
|
| D | normal_prior.cc | 43 : A_(A), b_(b) { in NormalPrior()
44 CHECK_GT(b_.rows(), 0); in NormalPrior()
46 CHECK_EQ(b_.rows(), A.cols()); in NormalPrior()
48 mutable_parameter_block_sizes()->push_back(b_.rows()); in NormalPrior()
59 r = A_ * (p - b_).eval(); in Evaluate()
|
| D | iterative_schur_complement_solver_test.cc | 67 b_.reset(problem->b.release()); in SetUpProblem()
90 qr->Solve(&dense_A, b_.get(), per_solve_options, reference_solution.data()); in TestSolver()
100 isc.Solve(A_.get(), b_.get(), per_solve_options, isc_sol.data()); in TestSolver()
115 scoped_array<double> b_; member in ceres::internal::IterativeSchurComplementSolverTest
|
| D | implicit_schur_complement_test.cc | 63 b_.reset(problem->b.release()); in SetUp()
97 eliminator->Eliminate(A_.get(), b_.get(), D, &blhs, rhs->data()); in ReducedLinearSystemAndSolution()
113 eliminator->BackSubstitute(A_.get(), b_.get(), D, in ReducedLinearSystemAndSolution()
127 isc.Init(*A_, D, b_.get()); in TestImplicitSchurComplement()
183 scoped_array<double> b_; member in ceres::internal::ImplicitSchurComplementTest
|
| D | implicit_schur_complement.cc | 49 b_(NULL) { in ImplicitSchurComplement()
65 b_ = b; in Init()
179 tmp_rows_ = ConstVectorRef(b_, num_rows) - tmp_rows_; in BackSubstitute()
206 A_->LeftMultiplyE(b_, tmp_e_cols_.data()); in UpdateRhs()
217 tmp_rows_ = ConstVectorRef(b_, A_->num_rows()) - tmp_rows_; in UpdateRhs()
|
| D | conditioned_cost_function_test.cc | 49 LinearCostFunction(double a, double b) : a_(a), b_(b) { in LinearCostFunction()
57 *residuals = **parameters * a_ + b_; in Evaluate()
66 const double a_, b_; member in ceres::internal::LinearCostFunction
|
| D | unsymmetric_linear_solver_test.cc | 53 b_.reset(problem->b.release()); in SetUp()
92 b_.get(), in TestSolver()
102 b_.get(), in TestSolver()
127 scoped_array<double> b_; member in ceres::internal::UnsymmetricLinearSolverTest
|
| /external/protobuf/src/google/protobuf/stubs/ |
| D | common_unittest.cc | 174 void SetABMethod(int a, const char* b) { a_ = a; b_ = b; } in SetABMethod()
177 current_instance_->b_ = b; in SetABFunction()
183 b_ = NULL; in SetUp()
193 const char* b_; member in google::protobuf::__anonea0b845c0111::ClosureTest
251 EXPECT_NE(cstr, b_); in TEST_F()
254 EXPECT_EQ(cstr, b_); in TEST_F()
262 EXPECT_NE(cstr, b_); in TEST_F()
265 EXPECT_EQ(cstr, b_); in TEST_F()
320 EXPECT_NE(cstr, b_); in TEST_F()
323 EXPECT_EQ(cstr, b_); in TEST_F()
[all …]
|
| /external/pdfium/third_party/freetype/src/base/ |
| D | ftcalc.c | 174 FT_Long b_, in FT_MulDiv() argument
183 FT_MOVE_SIGN( b_, s ); in FT_MulDiv()
187 b = (FT_UInt64)b_; in FT_MulDiv()
203 FT_Long b_, in FT_MulDiv_No_Round() argument
212 FT_MOVE_SIGN( b_, s ); in FT_MulDiv_No_Round()
216 b = (FT_UInt64)b_; in FT_MulDiv_No_Round()
232 FT_Long b_ ) in FT_MulFix() argument
236 return FT_MULFIX_ASSEMBLER( a_, b_ ); in FT_MulFix()
240 FT_Int64 ab = (FT_Int64)a_ * (FT_Int64)b_; in FT_MulFix()
253 FT_Long b_ ) in FT_DivFix() argument
[all …]
|
| /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/base/ |
| D | ftcalc.c | 174 FT_Long b_, in FT_MulDiv() argument
183 FT_MOVE_SIGN( b_, s ); in FT_MulDiv()
187 b = (FT_UInt64)b_; in FT_MulDiv()
203 FT_Long b_, in FT_MulDiv_No_Round() argument
212 FT_MOVE_SIGN( b_, s ); in FT_MulDiv_No_Round()
216 b = (FT_UInt64)b_; in FT_MulDiv_No_Round()
232 FT_Long b_ ) in FT_MulFix() argument
236 return FT_MULFIX_ASSEMBLER( a_, b_ ); in FT_MulFix()
240 FT_Int64 ab = (FT_Int64)a_ * (FT_Int64)b_; in FT_MulFix()
253 FT_Long b_ ) in FT_DivFix() argument
[all …]
|
| /external/bzip2/ |
| D | bzip2.1.preformatted | 19 _b_z_i_p_2 compresses files using the Burrows‐Wheeler block
29 _b_z_i_p_2 expects a list of file names to accompany the com
41 _b_z_i_p_2 and _b_u_n_z_i_p_2 will by default not overwrite existing
44 If no file names are specified, _b_z_i_p_2 compresses from
45 standard input to standard output. In this case, _b_z_i_p_2
50 _b_u_n_z_i_p_2 (or _b_z_i_p_2 _−_d_) decompresses all specified files.
51 Files which were not created by _b_z_i_p_2 will be detected and
52 ignored, and a warning issued. _b_z_i_p_2 attempts to guess
63 …_._b_z_2_, _._b_z_, _._t_b_z_2 or _._t_b_z_, _b_z_i_p_2 complains that i…
70 _b_u_n_z_i_p_2 will correctly decompress a file which is the con
[all …]
|
| /external/clang/test/Analysis/ |
| D | temp-obj-dtors-cfg-output.cpp | 57 C():b_(true) {} in C()
60 operator bool() { return b_; } in operator bool()
61 bool b_; member
65 D():b_(true) {} in D()
67 operator bool() { return b_; } in operator bool()
68 bool b_; member
|
| /external/libnl/lib/ |
| D | data.c | 177 void *b_ = nl_data_get(b); in nl_data_cmp() local
179 if (a_ && b_) in nl_data_cmp()
180 return memcmp(a_, b_, nl_data_get_size(a)); in nl_data_cmp()
|
| /external/vulkan-validation-layers/tests/gtest-1.7.0/test/ |
| D | gtest-tuple_test.cc | 265 b_(1, 0, 0, 0, 0, 0, 0, 0, 0, 3) {} in BigTupleTest()
267 BigTuple a_, b_; member in __anonf5d0d18b0111::BigTupleTest
273 BigTuple b(b_); in TEST_F()
292 EXPECT_TRUE(a_ != b_); in TEST_F()
293 EXPECT_FALSE(a_ == b_); in TEST_F()
|
| /external/google-breakpad/src/testing/gtest/test/ |
| D | gtest-tuple_test.cc | 265 b_(1, 0, 0, 0, 0, 0, 0, 0, 0, 3) {} in BigTupleTest()
267 BigTuple a_, b_; member in __anon0aff664a0111::BigTupleTest
273 BigTuple b(b_); in TEST_F()
292 EXPECT_TRUE(a_ != b_); in TEST_F()
293 EXPECT_FALSE(a_ == b_); in TEST_F()
|
| /external/protobuf/gtest/test/ |
| D | gtest-tuple_test.cc | 265 b_(1, 0, 0, 0, 0, 0, 0, 0, 0, 3) {} in BigTupleTest()
267 BigTuple a_, b_; member in __anonedc391730111::BigTupleTest
273 BigTuple b(b_); in TEST_F()
292 EXPECT_TRUE(a_ != b_); in TEST_F()
293 EXPECT_FALSE(a_ == b_); in TEST_F()
|
| /external/gtest/test/ |
| D | gtest-tuple_test.cc | 265 b_(1, 0, 0, 0, 0, 0, 0, 0, 0, 3) {} in BigTupleTest()
267 BigTuple a_, b_; member in __anon340667730111::BigTupleTest
273 BigTuple b(b_); in TEST_F()
292 EXPECT_TRUE(a_ != b_); in TEST_F()
293 EXPECT_FALSE(a_ == b_); in TEST_F()
|
| /external/jemalloc/test/include/test/ |
| D | test.h | 5 t b_ = (b); \
6 if (!(a_ cmp b_)) { \
14 #a, #b, a_, b_); \
215 bool b_ = (b); \
216 if (!(a_ == b_)) { \
224 b_ ? "true" : "false"); \
231 bool b_ = (b); \
232 if (!(a_ != b_)) { \
240 b_ ? "true" : "false"); \
|
| /external/llvm/test/CodeGen/Mips/ |
| D | seteq.ll | 16 ; 16: xor $[[REGISTER:[0-9A-Ba-b_]+]], ${{[0-9]+}}
17 ; 16: sltiu $[[REGISTER:[0-9A-Ba-b_]+]], 1
|
| D | seteqz.ll | 20 ; 16: xor $[[REGISTER:[0-9A-Ba-b_]+]], ${{[0-9]+}}
21 ; 16: sltiu $[[REGISTER:[0-9A-Ba-b_]+]], 1
|
| /external/clang/test/Sema/ |
| D | warn-thread-safety-analysis.c | 46 int *b_ PT_GUARDED_BY(foo_.mu_) = &a_;
105 …get_value(b_); // expected-warning{{calling function 'get_value' requires holding mutex 'foo_.mu_'… in main()
110 (void)(get_value(b_) == 1); in main()
|