| /src/external/bsd/openldap/dist/servers/lloadd/ |
| main.c | 235 parse_debug_unknowns( char **unknowns, int *levelp )
239 for ( i = 0; unknowns[i] != NULL; i++ ) {
241 if ( str2loglevel( unknowns[i], &level ) ) {
242 fprintf( stderr, "unrecognized log level \"%s\"\n", unknowns[i] );
252 parse_debug_level( const char *arg, int *levelp, char ***unknowns )
267 ldap_charray_add( unknowns, levels[i] );
|
| /src/external/bsd/openldap/dist/servers/slapd/ |
| logging.c | 374 parse_debug_unknowns( char **unknowns, int *levelp )
378 for ( i = 0; unknowns[ i ] != NULL; i++ ) {
380 if ( str2loglevel( unknowns[ i ], &level )) {
382 "unrecognized log level \"%s\"\n", unknowns[ i ] );
400 char ***unknowns = which ? &syslog_unknowns : &debug_unknowns; local
409 ldap_charray_add( unknowns, levels[ i ] );
|
| /src/external/gpl3/gcc/dist/gcc/ |
| tree-object-size.cc | 959 size_unknown, as noted in UNKNOWNS. */
962 propagate_unknowns (object_size_info *osi, tree expr, bitmap unknowns)
969 if (bitmap_bit_p (unknowns, SSA_NAME_VERSION (expr)))
977 unknowns);
981 res = propagate_unknowns (osi, TREE_OPERAND (expr, 1), unknowns);
990 unknowns);
999 unknowns);
1008 unknowns);
1030 /* Step 1: Propagate unknowns into expressions. */
1033 bitmap unknowns = BITMAP_ALLOC (NULL) local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| tree-object-size.cc | 46 bitmap visited, reexamine, unknowns; member in struct:object_size_info
267 bitmap_set_bit (osi->unknowns, SSA_NAME_VERSION (oldval));
268 bitmap_set_bit (osi->unknowns, SSA_NAME_VERSION (old_wholeval));
882 size_unknown, as noted in UNKNOWNS. */
892 if (bitmap_bit_p (osi->unknowns, SSA_NAME_VERSION (expr)))
949 /* Step 1: Propagate unknowns into expressions. */
974 /* Release all unknowns. */
975 EXECUTE_IF_SET_IN_BITMAP (osi->unknowns, 0, i, bi)
1104 osi.unknowns = BITMAP_ALLOC (NULL);
1124 BITMAP_FREE (osi.unknowns);
[all...] |
| /src/external/mit/isl/dist/doc/ |
| implementation.tex | 303 \subsection{Negative Unknowns and Maximization}
305 There are two places in the above algorithm where the unknowns $\vec x$
309 To deal with negative unknowns, \textcite[Appendix A.2]{Fea91}
343 specify that the unknowns may be negative or that the maximum should
348 negative unknowns and maximization are by far the most common applications
354 are made on the sign of the unknowns. Instead, the sign of the unknowns
357 does explicitly add non-negativity constraints on the unknowns unless
378 over the combined space of unknowns and parameters.
500 It is also possible to perform a similar compression on the unknowns,
[all...] |
| /src/external/gpl3/gdb.old/dist/gdbserver/ |
| server.cc | 2696 std::vector<const char *> unknowns; local
2776 unknowns.push_back (feature.c_str ());
2782 target_process_qsupported (unknowns);
|
| /src/external/gpl3/gdb/dist/gdbserver/ |
| server.cc | 2669 std::vector<const char *> unknowns; local
2749 unknowns.push_back (feature.c_str ());
2755 target_process_qsupported (unknowns);
|
