Lines Matching defs:walk
82 PedDiskType* walk;
88 for (walk = disk_types; walk && walk != disk_type;
89 last = walk, walk = walk->next);
91 PED_ASSERT (walk != NULL, return);
121 PedDiskType* walk = NULL;
125 for (walk = ped_disk_type_get_next (NULL); walk;
126 walk = ped_disk_type_get_next (walk))
127 if (strcasecmp (walk->name, name) == 0)
130 return walk;
141 PedDiskType* walk = NULL;
149 for (walk = ped_disk_type_get_next (NULL); walk;
150 walk = ped_disk_type_get_next (walk))
154 walk->name);
157 if (walk->ops->probe (dev))
166 return walk;
600 PedPartition* walk;
604 for (walk = disk->part_list; walk;
605 walk = ped_disk_next_partition (disk, walk)) {
606 const PedFileSystemType* fs_type = walk->fs_type;
611 if (!ped_partition_is_active (walk) || !fs_type)
614 geom = ped_file_system_probe_specific (fs_type, &walk->geom);
618 length_error = abs (walk->geom.length - geom->length);
619 max_length_error = PED_MAX (4096, walk->geom.length / 100);
620 bool ok = (ped_geometry_test_inside (&walk->geom, geom)
626 walk->geom.length);
633 walk->num, part_size, fs_size);
668 PedPartition* walk;
673 for (walk = disk->part_list; walk;
674 walk = ped_disk_next_partition (disk, walk)) {
675 if (ped_partition_is_active (walk)
676 && ! (walk->type & PED_PARTITION_LOGICAL))
689 PedPartition* walk;
694 for (walk = disk->part_list; walk;
695 walk = ped_disk_next_partition (disk, walk)) {
696 if (walk->num > highest)
697 highest = walk->num;
946 PedPartition* walk;
958 walk = ped_disk_get_partition (disk, i);
959 if (walk) {
960 if (!_partition_enumerate (walk))
966 for (walk = disk->part_list; walk;
967 walk = ped_disk_next_partition (disk, walk)) {
968 if (ped_partition_is_active (walk) && walk->num == -1) {
969 if (!_partition_enumerate (walk))
980 PedPartition* walk = NULL;
985 next = ped_disk_next_partition (disk, walk);
988 walk = next;
994 if (walk->type & PED_PARTITION_METADATA)
995 ped_disk_delete_partition (disk, walk);
1014 PedPartition* walk;
1017 walk = ped_disk_next_partition (disk, NULL);
1018 for (; walk; walk = next) {
1019 next = ped_disk_next_partition (disk, walk);
1021 if (walk->type & PED_PARTITION_FREESPACE) {
1022 _disk_raw_remove (disk, walk);
1023 ped_partition_destroy (walk);
1034 PedPartition* walk;
1046 for (walk = extended_part->part_list; walk; walk = walk->next) {
1047 if (walk->geom.start > last_end + 1) {
1053 last_end + 1, walk->geom.start - 1);
1054 _disk_raw_insert_before (disk, walk, free_space);
1057 last = walk;
1081 PedPartition* walk;
1093 for (walk = disk->part_list; walk; walk = walk->next) {
1094 if (walk->geom.start > last_end + 1) {
1097 last_end + 1, walk->geom.start - 1);
1098 _disk_raw_insert_before (disk, walk, free_space);
1101 last = walk;
1525 PedPartition* walk;
1529 for (walk = disk->part_list; walk; walk = walk->next) {
1530 if (walk->type == PED_PARTITION_EXTENDED)
1533 return walk;
1567 PedPartition* walk;
1571 for (walk = disk->part_list; walk; walk = walk->next) {
1572 PED_ASSERT (!(walk->type & PED_PARTITION_LOGICAL), return 0);
1573 PED_ASSERT (!walk->prev || walk->prev->next == walk, return 0);
1579 for (walk = ped_disk_extended_partition (disk)->part_list; walk;
1580 walk = walk->next) {
1581 PED_ASSERT (walk->type & PED_PARTITION_LOGICAL, return 0);
1582 if (walk->prev)
1583 PED_ASSERT (walk->prev->next == walk, return 0);
1597 PedPartition* walk;
1601 for (walk = disk->part_list; walk;
1602 walk = ped_disk_next_partition (disk, walk)) {
1603 if (walk->num == num && !(walk->type & PED_PARTITION_FREESPACE))
1604 return walk;
1618 PedPartition* walk;
1622 for (walk = disk->part_list; walk;
1623 walk = ped_disk_next_partition (disk, walk)) {
1624 if (ped_geometry_test_sector_inside (&walk->geom, sect)
1625 && walk->type != PED_PARTITION_EXTENDED)
1626 return walk;
1725 PedPartition* walk;
1734 walk = (part->type & PED_PARTITION_LOGICAL) ?
1737 for (; walk; last = walk, walk = walk->next) {
1738 if (walk->geom.start > part->geom.end)
1742 if (walk) {
1743 return _disk_raw_insert_before (disk, walk, part);
1763 PedPartition* walk;
1777 walk = ext_part->part_list;
1781 walk = part->disk->part_list;
1784 while (walk != NULL
1785 && (walk->geom.start < geom->start
1786 || min_start >= walk->geom.start)) {
1787 if (walk != part)
1788 min_start = walk->geom.end + 1;
1789 walk = walk->next;
1792 if (walk == part)
1793 walk = walk->next;
1795 if (walk)
1796 max_end = walk->geom.start - 1;
1820 PedPartition* walk;
1825 for (walk = ped_disk_next_partition (disk, NULL); walk;
1826 walk = ped_disk_next_partition (disk, walk)) {
1827 if (walk->type & PED_PARTITION_FREESPACE)
1829 if (walk == part)
1832 && walk->type & PED_PARTITION_LOGICAL)
1835 if (ped_geometry_test_overlap (&walk->geom, &part->geom)) {
1836 if (walk->type & PED_PARTITION_EXTENDED
1838 && ped_geometry_test_inside (&walk->geom,
1899 PedPartition* walk;
1916 for (walk = ext_part->part_list; walk; walk = walk->next) {
1917 if (!ped_geometry_test_inside (&ext_part->geom, &walk->geom)) {
2106 PedPartition* walk;
2114 for (walk = ext_part->part_list; walk; walk = next) {
2115 next = walk->next;
2117 if (!ped_disk_delete_partition (disk, walk))
2131 PedPartition* walk;
2139 for (walk = disk->part_list; walk; walk = next) {
2140 next = walk->next;
2142 if (!ped_disk_delete_partition (disk, walk)) {
2334 PedPartition* walk;
2355 for (walk = first_logical; walk->next; walk = walk->next);
2356 last_logical = walk;