HomeSort by: relevance | last modified time | path
    Searched defs:drop (Results 1 - 25 of 74) sorted by relevancy

1 2 3

  /src/external/gpl3/gcc/dist/contrib/
dg-cmp-results.sh 132 function drop() { function
159 drop() function
184 drop() function
  /src/external/gpl3/gcc.old/dist/contrib/
dg-cmp-results.sh 132 function drop() { function
159 drop() function
184 drop() function
  /src/games/battlestar/
command4.c 219 if (drop(name) != -1) {
301 drop(const char *name) function
360 puts("Drop kicked.");
397 return (drop("Dropped"));
  /src/games/adventure/
vocab.c 82 drop(object, where);
113 drop(int object, int where) function
  /src/common/dist/zlib/contrib/infback9/
inftree9.c 40 unsigned drop; /* code bits to drop for sub-table */ local
141 with length len. That code is converted to an index by dropping drop
142 bits off of the bottom. For codes where len is less than drop + curr,
143 those top drop + curr - len bits are incremented through all values to
149 new sub-table should be started. drop is zero when the root table is
150 being filled, and drop is root when sub-tables are being filled.
194 drop = 0; /* current bits to drop from code for index */
207 this.bits = (unsigned char)(len - drop);
    [all...]
  /src/common/dist/zlib/
inftrees.c 42 unsigned drop; /* code bits to drop for sub-table */ local
149 with length len. That code is converted to an index by dropping drop
150 bits off of the bottom. For codes where len is less than drop + curr,
151 those top drop + curr - len bits are incremented through all values to
157 new sub-table should be started. drop is zero when the root table is
158 being filled, and drop is root when sub-tables are being filled.
200 drop = 0; /* current bits to drop from code for index */
213 here.bits = (unsigned char)(len - drop);
    [all...]
  /src/games/hack/
hack.do.c 69 /* Contains code for 'd', 'D' (drop), '>', '<' (up, down) and 't' (throw) */
78 static int drop(struct obj *);
84 return (drop(getobj("0$#", "drop")));
88 drop(struct obj *obj) function
96 pline("You didn't drop any gold pieces.");
108 pline("You cannot drop something you are wearing.");
146 /* drop several things */
150 return (ggetobj("drop", drop, 0))
    [all...]
  /src/external/cddl/osnet/dist/uts/common/zmod/
inftrees.c 47 unsigned drop; /* code bits to drop for sub-table */ local
154 with length len. That code is converted to an index by dropping drop
155 bits off of the bottom. For codes where len is less than drop + curr,
156 those top drop + curr - len bits are incremented through all values to
162 new sub-table should be started. drop is zero when the root table is
163 being filled, and drop is root when sub-tables are being filled.
208 drop = 0; /* current bits to drop from code for index */
220 this.bits = (unsigned char)(len - drop);
    [all...]
  /src/external/gpl3/binutils/dist/zlib/contrib/infback9/
inftree9.c 40 unsigned drop; /* code bits to drop for sub-table */ local
141 with length len. That code is converted to an index by dropping drop
142 bits off of the bottom. For codes where len is less than drop + curr,
143 those top drop + curr - len bits are incremented through all values to
149 new sub-table should be started. drop is zero when the root table is
150 being filled, and drop is root when sub-tables are being filled.
194 drop = 0; /* current bits to drop from code for index */
207 this.bits = (unsigned char)(len - drop);
    [all...]
  /src/external/gpl3/binutils/dist/zlib/
inftrees.c 40 unsigned drop; /* code bits to drop for sub-table */ local
147 with length len. That code is converted to an index by dropping drop
148 bits off of the bottom. For codes where len is less than drop + curr,
149 those top drop + curr - len bits are incremented through all values to
155 new sub-table should be started. drop is zero when the root table is
156 being filled, and drop is root when sub-tables are being filled.
198 drop = 0; /* current bits to drop from code for index */
211 here.bits = (unsigned char)(len - drop);
    [all...]
  /src/external/gpl3/binutils.old/dist/zlib/contrib/infback9/
inftree9.c 45 unsigned drop; /* code bits to drop for sub-table */ local
146 with length len. That code is converted to an index by dropping drop
147 bits off of the bottom. For codes where len is less than drop + curr,
148 those top drop + curr - len bits are incremented through all values to
154 new sub-table should be started. drop is zero when the root table is
155 being filled, and drop is root when sub-tables are being filled.
199 drop = 0; /* current bits to drop from code for index */
212 this.bits = (unsigned char)(len - drop);
    [all...]
  /src/external/gpl3/binutils.old/dist/zlib/
inftrees.c 45 unsigned drop; /* code bits to drop for sub-table */ local
152 with length len. That code is converted to an index by dropping drop
153 bits off of the bottom. For codes where len is less than drop + curr,
154 those top drop + curr - len bits are incremented through all values to
160 new sub-table should be started. drop is zero when the root table is
161 being filled, and drop is root when sub-tables are being filled.
203 drop = 0; /* current bits to drop from code for index */
216 here.bits = (unsigned char)(len - drop);
    [all...]
  /src/external/gpl3/gdb/dist/zlib/contrib/infback9/
inftree9.c 45 unsigned drop; /* code bits to drop for sub-table */ local
146 with length len. That code is converted to an index by dropping drop
147 bits off of the bottom. For codes where len is less than drop + curr,
148 those top drop + curr - len bits are incremented through all values to
154 new sub-table should be started. drop is zero when the root table is
155 being filled, and drop is root when sub-tables are being filled.
199 drop = 0; /* current bits to drop from code for index */
212 this.bits = (unsigned char)(len - drop);
    [all...]
  /src/external/gpl3/gdb/dist/zlib/
inftrees.c 45 unsigned drop; /* code bits to drop for sub-table */ local
152 with length len. That code is converted to an index by dropping drop
153 bits off of the bottom. For codes where len is less than drop + curr,
154 those top drop + curr - len bits are incremented through all values to
160 new sub-table should be started. drop is zero when the root table is
161 being filled, and drop is root when sub-tables are being filled.
203 drop = 0; /* current bits to drop from code for index */
216 here.bits = (unsigned char)(len - drop);
    [all...]
  /src/external/gpl3/gdb.old/dist/zlib/contrib/infback9/
inftree9.c 45 unsigned drop; /* code bits to drop for sub-table */ local
146 with length len. That code is converted to an index by dropping drop
147 bits off of the bottom. For codes where len is less than drop + curr,
148 those top drop + curr - len bits are incremented through all values to
154 new sub-table should be started. drop is zero when the root table is
155 being filled, and drop is root when sub-tables are being filled.
199 drop = 0; /* current bits to drop from code for index */
212 this.bits = (unsigned char)(len - drop);
    [all...]
  /src/external/gpl3/gdb.old/dist/zlib/
inftrees.c 45 unsigned drop; /* code bits to drop for sub-table */ local
152 with length len. That code is converted to an index by dropping drop
153 bits off of the bottom. For codes where len is less than drop + curr,
154 those top drop + curr - len bits are incremented through all values to
160 new sub-table should be started. drop is zero when the root table is
161 being filled, and drop is root when sub-tables are being filled.
203 drop = 0; /* current bits to drop from code for index */
216 here.bits = (unsigned char)(len - drop);
    [all...]
  /src/games/rogue/
pack.c 152 drop(void) function
163 messagef(0, "you have nothing to drop");
166 if ((ch = pack_letter("drop what?", ALL_OBJECTS)) == CANCEL) {
  /src/external/ibm-public/postfix/dist/src/util/
ctable.c 284 static void drop(void *data, void *unused_context) function
299 cache = ctable_create(1, ask, drop, (void *) data_buf);
  /src/external/mpl/bind/dist/bin/tests/system/rpz/
tests.sh 453 drop() { function
533 drop a3-8.tld2 any # 32 drop
564 drop a3-8.tld2 any @$ns6 # 20 drop
700 drop a3-18.tld2 any # 18 bl-drop
  /src/common/dist/zlib/examples/
zran.c 263 value >>= k; // drop the bits appended
408 unsigned drop = 8; // length of gzip trailer local
409 if (strm.avail_in >= drop) {
410 strm.avail_in -= drop;
411 strm.next_in += drop;
415 drop -= strm.avail_in;
421 } while (--drop);
  /src/sys/external/bsd/drm2/dist/drm/nouveau/
nouveau_fence.c 65 int drop = 0; local
75 drop = 1;
79 return drop;
148 int drop = 0; local
157 drop |= nouveau_fence_signal(fence);
160 return drop;
  /src/crypto/external/bsd/heimdal/dist/kdc/
announce.c 348 struct entry *drop = *e; local
352 drop->realm, drop->domain);
354 if (drop->recordRef && g_dnsRef)
355 DNSServiceRemoveRecord(g_dnsRef, drop->recordRef, 0);
356 free(drop->domain);
357 free(drop->realm);
358 free(drop);
  /src/crypto/external/bsd/openssl.old/dist/test/
bad_dtls_test.c 426 #define DROP(x) { x##UL, 1 }
430 int drop; member in struct:__anon2228
435 DROP(0x10001), DROP(0xff), NODROP(0x100000), NODROP(0x800000), NODROP(0x7fffe1),
436 NODROP(0xffffff), NODROP(0x1000000), NODROP(0xfffffe), DROP(0xffffff), NODROP(0x1000010),
437 NODROP(0xfffffd), NODROP(0x1000011), DROP(0x12), NODROP(0x1000012),
438 NODROP(0x1ffffff), NODROP(0x2000000), DROP(0x1ff00fe), NODROP(0x2000001),
439 NODROP(0x20fffff), NODROP(0x2105500), DROP(0x20ffffe), NODROP(0x21054ff),
440 NODROP(0x211ffff), DROP(0x2110000), NODROP(0x2120000)
441 /* The last test should be NODROP, because a DROP wouldn't get tested. *
    [all...]
  /src/external/cddl/osnet/dist/lib/libdtrace/common/
dt_handle.c 315 dtrace_dropdata_t drop; local
321 bzero(&drop, sizeof (drop));
322 drop.dtdda_handle = dtp;
323 drop.dtdda_cpu = cpu;
324 drop.dtdda_kind = what;
325 drop.dtdda_drops = howmany;
326 drop.dtdda_msg = str;
345 if ((*dtp->dt_drophdlr)(&drop, dtp->dt_droparg) == DTRACE_HANDLE_ABORT)
359 "dynamic variable drop" },
395 dtrace_dropdata_t drop; local
    [all...]
  /src/external/gpl3/binutils/dist/zlib/examples/
zran.c 263 value >>= k; // drop the bits appended
408 unsigned drop = 8; // length of gzip trailer local
409 if (strm.avail_in >= drop) {
410 strm.avail_in -= drop;
411 strm.next_in += drop;
415 drop -= strm.avail_in;
421 } while (--drop);

Completed in 48 milliseconds

1 2 3