Using RPMs for systemd development
This is a modal window.
The media could not be loaded, either because the server or network failed or because the format is not supported.
Formal Metadata
| Title |
| |
| Title of Series | ||
| Number of Parts | 44 | |
| Author | ||
| License | CC Attribution 3.0 Unported: You are free to use, adapt and copy, distribute and transmit the work or content in adapted or unchanged form for any legal purpose as long as the work is attributed to the author in the manner specified by the author or licensor. | |
| Identifiers | 10.5446/46100 (DOI) | |
| Publisher | ||
| Release Date | ||
| Language | ||
| Producer |
Content Metadata
| Subject Area | ||
| Genre | ||
| Abstract |
|
All Systems Go! 201940 / 44
5
10
17
20
21
30
32
36
44
00:00
Computer animation
00:05
System programmingSynchronizationLaptopFibonacci numberLink (knot theory)Physical systemMathematicsSource codeVirtual machineMultiplication signSoftware developerComputer animation
00:48
System programmingComputer configurationDirectory serviceDialectBootingExecution unitContinuum hypothesisMaxima and minimaMusical ensembleBuildingMathematicsComputer fileComputer animation
01:03
System programmingConvex hullOSI modelExecution unitLocal ringInstallation artPhysical systemSynchronizationFlagSoftware testingSource codeComputer animation
01:13
Single sign-onSystem programmingInfinite conjugacy class propertyConvex hullSynchronizationQuadrilateralAnnulus (mathematics)Software testingSource codeComputer animation
01:26
Error messageSystem programmingLink (knot theory)Thomas KuhnLibrary (computing)Bit rateFingerprintMaß <Mathematik>Maxima and minima2 (number)Source codeComputer animation
01:44
Computer iconSystem programmingQuadrilateralAiry functionSynchronizationLine (geometry)Random numberCellular automatonLaptopDampingGradient1 (number)Physical systemRevision controlMathematicsLocal ringCache (computing)TimestampNetwork topologySource codeComputer animation
03:23
Hybrid computerQuadrilateralComputer wormGamma functionSynchronizationLaptopFormal verificationScripting languageSystem programmingLink (knot theory)Random numberMenu (computing)MIDIMathematicsSource codeComputer animation
03:54
System programmingWebsiteLattice (order)Computer animation
Transcript: English(auto-generated)
00:05
Hi. So I'm going to talk about using RPMs to develop systemd to the development. And you might think it takes a long time to build an RPM, and I'm going to try to build one from source here.
00:23
And it's going to take a long time. Meanwhile, I want to try to write a change to systemd. And let's say I want to change it to say, we're at all systems go.
00:45
And I want to test my change. So I'm going to install it on this machine. So I'm going to run a local build. And this is actually going to be an incremental build. You can see it's already in step two out of three, compiling the only file that was changed.
01:05
And now we're packing RPMs, stripping, testing. Wow, we're running tests. 530 tests.
01:21
They passed. 12 were skipped. And almost there. Saving the RPMs. And this took 48 seconds. Now we can actually test this.
01:40
Well, the RPMs are in my RPM build there. Oh, I had older ones there. But it doesn't matter, because the new ones have a later timestamp used for the release. So I can simply use RPM-F to install the latest version of the RPMs.
02:13
And it's going to ignore the RPMs I don't have on my system. And now, if I look at the journal, I'll see that my change went through.
02:29
So my change went through. And why use RPMs? So one reason is I can check quickly which version am I on.
02:41
And OK. And I want to know what was this based on. And I can see this was based on this commit. And the tree was dirty, because I forgot to commit. But if I had committed, I could go back to the exact same commit where I was. And if for some reason I don't want this anymore, I can simply use my local cache, downgrade system D.
03:18
So if I did something silly and it didn't work,
03:20
I can just go back to the original version. And my change was undone. And that's it. Thank you.
03:41
OK. Yeah. Sure. Thank you, Philippe.