| /src/external/gpl3/binutils/dist/gas/ |
| flonum.h | 58 LITTLENUM_TYPE *leader; /* -> 1st non-zero littlenum */ member in struct:FLONUM_STRUCT
59 /* If flonum is 0.0, leader==low-1 */
|
| expr.c | 210 0, /* leader. */
465 LITTLENUM_TYPE *leader; /* -> high order littlenum of the bignum. */
469 leader = generic_bignum;
478 for (pointer = generic_bignum; pointer <= leader; pointer++)
488 if (leader < generic_bignum + SIZE_OF_LARGE_NUMBER - 1)
491 *++leader = carry;
498 if (leader < generic_bignum + 2)
505 else if (leader < generic_bignum + 4)
515 number = leader - generic_bignum + 1;
461 LITTLENUM_TYPE *leader; \/* -> high order littlenum of the bignum. *\/ local
|
| /src/external/gpl3/binutils.old/dist/gas/ |
| flonum.h | 58 LITTLENUM_TYPE *leader; /* -> 1st non-zero littlenum */ member in struct:FLONUM_STRUCT
59 /* If flonum is 0.0, leader==low-1 */
|
| expr.c | 213 0, /* leader. */
468 LITTLENUM_TYPE *leader; /* -> high order littlenum of the bignum. */
472 leader = generic_bignum;
481 for (pointer = generic_bignum; pointer <= leader; pointer++)
491 if (leader < generic_bignum + SIZE_OF_LARGE_NUMBER - 1)
494 *++leader = carry;
501 if (leader < generic_bignum + 2)
508 else if (leader < generic_bignum + 4)
518 number = leader - generic_bignum + 1;
464 LITTLENUM_TYPE *leader; \/* -> high order littlenum of the bignum. *\/ local
|
| /src/external/gpl2/groff/dist/src/roff/troff/ |
| token.h | 83 int leader();
224 inline int token::leader() function in class:token
|
| /src/lib/libc/nameser/ |
| ns_print.c | 465 const char *leader; local
491 leader = "\n\t\t";
494 leader = " ";
496 T(addstr(leader, strlen(leader), &buf, &buflen));
512 const char *leader; local
553 leader = "\n\t\t";
556 leader = " ";
560 T(addstr(leader, strlen(leader), &buf, &buflen))
590 const char *leader; local
888 const char *leader; local
925 const char *leader; local
1018 const char *leader = "\\n\\t\\t\\t\\t\\t"; local
[all...] |
| /src/external/bsd/libbind/dist/nameser/ |
| ns_print.c | 458 const char *leader; local
480 leader = "\n\t\t";
483 leader = " ";
485 T(addstr(leader, strlen(leader), &buf, &buflen));
501 const char *leader; local
542 leader = "\n\t\t";
545 leader = " ";
549 T(addstr(leader, strlen(leader), &buf, &buflen))
579 const char *leader; local
876 const char *leader; local
911 const char *leader; local
1002 const char *leader = "\\n\\t\\t\\t\\t\\t"; local
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| tree-ssa-sccvn.h | 206 So we have a chain of LOCATION, LEADER entries where LOCATION is
207 specifying the basic-block LEADER is made available for VALUE.
210 LOCATION is the basic-block index and LEADER is its SSA name version. */
214 /* The basic-block LEADER is made available. */
216 /* The LEADER for the value we are chained on. */
217 int leader; member in struct:vn_avail
|
| tree-ssa-pre.cc | 705 pre_expr leader = constant_value_expressions[-v]; local
706 if (!leader)
851 /* If we already found a leader for the value we've
1402 the phis in PRED. Return NULL if we can't find a leader for each part
1429 pre_expr leader, result; local
1431 leader = find_leader_in_sets (op_val_id, set1, set2);
1432 result = phi_translate (dest, leader, set1, set2, e);
1434 /* If op has a leader in the sets we translate make
1456 leader for it. */
1469 /* We want a leader in ANTIC_OUT or AVAIL_OUT here
1533 pre_expr leader; local
[all...] |
| tree-ssa-sccvn.cc | 5457 /* If the leader is a wrapping operation we can
6736 /* Return a leader for OP that is available at the current point of the
6791 the leader for the expression if insertion was successful. */
6815 tree leader = TREE_CODE (op) == SSA_NAME ? eliminate_avail (bb, op) : op; local
6816 if (!leader)
6823 TREE_TYPE (val), leader,
6828 TREE_TYPE (val), leader, gimple_assign_rhs2 (stmt));
6831 TREE_TYPE (val), leader);
6901 /* If there is no existing usable leader but SCCVN thinks
7004 /* If this is an assignment from our leader (whic
7820 tree leader = ssa_name (av->leader); local
[all...] |
| tree-vect-slp.cc | 1704 if (slp_tree *leader = bst_map->get (stmts))
1708 !(*leader)->failed ? "" : "failed ",
1709 (void *) *leader);
1710 if (!(*leader)->failed)
1712 SLP_TREE_REF_COUNT (*leader)++;
1713 vect_update_max_nunits (max_nunits, (*leader)->max_nunits);
1715 return *leader;
1717 memcpy (matches, (*leader)->failed, sizeof (bool) * group_size);
3077 if (slp_tree *leader = load_map->get (root))
3078 return *leader;
6971 slp_instance leader = get_ultimate_leader (instance, instance_leader); local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| tree-ssa-sccvn.h | 204 So we have a chain of LOCATION, LEADER entries where LOCATION is
205 specifying the basic-block LEADER is made available for VALUE.
208 LOCATION is the basic-block index and LEADER is its SSA name version. */
212 /* The basic-block LEADER is made available. */
214 /* The LEADER for the value we are chained on. */
215 int leader; member in struct:vn_avail
|
| tree-ssa-pre.cc | 717 pre_expr leader = constant_value_expressions[-v]; local
718 if (!leader)
863 /* If we already found a leader for the value we've
1414 the phis in PRED. Return NULL if we can't find a leader for each part
1441 pre_expr leader, result; local
1443 leader = find_leader_in_sets (op_val_id, set1, set2);
1444 result = phi_translate (dest, leader, set1, set2, e);
1445 if (result && result != leader)
1446 /* If op has a leader in the sets we translate make
1468 leader for it. *
1545 pre_expr leader; local
[all...] |
| tree-ssa-sccvn.cc | 5069 /* If the leader is a wrapping operation we can
6235 /* Return a leader for OP that is available at the current point of the
6273 the leader for the expression if insertion was successful. */
6297 tree leader = TREE_CODE (op) == SSA_NAME ? eliminate_avail (bb, op) : op; local
6298 if (!leader)
6305 TREE_TYPE (val), leader,
6310 TREE_TYPE (val), leader, gimple_assign_rhs2 (stmt));
6313 TREE_TYPE (val), leader);
6383 /* If there is no existing usable leader but SCCVN thinks
6505 /* If this is an assignment from our leader (whic
7305 tree leader = ssa_name (av->leader); local
[all...] |
| tree-vect-slp.cc | 1505 if (slp_tree *leader = bst_map->get (stmts))
1509 !(*leader)->failed ? "" : "failed ", *leader);
1510 if (!(*leader)->failed)
1512 SLP_TREE_REF_COUNT (*leader)++;
1513 vect_update_max_nunits (max_nunits, (*leader)->max_nunits);
1515 return *leader;
1517 memcpy (matches, (*leader)->failed, sizeof (bool) * group_size);
2830 if (slp_tree *leader = load_map->get (root))
2831 return *leader;
5180 slp_instance leader = get_ultimate_leader (instance, instance_leader); local
[all...] |
| /src/external/gpl2/rcs/dist/src/ |
| rcsedit.c | 56 * Convert C- and Pascal-style comment starts to ` *' in comment leader.
122 * Fix bug in comment leader expansion.
128 * Don't generate trailing white space for empty comment leader.
1115 struct buf leader; local
1121 bufautobegin(&leader);
1159 /* Copy characters before `$Log' into LEADER. */
1160 bufalloc(&leader, cs);
1161 cp = leader.string;
1163 leader.string[cw] = c;
1169 /* Convert traditional C or Pascal leader to ` *'. *
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| LiveDebugVariables.cpp | 293 UserValue *leader; ///< Equivalence class leader. member in class:__anon4202::UserValue
325 : Variable(var), Fragment(Fragment), dl(std::move(L)), leader(this),
328 /// Get the leader of this value's equivalence class.
330 UserValue *l = leader;
331 while (l != l->leader)
332 l = l->leader;
333 return leader = l;
350 End->leader = L1;
353 End->leader = L1
[all...] |
| /src/external/gpl2/xcvs/dist/src/ |
| rcs.c | 3865 char *leader; local
3896 * including the leading `$' of the Log keyword in our leader.
3900 /* If the automagically determined leader exceeds the limit set in
3907 leader = xstrdup (rcs->comment);
3913 "Skipping `$" "Log$' keyword due to excessive comment leader.");
3919 /* Copy the start of the line to use as a comment leader. */
3920 leader = xmalloc (leader_len);
3921 memcpy (leader, start, leader_len);
3925 while (leader_sp_len > 0 && isspace (leader[leader_sp_len - 1]))
3933 we know how many copies of the leader we will need. *
[all...] |
