Lines Matching defs:Size
28 // To reduce generated source code size.
68 Entry = NodePredicates.size();
77 Entry = PatternPredicates.size();
85 Entry = ComplexPatterns.size();
94 Entry = NodeXForms.size();
164 // string while we get the size. Unfortunately, the offset of the
165 // children depends on the VBR size of the child, so for large children we
291 // For each case we emit the size, then the opcode, then the matcher.
297 IdxSize = 2; // size of opcode in table is 2 bytes.
300 IdxSize = 1; // size of type in table is 1 byte.
305 // string while we get the size. Unfortunately, the offset of the
306 // children depends on the VBR size of the child, so for large children we
600 unsigned Size = 0;
605 Size += MatcherSize;
612 return Size;
621 for (unsigned i = 0, e = PatternPredicates.size(); i != e; ++i)
640 for (unsigned i = 0, e = NodePredicates.size(); i != e; ++i) {
659 OS << " unsigned NextRes = Result.size();\n";
662 for (unsigned i = 0, e = ComplexPatterns.size(); i != e; ++i) {
702 for (unsigned i = 0, e = NodeXForms.size(); i != e; ++i) {
730 if (unsigned(M->getKind()) >= OpcodeFreq.size())
758 for (unsigned i = 0, e = OpcodeFreq.size(); i != e; ++i) {
821 OS << " 0\n }; // Total Array size is " << (TotalSize+1) << " bytes\n\n";
