Searched refs:cost (Results 1 - 25 of 61) sorted by relevance

123

/macosx-10.9.5/cups-372.4/cups/scheduler/
H A Dfilter.c57 int *cost, _mime_typelist_t *visited);
68 int cost, /* I - Relative time/resource cost */
74 DEBUG_printf(("mimeAddFilter(mime=%p, src=%p(%s/%s), dst=%p(%s/%s), cost=%d, "
78 cost, filter));
98 * Yup, does the existing filter have a higher cost? If so, copy the
99 * filter and cost to the existing filter entry and return it...
102 if (temp->cost > cost)
104 DEBUG_printf(("1mimeAddFilter: Replacing filter \"%s\", cost
65 mimeAddFilter(mime_t *mime, mime_type_t *src, mime_type_t *dst, int cost, const char *filter) argument
154 mimeFilter(mime_t *mime, mime_type_t *src, mime_type_t *dst, int *cost) argument
175 mimeFilter2(mime_t *mime, mime_type_t *src, size_t srcsize, mime_type_t *dst, int *cost) argument
312 mime_find_filters( mime_t *mime, mime_type_t *src, size_t srcsize, mime_type_t *dst, int *cost, _mime_typelist_t *list) argument
[all...]
H A Dmime.h98 int cost; /* Relative cost */ member in struct:_mime_filter_s
139 mime_type_t *dst, int cost,
143 mime_type_t *dst, int *cost);
146 int *cost);
H A Dtestmime.c59 int cost; /* Cost of filters */ local
138 filters = mimeFilter2(mime, src, srcinfo.st_size, dst, &cost);
149 printf("Filter cost = %d\n", cost);
197 filter->filter, filter->cost);
222 int cost; /* Cost of filter */ local
235 * source/type cost program
236 * source/type cost maxsize(nnnn) program
237 * source/type dest/type cost program
238 * source/type dest/type cost maxsiz
471 int cost; /* Filter cost */ local
[all...]
H A Dcupsfilter.c109 int cost; /* Cost of filters */ local
439 else if ((filters = mimeFilter(mime, src, dst, &cost)) == NULL)
518 int cost; /* Cost of filter */ local
528 * source/type cost program
529 * source/type cost maxsize(nnnn) program
530 * source/type dest/type cost program
531 * source/type dest/type cost maxsize(nnnn) program
535 super, type, dsuper, dtype, &cost, program) == 6)
544 if (sscanf(filter, "%15[^/]/%255s%d%*[ \t]%1023[^\n]", super, type, &cost,
608 filterptr = mimeAddFilter(mime, temptype, desttype, cost, progra
[all...]
H A Djob.h70 int cost; /* Filtering cost */ member in struct:cupsd_job_s
H A Dmime.c129 DEBUG_printf(("mimeDeleteFilter(mime=%p, filter=%p(%s/%s->%s/%s, cost=%d, "
135 filter ? filter->cost : -1,
688 int cost; /* Cost of filter */ local
771 * Then get the cost and filter program...
780 cost = atoi(lineptr);
852 mimeAddFilter(mime, temptype, dsttype, cost, filter);
/macosx-10.9.5/emacs-92/emacs/src/
H A Dscroll.c34 So no cost can exceed the area of a frame, measured in characters.
51 for the cost in insertcost. */
54 for the cost in deletecost. */
57 or delete for the cost in writecost. */
70 /* Determine, in matrix[i,j], the cost of updating the first j old
74 the smallest cost that ends with an insert, the smallest
75 cost that ends with a delete, and the smallest cost that
77 on some terminals the cost of doing an insert varies
80 /* draw_cost[VPOS] is the cost o
102 register int cost, cost1; local
444 register int cost, cost1, delta; local
[all...]
H A Dcm.c45 int cost; /* sums up costs */ variable
52 cost++;
145 * (Re)Initialize the cost factors, given the output speed of the terminal
155 #define COST(x,e) (x ? (cost = 0, tputs (x, 1, e), cost) : BIG)
169 * candidates for the least-cost motion, the real cost is computed.
170 * (Note that "0" is the assumed to generate the minimum cost.
172 * for which is not; all the terminals that have variable-cost
185 * Calculate the cost t
[all...]
H A Dcm.h86 int cc_up; /* cost for up */
163 extern int cost;
/macosx-10.9.5/cups-372.4/cups/ppdc/
H A Dppdc-filter.cxx34 int c) // I - Relative cost
41 cost = c;
H A Dppdc-import.cxx40 int cost; // Cost for filter local
150 cost = strtol(ptr, &ptr, 10);
155 filter = new ppdcFilter(line, ptr, cost);
/macosx-10.9.5/CPANInternal-140/Text-LevenshteinXS/
H A DLevenshteinXS.xs23 int k,i,j,n,m,cost,*d,distance;
44 cost=0;
46 cost=1;
48 d[j*n+i]=minimum(d[(j-1)*n+i]+1,d[j*n+i-1]+1,d[(j-1)*n+i-1]+cost);
/macosx-10.9.5/CPANInternal-140/Text-LevenshteinXS-0.03/
H A DLevenshteinXS.xs23 int k,i,j,n,m,cost,*d,distance;
44 cost=0;
46 cost=1;
48 d[j*n+i]=minimum(d[(j-1)*n+i]+1,d[j*n+i-1]+1,d[(j-1)*n+i-1]+cost);
/macosx-10.9.5/ruby-104/ruby/lib/
H A Dprofiler.rb92 cost = now - tick[0]
93 data[1] += cost
94 data[2] += cost - tick[1]
95 stack[-1][1] += cost if stack[-1]
/macosx-10.9.5/ruby-104/ruby/lib/rubygems/
H A Dtext.rb30 # Returns a value representing the "cost" of transforming str1 into str2
49 cost = (s[i] == t[j]) ? 0 : 1
53 d[j] + cost # substitution
/macosx-10.9.5/WebCore-7537.78.1/Modules/webaudio/
H A DAudioBuffer.cpp124 size_t cost = 0; local
126 cost += m_channels[i]->byteLength();
127 return cost;
/macosx-10.9.5/tcl-102/tcl_ext/tcllib/tcllib/modules/simulation/
H A Dannealing.tcl516 proc cost {params} { procedure
517 set cost 0
520 incr cost
525 incr cost
528 return $cost
538 -code {set result [cost $params]}]
547 set cost 0
550 incr cost
553 return $cost
/macosx-10.9.5/emacs-92/emacs/lisp/calc/
H A Dcalc-fin.el361 (defun calcFunc-sln (cost salvage life &optional period)
362 (or (math-realp cost) math-expand-formulas
363 (math-reject-arg cost 'realp))
374 (math-div (math-sub cost salvage) life)))
377 (defun calcFunc-syd (cost salvage life period)
378 (or (math-realp cost) math-expand-formulas
379 (math-reject-arg cost 'realp))
389 (math-div (math-mul (math-sub cost salvage)
394 (defun calcFunc-ddb (cost salvage life period)
397 (or (math-realp cost) (mat
[all...]
/macosx-10.9.5/bzip2-29/bzip2/
H A Dcompress.c256 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...]
/macosx-10.9.5/ncurses-42/ncurses/ncurses/tty/
H A Dhashmap.c127 /* approximate update cost */
131 int cost = 0; local
136 cost++;
138 return cost;
144 int cost = 0; local
153 cost++;
155 return cost;
159 * Returns true when moving line 'from' to line 'to' seems to be cost
175 * On the left side of >= is the cost before moving;
176 * on the right side -- cost afte
[all...]
/macosx-10.9.5/ntp-88/util/
H A Dntptime.c97 int cost = 0; local
122 cost++;
224 if (cost) {
/macosx-10.9.5/rsync-42/rsync/
H A Dutil.c1340 int32 cost; local
1348 for (i1 = 0, cost = 0; i1 < len1; i1++)
1349 cost += s1[i1];
1350 return (int32)len1 * UNIT + cost;
1361 if ((cost = *((uchar*)s1+i1) - *((uchar*)s2+i2)) != 0) {
1362 if (cost < 0)
1363 cost = UNIT - cost;
1365 cost = UNIT + cost;
[all...]
/macosx-10.9.5/JavaScriptCore-7537.78.1/heap/
H A DHeap.h135 void reportExtraMemoryCost(size_t cost);
349 inline void Heap::reportExtraMemoryCost(size_t cost) argument
351 if (cost > minExtraCost)
352 reportExtraMemoryCostSlowCase(cost);
/macosx-10.9.5/JavaScriptCore-7537.78.1/runtime/
H A DJSString.h101 void finishCreation(VM& vm, size_t length, size_t cost) argument
107 Heap::heap(this)->reportExtraMemoryCost(cost);
126 size_t cost = value->cost(); local
128 newString->finishCreation(vm, length, cost);
/macosx-10.9.5/network_cmds-433/ifconfig.tproj/
H A Difbridge.c208 printf(" path cost %u", req->ifbr_path_cost);
678 setbridge_ifpathcost(const char *ifn, const char *cost, int s, argument
686 if (get_val(cost, &val) < 0)
687 errx(1, "invalid value: %s", cost);
693 err(1, "BRDGSIFCOST %s", cost);

Completed in 387 milliseconds

123