| /OK3568_Linux_fs/external/rknpu2/examples/3rdparty/opencv/opencv-linux-aarch64/include/opencv2/flann/ |
| H A D | autotuned_index.h | 325 void optimizeKMeans(std::vector<CostData>& costs) in optimizeKMeans() argument 334 costs.reserve(costs.size() + kmeansParamSpaceSize); in optimizeKMeans() 346 costs.push_back(cost); in optimizeKMeans() 373 void optimizeKDTree(std::vector<CostData>& costs) in optimizeKDTree() argument 387 costs.push_back(cost); in optimizeKDTree() 417 std::vector<CostData> costs; in estimateBuildParams() local 450 costs.push_back(linear_cost); in estimateBuildParams() 455 optimizeKMeans(costs); in estimateBuildParams() 456 optimizeKDTree(costs); in estimateBuildParams() 458 float bestTimeCost = costs[0].searchTimeCost; in estimateBuildParams() [all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/lib/gcc/aarch64-none-linux-gnu/10.3.1/plugin/include/ |
| H A D | ifcvt.h | 98 /* An estimate of the original costs. When optimizing for size, this is the 99 combined cost of COND, JUMP and the costs for THEN_BB and ELSE_BB. 100 When optimizing for speed, we use the costs of COND plus weighted average 101 of the costs for THEN_BB and ELSE_BB, as computed in the next field. */
|
| H A D | ira-int.h | 341 /* Minimal accumulated and updated costs of usage register of the 344 /* Minimal accumulated, and updated costs of memory for the allocno. 345 At the allocation start, the original and updated costs are 387 /* Array of usage costs (accumulated and the one updated during 389 member value can be NULL if all costs are the same and equal to 390 CLASS_COST. For example, the costs of two different hard 396 the allocno class (GENERAL_REGS for x86). We have updated costs 402 /* Array of decreasing costs (accumulated and the one updated during 405 costs are the same. These costs are used to reflect preferences 791 struct costs. */ [all …]
|
| H A D | expmed.h | 1 /* Target-dependent costs for expmed.c. 188 /* Conversion costs are only defined between two scalar integer modes 264 /* Return a pointer to a cost contained in COSTS when a particular 268 expmed_op_cost_ptr (struct expmed_op_costs *costs, bool speed, in expmed_op_cost_ptr() argument 272 return &costs->cost[speed][idx]; in expmed_op_cost_ptr()
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/lib/gcc/arm-none-linux-gnueabihf/10.3.1/plugin/include/ |
| H A D | ifcvt.h | 98 /* An estimate of the original costs. When optimizing for size, this is the 99 combined cost of COND, JUMP and the costs for THEN_BB and ELSE_BB. 100 When optimizing for speed, we use the costs of COND plus weighted average 101 of the costs for THEN_BB and ELSE_BB, as computed in the next field. */
|
| H A D | ira-int.h | 341 /* Minimal accumulated and updated costs of usage register of the 344 /* Minimal accumulated, and updated costs of memory for the allocno. 345 At the allocation start, the original and updated costs are 387 /* Array of usage costs (accumulated and the one updated during 389 member value can be NULL if all costs are the same and equal to 390 CLASS_COST. For example, the costs of two different hard 396 the allocno class (GENERAL_REGS for x86). We have updated costs 402 /* Array of decreasing costs (accumulated and the one updated during 405 costs are the same. These costs are used to reflect preferences 791 struct costs. */ [all …]
|
| H A D | expmed.h | 1 /* Target-dependent costs for expmed.c. 188 /* Conversion costs are only defined between two scalar integer modes 264 /* Return a pointer to a cost contained in COSTS when a particular 268 expmed_op_cost_ptr (struct expmed_op_costs *costs, bool speed, in expmed_op_cost_ptr() argument 272 return &costs->cost[speed][idx]; in expmed_op_cost_ptr()
|
| /OK3568_Linux_fs/kernel/arch/arm64/boot/dts/rockchip/ |
| H A D | rk3399-opp.dtsi | 323 sched-energy-costs = <&RK3399_CPU_COST_0 &RK3399_CLUSTER_COST_0>; 328 sched-energy-costs = <&RK3399_CPU_COST_0 &RK3399_CLUSTER_COST_0>; 333 sched-energy-costs = <&RK3399_CPU_COST_0 &RK3399_CLUSTER_COST_0>; 338 sched-energy-costs = <&RK3399_CPU_COST_0 &RK3399_CLUSTER_COST_0>; 343 sched-energy-costs = <&RK3399_CPU_COST_1 &RK3399_CLUSTER_COST_1>; 348 sched-energy-costs = <&RK3399_CPU_COST_1 &RK3399_CLUSTER_COST_1>;
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/lib/gcc/arm-none-linux-gnueabihf/10.3.1/plugin/include/config/arm/ |
| H A D | aarch-common-protos.h | 49 Therefore it's okay for some costs to be 0. 50 Costs may not have a negative value. */ 82 /* Calculations of LDM costs are complex. We assume an initial cost
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/lib/gcc/aarch64-none-linux-gnu/10.3.1/plugin/include/config/arm/ |
| H A D | aarch-common-protos.h | 49 Therefore it's okay for some costs to be 0. 50 Costs may not have a negative value. */ 82 /* Calculations of LDM costs are complex. We assume an initial cost
|
| /OK3568_Linux_fs/yocto/poky/meta/files/common-licenses/ |
| H A D | psutils | 25 …e of charge (except for reasonable distribution costs). For a definition of reasonable distributio…
|
| H A D | QPL-1.0 | 24 …uted Software, including all modifications, without any charge beyond the costs of data transfer, … 32 …ete machine-readable source code to the items without any charge beyond the costs of data transfer.
|
| H A D | OGTSL | 17 integration costs and protection of investments in applications, 25 keeps development and support costs in check. API conformance is
|
| H A D | SGI-B-1.0 | 66 …ess Silicon Graphics, Inc. from and against any loss, liability, damages, costs or expenses (inclu… 70 …, California, with the losing party responsible for costs, including without limitation, court cos…
|
| H A D | SGI-B-1.1 | 68 …ess Silicon Graphics, Inc. from and against any loss, liability, damages, costs or expenses (inclu… 72 …, California, with the losing party responsible for costs, including without limitation, court cos…
|
| H A D | AFL-2.0 | 39 …shall be entitled to recover its costs and expenses, including, without limitation, reasonable att…
|
| H A D | OSL-1.0 | 139 entitled to recover its costs and expenses, including, without 140 limitation, reasonable attorneys` fees and costs incurred in
|
| H A D | AFL-2.1 | 41 …shall be entitled to recover its costs and expenses, including, without limitation, reasonable att…
|
| H A D | MPL-1.0 | 97 …costs of arbitration; (b) any arbitration relating to this Agreement shall be held in Santa Clara …
|
| H A D | FreeImage | 108 …costs of arbitration; (b) any arbitration relating to this Agreement shall be held in Almelo, The …
|
| /OK3568_Linux_fs/kernel/include/linux/ |
| H A D | energy_model.h | 64 * resolution (i.e. 64-bit). The costs for increasing resolution when 32-bit 65 * are pretty high and the returns do not justify the increased costs. 157 * So, ignoring the costs of idle states (which are not available in in em_cpu_energy()
|
| /OK3568_Linux_fs/kernel/tools/perf/util/ |
| H A D | levenshtein.c | 31 * It does so by calculating the costs of the path ending in characters 35 * This implementation allows the costs to be weighted:
|
| /OK3568_Linux_fs/yocto/meta-openembedded/meta-oe/recipes-benchmark/lmbench/lmbench-3.0-a9/ |
| H A D | update-results-script.patch | 39 echo "OK, it looks like your gettimeofday() costs $TIMING_O usecs." 47 echo "OK, it looks like your benchmark loop costs $LOOP_O usecs."
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/location/maps/ |
| H A D | qgeofiletilecache.cpp | 168 QList<int> costs; in loadTiles() 185 costs.append(fi.size()); in loadTiles() 187 costs.append(1); in loadTiles() 192 diskCache_.deserializeQueue(i, specs, queue, costs); in loadTiles()
|
| /OK3568_Linux_fs/kernel/Documentation/power/ |
| H A D | energy-model.rst | 15 from one platform to another. These power costs can be estimated using 24 approach is applicable to any architecture) providing power costs to the EM
|