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

1 2 3 4 5 6 7 8 91011

  /src/tests/usr.bin/xlint/lint1/
msg_090.c 11 use(void) function
15 /* expect+1: warning: 'random_number' unused in function 'use' [192] */
  /src/games/battlestar/
command2.c 7 * Redistribution and use in source and binary forms, with or without
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
137 use(void) function
174 puts("There is no apparent use.");
  /src/lib/libutil/
getlabelsector.c 9 * Redistribution and use in source and binary forms, with or without
17 * 3. All advertising materials mentioning features or use of this software
31 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
34 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
80 int use; local
83 uselen = sizeof(use);
84 if (sysctlbyname("kern.labelusesmbr", &use, &uselen,
88 return use;
  /src/external/gpl3/gcc/dist/gcc/
init-regs.cc 32 /* Check all of the uses of pseudo variables. If any use that is MUST
70 df_ref use; local
74 FOR_EACH_INSN_USE (use, insn)
76 unsigned int regno = DF_REF_REGNO (use);
94 /* A use is MUST uninitialized if it reaches the top of
102 rtx reg = DF_REF_REAL_REG (use);
ipa-ref.h 66 ENUM_BITFIELD (ipa_ref_use) use:3; member in struct:ipa_ref
98 return r && r->use == IPA_REF_ALIAS ? r : NULL;
107 if (referring[i]->use != IPA_REF_ALIAS)
valtrack.h 81 df_ref use; member in struct:dead_debug_use
120 temporary even if there is just a single debug use. This is used
regstat.cc 40 incremental df scanning, then it should use REG_N_SETS and
61 df_ref use; local
64 for (use = DF_REG_USE_CHAIN (i); use; use = DF_REF_NEXT_REG (use))
65 if (DF_REF_INSN_INFO (use) && DEBUG_INSN_P (DF_REF_INSN (use)))
114 df_ref def, use; local
131 FOR_EACH_ARTIFICIAL_USE (use, bb->index
311 df_ref def, use; local
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
init-regs.cc 32 /* Check all of the uses of pseudo variables. If any use that is MUST
70 df_ref use; local
74 FOR_EACH_INSN_USE (use, insn)
76 unsigned int regno = DF_REF_REGNO (use);
94 /* A use is MUST uninitialized if it reaches the top of
102 rtx reg = DF_REF_REAL_REG (use);
ipa-ref.h 66 ENUM_BITFIELD (ipa_ref_use) use:3; member in struct:ipa_ref
98 return r && r->use == IPA_REF_ALIAS ? r : NULL;
107 if (referring[i]->use != IPA_REF_ALIAS)
valtrack.h 81 df_ref use; member in struct:dead_debug_use
120 temporary even if there is just a single debug use. This is used
regstat.cc 40 incremental df scanning, then it should use REG_N_SETS and
61 df_ref use; local
64 for (use = DF_REG_USE_CHAIN (i); use; use = DF_REF_NEXT_REG (use))
65 if (DF_REF_INSN_INFO (use) && DEBUG_INSN_P (DF_REF_INSN (use)))
114 df_ref def, use; local
131 FOR_EACH_ARTIFICIAL_USE (use, bb->index
311 df_ref def, use; local
    [all...]
  /src/external/bsd/unbound/dist/validator/
val_neg.h 8 * Redistribution and use in source and binary forms, with or without
29 * TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
32 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
68 /** the big lock on the negative cache. Because we use a rbtree
77 /** current memory in use (bytes) */
78 size_t use; member in struct:val_neg_cache
79 /** max memory to use (bytes) */
112 /** if 0: NSEC zone, else NSEC3 hash algorithm in use */
114 /** nsec3 iteration count in use */
116 /** nsec3 salt in use */
    [all...]
  /src/external/gpl3/gcc/dist/gcc/config/riscv/
riscv-sr.cc 18 use of '-msave-restore. The goal is to identify cases where the call
24 selected to use save/restore we are stuck with it. */
149 2. An optional use instruction for the register holding the return
161 if (INSN_P (insn) && GET_CODE (PATTERN (insn)) == USE)
226 -msave-restore is in use.
248 sp use site, which could be unsafe, so we decide to turn off this
257 /* Should only be called with -msave-restore is in use. */
299 usage check below (due to it's use of the return address), so
321 df_ref use; local
323 FOR_EACH_INSN_USE (use, insn
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/config/riscv/
riscv-sr.cc 18 use of '-msave-restore. The goal is to identify cases where the call
24 selected to use save/restore we are stuck with it. */
149 2. An optional use instruction for the register holding the return
161 if (INSN_P (insn) && GET_CODE (PATTERN (insn)) == USE)
226 -msave-restore is in use.
248 sp use site, which could be unsafe, so we decide to turn off this
257 /* Should only be called with -msave-restore is in use. */
299 usage check below (due to it's use of the return address), so
321 df_ref use; local
323 FOR_EACH_INSN_USE (use, insn
    [all...]
  /src/external/bsd/openldap/dist/servers/slapd/
filterentry.c 10 * Redistribution and use in source and binary forms, with or without
21 * Redistribution and use in source and binary forms are permitted
243 * normal rule, then we can't use the a_nvals.
292 suitable for use with the specified type (see [RFC4517]),
624 int use; local
635 use = SLAP_MR_EQUALITY;
639 use = SLAP_MR_EQUALITY_APPROX;
643 /* fallthru: use EQUALITY matching rule if no APPROX rule */
646 /* use variable set above so fall thru use is not clobbered *
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/rtl-ssa/
access-utils.h 146 // If ACCESS records a use, return the value that it uses. If ACCESS records
154 if (auto *use = dyn_cast<const use_info *> (access))
155 return use->def ();
303 // If ACCESS is a set, return the first use of ACCESS by a nondebug insn I
305 // no such use exists.
315 use_info *use = set->first_use (); local
318 if (!ignore (use->insn ()))
319 return use;
320 use = use->next_nondebug_insn_use ()
339 use_info *use = set->last_nondebug_insn_use (); local
    [all...]
  /src/common/dist/zlib/examples/
enough.c 9 1.1 4 Jan 2007 Use faster incremental table usage computation
16 Use a macro to compute the history index
41 properties are: we cannot use more bit patterns than are available; and when
275 // we need to use at least this many bit patterns so that the code won't be
281 // we can use at most this many bit patterns, lest there not be enough
289 for (int use = least; use <= most; use++) {
290 got = count(syms - use, (left - use) << 1, len + 1)
425 int use = least; local
    [all...]
  /src/sys/arch/sparc64/include/
pmap.h 8 * Redistribution and use in source and binary forms, with or without
16 * 3. All advertising materials mentioning features or use of this software
27 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
30 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
112 uint64_t use; member in struct:page_size_map
172 we really should use another param to pmap_enter() */
174 #define PMAP_64K 0x008 /* Use 64K page */
  /src/tests/libexec/ld.elf_so/
t_tls_extern.c 7 * Redistribution and use in source and binary forms, with or without
22 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
25 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
46 void *def, *use; local
57 ATF_REQUIRE_DL(use = dlopen(libuse, 0));
58 ATF_REQUIRE_DL(fuse = dlsym(use, "fuse"));
63 ATF_REQUIRE_DL(use = dlopen(libuse, 0));
66 ATF_REQUIRE_DL(use = dlopen(libuse, 0));
70 ATF_REQUIRE_DL(use = dlopen(libuse, 0));
73 ATF_REQUIRE_DL(fuse = dlsym(use, "fuse"))
394 void *def, *use; local
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/MCA/HardwareUnits/
ResourceManager.cpp 174 // Returns the actual resource consumed by this Use.
179 assert(Index < Resources.size() && "Invalid resource use!");
194 void ResourceManager::use(const ResourceRef &RR) { function in class:llvm::mca::ResourceManager
310 use(Pipe);
  /src/external/bsd/mdocml/dist/
dba.c 5 * Permission to use, copy, modify, and distribute this software for any
13 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
15 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
438 int use; local
453 use = 0;
456 use = 1;
457 if (use)
  /src/external/bsd/pcc/dist/pcc/driver/
platform.c 8 * Redistribution and use in source and binary forms, with or without
26 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
29 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
57 } use; variable in typeref:struct:__anon7931
60 { &use.crt0, "crt0.o" },
61 { &use.gcrt0, "gcrt0.o" },
62 { &use.crt1, "crt1.o" },
63 { &use.gcrt1, "gcrt1.o" },
64 { &use.crt2, "crt2.o" },
65 { &use.dllcrt2, "dllcrt2.o" }
    [all...]
  /src/external/bsd/zstd/dist/contrib/linux-kernel/test/
test.c 58 fprintf(stderr, "testing btrfs use cases... ");
185 static void __attribute__((noinline)) use(void *x) { function
197 use(g_stack);
  /src/external/bsd/zstd/dist/tests/
Makefile 424 ./decodecorpus -n5 -otestdir -ptestdir --use-dict=1MB
  /src/external/gpl2/mkhybrid/dist/
rock.c 219 int remain, use; local
222 /* use the HFS name if it exists */
237 use = remain;
240 if(use + currlen + CE_SIZE + (ipnt - recstart) > reclimit) {
241 use = reclimit - currlen - CE_SIZE - (ipnt - recstart);
246 if(use > 0xf8) use = 0xf8;
251 Rock[ipnt++] = NM_SIZE + use;
253 Rock[ipnt++] = (remain != use ? 1 : 0);
258 rstrncpy((char *)&Rock[ipnt], npnt, use);
    [all...]

Completed in 47 milliseconds

1 2 3 4 5 6 7 8 91011