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

1 2 3

  /src/external/gpl3/gcc/dist/contrib/
jit-coverage-report.py 51 uses = Counter() variable
54 uses[sym] = 0
57 uses[sym] += count
59 print(' uses in %s: %i' % (path, count))
60 if uses[sym] == 0:
65 print(layout % ('SYMBOL', 'USES', 'HISTOGRAM'))
66 for sym, count in uses.most_common():
  /src/external/gpl3/gcc.old/dist/contrib/
jit-coverage-report.py 51 uses = Counter() variable
54 uses[sym] = 0
57 uses[sym] += count
59 print(' uses in %s: %i' % (path, count))
60 if uses[sym] == 0:
65 print(layout % ('SYMBOL', 'USES', 'HISTOGRAM'))
66 for sym, count in uses.most_common():
  /src/external/gpl3/gcc/dist/gcc/
fold-mem-offsets.cc 76 foldable instructions for uses. In that phase a DFS traversal on the
205 /* Get all uses of REG which is set in INSN. Return the use list or NULL if a
207 there are missing / irregular uses and true otherwise. */
483 /* Function that computes the offset that would have to be added to all uses
515 memory addresses and do not have other uses. Use the same logic
519 struct df_link *uses = get_uses (def, dest, &success), *ref_link; local
524 for (ref_link = uses; ref_link; ref_link = ref_link->next)
valtrack.cc 341 /* Reset all debug uses in HEAD, and clear DEBUG->to_rescan bits of
408 /* Promote pending local uses of pseudos in DEBUG to global
409 substitutions. Uses of non-pseudos are left alone for
479 /* Reset all debug insns with pending uses. Release the bitmap in it,
570 replace all uses of UREGNO in DEBUG with uses of the debug temp.
580 struct dead_debug_use *uses = NULL; local
581 struct dead_debug_use **usesp = &uses;
597 /* Move all uses of uregno from debug->head to uses, setting mode t
    [all...]
compare-elim.cc 75 /* The choice of maximum 3 uses comes from wanting to eliminate the two
110 struct comparison_use uses[MAX_CMP_USE];
115 /* The number of uses identified for this comparison. */
118 /* True if not all uses of this comparison have been identified.
225 /* Look for uses of FLAGS in INSN. If we find one we can analyze, record
233 /* If we've already lost track of uses, don't bother collecting more. */
247 /* If we've run out of slots to record uses, quit. */
267 struct comparison_use *cuse = &cmp->uses[cmp->n_uses++];
415 /* Notice if this instruction uses the flags register. */
519 /* If we don't have access to all of the uses, we can't validate. *
109 struct comparison_use uses[MAX_CMP_USE]; member in struct:comparison
    [all...]
ree.cc 504 /* Get all the reaching uses of an instruction. The uses are desired for REG
865 as destination register will not affect its reaching uses, which may
872 struct df_link *uses = get_uses (def_insn, src_reg); local
873 if (!uses)
876 for (df_link *use = uses; use; use = use->next)
955 uses, which may read its value in a larger mode because DEF_INSN
959 struct df_link *uses = get_uses (def_insn2, SET_DEST (set)); local
960 if (!uses)
965 for (use = uses; use; use = use->next
    [all...]
shrink-wrap.cc 101 /* See whether there has a single live edge from BB, which dest uses
148 USES and DEFS are the set of registers that are used and defined
154 const_hard_reg_set uses,
170 because we can't deal with any CLOBBERs, USEs, or REG_UNUSED secondary
269 if (overlaps_hard_reg_set_p (uses, GET_MODE (dest), dregno)
330 /* Check whether BB uses DEST or clobbers DEST. We need to add
398 /* BB now defines DEST. It only uses the parts of DEST that overlap SRC
406 /* BB now uses SRC. */
439 HARD_REG_SET uses, defs; local
455 CLEAR_HARD_REG_SET (uses);
    [all...]
ssa-iterators.h 23 /* Immediate use lists are used to directly access all uses for an SSA
40 any modifications to the uses or stmts.
64 /* This node is inserted and used to mark the end of the uses for a stmt. */
149 use_optype_p uses; member in struct:ssa_op_iter
385 /* Return true if VAR has no nondebug uses. */
426 /* If there aren't any uses whatsoever, we're done. */
451 /* Return the number of nondebug immediate uses of VAR. */
491 if (ptr->uses)
493 use_p = USE_OP_PTR (ptr->uses);
494 ptr->uses = ptr->uses->next
    [all...]
tree-ssa-operands.cc 54 4 types of operands. Defs, Uses, Virtual Uses, and Virtual May Defs.
260 uses. */
368 /* Adds OP to the list of uses of statement STMT after LAST. */
872 mirroring the other uses of THIS_VOLATILE in this file. */
1113 use_optype_p uses = gimple_use_ops (stmt), last_use; local
1115 if (uses)
1117 for (last_use = uses; last_use->next; last_use = last_use->next)
1121 gimple_ssa_operands (fn)->free_uses = uses;
1247 fprintf (f, "number of immediate uses doesn't fit unsigned int\n")
    [all...]
early-remat.cc 79 candidate C1 uses candidate C2, C1 has a lower index than C2.
91 An instruction I "uses" a candidate C if I takes the register defined by
101 (a) C uses an invalid candidate;
103 (b) there is a cycle of candidate uses involving C; or
121 (b) I uses a candidate register R;
137 C1: R1 <- f1 (R2, R3, ...) // uses C2 and C3
143 I: use R1 // uses C1
162 I1: use R1 // uses C1
164 I2: use R3 // uses C3
175 I1: use R1 // uses C
382 bitmap uses; member in struct:__anon13588::remat_candidate
1348 bitmap_head uses; local
    [all...]
haifa-sched.cc 449 /* The insn uses memory: a volatile load. */
946 uses them, and the number of fixed_regs. Helpers for calculating of
2015 outside of USE's instruction. Return -1 if there are no other uses,
2132 } uses[FIRST_PSEUDO_REGISTER + MAX_RECOG_OPERANDS];
2162 gcc_assert (num_uses < ARRAY_SIZE (uses));
2163 uses[num_uses].last_use = new_last;
2164 uses[num_uses].regno = use->regno;
2199 if (uses[i].last_use == point)
2203 uses[i].regno, true);
2206 uses[i] = uses[num_uses - 1]
2122 } uses[FIRST_PSEUDO_REGISTER + MAX_RECOG_OPERANDS]; local
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
valtrack.cc 341 /* Reset all debug uses in HEAD, and clear DEBUG->to_rescan bits of
408 /* Promote pending local uses of pseudos in DEBUG to global
409 substitutions. Uses of non-pseudos are left alone for
479 /* Reset all debug insns with pending uses. Release the bitmap in it,
570 replace all uses of UREGNO in DEBUG with uses of the debug temp.
580 struct dead_debug_use *uses = NULL; local
581 struct dead_debug_use **usesp = &uses;
597 /* Move all uses of uregno from debug->head to uses, setting mode t
    [all...]
compare-elim.cc 75 /* The choice of maximum 3 uses comes from wanting to eliminate the two
110 struct comparison_use uses[MAX_CMP_USE];
115 /* The number of uses identified for this comparison. */
118 /* True if not all uses of this comparison have been identified.
225 /* Look for uses of FLAGS in INSN. If we find one we can analyze, record
233 /* If we've already lost track of uses, don't bother collecting more. */
247 /* If we've run out of slots to record uses, quit. */
266 struct comparison_use *cuse = &cmp->uses[cmp->n_uses++];
414 /* Notice if this instruction uses the flags register. */
518 /* If we don't have access to all of the uses, we can't validate. *
109 struct comparison_use uses[MAX_CMP_USE]; member in struct:comparison
    [all...]
ree.cc 504 /* Get all the reaching uses of an instruction. The uses are desired for REG
865 as destination register will not affect its reaching uses, which may
872 struct df_link *uses = get_uses (def_insn, src_reg); local
873 if (!uses)
876 for (df_link *use = uses; use; use = use->next)
955 uses, which may read its value in a larger mode because DEF_INSN
959 struct df_link *uses = get_uses (def_insn2, SET_DEST (set)); local
960 if (!uses)
965 for (use = uses; use; use = use->next
    [all...]
shrink-wrap.cc 101 /* See whether there has a single live edge from BB, which dest uses
148 USES and DEFS are the set of registers that are used and defined
154 const_hard_reg_set uses,
170 because we can't deal with any CLOBBERs, USEs, or REG_UNUSED secondary
269 if (overlaps_hard_reg_set_p (uses, GET_MODE (dest), dregno)
330 /* Check whether BB uses DEST or clobbers DEST. We need to add
398 /* BB now defines DEST. It only uses the parts of DEST that overlap SRC
406 /* BB now uses SRC. */
439 HARD_REG_SET uses, defs; local
455 CLEAR_HARD_REG_SET (uses);
    [all...]
ssa-iterators.h 23 /* Immediate use lists are used to directly access all uses for an SSA
40 any modifications to the uses or stmts.
64 /* This node is inserted and used to mark the end of the uses for a stmt. */
149 use_optype_p uses; member in struct:ssa_op_iter
385 /* Return true if VAR has no nondebug uses. */
426 /* If there aren't any uses whatsoever, we're done. */
451 /* Return the number of nondebug immediate uses of VAR. */
491 if (ptr->uses)
493 use_p = USE_OP_PTR (ptr->uses);
494 ptr->uses = ptr->uses->next
    [all...]
tree-ssa-operands.cc 54 4 types of operands. Defs, Uses, Virtual Uses, and Virtual May Defs.
260 uses. */
368 /* Adds OP to the list of uses of statement STMT after LAST. */
872 mirroring the other uses of THIS_VOLATILE in this file. */
1114 use_optype_p uses = gimple_use_ops (stmt), last_use; local
1116 if (uses)
1118 for (last_use = uses; last_use->next; last_use = last_use->next)
1122 gimple_ssa_operands (fn)->free_uses = uses;
1248 fprintf (f, "number of immediate uses doesn't fit unsigned int\n")
    [all...]
  /src/usr.sbin/quot/
quot.c 102 static void uses(uid_t, daddr_t, time_t);
292 uses(uid, blks, act) function
425 uses(DIP(super, dp, uid),
  /src/external/apache2/llvm/dist/llvm/include/llvm/IR/
Value.h 113 /// User uses this value to find the Use list.
298 /// Change all uses of this to point to a new Value.
300 /// Go through the uses list for this definition and make each use point to
305 /// Change non-metadata uses of this to point to a new Value.
307 /// Go through the uses list for this definition and make each use point to
311 /// Go through the uses list for this definition and make each use point
330 /// replaceUsesOutsideBlock - Go through the uses list for this definition and
338 // Methods for handling the chain of uses of this Value.
340 // Materializing a function can introduce new uses, so these methods come in
342 // The methods that start with materialized_ check the uses that ar
389 iterator_range<use_iterator> uses() { function
393 iterator_range<const_use_iterator> uses() const { function
    [all...]
  /src/external/apache2/mDNSResponder/nss/
nss_mdnsd.c 77 unsigned int uses; member in struct:svc_ref
1162 sr->uses++;
1166 || (conn_count && (sr->uses > REUSE_TIMES))) {
1192 if ((*sr)->uses) {
  /src/external/gpl3/gdb.old/dist/gdb/nat/
linux-osdata.c 229 /* get_core_array_size helper that uses /sys/devices/system/cpu/possible. */
1239 int uses; local
1254 if (sscanf (tmp, "%d", &uses) != 1)
1275 "<column name=\"num uses\">%d</column>"
1282 uses,
  /src/external/gpl3/gdb/dist/gdb/nat/
linux-osdata.c 229 /* get_core_array_size helper that uses /sys/devices/system/cpu/possible. */
1239 int uses; local
1254 if (sscanf (tmp, "%d", &uses) != 1)
1275 "<column name=\"num uses\">%d</column>"
1282 uses,
  /src/external/apache2/llvm/dist/clang/lib/Sema/
AnalysisBasedWarnings.cpp 987 /// DiagnoseUninitializedUse -- Helper function for diagnosing uses of an
989 /// emitted for particular types of uses. Returns true if the use was diagnosed
1371 const WeakUseVector &Uses = I->second;
1374 WeakUseVector::const_iterator UI = Uses.begin(), UE = Uses.end();
1388 if (UI == Uses.begin()) {
1452 const WeakUseVector &Uses = P.second->second;
1499 for (const auto &Use : Uses) {
1537 UsesMap uses; member in class:__anon3119::UninitValsDiagReporter
1553 getUses(uses, vd).getPointer()->push_back(use)
    [all...]
  /src/external/gpl2/lvm2/dist/libdm/
libdm-deptree.c 117 /* Two of these used to join two nodes with uses and used_by. */
130 struct dm_list uses; /* Nodes this node uses */ member in struct:dm_tree_node
163 dm_list_init(&dtree->root.uses);
208 dm_list_iterate_items(dlink, &parent->uses)
236 if (!_link(&parent->uses, child))
262 _unlink(&parent->uses, child);
328 dm_list_init(&node->uses);
696 return dm_list_size(&node->uses);
746 list = &node->uses;
    [all...]
  /src/external/gpl3/gcc/dist/gcc/config/v850/
v850.cc 1099 int uses,
1116 Saved %d bytes (%d uses of register %s) in function %s, starting as insn %d, ending at %d\n",
1117 2 * (uses - 3), uses, reg_names[regno],
1210 int uses;
1229 regs[i].uses = 0;
1247 if (max_uses < regs[i].uses)
1249 max_uses = regs[i].uses;
1263 regs[i].uses = 0;
1349 regs[regno].uses++
1203 int uses; member in struct:__anon13535
    [all...]

Completed in 45 milliseconds

1 2 3