Loading Documentation/DocBook/kernel-locking.tmpl +1 −1 Original line number Original line Diff line number Diff line Loading @@ -1590,7 +1590,7 @@ the amount of locking which needs to be done. <para> <para> Our final dilemma is this: when can we actually destroy the Our final dilemma is this: when can we actually destroy the removed element? Remember, a reader might be stepping through removed element? Remember, a reader might be stepping through this element in the list right now: it we free this element and this element in the list right now: if we free this element and the <symbol>next</symbol> pointer changes, the reader will jump the <symbol>next</symbol> pointer changes, the reader will jump off into garbage and crash. We need to wait until we know that off into garbage and crash. We need to wait until we know that all the readers who were traversing the list when we deleted the all the readers who were traversing the list when we deleted the Loading Documentation/driver-model/overview.txt +1 −1 Original line number Original line Diff line number Diff line Loading @@ -18,7 +18,7 @@ Traditional driver models implemented some sort of tree-like structure (sometimes just a list) for the devices they control. There wasn't any (sometimes just a list) for the devices they control. There wasn't any uniformity across the different bus types. uniformity across the different bus types. The current driver model provides a comon, uniform data model for describing The current driver model provides a common, uniform data model for describing a bus and the devices that can appear under the bus. The unified bus a bus and the devices that can appear under the bus. The unified bus model includes a set of common attributes which all busses carry, and a set model includes a set of common attributes which all busses carry, and a set of common callbacks, such as device discovery during bus probing, bus of common callbacks, such as device discovery during bus probing, bus Loading Loading
Documentation/DocBook/kernel-locking.tmpl +1 −1 Original line number Original line Diff line number Diff line Loading @@ -1590,7 +1590,7 @@ the amount of locking which needs to be done. <para> <para> Our final dilemma is this: when can we actually destroy the Our final dilemma is this: when can we actually destroy the removed element? Remember, a reader might be stepping through removed element? Remember, a reader might be stepping through this element in the list right now: it we free this element and this element in the list right now: if we free this element and the <symbol>next</symbol> pointer changes, the reader will jump the <symbol>next</symbol> pointer changes, the reader will jump off into garbage and crash. We need to wait until we know that off into garbage and crash. We need to wait until we know that all the readers who were traversing the list when we deleted the all the readers who were traversing the list when we deleted the Loading
Documentation/driver-model/overview.txt +1 −1 Original line number Original line Diff line number Diff line Loading @@ -18,7 +18,7 @@ Traditional driver models implemented some sort of tree-like structure (sometimes just a list) for the devices they control. There wasn't any (sometimes just a list) for the devices they control. There wasn't any uniformity across the different bus types. uniformity across the different bus types. The current driver model provides a comon, uniform data model for describing The current driver model provides a common, uniform data model for describing a bus and the devices that can appear under the bus. The unified bus a bus and the devices that can appear under the bus. The unified bus model includes a set of common attributes which all busses carry, and a set model includes a set of common attributes which all busses carry, and a set of common callbacks, such as device discovery during bus probing, bus of common callbacks, such as device discovery during bus probing, bus Loading
Adrian Bunk <bunk@stusta.de>Adrian Bunk <bunk@stusta.de>