HomeSort by: relevance | last modified time | path
    Searched refs:TO (Results 1 - 25 of 291) sorted by relevancy

1 2 3 4 5 6 7 8 91011>>

  /src/external/gpl3/gcc/dist/gcc/
regset.h 29 by changing all bitmaps that are really regsets to the regset type. For
30 the latter option, a good start would be to change everything allocated
31 on the reg_obstack to regset. */
37 /* A pointer to a regset_head. */
55 /* Copy a register set to another register set. */
56 #define COPY_REG_SET(TO, FROM) bitmap_copy (TO, FROM)
62 #define AND_REG_SET(TO, FROM) bitmap_and_into (TO, FROM)
65 #define AND_COMPL_REG_SET(TO, FROM) bitmap_and_compl_into (TO, FROM
    [all...]
function.h 40 /* This is reset to LAST_VIRTUAL_REGISTER + 1 at the start of each function.
48 rtl for the current function. Both are reset to null at the
60 Reset to 1 for each function compiled. */
86 able to deal with length attribute nested in top level structures. */
97 These are the arguments to function calls that have already returned. */
100 /* Under some ABIs, it is the caller's responsibility to pop arguments
103 function calls are made in a row, it is typically cheaper to pop
105 single pop instruction can be used. Therefore, GCC attempts to
109 arguments need to be popped.)
112 attempt to defer pops. Instead, the stack is popped immediatel
    [all...]
hard-reg-set.h 31 and it has enough bits to represent all the target machine's hard
36 the same format as a HARD_REG_SET. To help make sure this is true,
41 it used to be. */
132 /* HARD_REG_SET wrapped into a structure, to make it possible to
140 /* HARD_CONST is used to cast a constant to the appropriate type
146 to set, clear or test one bit in a hard reg set of type HARD_REG_SET.
150 is actually a pointer to a long.
173 #define CLEAR_HARD_REG_SET(TO) ((TO) = HARD_CONST (0)
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
regset.h 29 by changing all bitmaps that are really regsets to the regset type. For
30 the latter option, a good start would be to change everything allocated
31 on the reg_obstack to regset. */
37 /* A pointer to a regset_head. */
55 /* Copy a register set to another register set. */
56 #define COPY_REG_SET(TO, FROM) bitmap_copy (TO, FROM)
62 #define AND_REG_SET(TO, FROM) bitmap_and_into (TO, FROM)
65 #define AND_COMPL_REG_SET(TO, FROM) bitmap_and_compl_into (TO, FROM
    [all...]
function.h 40 /* This is reset to LAST_VIRTUAL_REGISTER + 1 at the start of each function.
48 rtl for the current function. Both are reset to null at the
60 Reset to 1 for each function compiled. */
86 able to deal with length attribute nested in top level structures. */
97 These are the arguments to function calls that have already returned. */
100 /* Under some ABIs, it is the caller's responsibility to pop arguments
103 function calls are made in a row, it is typically cheaper to pop
105 single pop instruction can be used. Therefore, GCC attempts to
109 arguments need to be popped.)
112 attempt to defer pops. Instead, the stack is popped immediatel
    [all...]
hard-reg-set.h 31 and it has enough bits to represent all the target machine's hard
36 the same format as a HARD_REG_SET. To help make sure this is true,
41 it used to be. */
132 /* HARD_REG_SET wrapped into a structure, to make it possible to
140 /* HARD_CONST is used to cast a constant to the appropriate type
146 to set, clear or test one bit in a hard reg set of type HARD_REG_SET.
150 is actually a pointer to a long.
173 #define CLEAR_HARD_REG_SET(TO) ((TO) = HARD_CONST (0)
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/config/pa/
pa64-linux.h 21 /* If defined, this macro specifies a table of register pairs used to
33 #define INITIAL_ELIMINATION_OFFSET(FROM, TO, OFFSET) \
39 if ((TO) == FRAME_POINTER_REGNUM \
46 gcc_assert ((TO) == STACK_POINTER_REGNUM); \
  /src/external/gpl3/gcc/dist/gcc/config/pa/
pa64-linux.h 25 /* If defined, this macro specifies a table of register pairs used to
37 #define INITIAL_ELIMINATION_OFFSET(FROM, TO, OFFSET) \
43 if ((TO) == FRAME_POINTER_REGNUM \
50 gcc_assert ((TO) == STACK_POINTER_REGNUM); \
  /src/external/gpl3/gdb/dist/sim/ppc/
idecode_fields.h 26 In addition to the below, more will be found in the gen program's
59 /* Expand argument to current architecture size */
92 #define TO_0_ ((TO & BIT5(0)) != 0)
93 #define TO_1_ ((TO & BIT5(1)) != 0)
94 #define TO_2_ ((TO & BIT5(2)) != 0)
95 #define TO_3_ ((TO & BIT5(3)) != 0)
96 #define TO_4_ ((TO & BIT5(4)) != 0)
  /src/external/gpl3/gdb.old/dist/sim/ppc/
idecode_fields.h 26 In addition to the below, more will be found in the gen program's
59 /* Expand argument to current architecture size */
92 #define TO_0_ ((TO & BIT5(0)) != 0)
93 #define TO_1_ ((TO & BIT5(1)) != 0)
94 #define TO_2_ ((TO & BIT5(2)) != 0)
95 #define TO_3_ ((TO & BIT5(3)) != 0)
96 #define TO_4_ ((TO & BIT5(4)) != 0)
  /src/usr.bin/make/unit-tests/
hanoi-include.mk 9 # * using the :: dependency operator for adding commands to a target
23 TO?= C # ... to this stack.
25 # Since make has no built-in arithmetic functions, convert N to a list of
32 . for from to in ${FROM} ${TO}
34 @echo "Move the upper disk from stack ${from} to stack ${to}."
37 _:= ${N::=${N:[1..-2]}} ${TMP::=${VIA}} ${VIA::=${TO}} ${TO::=${TMP}
    [all...]
  /src/external/zlib/pigz/dist/
yarn.h 11 Permission is granted to anyone to use this software for any purpose,
12 including commercial applications, and to alter it and redistribute it
13 freely, subject to the following restrictions:
30 from the application in order to facilitate platform independent use of
34 can fail. As a result, any errors encountered will cause an exit() to be
40 value can be ignored for simple exclusive access to an object, or the value
41 can be used to signal and wait for changes to an object.
46 void probe(void *); pointer to function "probe", run when thread start
    [all...]
  /src/external/gpl3/gcc/dist/libgcc/config/pa/
fptr.c 35 /* List of byte offsets in _dl_runtime_resolve to search for "bl" branches.
36 The first "bl" branch instruction found MUST be a call to fixup. See
40 the template should it be necessary to change the current branch
45 #define GET_FIELD(X, FROM, TO) \
46 ((X) >> (31 - (TO)) & ((1 << ((TO) - (FROM) + 1)) - 1))
86 /* -1 and page 0 are special. -1 is used in crtend to mark the end of
89 pointer points directly to the function. */
93 /* The function pointer points to a function descriptor (plabel). If
95 to the entry of the PLT stub just before the global offset table
    [all...]
  /src/external/gpl3/gcc.old/dist/libgcc/config/pa/
fptr.c 35 /* List of byte offsets in _dl_runtime_resolve to search for "bl" branches.
36 The first "bl" branch instruction found MUST be a call to fixup. See
40 the template should it be necessary to change the current branch
45 #define GET_FIELD(X, FROM, TO) \
46 ((X) >> (31 - (TO)) & ((1 << ((TO) - (FROM) + 1)) - 1))
86 /* -1 and page 0 are special. -1 is used in crtend to mark the end of
89 pointer points directly to the function. */
93 /* The function pointer points to a function descriptor (plabel). If
95 to the entry of the PLT stub just before the global offset table
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/AVR/MCTargetDesc/
AVRMCTargetDesc.h 42 const llvm::MCTargetOptions &TO);
  /src/sys/arch/vax/floppy/
defboo.hp 14 D/G A 0 ! DEV TO BOOT FROM, SEE CODING IN REBOOT.H AND RPB.H
  /src/external/mit/isl/dist/interface/
extract_interface.cc 17 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
112 llvm::cl::desc("Bindings to generate"),
210 /* Clang changed its API from 3.5 to 3.6 and once more in 3.7.
248 * If CLANG_SYSROOT is defined, then set it to this value.
258 * If CLANG_SYSROOT is not defined, then it does not need to be set.
326 shared_ptr<TargetOptions> TO = Clang->getInvocation().TargetOpts;
327 TO->Triple = llvm::sys::getDefaultTargetTriple();
328 return TargetInfo::CreateTargetInfo(Diags, TO);
336 TargetOptions &TO = Clang->getTargetOpts()
    [all...]
  /src/usr.sbin/sysinst/arch/acorn32/
menus.md.pl 20 * 3. The name of Piermont Information Systems Inc. may not be used to endorse
25 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
29 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  /src/usr.sbin/sysinst/arch/alpha/
menus.md.pl 20 * 3. The name of Piermont Information Systems Inc. may not be used to endorse
25 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
29 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  /src/usr.sbin/sysinst/arch/bebox/
menus.md.pl 19 * 3. The name of Piermont Information Systems Inc. may not be used to endorse
24 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  /src/usr.sbin/sysinst/arch/cats/
menus.md.pl 19 * 3. The name of Piermont Information Systems Inc. may not be used to endorse
24 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  /src/usr.sbin/sysinst/arch/emips/
menus.md.pl 20 * 3. The name of Piermont Information Systems Inc. may not be used to endorse
25 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
29 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  /src/usr.sbin/sysinst/arch/evbarm/
menus.md.pl 20 * 3. The name of Piermont Information Systems Inc. may not be used to endorse
25 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
29 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  /src/usr.sbin/sysinst/arch/evbmips/
menus.md.pl 19 * 3. The name of Piermont Information Systems Inc. may not be used to endorse
24 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  /src/usr.sbin/sysinst/arch/evbppc/
menus.md.pl 19 * 3. The name of Piermont Information Systems Inc. may not be used to endorse
24 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF

Completed in 78 milliseconds

1 2 3 4 5 6 7 8 91011>>