/netbsd-6-1-5-RELEASE/games/phantasia/ |
H A D | misc.c | 165 double cost; /* cost of purchase */ local 166 double blessingcost; /* cost of blessing */ 182 /* set up cost of blessing */ 191 cost = blessingcost; 193 cost = Menu[loop].cost; 194 printw("(%d) %-12s: %6.0f\n", loop + 1, Menu[loop].item, cost); 232 Menu[0].cost, floor(Player.p_gold / Menu[0].cost)); [all...] |
/netbsd-6-1-5-RELEASE/games/trek/ |
H A D | computer.c | 79 ** warpcost -- Gives you the cost in time and units to move for 117 int cost; local 228 cost = pow(0.90, dist) * 98.0 + 0.5; 230 cost); 233 case 6: /* warp cost (time/energy) */ 240 cost = (dist + 0.05) * warpfact * warpfact * warpfact; 242 printf("Warp %.2f distance %.2f cost %.2f " 244 warpfact, dist, time, cost, cost + cost); [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/gcc.dg/ |
H A D | pr42389.c | 23 float cost; member in struct:s_rr_route 69 rr_route[inode].cost = rr_cost[inode].base_cost + rr_cost[inode].acc_cost;
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/ |
H A D | tree-ssa-loop-ivopts.c | 40 3) The optimal (w.r. to a cost function) set of variables is chosen. The 41 cost function assigns a cost to sets of induction variables and consists 45 variable in the set and adds its cost to the sum. The cost reflects 48 -- The variable costs. Each of the variables has a cost assigned that 51 -- The set cost. Depending on the size of the set, extra cost may be 96 /* The infinite cost. */ 138 int cost; /* Th member in struct:__anon6783 152 comp_cost cost; /* The cost. */ member in struct:cost_pair 204 unsigned cost; /* Cost of the candidate. */ member in struct:iv_cand 297 comp_cost cost; member in struct:iv_ca 2500 comp_cost cost; local 2544 infinite_cost_p(comp_cost cost) argument 2554 set_use_iv_cost(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand, comp_cost cost, bitmap depends_on, tree value) argument 2632 unsigned cost = 0; local 2740 unsigned cost; local 2938 unsigned cost; local 2968 unsigned cost; /* The cost. */ member in struct:mbc_entry 3001 unsigned cost; local 3125 unsigned cost, acost, complexity; local 3387 comp_cost cost0, cost1, cost; local 3673 comp_cost cost = force_var_cost (data, e2, depends_on); local 3707 comp_cost cost; local 3901 comp_cost cost; local 3928 comp_cost cost = get_computation_cost (data, use, cand, true, &depends_on, local 4093 comp_cost elim_cost, express_cost, cost; local 4195 comp_cost cost; local 4340 unsigned cost, cost_step; local 4523 comp_cost cost = ivs->cand_use_cost; local 4873 comp_cost cost = iv_ca_cost (ivs); local 4897 comp_cost cost; local 4945 comp_cost cost; local 5284 comp_cost cost = iv_ca_cost (set); local [all...] |
H A D | ira-color.c | 196 /* When we traverse allocnos to update hard register costs, the cost 201 /* Start a new cost-updating pass. */ 249 /* Update the cost of allocnos to increase chances to remove some 254 int i, cost, update_cost, hard_regno, divisor; 295 cost = (cp->second == allocno 299 cost = -cost; 301 update_cost = cp->freq * cost / divisor; 333 int i, cost, class_size, freq, mult, div, divisor; 386 cost 252 int i, cost, update_cost, hard_regno, divisor; local 331 int i, cost, class_size, freq, mult, div, divisor; local 450 int cost, mem_cost, min_cost, full_cost, min_full_cost, add_cost; local 1053 int regno, cost; local 1151 int cost; local 1927 int cost, exit_freq, enter_freq; local 2113 int cost, regno, hard_regno, hard_regno2, index; local 2228 int i, hard_regno, cost; local 2437 int i, num, regno, cost; local 2731 int old_hard_regno, hard_regno, cost; local 2970 int cost, best_cost; local 3122 int i, cost, regno, hard_regno, j, count, saved_cost, nregs; local 3181 int cost, other_cost; local [all...] |
H A D | ira-costs.c | 1 /* IRA hard register and memory cost calculation for allocnos or pseudos. 57 /* The `costs' struct records the cost of using hard registers of each 64 register classes (cover classes on the 1st cost calculation 66 int cost[1]; member in struct:costs 73 /* Allocated and initialized once, and used to initialize cost values 80 /* Allocated once, and used for the cost calculation. */ 90 /* Classes used for cost calculation. They may be different on 91 different iterations of the cost calculations or in different 98 /* Map: cost class -> order number (they start with 0) of the cost 1463 int i, freq, cost, src_regno, dst_regno, hard_regno; local 1725 int cost, min_cost, *reg_costs; local [all...] |
H A D | tree-ssa-coalesce.c | 49 int cost; member in struct:coalesce_pair 67 cost_one_pair_p cost_one_list;/* Single use coalesces with cost 1. */ 74 /* Return cost of execution of copy instruction with FREQUENCY. */ 80 int cost = frequency; local 82 if (!cost) 83 cost = 1; 86 cost = 1; 88 return cost; 92 /* Return the cost of executing a copy instruction in basic block BB. */ 101 /* Return the cost o 991 int v1, v2, cost; local 1035 int cost = coalesce_cost_edge (e); local 1283 int cost; local [all...] |
H A D | cfgloopanal.c | 300 /* Returns estimate on cost of computing SEQ. */ 305 unsigned cost = 0; local 312 cost += rtx_cost (set, SET, speed); 314 cost++; 317 return cost; 325 unsigned target_reg_cost[2]; /* The cost for register when there still 328 unsigned target_spill_cost[2]; /* The cost for register when we need 380 /* Estimates cost of increased register pressure caused by making N_NEW new 387 unsigned cost; local 398 cost [all...] |
H A D | tree-vectorizer.h | 115 } cost; member in struct:_slp_tree 138 } cost; member in struct:_slp_instance 159 #define SLP_INSTANCE_OUTSIDE_OF_LOOP_COST(S) (S)->cost.outside_of_loop 160 #define SLP_INSTANCE_INSIDE_OF_LOOP_COST(S) (S)->cost.inside_of_loop 170 #define SLP_TREE_OUTSIDE_OF_LOOP_COST(S) (S)->cost.outside_of_loop 171 #define SLP_TREE_INSIDE_OF_LOOP_COST(S) (S)->cost.inside_of_loop 189 not be profitable (as estimated by the cost model). 252 retain total unchanged scalar loop iterations for cost model. */ 482 } cost; member in struct:_stmt_vec_info 530 #define STMT_VINFO_OUTSIDE_OF_LOOP_COST(S) (S)->cost 692 stmt_vinfo_set_inside_of_loop_cost(stmt_vec_info stmt_info, slp_tree slp_node, int cost) argument 702 stmt_vinfo_set_outside_of_loop_cost(stmt_vec_info stmt_info, slp_tree slp_node, int cost) argument [all...] |
H A D | expmed.c | 1685 If a TARGET is specified and we can store in it at no extra cost, 2302 /* This structure holds the "cost" of a multiply sequence. The 2303 "cost" field holds the total rtx_cost of every operator in the member in struct:mult_cost 2304 synthetic multiplication sequence, hence cost(a op b) is defined 2305 as rtx_cost(op) + cost(a) + cost(b), where cost(leaf) is zero. 2314 short cost; /* Total rtx_cost of the multiplication sequence. */ 2321 #define MULT_COST_LESS(X,Y) ((X)->cost < (Y) \ 2322 || ((X)->cost 2342 struct mult_cost cost; member in struct:algorithm 2367 struct mult_cost cost; member in struct:alg_hash_entry [all...] |
H A D | mcf.c | 1 /* Routines to implement minimum-cost maximal flow algorithm used to smooth 37 cancel_negative_cycle: While G contains a negative cost cycle C, reverse 40 5. Form the minimal cost flow 96 gcov_type cost; member in struct:fixup_edge_d 229 fprintf (file, " cost=" HOST_WIDEST_INT_PRINT_DEC ".", fedge->cost); 368 (SRC->DEST) to the edge_list maintained in FIXUP_GRAPH with cost of the edge 372 add_edge (fixup_graph_type *fixup_graph, int src, int dest, gcov_type cost) argument 378 curr_edge->cost = cost; 391 add_fixup_edge(fixup_graph_type *fixup_graph, int src, int dest, edge_type type, gcov_type weight, gcov_type cost, gcov_type max_capacity) argument 406 add_rfixup_edge(fixup_graph_type *fixup_graph, int src, int dest, gcov_type rflow, gcov_type cost) argument [all...] |
H A D | reginfo.c | 187 /* Maximum cost of moving from a register in one class to a register in 192 of the second so in that case the cost is zero. */ 196 of the second so in that case the cost is zero. */ 274 int cost; 276 cost = 65535; 279 cost = REGISTER_MOVE_COST (m, (enum reg_class) i, 281 gcc_assert (cost < 65535); 283 all_match &= (last_move_cost[i][j] == cost); 284 last_move_cost[i][j] = cost; 304 int cost; 273 int cost; local 303 int cost; local [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/binutils/dist/gas/testsuite/gas/cris/ |
H A D | regreg.s | 7 ; is less expensive than any other time and still falling in cost.
|
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/ |
H A D | tree-ssa-loop-ivopts.c | 40 3) The optimal (w.r. to a cost function) set of variables is chosen. The 41 cost function assigns a cost to sets of induction variables and consists 45 variable in the set and adds its cost to the sum. The cost reflects 48 -- The variable costs. Each of the variables has a cost assigned that 51 -- The set cost. Depending on the size of the set, extra cost may be 93 /* The infinite cost. */ 139 /* The candidate - cost pai 143 unsigned cost; /* The cost. */ member in struct:cost_pair 193 unsigned cost; /* Cost of the candidate. */ member in struct:iv_cand 277 unsigned cost; member in struct:iv_ca 2356 set_use_iv_cost(struct ivopts_data *data, struct iv_use *use, struct iv_cand *cand, unsigned cost, bitmap depends_on, tree value) argument 2434 unsigned cost = 0; local 2532 unsigned cost; local 3154 unsigned cost; local 3184 unsigned cost; /* The cost. */ member in struct:mbc_entry 3217 unsigned cost; local 3304 unsigned cost, acost; local 3437 unsigned cost0, cost1, cost; local 3627 unsigned cost; local 3664 unsigned cost; local 3721 unsigned cost = 0, n_sums; local 3898 unsigned cost; local 3924 unsigned cost = get_computation_cost (data, use, cand, true, &depends_on); local 4067 unsigned cost; local 4141 unsigned cost; local 4476 unsigned cost = 0; local 4845 unsigned i, cost; local 4893 unsigned cost; local [all...] |
H A D | cfgloopanal.c | 480 /* Returns estimate on cost of computing SEQ. */ 485 unsigned cost = 0; local 492 cost += rtx_cost (set, SET); 494 cost++; 497 return cost; 504 unsigned target_small_cost; /* The cost for register when there is a free one. */ 505 unsigned target_pres_cost; /* The cost for register when there are not too many 507 unsigned target_spill_cost; /* The cost for register when we need to spill. */ 545 /* Calculates cost for having SIZE new loop global variables. REGS_USED is the 553 unsigned cost local [all...] |
H A D | haifa-sched.c | 519 /* Compute cost of executing INSN given the dependence LINK on the insn USED. 526 int cost = INSN_COST (insn); 528 if (cost < 0) 541 cost = insn_default_latency (insn); 542 if (cost < 0) 543 cost = 0; 545 INSN_COST (insn) = cost; 549 /* In this case estimate cost without caring how insn is used. */ 551 return cost; 557 cost 523 int cost = INSN_COST (insn); local 917 int cost = insn_cost (insn, link, next); local 1504 int cost; local 2007 int cost; local [all...] |
H A D | expmed.c | 1078 If a TARGET is specified and we can store in it at no extra cost, 2340 /* This structure holds the "cost" of a multiply sequence. The 2341 "cost" field holds the total rtx_cost of every operator in the 2342 synthetic multiplication sequence, hence cost(a op b) is defined member in struct:mult_cost 2343 as rtx_cost(op) + cost(a) + cost(b), where cost(leaf) is zero. 2352 short cost; /* Total rtx_cost of the multiplication sequence. */ 2359 #define MULT_COST_LESS(X,Y) ((X)->cost < (Y) \ 2360 || ((X)->cost 2381 struct mult_cost cost; member in struct:algorithm 2406 struct mult_cost cost; member in struct:alg_hash_entry [all...] |
/netbsd-6-1-5-RELEASE/external/bsd/tre/dist/lib/ |
H A D | tre-match-approx.c | 130 /* Set insert cost. */ 137 /* Set delete cost. */ 144 /* Set substitute cost. */ 151 /* Set maximum cost. */ 241 DPRINT(("max cost %d, ins %d, del %d, subst %d\n", 378 int cost, cost0; local 388 /* Compute and check cost at current depth. */ 389 cost = reach[id].costs[depth][TRE_M_COST]; 391 cost += reach[id].params.cost_ins; 392 if (cost > reac 476 int cost, cost0; local 652 int cost, cost0, err; local [all...] |
/netbsd-6-1-5-RELEASE/sys/arch/mvme68k/stand/sboot/ |
H A D | oc_cksum.s | 59 | bad alignment adds ~10% to the per-call cost. Since, by the nature 61 | always longword aligned, there is no benefit to this added cost 72 | loop branch cost and unroll-16 doesn't. But the tests also showed 84 | The cost of calling this routine was typically 10% of the per- 85 | kilobyte cost. E.g., checksumming zero bytes on a 3/60 cost 9us 86 | and each additional byte cost 125ns. With the high fixed cost,
|
/netbsd-6-1-5-RELEASE/sys/arch/m68k/m68k/ |
H A D | oc_cksum.s | 55 | bad alignment adds ~10% to the per-call cost. Since, by the nature 57 | always longword aligned, there is no benefit to this added cost 68 | loop branch cost and unroll-16 doesn't. But the tests also showed 80 | The cost of calling this routine was typically 10% of the per- 81 | kilobyte cost. E.g., checksumming zero bytes on a 3/60 cost 9us 82 | and each additional byte cost 125ns. With the high fixed cost,
|
/netbsd-6-1-5-RELEASE/games/monop/ |
H A D | morg.c | 145 price = board[propnum].cost/2; 208 price = board[propnum].cost/2; 211 printf("That cost you $%d\n",price);
|
H A D | print.c | 107 printf(" - %-8.8s %3d", pp->mon_desc->name, sqp->cost); 113 sqp->cost);
|
/netbsd-6-1-5-RELEASE/dist/bzip2/ |
H A D | compress.c | 256 UInt16 cost[BZ_N_GROUPS]; local 353 Calculate the cost of this group as coded 356 for (t = 0; t < nGroups; t++) cost[t] = 0; 383 cost[0] = cost01 & 0xffff; cost[1] = cost01 >> 16; 384 cost[2] = cost23 & 0xffff; cost[3] = cost23 >> 16; 385 cost[4] = cost45 & 0xffff; cost[5] = cost45 >> 16; 391 for (t = 0; t < nGroups; t++) cost[ [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/gcc.c-torture/execute/ |
H A D | 20000815-1.c | 10 int cost; member in struct:table_elt
|
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/testsuite/gcc.c-torture/execute/ |
H A D | 20000815-1.c | 10 int cost; member in struct:table_elt
|