HomeSort by: relevance | last modified time | path
    Searched refs:max_slots (Results 1 - 7 of 7) sorted by relevancy

  /src/external/ibm-public/postfix/dist/src/qmgr/
qmgr_job.c 491 int max_slots, max_needed_entries, max_total_entries; local
517 max_slots = (MIN_ENTRIES(current) - current->selected_entries
522 * score. In addition to jobs which don't meet the max_slots limit, skip
539 if (max_slots > 0) {
546 if (max_needed_entries > 0 && max_needed_entries <= max_slots) {
  /src/sys/external/bsd/vchiq/dist/interface/vchiq_arm/
vchiq_core.h 396 int32_t max_slots; member in struct:vchiq_slot_zero_struct
vchiq_core.c 2323 slot_zero->max_slots = htole32(VCHIQ_MAX_SLOTS);
2397 (le32toh(slot_zero->max_slots) != VCHIQ_MAX_SLOTS) ||
2411 if (le32toh(slot_zero->max_slots) != VCHIQ_MAX_SLOTS)
2412 vchiq_loud_error("slot_zero=%p: max_slots=%d "
2414 slot_zero, le32toh(slot_zero->max_slots),
  /src/external/gpl3/gcc/dist/gcc/
genattrtab.cc 4506 int max_slots; local
4517 for (delay = delays, max_slots = 0; delay; delay = delay->next)
4518 if (XVECLEN (delay->def, 1) / 3 > max_slots)
4519 max_slots = XVECLEN (delay->def, 1) / 3;
4533 fprintf (outf, " gcc_assert (slot < %d);\n", max_slots);
4553 sprintf (str, " * %d;\n break;", max_slots);
4562 fprintf (outf, " gcc_assert (slot >= %d);\n\n", max_slots);
4566 if (num_delays == 1 && max_slots == 1)
4596 (i / 3) + (num_delays == 1 ? 0 : delay->num * max_slots));
tree.cc 1636 SLOT is the slot entry to store it in, and MAX_SLOTS is the maximum
1641 int slot, int max_slots)
1648 TYPE_CACHED_VALUES (type) = make_tree_vec (max_slots);
  /src/external/gpl3/gcc.old/dist/gcc/
genattrtab.cc 4506 int max_slots; local
4517 for (delay = delays, max_slots = 0; delay; delay = delay->next)
4518 if (XVECLEN (delay->def, 1) / 3 > max_slots)
4519 max_slots = XVECLEN (delay->def, 1) / 3;
4533 fprintf (outf, " gcc_assert (slot < %d);\n", max_slots);
4553 sprintf (str, " * %d;\n break;", max_slots);
4562 fprintf (outf, " gcc_assert (slot >= %d);\n\n", max_slots);
4566 if (num_delays == 1 && max_slots == 1)
4596 (i / 3) + (num_delays == 1 ? 0 : delay->num * max_slots));
tree.cc 1653 SLOT is the slot entry to store it in, and MAX_SLOTS is the maximum
1658 int slot, int max_slots)
1665 TYPE_CACHED_VALUES (type) = make_tree_vec (max_slots);

Completed in 89 milliseconds