Lines Matching refs:partitions
65 * NPART is the total number of partitions. This must be <= 43, given the
66 * amount of space available to store extended partitions. It also must be
67 * <=26, given the use of single letters to name partitions. The 8 is the
68 * number of `standard' partitions; this arguably should be a #define, since
81 * cheat, using (effectively) ptr-&label.partitions[0].
126 struct part partitions[NPART];/* The partitions themselves */
163 * extended partitions (mainly the kernel).
356 * whenever we change it; we need to call it on all partitions
408 label.partitions[i].startcyl = 0;
409 label.partitions[i].nblk = 0;
410 set_endcyl(&label.partitions[i]);
455 label.partitions[i].startcyl = (uint32_t)l_l[i + i + 111];
456 label.partitions[i].nblk = (uint32_t)l_l[i + i + 112];
457 set_endcyl(&label.partitions[i]);
479 label.partitions[i + 8].startcyl = (uint32_t)l_l[j++];
480 label.partitions[i + 8].nblk = (uint32_t)l_l[j++];
481 set_endcyl(&label.partitions[i + 8]);
485 label.partitions[i + 8].startcyl = 0;
486 label.partitions[i + 8].nblk = 0;
487 set_endcyl(&label.partitions[i + 8]);
497 * partitions past the first 8 are size=0 cyl=0, we store all-0s in
534 l_s[(i * 4) + 222] = label.partitions[i].startcyl >> 16;
535 l_s[(i * 4) + 223] = label.partitions[i].startcyl & 0xffff;
536 l_s[(i * 4) + 224] = label.partitions[i].nblk >> 16;
537 l_s[(i * 4) + 225] = label.partitions[i].nblk & 0xffff;
540 if (label.partitions[i + 8].startcyl ||
541 label.partitions[i + 8].nblk)
550 l_s[j++] = label.partitions[i + 8].startcyl >> 16;
551 l_s[j++] = label.partitions[i + 8].startcyl & 0xffff;
552 l_s[j++] = label.partitions[i + 8].nblk >> 16;
553 l_s[j++] = label.partitions[i + 8].nblk & 0xffff;
734 cyl0 = label.partitions[epno].endcyl;
743 cyl0 = label.partitions[spno].startcyl;
757 if (label.partitions[epno].endcyl <= cyl0) {
762 size = label.partitions[epno].nblk;
764 if (cyl0 > label.partitions[epno].startcyl) {
765 size -= (cyl0 - label.partitions[epno].startcyl)
767 } else if (cyl0 < label.partitions[epno].startcyl) {
768 size += (label.partitions[epno].startcyl - cyl0)
779 if (label.partitions[spno].startcyl <= cyl0) {
784 size = (label.partitions[spno].startcyl - cyl0)
794 size = label.partitions[spno].nblk;
828 label.partitions[pno].startcyl = cyl0;
829 label.partitions[pno].nblk = size;
830 set_endcyl(&label.partitions[pno]);
831 if ((label.partitions[pno].startcyl * label.spc)
832 + label.partitions[pno].nblk > label.spc * label.ncyl) {
907 * and call set_endcyl on all partitions.
916 set_endcyl(&label.partitions[i]);
966 * we have fewer columns than partitions.
1006 * Print the partitions. The argument is true iff we should print all
1007 * partitions, even those set start=0 size=0. We generate one line
1025 struct part *p = label.partitions;
1186 struct part *p = label.partitions;