| /src/games/battlestar/ |
| command6.c | 100 live(void) function
|
| /src/sys/external/bsd/drm2/dist/drm/i915/ |
| i915_selftest.h | 40 int live; member in struct:i915_selftest
60 * Live unit tests are run after the driver is loaded - all hardware
|
| /src/sys/external/bsd/drm2/dist/drm/i915/selftests/ |
| i915_selftest.c | 76 int (*live)(struct drm_i915_private *); member in union:selftest::__anon5092
86 #define selftest(n, f) [live_##n] = { .name = #n, { .live = f } },
92 #define selftest(n, f) [perf_##n] = { .name = #n, { .live = f } },
165 err = st->live(data);
210 if (!i915_selftest.live)
213 err = run_selftests(live, pdev_to_i915(pdev));
215 i915_selftest.live = err;
219 if (i915_selftest.live < 0) {
220 i915_selftest.live = -ENOTTY;
411 module_param_named_unsafe(live_selftests, i915_selftest.live, int, 0400)
[all...] |
| i915_request.c | 1329 struct igt_live_test live; local
1382 ret = igt_live_test_begin(&live, i915, __func__, "");
1447 ret = igt_live_test_end(&live) ?: ret;
|
| /src/external/gpl3/gcc/dist/gcc/ |
| regstat.cc | 108 for basic block BB. LIVE is a scratch bitvector used here. */
111 regstat_bb_compute_ri (basic_block bb, bitmap live)
118 bitmap_copy (live, df_get_live_out (bb));
120 /* Process the regs live at the end of the block. Mark them as
122 EXECUTE_IF_SET_IN_BITMAP (live, 0, regno, bi)
129 bitmap_clear_bit (live, DF_REF_REGNO (def));
135 bitmap_set_bit (live, regno);
159 EXECUTE_IF_SET_IN_BITMAP (live, 0, regno, bi)
191 ??? This means that any partial store is live from
196 bitmap_clear_bit (live, dregno)
237 bitmap live = BITMAP_ALLOC (&df_bitmap_obstack); local
368 bitmap live = BITMAP_ALLOC (&df_bitmap_obstack); local
[all...] |
| combine-stack-adj.cc | 86 bitmap live = BITMAP_ALLOC (®_obstack);
89 combine_stack_adjustments_for_block (bb, live);
91 BITMAP_FREE (live);
230 bitmap live, rtx_insn *other_insn)
243 if (other_insn == NULL_RTX || live == NULL)
270 if (bitmap_bit_p (live, regno))
541 combine_stack_adjustments_for_block (basic_block bb, bitmap live)
553 bitmap_copy (live, DF_LR_IN (bb));
554 df_simulate_initialize_forwards (bb, live);
603 bitmap_copy (last_sp_live, live);
85 bitmap live = BITMAP_ALLOC (®_obstack); local
[all...] |
| mode-switching.cc | 181 /* Record in LIVE that register REG died. */
184 reg_dies (rtx reg, HARD_REG_SET *live)
193 remove_from_hard_reg_set (live, GET_MODE (reg), regno);
196 /* Record in LIVE that register REG became live.
200 reg_becomes_live (rtx reg, const_rtx setter ATTRIBUTE_UNUSED, void *live)
212 add_to_hard_reg_set ((HARD_REG_SET *) live, GET_MODE (reg), regno);
260 auto_bitmap live;
261 df_simulate_initialize_backwards (src_bb, live);
271 df_simulate_one_insn_backwards (src_bb, last_insn, live);
259 auto_bitmap live; local
[all...] |
| shrink-wrap.cc | 101 /* See whether there has a single live edge from BB, which dest uses
102 [REGNO, END_REGNO). Return the live edge if its dest bb has
110 bitmap live; local
116 live = df_get_live_in (e->dest);
118 if (REGNO_REG_SET_P (live, i))
149 after INSN in BB. SPLIT_P indicates whether a live edge from BB
331 INSN to BB if so. Either way, DEST is no longer live on entry,
352 Either way, SRC is now live on entry. */
431 to call-saved registers because their values are live across one or
488 does not work). It also cannot if there exist registers live on entr
[all...] |
| regcprop.cc | 329 /* If SRC had no assigned mode (i.e. we didn't know it was live)
1000 eldest live copy that's in an appropriate register class. */
1116 value in it is still live. */
1327 processed, begin with the value data that was live at
1369 bitmap live;
1371 live = df_get_live_out (bb);
1375 if (REGNO_REG_SET_P (live, regno))
1368 bitmap live; local
|
| tree-ssa-coalesce.cc | 36 #include "tree-ssa-live.h"
666 /* This structure is used to efficiently record the current status of live
669 ssa version live.
672 live. This makes it easy to add conflicts between just live partitions
675 marked as being live. This delays clearing of these bitmaps until
682 bitmap_head live_base_var; /* Indicates if a basevar is live. */
683 bitmap_head *live_base_partitions; /* Live partitions for each basevar. */
688 /* This routine will create a new live track structure based on the partitions
723 /* This function will remove PARTITION from the live list in PTR. *
871 live_track *live; local
[all...] |
| tree-ssa-live.cc | 36 #include "tree-ssa-live.h"
407 2) Declares no live variables
488 levels that keep an upper level with a label live, so we have to
555 /* Innermost blocks with no live variables nor statements can be always
1012 /* Allocate and return a new live range information object base on MAP. */
1017 tree_live_info_p live; local
1020 live = XNEW (struct tree_live_info_d);
1021 live->map = map;
1022 live->num_blocks = last_basic_block_for_fn (cfun);
1024 bitmap_obstack_initialize (&live->livein_obstack)
1271 tree_live_info_p live; local
[all...] |
| postreload.cc | 1267 still good enough to determine which registers are live at a jump
1279 HARD_REG_SET live;
1282 REG_SET_TO_HARD_REG_SET (live, live_in);
1283 compute_use_by_pseudos (&live, live_in);
1284 LABEL_LIVE (insn) = live;
1285 ever_live_at_start |= live;
1375 HARD_REG_SET *live;
1381 live = NULL;
1383 live = &LABEL_LIVE (JUMP_LABEL (insn));
1386 live = &ever_live_at_start
1278 HARD_REG_SET live; local
1374 HARD_REG_SET *live; local
[all...] |
| regrename.cc | 47 predecessor block and found chains live at the end which match
48 live registers at the start of the new block.
129 /* Record the registers that are live but not tracked. The intersection
248 list of conflicting live hard registers and track it in
607 chains, we'd have to track the live register as a hard reg, and
635 live value, described by CHAIN. */
830 to B, if the register is live across this edge. In the code below,
831 N_PREDS_USED counts the number of edges where the register is live, and
862 HARD_REG_SET live; local
865 REG_SET_TO_HARD_REG_SET (live, df_get_live_out (e->src))
928 HARD_REG_SET live; local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| regstat.cc | 108 for basic block BB. LIVE is a scratch bitvector used here. */
111 regstat_bb_compute_ri (basic_block bb, bitmap live)
118 bitmap_copy (live, df_get_live_out (bb));
120 /* Process the regs live at the end of the block. Mark them as
122 EXECUTE_IF_SET_IN_BITMAP (live, 0, regno, bi)
129 bitmap_clear_bit (live, DF_REF_REGNO (def));
135 bitmap_set_bit (live, regno);
159 EXECUTE_IF_SET_IN_BITMAP (live, 0, regno, bi)
191 ??? This means that any partial store is live from
196 bitmap_clear_bit (live, dregno)
237 bitmap live = BITMAP_ALLOC (&df_bitmap_obstack); local
368 bitmap live = BITMAP_ALLOC (&df_bitmap_obstack); local
[all...] |
| combine-stack-adj.cc | 86 bitmap live = BITMAP_ALLOC (®_obstack);
89 combine_stack_adjustments_for_block (bb, live);
91 BITMAP_FREE (live);
230 bitmap live, rtx_insn *other_insn)
243 if (other_insn == NULL_RTX || live == NULL)
270 if (bitmap_bit_p (live, regno))
541 combine_stack_adjustments_for_block (basic_block bb, bitmap live)
553 bitmap_copy (live, DF_LR_IN (bb));
554 df_simulate_initialize_forwards (bb, live);
603 bitmap_copy (last_sp_live, live);
85 bitmap live = BITMAP_ALLOC (®_obstack); local
[all...] |
| shrink-wrap.cc | 101 /* See whether there has a single live edge from BB, which dest uses
102 [REGNO, END_REGNO). Return the live edge if its dest bb has
110 bitmap live; local
116 live = df_get_live_in (e->dest);
118 if (REGNO_REG_SET_P (live, i))
149 after INSN in BB. SPLIT_P indicates whether a live edge from BB
331 INSN to BB if so. Either way, DEST is no longer live on entry,
352 Either way, SRC is now live on entry. */
431 to call-saved registers because their values are live across one or
488 does not work). It also cannot if there exist registers live on entr
[all...] |
| tree-ssa-live.cc | 36 #include "tree-ssa-live.h"
404 2) Declares no live variables
485 levels that keep an upper level with a label live, so we have to
552 /* Innermost blocks with no live variables nor statements can be always
969 /* Allocate and return a new live range information object base on MAP. */
974 tree_live_info_p live; local
977 live = XNEW (struct tree_live_info_d);
978 live->map = map;
979 live->num_blocks = last_basic_block_for_fn (cfun);
981 bitmap_obstack_initialize (&live->livein_obstack)
1228 tree_live_info_p live; local
[all...] |
| regcprop.cc | 329 /* If SRC had no assigned mode (i.e. we didn't know it was live)
985 eldest live copy that's in an appropriate register class. */
1101 value in it is still live. */
1312 processed, begin with the value data that was live at
1354 bitmap live;
1356 live = df_get_live_out (bb);
1360 if (REGNO_REG_SET_P (live, regno))
1353 bitmap live; local
|
| tree-ssa-coalesce.cc | 36 #include "tree-ssa-live.h"
665 /* This structure is used to efficiently record the current status of live
668 ssa version live.
671 live. This makes it easy to add conflicts between just live partitions
674 marked as being live. This delays clearing of these bitmaps until
681 bitmap_head live_base_var; /* Indicates if a basevar is live. */
682 bitmap_head *live_base_partitions; /* Live partitions for each basevar. */
687 /* This routine will create a new live track structure based on the partitions
722 /* This function will remove PARTITION from the live list in PTR. *
870 live_track *live; local
[all...] |
| postreload.cc | 1267 still good enough to determine which registers are live at a jump
1279 HARD_REG_SET live;
1282 REG_SET_TO_HARD_REG_SET (live, live_in);
1283 compute_use_by_pseudos (&live, live_in);
1284 LABEL_LIVE (insn) = live;
1285 ever_live_at_start |= live;
1375 HARD_REG_SET *live;
1381 live = NULL;
1383 live = &LABEL_LIVE (JUMP_LABEL (insn));
1386 live = &ever_live_at_start
1278 HARD_REG_SET live; local
1374 HARD_REG_SET *live; local
[all...] |
| regrename.cc | 47 predecessor block and found chains live at the end which match
48 live registers at the start of the new block.
129 /* Record the registers that are live but not tracked. The intersection
248 list of conflicting live hard registers and track it in
607 chains, we'd have to track the live register as a hard reg, and
635 live value, described by CHAIN. */
830 to B, if the register is live across this edge. In the code below,
831 N_PREDS_USED counts the number of edges where the register is live, and
862 HARD_REG_SET live; local
865 REG_SET_TO_HARD_REG_SET (live, df_get_live_out (e->src))
928 HARD_REG_SET live; local
[all...] |
| /src/external/mpl/bind/dist/lib/dns/include/dns/ |
| qp.h | 312 size_t live; /*%< nodes in use */ member in struct:dns_qp_memusage
|
| /src/external/gpl3/gcc/dist/c++tools/ |
| server.cc | 624 unsigned live = 0; local
625 while (sock_fd >= 0 || live)
645 && !(term || (live && (flag_one || flag_sequential))))
770 live--;
789 if (live == slot)
799 live++;
805 && (term || (live && (flag_one || flag_sequential))))
|
| /src/external/gpl3/gcc.old/dist/c++tools/ |
| server.cc | 624 unsigned live = 0; local
625 while (sock_fd >= 0 || live)
645 && !(term || (live && (flag_one || flag_sequential))))
770 live--;
789 if (live == slot)
799 live++;
805 && (term || (live && (flag_one || flag_sequential))))
|
| /src/external/bsd/pcc/dist/pcc/mip/ |
| regs.c | 86 * The "live" set used during graph building is represented by a bitset.
389 static bittype *live; variable
486 * heap for the "live" variable and on the stack for the in, out, gen
502 BITSET(live, x);
504 BITSET(live, (x-tempmin+MAXREGS));
515 BITCLEAR(live, x);
517 BITCLEAR(live, (x-tempmin+MAXREGS));
521 (x >= MAXREGS ? BITSET(live, (x-tempmin+MAXREGS)) : BITSET(live, x))
523 (x >= MAXREGS ? BITCLEAR(live, (x-tempmin+MAXREGS)) : BITCLEAR(live, x)
[all...] |
