Lines Matching defs:size

194         if (smStack[sid].size()) {
216 for (int x = smStack[sid].size()-1; x >= 0; x--)
243 DPRINTF(Annotate, "st: %s smi: %d stCache.size %d\n", st,
244 smi, stCache.size());
281 if (!smStack[sid].size() || smMap[smib-1].second.first != sm) {
285 for (int x = smStack[sid].size()-1; x >= 0; x--)
308 if (smStack[sid].size()) {
313 for (int x = smStack[sid].size()-1; x >= 0; x--)
376 if (!smStack[sid].size())
407 if (!smStack[sid].size()) {
437 if (!smStack[sid].size())
448 "swQ: %s[%#x] cur size %d %d bytes: %d adding: %d\n",
449 q, id, qSize[qi-1], qData[qi-1].size(), qBytes[qi-1], count);
468 if (!smStack[sid].size())
475 "swDq: %s[%#x] cur size %d %d bytes: %d removing: %d\n",
476 q, id, qSize[qi-1], qData[qi-1].size(), qBytes[qi-1], count);
497 if (!smStack[sid].size())
504 "swPq: %s [%#x] cur size %d %d bytes: %d peeking: %d\n",
505 q, id, qSize[qi-1], qData[qi-1].size(), qBytes[qi-1], count);
532 if (!smStack[sid].size())
539 "swRq: %s [%#x] cur size %d %d bytes: %d reserve: %d\n",
540 q, id, qSize[qi-1], qData[qi-1].size(), qBytes[qi-1], count);
563 if (!smStack[sid].size())
591 if (!smStack[sid].size())
616 int32_t size = args[2];
621 if (!smStack[sid].size())
625 DPRINTF(AnnotateQ, "swSq: %s [%#x] cur size: %d bytes: %d, new size: %d\n",
626 q, id, qSize[qi-1], qBytes[qi-1], size);
636 if (qBytes[qi-1] < size)
637 doQ(sys, FL_NONE, tc->contextId(), smi, q, qi, size - qBytes[qi-1]);
638 else if (qBytes[qi-1] > size) {
640 add(OP_SIZE_QUEUE, FL_NONE, tc->contextId(), smi, qi, size);
641 if (size <= 0) {
647 int need = qBytes[qi-1] - size;
648 qBytes[qi-1] = size;
654 fatal("Queue %s had inconsistancy when doing size queue!\n", q);
684 int32_t size = args[2];
688 if (qBytes[qi-1] != size) {
689 DPRINTF(AnnotateQ, "Queue %s [%#x] has inconsintant size\n", q, id);
695 DPRINTF(AnnotateQ, "--Element %d size %d\n", x, (*ai)->data);
702 curTick(), size, q, qBytes[qi-1]);
705 curTick(), size, q, qBytes[qi-1]);
723 if (!smStack[sid].size())
755 if (!smStack[sid].size())
773 if (!smStack[sid].size())
800 if (!smStack[sid].size())
869 for (int x = 1; x < state_machines.size(); x++) {
872 assert(x-1 < stCache.size());
879 for (int y = 1; y < states.size(); y++)
888 for (int x = 0; x < smMap.size(); x++)
905 for (int x = 1; x < systems.size(); x++) {
912 for (int x = 0; x < qMap.size(); x++)
925 for (int x = 0; x < annotateIdx.size(); x++)
947 if (!all && data.size() < 10000)
950 DPRINTF(Annotate, "Writing %d\n", data.size());
993 DPRINTFS(AnnotateQ, sys, "Queing in queue %s size now %d/%d\n",
1011 DPRINTF(AnnotateQ, "Dequeing all data in queue %s size now %d/%d\n",
1017 if (qSize[qi-1] <= 0 || qBytes[qi-1] <= 0 || !qData[qi-1].size()) {
1025 assert(qData[qi-1].size());
1060 DPRINTF(AnnotateQ, "Dequeing in queue %s size now %d/%d\n",
1095 for (x = 0; x < stCache.size(); x++) {
1107 for (x = 0; x < qCache.size(); x++) {
1119 for (x = 0; x < smCache.size(); x++) {
1122 paramOut(os, csprintf("smCache%d", x), smCache[x].size());
1150 paramOut(os, "smStackIdCount", smStack.size());
1154 paramOut(os, csprintf("smStackId%d.count", x), si->second.size());
1155 for (y = 0; y < si->second.size(); y++)
1164 paramOut(os, "lnMapSize", lnMap.size());
1175 paramOut(os, "swExplCount", swExpl.size());
1187 paramOut(os, "lastStateSize", lastState.size());
1195 for (x = 0; x < smMap.size(); x++) {
1202 for (x = 0; x < qMap.size(); x++) {
1209 for (x = 0; x < qData.size(); x++) {
1210 if (!qData[x].size())
1268 int size;
1269 paramIn(cp, csprintf("smCache%d", x), size);
1270 for (int y = 0; y < size; y++) {
1351 for (int x = 0; x < smMap.size(); x++) {
1359 for (int x = 0; x < qMap.size(); x++) {
1367 qData.resize(qSize.size());
1368 for (int x = 0; x < qSize.size(); x++) {