HomeSort by: relevance | last modified time | path
    Searched refs:DEFINE (Results 1 - 7 of 7) sorted by relevancy

  /src/sys/lib/libkern/arch/hppa/
prefix.h 35 #define DEFINE(name, value)name: .EQU value
38 #define MILLI_BE(lbl) \
44 #define MILLI_BEN(lbl) \
50 #define MILLI_BLE(lbl) \
56 #define MILLI_BLEN(lbl) \
62 #define MILLI_BE(lbl) BE lbl(sr7,r0)
63 #define MILLI_BEN(lbl) BE,n lbl(sr7,r0)
64 #define MILLI_BLE(lbl) BLE lbl(sr7,r0)
65 #define MILLI_BLEN(lbl) BLE,n lbl(sr7,r0
    [all...]
  /src/common/dist/zlib/contrib/pascal/
example.pas 16 {$DEFINE TEST_COMPRESS}
17 {DO NOT $DEFINE TEST_GZIO}
18 {$DEFINE TEST_DEFLATE}
19 {$DEFINE TEST_INFLATE}
20 {$DEFINE TEST_FLUSH}
21 {$DEFINE TEST_SYNC}
22 {$DEFINE TEST_DICT}
  /src/usr.sbin/sysinst/
msg.pm.es 114 message cgd_err_menufmt {DISCO NO SE DEFINE!}
  /src/usr.bin/config/
gram.y 57 #define FORMAT(n) (((n).fmt == 8 && (n).val != 0) ? "0%llo" : \
60 #define stop(s) cfgerror(s), exit(1)
76 #define WRAP_CODE_nvlist 1
77 #define WRAP_CODE_defoptlist 2
78 #define WRAP_CODE_loclist 3
79 #define WRAP_CODE_attrlist 4
80 #define WRAP_CODE_condexpr 5
85 #define DECL_ALLOCWRAP(t) static struct t *wrap_mk_##t(struct t *arg)
94 #define wrap_mk_loc(p) wrap_mk_loclist(p)
95 #define wrap_mk_cx(p) wrap_mk_condexpr(p
    [all...]
  /src/sys/external/isc/libsodium/dist/
aclocal.m4 114 # and then we would define $MISSING as
141 # Define a conditional.
446 # AM_INIT_AUTOMAKE(PACKAGE, VERSION, [NO-DEFINE])
484 # Define the identity of the package.
489 m4_ifval([$3], [_AM_SET_OPTION([no-define])])dnl
501 _AM_IF_OPTION([no-define],,
636 # Define $install_sh.
771 # Define MISSING if not defined so far and test if it is modern enough.
1099 [# Always define AMTAR for backward compatibility. Yes, it's still used
  /src/sys/arch/m68k/060sp/dist/
fplsp.s 280 # This file contains a set of define statements for constants
6067 # Define F = sgn * 2**k * 1.xxxx1, i.e. the first 5 #
6069 # bit position. Define u to be u = (X-F) / (1 + X*F). #
6080 # Step 7. Define X' = -1/X. Approximate arctan(X') by an odd #
7994 # Step 2. X = 2**k * Y where 1 <= Y < 2. Define F to be the first #
7999 # Step 3. Define u = (Y-F)/F. Approximate log(1+u) by a #
8012 # Step 2: Let 1+X = 2**k * Y, where 1 <= Y < 2. Define F as done #
8249 #--WE DEFINE F = 1.XXXXXX1, I.E. FIRST 7 BITS OF Y AND ATTACH A 1.
8861 # 4. Define r as #
fpsp.s 300 # This file contains a set of define statements for constants
6173 # Define F = sgn * 2**k * 1.xxxx1, i.e. the first 5 #
6175 # bit position. Define u to be u = (X-F) / (1 + X*F). #
6186 # Step 7. Define X' = -1/X. Approximate arctan(X') by an odd #
8100 # Step 2. X = 2**k * Y where 1 <= Y < 2. Define F to be the first #
8105 # Step 3. Define u = (Y-F)/F. Approximate log(1+u) by a #
8118 # Step 2: Let 1+X = 2**k * Y, where 1 <= Y < 2. Define F as done #
8355 #--WE DEFINE F = 1.XXXXXX1, I.E. FIRST 7 BITS OF Y AND ATTACH A 1.
8967 # 4. Define r as #

Completed in 36 milliseconds