| /src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
| debug_fn_imps.hpp | 127 degree(node_const_pointer p_nd) function in class:PB_DS_CLASS_C_DEC
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
| debug_fn_imps.hpp | 127 degree(node_const_pointer p_nd) function in class:PB_DS_CLASS_C_DEC
|
| /src/usr.bin/nbperf/ |
| graph2.h | 51 * The core observation of the paper above is that for a degree of one,
67 uint32_t degree, edges; local
|
| /src/external/gpl3/binutils/dist/include/ |
| fibheap.h | 67 __extension__ unsigned long int degree : 31; member in struct:fibnode
70 unsigned int degree : 31; member in struct:fibnode
|
| /src/external/gpl3/binutils.old/dist/include/ |
| fibheap.h | 67 __extension__ unsigned long int degree : 31; member in struct:fibnode
70 unsigned int degree : 31; member in struct:fibnode
|
| /src/external/gpl3/gcc/dist/include/ |
| fibheap.h | 67 __extension__ unsigned long int degree : 31; member in struct:fibnode
70 unsigned int degree : 31; member in struct:fibnode
|
| /src/external/gpl3/gcc.old/dist/include/ |
| fibheap.h | 67 __extension__ unsigned long int degree : 31; member in struct:fibnode
70 unsigned int degree : 31; member in struct:fibnode
|
| /src/external/gpl3/gdb/dist/include/ |
| fibheap.h | 67 __extension__ unsigned long int degree : 31; member in struct:fibnode
70 unsigned int degree : 31; member in struct:fibnode
|
| /src/external/gpl3/gdb.old/dist/include/ |
| fibheap.h | 67 __extension__ unsigned long int degree : 31; member in struct:fibnode
70 unsigned int degree : 31; member in struct:fibnode
|
| /src/sys/arch/vax/include/ |
| asm.h | 124 .macro polyf arg:req degree:req tbladdr:req
126 movzwl \degree, %r2 variable
137 .macro polyd arg:req degree:req tbladdr:req
139 movzwl \degree, %r2 variable
|
| /src/external/mit/isl/dist/ |
| isl_bound.c | 91 int degree; local
96 degree = isl_qpolynomial_degree(poly);
97 if (degree < -1)
99 if (degree <= 0)
|
| isl_bernstein.c | 103 * If the degree "d" is zero, then there are no exponents.
153 * of multi-degree (k[0], k[1], ..., k[n-1]) is divided by the corresponding
373 int degree; local
385 degree = isl_qpolynomial_degree(poly);
386 if (degree < -1)
388 if (degree <= 0)
|
| /src/crypto/external/apache2/openssl/dist/providers/implementations/exchange/ |
| ecdh_exch.c | 448 size_t degree = 0; local
455 degree = EC_GROUP_get_degree(group);
457 return (degree + 7) / 8;
|
| /src/crypto/external/bsd/openssl/dist/providers/implementations/exchange/ |
| ecdh_exch.c | 416 size_t degree = 0; local
423 degree = EC_GROUP_get_degree(group);
425 return (degree + 7) / 8;
|
| /src/lib/libc/cdb/ |
| cdbw.c | 362 * The core observation of the paper above is that for a degree of one,
366 uint32_t degree; member in struct:vertex
404 v->degree += delta;
414 if (v_->degree == 1) {
|
| /src/crypto/external/bsd/openssl.old/dist/test/ |
| ectest.c | 646 int degree; member in struct:c2_curve_test
879 if (!TEST_int_eq(EC_GROUP_get_degree(group), test->degree)
1218 int degree; member in struct:nistp_test_params
1328 test->degree);
1366 || !TEST_int_eq(EC_GROUP_get_degree(NISTP), test->degree))
|
| /src/crypto/external/apache2/openssl/dist/test/ |
| ectest.c | 617 int degree; member in struct:c2_curve_test
841 if (!TEST_int_eq(EC_GROUP_get_degree(group), test->degree)
1188 int degree; member in struct:nistp_test_params
1298 test->degree);
1336 || !TEST_int_eq(EC_GROUP_get_degree(NISTP), test->degree))
|
| /src/crypto/external/bsd/openssl/dist/test/ |
| ectest.c | 619 int degree; member in struct:c2_curve_test
853 if (!TEST_int_eq(EC_GROUP_get_degree(group), test->degree)
1213 int degree; member in struct:nistp_test_params
1323 test->degree);
1361 || !TEST_int_eq(EC_GROUP_get_degree(NISTP), test->degree))
|
| /src/usr.sbin/acpitools/acpidump/ |
| acpi.c | 1239 unsigned int degree; local
1246 degree = ((unsigned int)(bgrt->Status & ACPI_BGRT_ORIENTATION_OFFSET)
1248 printf("\tDegree=%u\n", degree);
|
| /src/external/gpl3/gcc/dist/gcc/ |
| sched-rgn.cc | 626 int *max_hdr, *dfs_nr, *degree;
779 to hold degree counts. */
780 degree = dfs_nr;
783 degree[bb->index] = EDGE_COUNT (bb->preds);
861 /* We save degree in case when we meet a too_large region
862 and cancel it. We need a correct degree later when
864 memcpy (degree1, degree,
867 /* Decrease degree of all I's successors for topological
871 --degree[e->dest->index];
949 the degree of a node if it is the target of a backedg
625 int *max_hdr, *dfs_nr, *degree; local
[all...] |
| sel-sched-ir.cc | 6206 int *degree;
6219 degree = XCNEWVEC (int, last_basic_block_for_fn (cfun));
6234 /* For each basic block degree is calculated as the number of incoming
6236 The basic blocks that are scheduled have degree value of zero. */
6239 degree[bb->index] = 0;
6245 degree[bb->index]++;
6248 degree[bb->index] = -1;
6251 extend_rgns (degree, &cur_rgn_blocks, bbs_in_loop_rgns, loop_hdr);
6256 if (degree[bb->index] >= 0)
6267 free (degree);
6179 int *degree; local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| sched-rgn.cc | 625 int *max_hdr, *dfs_nr, *degree;
777 to hold degree counts. */
778 degree = dfs_nr;
781 degree[bb->index] = EDGE_COUNT (bb->preds);
859 /* We save degree in case when we meet a too_large region
860 and cancel it. We need a correct degree later when
862 memcpy (degree1, degree,
865 /* Decrease degree of all I's successors for topological
869 --degree[e->dest->index];
947 the degree of a node if it is the target of a backedg
624 int *max_hdr, *dfs_nr, *degree; local
[all...] |
| sel-sched-ir.cc | 6206 int *degree;
6219 degree = XCNEWVEC (int, last_basic_block_for_fn (cfun));
6234 /* For each basic block degree is calculated as the number of incoming
6236 The basic blocks that are scheduled have degree value of zero. */
6239 degree[bb->index] = 0;
6245 degree[bb->index]++;
6248 degree[bb->index] = -1;
6251 extend_rgns (degree, &cur_rgn_blocks, bbs_in_loop_rgns, loop_hdr);
6256 if (degree[bb->index] >= 0)
6267 free (degree);
6179 int *degree; local
[all...] |
