Searched +refs:val +refs:length (Results 1 - 12 of 12) sorted by relevance

/ast/src/lib/libtk/library/demos/
H A Dixset111 set bellpit [.bell.val.pit.entry get]
112 set belldur [.bell.val.dur.entry get]
115 set kbdcli [.kbd.val.cli get]
123 set screentim [.screen.val.le.tim.entry get]
124 set screencyc [.screen.val.le.cyc.entry get]
145 .bell.val.pit.entry delete 0 end
146 .bell.val.pit.entry insert 0 $bellpit
147 .bell.val.dur.entry delete 0 end
148 .bell.val.dur.entry insert 0 $belldur
150 .kbd.val
[all...]
/ast/src/lib/libz/
H A Dinfback.c64 Return state with length and distance decoding tables and index sizes set to
86 /* literal/length table */
258 unsigned len; /* length to copy for repeats, bits to drop */
318 /* get and verify stored block length */
326 state->length = (unsigned)hold & 0xffff;
327 Tracev((stderr, "inflate: stored length %u\n",
328 state->length));
332 while (state->length != 0) {
333 copy = state->length;
343 state->length
[all...]
H A Dinflate.c19 * - Remove unnecessary second byte pull from length extra in inffast.c
76 * - Changed inflateBack() argument and in_func typedef to swap the length
196 Return state with length and distance decoding tables and index sizes set to
218 /* literal/length table */
290 state.lencode[low].val);
301 state.distcode[low].val);
508 if there is no input available. The decoding of variable length codes uses
569 unsigned len; /* length to copy for repeats, bits to drop */
671 state->length = (unsigned)(hold);
682 copy = state->length;
[all...]
H A Dtrees.c47 /* Bit length codes must not exceed MAX_BL_BITS bits */
53 /* repeat previous bit length 3-6 times (2 bits of repeat count) */
56 /* repeat a zero length 3-10 times (3 bits of repeat count) */
59 /* repeat a zero length 11-138 times (7 bits of repeat count) */
61 local const int extra_lbits[LENGTH_CODES] /* extra bits for each length code */
67 local const int extra_blbits[BL_CODES]/* extra bits for each bit length code */
72 /* The lengths of the bit length codes are sent in order of decreasing
73 * probability, to avoid transmitting the lengths for unused bit length codes.
109 /* length code for each normalized match length (
244 int length; /* length value */ local
[all...]
H A Ddeflate.c98 int length));
111 /* Matches of length 3 are discarded if their distance exceeds TOO_FAR */
124 ush good_length; /* reduce lazy search above this match length */
125 ush max_lazy; /* do not perform lazy search above this match length */
126 ush nice_length; /* quit search above this match length */
176 * the previous length of the hash chain.
233 * output size for (length,distance) codes is <= 24 bits.
321 uInt length = dictLength; local
334 if (length < MIN_MATCH) return Z_OK;
335 if (length > MAX_DIS
683 int val; local
714 int val; local
[all...]
/ast/src/cmd/mam/
H A Dshmam.awk118 val[1]=""
127 val[iLINT]=""
321 val[iLINT]=val[iLINT] " " nbasename(any2ln(tar))
660 #invar[VAR] = val
827 #gsf# if ((val[CMD] != "") && (COMD[ldep[i]] != 1))
830 if ((var[1] == PAT) && (val[1] != "") ) {
853 if (val[iLINT]!="") {
881 rdep[iDEP] = val[i+1] #KLUDGE : i+1 is libfiles.
956 if (val[
[all...]
/ast/src/cmd/INIT/
H A Dratz.c1200 /* do length NMAX blocks -- requires just one modulo operation */
1241 /* number of length codes, not counting the special END_BLOCK code */
1279 ush len; /* length of bit string */
1328 * performed with a length multiple of the block size. Also, it limits
1363 uInt match_length; /* length of best match */
1377 * length. A higher limit improves compression ratio but degrades the
1387 /* Insert new strings in the hash table only if the match length is not
1388 * greater than this length. This saves time but degrades compression.
1402 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
1408 struct tree_desc_s bl_desc; /* desc. for bit length tre
1549 unsigned short val; /* offset in table or code value */ member in struct:__anon30
1658 unsigned length; /* literal or length of data to copy */ member in struct:inflate_state
[all...]
/ast/src/cmd/mailx/
H A Dvars.c170 varkeep(const char* val) argument
175 if (!val)
177 if (!*val)
179 len = strlen(val) + 1;
182 memcpy(p, val, len);
669 xp->length = n;
/ast/src/cmd/dsslib/flat/
H A Dflat.c188 size_t length; /* magic number/string length */ member in struct:Magic_s
746 if (!memcmp(buf, flat->magic->string, flat->magic->length))
755 i = flat->magic->length;
761 if ((swap = swapop(tmp, buf, flat->magic->length)) >= 0)
952 (*disc->errorf)(NiL, disc, 2, "%sinvalid record length %d -- record ignored", cxlocation(r->cx, record), i);
1408 sfwrite(file->io, flat->magic->string, flat->magic->length);
1422 switch (flat->magic->length)
1440 swapmem(flat->magic->swap, num.buf, num.buf, flat->magic->length);
1441 sfwrite(file->io, num.buf, flat->magic->length);
3837 Cxvalue_t* val; local
3855 Cxvalue_t* val; local
[all...]
/ast/src/cmd/ksh93/sh/
H A Dpath.c89 if (!pf->attr || pf->attr->length == 0)
459 const char *val; local
463 if(val=sh_scoped(shp,(PATHNOD))->nvalue.cp)
465 shp->pathlist = pp = (void*)path_addpath(shp,(Pathcomp_t*)shp->pathlist,val,PATH_PATH);
473 if(val=sh_scoped(shp,(FPATHNOD))->nvalue.cp)
475 pp = (void*)path_addpath(shp,(Pathcomp_t*)shp->pathlist,val,PATH_FPATH);
1776 static void talias_put(register Namval_t* np,const char *val,int flags,Namfun_t *fp) argument
1778 if(!val && np->nvalue.cp)
1784 nv_putv(np,val,flags,fp);
/ast/src/cmd/nmake/
H A Dparse.c293 p->newv.length = MINVALUE;
424 * copy the local argc into internal.val
430 sfprintf(internal.val, "%d", pp->argc);
450 if (!(v->property & V_import) && v->value && strlen(p) <= v->length)
2899 nextarg(char* s, char** p, char** end, long* val) argument
2939 *val = 0;
2942 *val = strtol(arg, &s, 0);
2944 *val = 1;
2970 sfsprintf(arg = buf, sizeof(buf), "%ld", *val = strexpr(s, &s, makeexpr, NiL));
H A Dmake.h176 #define MINVALUE 32 /* minimum variable value length */
178 #define MAXNAME 1024 /* maximum file pathname length */
261 #define PREREQ_LENGTH 4 /* addprereq insert by length */
642 Sfio_t* val; /* initial getval return buffer */ member in struct:Internal_s
732 short pathlen; /* path length */
733 short rootlen; /* root length */
819 unsigned char val; /* internal.val in use */ member in struct:State_s
893 size_t length; /* maximum length o member in struct:Var_s
[all...]

Completed in 146 milliseconds