| |
---|
| | Isn't that what ``PROGRAM==`` does?" Not exactly, Grasshopper. |
---|
| | ``PROGRAM==`` *always* runs regardless of prior matching. That's |
---|
| | because ``PROGRAM==`` is itself a *matching* key-value construct. |
---|
| | It's used to *figure out* whether a match has taken place (by |
---|
| | means of it populating ``RESULTS``). It this has to run every |
---|
| | means of it populating ``RESULTS``). It thus has to run every |
---|
| | time. ``RUN==``, on the other hand, *only* runs if all prior |
---|
| | matching has been successful. |
---|
| | |
---|
| | Why is that important here? Say we boot the system, and the |
---|
| |
---|
| | |
---|
| | Document Revision Information |
---|
| | ============================= |
---|
| | |
---|
| | ``$Id: Deconstructing_Linux_udev_Rules.rst,v 1.116 2013/11/01 03:22:50 tundra Exp $`` |
---|
| | ``$Id: Deconstructing_Linux_udev_Rules.rst,v 1.117 2013/11/01 03:26:47 tundra Exp $`` |
---|
| | |
---|
| | You can find the latest version of this document at: |
---|
| | |
---|
| | http://www.tundraware.com/TechnicalNotes/Deconstructing-Linux-udev-Rules |
---|
| | |
---|
| | A pdf version of this document can be downloaded at: |
---|
| | |
---|
| | http://www.tundraware.com/TechnicalNotes/Deconstructing-Linux-udev-Rules/Deconstructing-Linux-udev-Rules.pdf |
---|
| | |
---|
| | This document produced with ``emacs`` and ``RestructuredText``. |
---|
| | |
---|
| | |