| /src/external/gpl3/gcc.old/dist/libgomp/ |
| splay-tree.c | 137 int comparison = 0; local
142 comparison = splay_compare (&sp->root->key, &node->key);
144 if (sp->root && comparison == 0)
151 else if (comparison < 0)
|
| /src/external/gpl3/gcc/dist/libgomp/ |
| splay-tree.c | 141 int comparison = 0; local
146 comparison = splay_compare (&sp->root->key, &node->key);
148 if (sp->root && comparison == 0)
155 else if (comparison < 0)
|
| /src/external/gpl3/gcc/dist/gcc/ |
| splay-tree-utils.cc | 252 int comparison = rootless::compare_nodes (nodes[data1], nodes[data2]); local
254 ASSERT_TRUE (comparison < 0);
256 ASSERT_TRUE (comparison > 0);
258 ASSERT_EQ (comparison, 0);
|
| typed-splay-tree.h | 454 int comparison = 0; local
459 comparison = (*comp)(root->key, key);
461 if (root && comparison == 0)
479 else if (comparison < 0)
594 int comparison; local
604 comparison = (*comp)(root->key, key);
607 if (comparison < 0)
627 int comparison; local
637 comparison = (*comp)(root->key, key);
640 if (comparison > 0
[all...] |
| compare-elim.cc | 25 cannot make use of the comparison elimination offered by the combine pass.
27 This is a small pass intended to provide comparison elimination similar to
34 (1) All comparison patterns are represented as
73 /* These structures describe a comparison and how it is used. */
78 high-part of a double-word comparison. */
87 /* The comparison code applied against the flags register. */
91 struct comparison
93 /* The comparison instruction. */
96 /* The insn prior to the comparison insn that clobbers the flags. */
99 /* The insn prior to the comparison insn that sets in_a REG. *
90 struct comparison struct
[all...] |
| jump.cc | 352 /* Given a comparison (CODE ARG0 ARG1), inside an insn, INSN, return a code
353 of reversed comparison if it is possible to do so. Otherwise return UNKNOWN.
355 know whether it's source is floating point or integer comparison. Machine
364 /* If this is not actually a comparison, we can't reverse it. */
374 comparison. Give it priority over everything else to allow
380 /* Try a few special cases based on the comparison code. */
397 /* In case we already see unordered comparison, we can be sure to
412 /* Try to search for the comparison to determine the real mode.
434 rtx comparison = src;
438 mode = GET_MODE (XEXP (comparison, 1))
430 rtx comparison = src; local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/rtl-ssa/ |
| access-utils.h | 270 int comparison = lookup_call_clobbers (tree, insn); local
271 while (comparison <= 0 || ignore (tree->insn ()))
276 comparison = 1;
292 int comparison = lookup_call_clobbers (tree, insn); local
293 while (comparison >= 0 || ignore (tree->insn ()))
298 comparison = -1;
|
| insns.cc | 343 int comparison = lookup_call_clobbers (*ecc, insn); local
344 gcc_assert (comparison == 0);
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| splay-tree-utils.cc | 252 int comparison = rootless::compare_nodes (nodes[data1], nodes[data2]); local
254 ASSERT_TRUE (comparison < 0);
256 ASSERT_TRUE (comparison > 0);
258 ASSERT_EQ (comparison, 0);
|
| typed-splay-tree.h | 454 int comparison = 0; local
459 comparison = (*comp)(root->key, key);
461 if (root && comparison == 0)
479 else if (comparison < 0)
594 int comparison; local
604 comparison = (*comp)(root->key, key);
607 if (comparison < 0)
627 int comparison; local
637 comparison = (*comp)(root->key, key);
640 if (comparison > 0
[all...] |
| compare-elim.cc | 25 cannot make use of the comparison elimination offered by the combine pass.
27 This is a small pass intended to provide comparison elimination similar to
34 (1) All comparison patterns are represented as
73 /* These structures describe a comparison and how it is used. */
78 high-part of a double-word comparison. */
87 /* The comparison code applied against the flags register. */
91 struct comparison
93 /* The comparison instruction. */
96 /* The insn prior to the comparison insn that clobbers the flags. */
99 /* The insn prior to the comparison insn that sets in_a REG. *
90 struct comparison struct
[all...] |
| jump.cc | 349 /* Given a comparison (CODE ARG0 ARG1), inside an insn, INSN, return a code
350 of reversed comparison if it is possible to do so. Otherwise return UNKNOWN.
352 know whether it's source is floating point or integer comparison. Machine
361 /* If this is not actually a comparison, we can't reverse it. */
371 comparison. Give it priority over everything else to allow
377 /* Try a few special cases based on the comparison code. */
394 /* In case we already see unordered comparison, we can be sure to
409 /* Try to search for the comparison to determine the real mode.
431 rtx comparison = src;
435 mode = GET_MODE (XEXP (comparison, 1))
427 rtx comparison = src; local
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/ |
| Iterator.cpp | 308 const auto comparison = local
311 assert(comparison.getAs<DefinedSVal>() &&
312 "Symbol comparison must be a `DefinedSVal`");
314 return !State->assume(comparison.castAs<DefinedSVal>(), false);
|
| IteratorModeling.cpp | 55 // of the comparison (1 or 0) but in case of type-III we only get a Symbol. In
59 // comparison itself.
65 // a constraint which we later retrieve when doing an actual comparison.
453 // Record the operands and the operator of the comparison for the next
491 // unsuccessful. We cannot handle the comparison in this case.
798 // 4. Assume the result of the comparison.
799 const auto comparison = local
803 assert(comparison.getAs<DefinedSVal>() &&
804 "Symbol comparison must be a `DefinedSVal`");
806 auto NewState = State->assume(comparison.castAs<DefinedSVal>(), Equal)
[all...] |
| /src/external/gpl3/binutils/dist/libiberty/ |
| splay-tree.c | 370 int comparison = 0; local
375 comparison = (*sp->comp)(sp->root->key, key);
377 if (sp->root && comparison == 0)
401 else if (comparison < 0)
513 int comparison; local
523 comparison = (*sp->comp)(sp->root->key, key);
526 if (comparison < 0)
544 int comparison; local
554 comparison = (*sp->comp)(sp->root->key, key);
557 if (comparison > 0
[all...] |
| /src/external/gpl3/binutils.old/dist/libiberty/ |
| splay-tree.c | 370 int comparison = 0; local
375 comparison = (*sp->comp)(sp->root->key, key);
377 if (sp->root && comparison == 0)
401 else if (comparison < 0)
513 int comparison; local
523 comparison = (*sp->comp)(sp->root->key, key);
526 if (comparison < 0)
544 int comparison; local
554 comparison = (*sp->comp)(sp->root->key, key);
557 if (comparison > 0
[all...] |
| /src/external/gpl3/gcc/dist/gcc/rtl-ssa/ |
| access-utils.h | 335 int comparison = lookup_call_clobbers (tree, insn); local
336 while (comparison <= 0 || ignore (tree->insn ()))
341 comparison = 1;
357 int comparison = lookup_call_clobbers (tree, insn); local
358 while (comparison >= 0 || ignore (tree->insn ()))
363 comparison = -1;
|
| insns.cc | 356 int comparison = lookup_call_clobbers (*ecc, insn); local
357 gcc_assert (comparison == 0);
|
| accesses.h | 995 // - Otherwise, COMPARISON is 0 if we found a definition at P or a
999 // - Otherwise, COMPARISON is greater than 0 if we found the definition
1003 // - Otherwise, COMPARISON is less than zero and we found the definition
1043 int comparison; member in class:rtl_ssa::def_lookup
|
| /src/external/gpl3/gcc/dist/libiberty/ |
| splay-tree.c | 370 int comparison = 0; local
375 comparison = (*sp->comp)(sp->root->key, key);
377 if (sp->root && comparison == 0)
401 else if (comparison < 0)
513 int comparison; local
523 comparison = (*sp->comp)(sp->root->key, key);
526 if (comparison < 0)
544 int comparison; local
554 comparison = (*sp->comp)(sp->root->key, key);
557 if (comparison > 0
[all...] |
| /src/external/gpl3/gcc.old/dist/libiberty/ |
| splay-tree.c | 370 int comparison = 0; local
375 comparison = (*sp->comp)(sp->root->key, key);
377 if (sp->root && comparison == 0)
401 else if (comparison < 0)
513 int comparison; local
523 comparison = (*sp->comp)(sp->root->key, key);
526 if (comparison < 0)
544 int comparison; local
554 comparison = (*sp->comp)(sp->root->key, key);
557 if (comparison > 0
[all...] |
| /src/external/gpl3/gdb.old/dist/libiberty/ |
| splay-tree.c | 370 int comparison = 0; local
375 comparison = (*sp->comp)(sp->root->key, key);
377 if (sp->root && comparison == 0)
401 else if (comparison < 0)
513 int comparison; local
523 comparison = (*sp->comp)(sp->root->key, key);
526 if (comparison < 0)
544 int comparison; local
554 comparison = (*sp->comp)(sp->root->key, key);
557 if (comparison > 0
[all...] |
| /src/external/lgpl3/mpfr/dist/src/ |
| atan.c | 294 int comparison, inexact; local
349 comparison = mpfr_cmp_ui (xp, 1);
350 if (MPFR_UNLIKELY (comparison == 0))
411 if (comparison > 0) /* use atan(xp) = Pi/2 - atan(1/xp) */
428 if (red == 0 && comparison > 0)
498 if (comparison > 0)
|
| /src/external/gpl3/gdb/dist/libiberty/ |
| splay-tree.c | 370 int comparison = 0; local
375 comparison = (*sp->comp)(sp->root->key, key);
377 if (sp->root && comparison == 0)
401 else if (comparison < 0)
513 int comparison; local
523 comparison = (*sp->comp)(sp->root->key, key);
526 if (comparison < 0)
544 int comparison; local
554 comparison = (*sp->comp)(sp->root->key, key);
557 if (comparison > 0
[all...] |
| /src/external/gpl2/diffutils/dist/src/ |
| diff.h | 158 /* In directory comparison, specify file to start with (-S).
159 This is used for resuming an aborted comparison.
208 /* The result of comparison is an "edit script": a chain of `struct change'.
286 The results of comparison are stored here. */
306 struct comparison
309 struct comparison const *parent; /* parent, if a recursive comparison */
325 int diff_2_files (struct comparison *);
332 int diff_dirs (struct comparison const *, int (*) (struct comparison const *, char const *, char const *))
303 struct comparison struct
[all...] |
