| /src/external/public-domain/xz/dist/tests/ |
| bcj_test.c | 21 extern int jump(int a, int b);
28 a = jump(a, b);
35 jump(int a, int b) function
37 // The loop generates conditional jump backwards.
|
| /src/games/battlestar/ |
| command3.c | 68 jump(void) function
|
| /src/sys/arch/hpc/stand/hpcboot/mips/ |
| mips_arch.cpp | 118 MIPSArchitecture::jump(paddr_t info, paddr_t pvec) function in class:MIPSArchitecture
138 DPRINTF((TEXT("jump to 0x%08x (info=0x%08x, pvec=0x%08x)\n"),
145 // jump to 2nd-loader(run kseg0)
|
| /src/sys/arch/hpc/stand/hpcboot/sh3/ |
| sh_arch.cpp | 104 SHArchitecture::jump(paddr_t info, paddr_t pvec) function in class:SHArchitecture
133 // jump to 2nd loader.(run P1) at this time I still use MMU.
|
| /src/sys/dev/ |
| kloader.h | 46 * lined list of new kernel pieces. and then, jump to kernel
52 * koader_jumpfunc_t jump to boot loader described abobe.
60 kloader_jumpfunc_t *jump; member in struct:kloader_ops
|
| /src/external/apache2/llvm/dist/clang/lib/AST/Interp/ |
| ByteCodeEmitter.cpp | 105 // Compute the PC offset which the jump is relative to.
108 // If target is known, compute jump offset.
160 bool ByteCodeEmitter::jump(const LabelTy &Label) { function in class:ByteCodeEmitter
|
| EvalEmitter.cpp | 85 bool EvalEmitter::jump(const LabelTy &Label) { function in class:EvalEmitter
|
| /src/sys/arch/hpc/stand/hpcboot/arm/ |
| arm_sa1100.cpp | 64 /* jump to 2nd loader */
160 // don't writeback D-cache here. make sure to writeback before jump.
176 SA1100Architecture::jump(paddr_t info, paddr_t pvec) function in class:SA1100Architecture
|
| arm_pxa2x0.cpp | 64 /* jump to 2nd loader */
170 // don't writeback D-cache here. make sure to writeback before jump.
186 PXA2X0Architecture::jump(paddr_t info, paddr_t pvec) function in class:PXA2X0Architecture
|
| /src/external/gpl3/gcc/dist/gcc/ |
| ifcvt.h | 54 /* The jump that ends TEST_BB. */
55 rtx_insn *jump; member in struct:noce_if_info
57 /* The jump condition. */
60 /* Reversed jump condition. */
71 the jump. */
92 - JUMP branches to THEN_BB on COND
93 - JUMP falls through to JOIN_BB on !COND
107 combined cost of COND, JUMP and the costs for THEN_BB and ELSE_BB.
|
| loop-doloop.cc | 54 3. At the end of the loop, the jump insn is replaced by the
66 somehow extremely lower than the cost of compare & jump, or unless the bct
71 if it is not a decrement and branch jump insn. */
95 by jump.cc), and the second entry of the parallel must be a set of
288 additional jump around the loop to ensure an infinite loop.
344 rtx_insn *seq, *jump; local
350 /* The jump is supposed to handle an unlikely special case. */
364 jump = get_last_insn ();
365 if (!jump || !JUMP_P (jump))
[all...] |
| bb-reorder.cc | 24 duplicates blocks ending in an indirect jump.
67 The rest of traces are simply connected so there will be a jump to the
419 /* Try to get rid of uncond jump to cond jump. */
424 /* Duplicate HEADER if it is a small block containing cond jump
571 duplicated cheaper than a jump, don't allow it to be added to
610 It does not add jump compared with the previous order. But it
1400 /* Return the length of unconditional jump instruction. */
1409 rtx_insn *jump = emit_jump_insn (targetm.gen_jump (label));
1410 length = get_attr_min_length (jump);
1408 rtx_insn *jump = emit_jump_insn (targetm.gen_jump (label)); local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| ifcvt.h | 54 /* The jump that ends TEST_BB. */
55 rtx_insn *jump; member in struct:noce_if_info
57 /* The jump condition. */
60 /* Reversed jump condition. */
71 the jump. */
99 combined cost of COND, JUMP and the costs for THEN_BB and ELSE_BB.
|
| loop-doloop.cc | 54 3. At the end of the loop, the jump insn is replaced by the
66 somehow extremely lower than the cost of compare & jump, or unless the bct
71 if it is not a decrement and branch jump insn. */
95 by jump.cc), and the second entry of the parallel must be a set of
288 additional jump around the loop to ensure an infinite loop.
344 rtx_insn *seq, *jump; local
350 /* The jump is supposed to handle an unlikely special case. */
364 jump = get_last_insn ();
365 if (!jump || !JUMP_P (jump))
[all...] |
| /src/games/rogue/ |
| move.c | 59 boolean jump = 0; variable
133 if (!jump) {
|
| /src/external/gpl3/gcc/dist/gcc/config/loongarch/ |
| loongarch-tune.h | 172 const char *jump; /* default value for -falign-jumps */ member in struct:loongarch_align
174 loongarch_align () : function (nullptr), loop (nullptr), jump (nullptr) {}
190 jump = _jump;
|
| /src/external/gpl3/gcc/dist/gcc/config/sh/ |
| sh-mem.cc | 213 rtx_insn *jump; local
227 jump = emit_jump_insn (gen_branch_false (L_loop_byte));
228 add_int_reg_note (jump, REG_BR_PROB, prob_likely);
233 jump = emit_jump_insn (gen_branch_false (L_loop_byte));
234 add_int_reg_note (jump, REG_BR_PROB, prob_likely);
239 jump = emit_jump_insn (gen_branch_false (L_loop_byte));
240 add_int_reg_note (jump, REG_BR_PROB, prob_likely);
263 jump = emit_jump_insn (gen_branch_true (L_end_loop_long));
264 add_int_reg_note (jump, REG_BR_PROB, prob_unlikely);
272 jump = emit_jump_insn (gen_branch_true (L_loop_long))
351 rtx_insn *jump; local
592 rtx_insn *jump; local
678 rtx_insn *jump; local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/config/sh/ |
| sh-mem.cc | 213 rtx_insn *jump; local
227 jump = emit_jump_insn (gen_branch_false (L_loop_byte));
228 add_int_reg_note (jump, REG_BR_PROB, prob_likely);
233 jump = emit_jump_insn (gen_branch_false (L_loop_byte));
234 add_int_reg_note (jump, REG_BR_PROB, prob_likely);
239 jump = emit_jump_insn (gen_branch_false (L_loop_byte));
240 add_int_reg_note (jump, REG_BR_PROB, prob_likely);
263 jump = emit_jump_insn (gen_branch_true (L_end_loop_long));
264 add_int_reg_note (jump, REG_BR_PROB, prob_unlikely);
272 jump = emit_jump_insn (gen_branch_true (L_loop_long))
351 rtx_insn *jump; local
592 rtx_insn *jump; local
678 rtx_insn *jump; local
[all...] |
| /src/games/wump/ |
| wump.c | 125 static void jump(int);
373 jump(next_room = (random() % room_num) + 1);
843 jump(int where) function
|
| /src/external/gpl3/gcc/dist/libgfortran/intrinsics/ |
| random.c | 203 - provides a "jump" function making it easy to provide many
284 /* This is the jump function for the generator. It is equivalent to
289 jump (prng_state* rs) function
291 static const uint64_t JUMP[] = { 0x180ec6d33cfd0aba, 0xd5a61266f0c9392c, 0xa9582618e03fc9aa, 0x39abdc4529b1661c };
297 for(size_t i = 0; i < sizeof JUMP / sizeof *JUMP; i++)
299 if (JUMP[i] & UINT64_C(1) << b) {
377 using the master state and the number of times we must jump. */
396 jump (&master_state);
|
| /src/external/gpl3/gcc.old/dist/gcc/c-family/ |
| c-gimplify.cc | 267 then we just build a jump back to the top. */
426 tree jump = build1_loc (location, GOTO_EXPR, void_type_node, label); local
428 append_to_statement_list (jump, &stmt_list);
|
| /src/external/gpl3/gcc.old/dist/libgfortran/intrinsics/ |
| random.c | 203 - provides a "jump" function making it easy to provide many
284 /* This is the jump function for the generator. It is equivalent to
289 jump (prng_state* rs) function
291 static const uint64_t JUMP[] = { 0x180ec6d33cfd0aba, 0xd5a61266f0c9392c, 0xa9582618e03fc9aa, 0x39abdc4529b1661c };
297 for(size_t i = 0; i < sizeof JUMP / sizeof *JUMP; i++)
299 if (JUMP[i] & UINT64_C(1) << b) {
377 using the master state and the number of times we must jump. */
396 jump (&master_state);
|
| /src/sys/arch/mips/mips/ |
| db_interface.c | 1018 * Determine whether the instruction makes a jump.
1024 bool jump; local
1027 jump = (i.JType.op == OP_J) ||
1029 return jump;
|
| /src/usr.bin/man/ |
| man.c | 122 static void jump(char **, const char *, const char *) __dead;
184 jump(argv, "-f", "whatis");
187 jump(argv, "-k", "apropos");
950 * jump --
951 * strip out flag argument and jump
954 jump(char **argv, const char *flag, const char *name) function
|
| /src/external/gpl3/gcc/dist/gcc/c-family/ |
| c-gimplify.cc | 324 then we just build a jump back to the top. */
511 tree jump = build1_loc (location, GOTO_EXPR, void_type_node, label); local
513 append_to_statement_list (jump, &stmt_list);
|
