/external/deqp/modules/gles3/performance/ |
es3pStateChangeCallTests.cpp | 39 : TestCaseGroup(context, "state_change_only", "Test cost of state change calls without rendering anything") 219 ADD_ARG_CASE1(enable, "Test cost of glEnable() calls", 237 ADD_ARG_CASE1(disable, "Test cost of glDisable() calls", 255 ADD_ARG_CASE1(depth_func, "Test cost of glDepthFunc() calls", 270 ADD_ARG_CASE1(depth_mask, "Test cost of glDepthMask() calls", 279 ADD_ARG_CASE1(stencil_mask, "Test cost of glStencilMask() calls", 288 ADD_ARG_CASE1(clear_depth, "Test cost of glClearDepth() calls", 298 ADD_ARG_CASE1(clear_stencil, "Test cost of glClearStencil() calls", 308 ADD_ARG_CASE1(line_width, "Test cost of glLineWidth() calls", 318 ADD_ARG_CASE1(cull_face, "Test cost of glCullFace() calls" [all...] |
/external/llvm/utils/PerfectShuffle/ |
PerfectShuffle.cpp | 89 unsigned Cost; // Number of instrs used to generate this value. 92 ShuffleVal() : Cost(1000000) {} 108 unsigned Cost; 111 unsigned cost = 1) 112 : Name(name), ShuffleMask(shufflemask), OpNum(opnum),Cost(cost) { 125 unsigned getCost() const { return Cost; } 153 assert(0 && "bad zero cost operation"); 164 if (ShufTab[ShufTab[ThisOp].Arg0].Cost == 0) { 178 if (ShufTab[ShufTab[ThisOp].Arg1].Cost == 0) [all...] |
/external/webrtc/webrtc/modules/rtp_rtcp/source/ |
vp8_partition_aggregator.cc | 32 // If |this_size_| > INT_MAX, Cost() and CreateChildren() won't work properly. 51 int PartitionTreeNode::Cost(size_t penalty) { 52 int cost = 0; local 55 cost = std::max(max_parent_size_, this_size_int()) - 58 cost = std::max(max_parent_size_, this_size_int()) - min_parent_size_; 60 return cost + NumPackets() * penalty; 125 if (left->Cost(penalty) <= right->Cost(penalty)) { 133 if (second->Cost(penalty) <= first->Cost(penalty)) 249 size_t cost = 0; local [all...] |
/external/ceres-solver/include/ceres/ |
conditioned_cost_function.h | 31 // This file contains a cost function that can apply a transformation to 47 // values of a wrapped cost function. An example where this is useful is 48 // where you have an existing cost function that produces N values, but you 49 // want the total cost to be something other than just the sum of these 51 // values, to change their contribution to the cost. 60 // // Make N 1x1 cost functions (1 parameter, 1 residual) 76 // Builds a cost function based on a wrapped cost function, and a 77 // per-residual conditioner. Takes ownership of all of the wrapped cost
|
/external/deqp/modules/gles2/performance/ |
es2pStateChangeCallTests.cpp | 39 : TestCaseGroup(context, "state_change_only", "Test cost of state change calls without rendering anything") 188 ADD_ARG_CASE1(enable, "Test cost of glEnable() calls", 204 ADD_ARG_CASE1(disable, "Test cost of glDisable() calls", 220 ADD_ARG_CASE1(depth_func, "Test cost of glDepthFunc() calls", 235 ADD_ARG_CASE1(depth_mask, "Test cost of glDepthMask() calls", 244 ADD_ARG_CASE1(stencil_mask, "Test cost of glStencilMask() calls", 253 ADD_ARG_CASE1(clear_depth, "Test cost of glClearDepth() calls", 263 ADD_ARG_CASE1(clear_stencil, "Test cost of glClearStencil() calls", 273 ADD_ARG_CASE1(line_width, "Test cost of glLineWidth() calls", 283 ADD_ARG_CASE1(cull_face, "Test cost of glCullFace() calls" [all...] |
/external/llvm/test/Analysis/CostModel/AMDGPU/ |
extractelement.ll | 1 ; RUN: opt -cost-model -analyze -mtriple=amdgcn-unknown-amdhsa < %s | FileCheck %s 4 ; CHECK: estimated cost of 0 for {{.*}} extractelement <2 x i32> 13 ; CHECK: estimated cost of 0 for {{.*}} extractelement <2 x float> 22 ; CHECK: estimated cost of 0 for {{.*}} extractelement <3 x i32> 31 ; CHECK: estimated cost of 0 for {{.*}} extractelement <4 x i32> 40 ; CHECK: estimated cost of 0 for {{.*}} extractelement <8 x i32> 50 ; CHECK: estimated cost of 2 for {{.*}} extractelement <8 x i32> 59 ; CHECK: estimated cost of 0 for {{.*}} extractelement <2 x i64> 68 ; CHECK: estimated cost of 0 for {{.*}} extractelement <3 x i64> 77 ; CHECK: estimated cost of 0 for {{.*}} extractelement <4 x i64 [all...] |
/external/iproute2/ip/ |
iplink_bridge_slave.c | 25 "Usage: ... bridge_slave [ state STATE ] [ priority PRIO ] [cost COST ]\n" 75 fprintf(f, "cost %d ", 123 __u32 cost; local 136 } else if (matches(*argv, "cost") == 0) { 138 if (get_u32(&cost, *argv, 0)) 139 invarg("cost is invalid", *argv); 140 addattr32(n, 1024, IFLA_BRPORT_COST, cost);
|
/frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/reference/vc/m4p10/src/ |
armVCM4P10_CompareMotionCostToMV.c | 81 * Performs comparision of motion vectors and Motion cost to decide the 92 * [in] nLamda Lamda factor; used to compute motion cost 93 * [in] *pBestCost Contains the current best motion cost. 94 * [out] *pBestCost pBestCost Motion cost will be associated with the best MV 97 * than the best cost passed then the *pBestCost will be equal to candCost 101 * OMX_INT -- 1 to indicate that the current motion cost is the best 102 * 0 to indicate that it is NOT the best motion cost 121 /* Motion cost = SAD + lamda * ((bitsused(diffMVx) + (bitsused(diffMVy))*/
|
/development/ndk/platforms/android-3/include/linux/netfilter/ |
xt_limit.h | 23 u_int32_t credit_cap, cost; member in struct:xt_rateinfo
|
/external/kernel-headers/original/uapi/linux/netfilter_bridge/ |
ebt_limit.h | 21 __u32 credit_cap, cost; member in struct:ebt_limit_info
|
/external/opencv3/modules/cudastereo/src/cuda/ |
disparity_bilateral_filter.cu | 102 float cost[] = {0.0f, 0.0f, 0.0f, 0.0f, 0.0f}; 120 cost[0] += ::min(cmax_disc, ::abs(disp_reg - dp[0])) * weight; 121 cost[1] += ::min(cmax_disc, ::abs(disp_reg - dp[1])) * weight; 122 cost[2] += ::min(cmax_disc, ::abs(disp_reg - dp[2])) * weight; 123 cost[3] += ::min(cmax_disc, ::abs(disp_reg - dp[3])) * weight; 124 cost[4] += ::min(cmax_disc, ::abs(disp_reg - dp[4])) * weight; 131 if (cost[0] < minimum) 133 minimum = cost[0]; 136 if (cost[1] < minimum) 138 minimum = cost[1] [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/linux/netfilter_bridge/ |
ebt_limit.h | 20 u_int32_t credit_cap, cost; member in struct:ebt_limit_info
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/linux/netfilter_bridge/ |
ebt_limit.h | 21 __u32 credit_cap, cost; member in struct:ebt_limit_info
|
/prebuilts/ndk/current/platforms/android-12/arch-arm/usr/include/linux/netfilter/ |
xt_limit.h | 23 u_int32_t credit_cap, cost; member in struct:xt_rateinfo
|
/prebuilts/ndk/current/platforms/android-12/arch-mips/usr/include/linux/netfilter/ |
xt_limit.h | 23 u_int32_t credit_cap, cost; member in struct:xt_rateinfo
|
/prebuilts/ndk/current/platforms/android-12/arch-x86/usr/include/linux/netfilter/ |
xt_limit.h | 23 u_int32_t credit_cap, cost; member in struct:xt_rateinfo
|
/prebuilts/ndk/current/platforms/android-13/arch-arm/usr/include/linux/netfilter/ |
xt_limit.h | 23 u_int32_t credit_cap, cost; member in struct:xt_rateinfo
|
/prebuilts/ndk/current/platforms/android-13/arch-mips/usr/include/linux/netfilter/ |
xt_limit.h | 23 u_int32_t credit_cap, cost; member in struct:xt_rateinfo
|
/prebuilts/ndk/current/platforms/android-13/arch-x86/usr/include/linux/netfilter/ |
xt_limit.h | 23 u_int32_t credit_cap, cost; member in struct:xt_rateinfo
|
/prebuilts/ndk/current/platforms/android-14/arch-arm/usr/include/linux/netfilter/ |
xt_limit.h | 23 u_int32_t credit_cap, cost; member in struct:xt_rateinfo
|
/prebuilts/ndk/current/platforms/android-14/arch-mips/usr/include/linux/netfilter/ |
xt_limit.h | 23 u_int32_t credit_cap, cost; member in struct:xt_rateinfo
|
/prebuilts/ndk/current/platforms/android-14/arch-x86/usr/include/linux/netfilter/ |
xt_limit.h | 23 u_int32_t credit_cap, cost; member in struct:xt_rateinfo
|
/prebuilts/ndk/current/platforms/android-15/arch-arm/usr/include/linux/netfilter/ |
xt_limit.h | 23 u_int32_t credit_cap, cost; member in struct:xt_rateinfo
|
/prebuilts/ndk/current/platforms/android-15/arch-mips/usr/include/linux/netfilter/ |
xt_limit.h | 23 u_int32_t credit_cap, cost; member in struct:xt_rateinfo
|
/prebuilts/ndk/current/platforms/android-15/arch-x86/usr/include/linux/netfilter/ |
xt_limit.h | 23 u_int32_t credit_cap, cost; member in struct:xt_rateinfo
|