1. A node system of a high-availability cluster, the node system comprising:
a first register configured to store multi-state status data of the node; and
an output port configured to send signals representing the multi-state status data of the node,
wherein the multi-state status data of the node includes at least one degraded state.
2. The node system of claim 1, further comprising:
an input port configured to receive signals representing multi-state status data of another node;
a second register configured to store the multi-state status data from the other node,
wherein the multi-state status data of the other node includes at least one degraded state.
3. The node system of claim 2, wherein the multi-state status data of the other node further includes a no signal state.
4. The node system of claim 1, wherein the multi-state status data of the node includes multiple levels of degradation.
5. The node system of claim 3, wherein the multi-state status data of the other node includes multiple levels of degradation.
6. The node system of claim 2, wherein the input and output ports each couple to a point-to-point communication path for communicating the status data between nodes of the cluster.
7. The node system of 1, further comprising a rule file and an operating system, wherein the operating system applies rules from the rule file to determine the multi-state status of the node.
8. The node system of claim 7, wherein the rules includes a rule such that receipt of a critical chassis code results in a bad state and another rule such that receipt of a chassis code below critical results in a degraded state.
9. A method of status reporting for a node of a cluster, the method comprising applying a set of rules to determine current multi-state status of the node, wherein states of the multi-state status includes a good state, a bad state, and at least one degraded state.
10. The method of claim 9, further comprising:
writing the multi-state status of the node to a first register.
11. The method of claim 10, further comprising:
driving the multi-state status from the first register to a next node via a point-to-point communications path.
12. The method of claim 11, further comprising:
receiving multi-state status from another node; and
writing the multi-state status from the other node to a second register.
13. The method of claim 12, further comprising:
reading the statuses from the first and second registers; and
taking action to maintain high availability of the cluster based on the statuses read.
14. The method of claim 11, wherein the status writable into the second register includes a no signal state.
15. The method of claim 9, wherein the multi-state status of the node includes multiple levels of degradation.
16. The method of claim 12, wherein the multi-state status from the other node includes multiple levels of degradation.
17. The method of claim 9, wherein the set of rules includes a rule such that receipt of a chassis code of a critical level results in the bad state and another rule such that receipt of a chassis code of a level below critical results in a degraded state.
18. An apparatus for reporting status from a node of a cluster, the apparatus comprising:
a processor for executing instructions;
memory for holding data;
system interconnect to provide intercommunication between components of the apparatus;
a software module that is configured to apply a set of rules to determine current multi-state status of the node; and
signaling hardware configured to output the multi-state status of the node,
wherein states of the multi-state status includes a good state, a bad state, and at least one degraded state.
19. The apparatus of claim 18, wherein the signaling hardware is further configured to receive as input the multi-state status from another node of the cluster.
20. The apparatus of claim 19, wherein the multi-state status includes multiple levels of degradation.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.
1-23. (canceled)
24. A method of rendering a path, suitable for use in a device having graphics processing capabilities, wherein the path comprises at least two straight lines and at least one join connecting two of the at least two straight lines, comprising:
determining a mask associated with a stroke of the path;
rendering the path by filling the mask;
representing the mask by a plurality of triangles, wherein each of the at least two straight lines are represented by two triangles and the triangles representing two straight lines connected by one join are non-overlapping; and
creating the mask based on the plurality of triangles.
25. The method of claim 24, wherein each of the at least one join are represented by at most one triangle and the triangles representing two straight lines connected by one join and the at most one triangle representing the one join are non-overlapping.
26. The method of claim 24, wherein each of the plurality of triangles share at least two vertices with another one of the plurality of triangles.
27. The method of claim 26, wherein each of the plurality of triangles, except triangles representing an end of a straight line that is not connected to another straight line, share two first vertices with a first other one of the plurality of triangles and share two second vertices with a second other one of the plurality of triangles, at least one of the two second vertices being different from the two first vertices.
28. The method of claim 24, wherein the step of representing the mask by a plurality of triangles comprises:
associating each of the at least two straight lines with a quadrangle, wherein the shape of the quadrangle is defined by at least a starting point and an ending point of the associated straight line, a stroke width, and a join shape; and
dividing each of the quadrangles into two triangles with a straight line between two opposing vertices of the quadrangle.
29. The method of claim 28, wherein the join shape is a mitre join, and no triangle is used to represent the at least one join.
30. The method of claim 28, wherein the join shape is a bevel join, and one triangle is used to represent each of the at least one join.
31. The method of claim 24, further comprising defining the plurality of triangles as a sequence of vertices, and wherein the step of creating a mask based on the plurality of triangles comprises creating the mask based on the sequence of vertices.
32. The method of claim 31, wherein the plurality of triangles comprises m triangles and the sequence of vertices comprises m+2 vertices.
33. The method of claim 31, wherein each of the vertices appears only once in the sequence of vertices.
34. The method of claim 24, further comprising:
post-processing at least one of the at least one joins with a join shape stamp, and wherein the step of creating the mask further comprises creating the mask based on the join shape stamp.
35. The method of claim 34, wherein the join shape stamp comprises a join stamp triangle, and wherein creating the mask based on the join shape stamp comprises creating the mask based on an arc between two of the vertices of the join stamp triangle.
36. The method of claim 34, wherein the join shape stamp andor cap shape stamp is a semi-circular shape stamp.
37. The method of claim 24, further comprising:
post-processing at least one of an end of a straight line that is not connected to another straight line with a cap shape stamp and wherein the step of creating the mask further comprises creating the mask based on the cap shape stamp.
38. The method of claim 37, wherein the cap shape stamp comprises first, second and third cap stamp triangles, and wherein creating the mask based on the cap shape stamp comprises creating the mask based on the third cap stamp triangle, on a first arc between two of the vertices of the first cap stamp triangle, and on a second arc between two of the vertices of the second cap stamp triangle.
39. A computer program product comprising a computer readable medium, having stored thereon a computer program comprising program instructions, the computer program being loadable in to a data-processing unit and adapted to cause the data-processing unit to render a path, suitable for use in a device having graphics processing capabilities, wherein the path comprises at least two straight lines and at least one join connecting two of the at least two straight lines, and wherein the computer program comprises program instructions to:
determine a mask associated with a stroke of the path;
render the path by filling the mask;
represent the mask by a plurality of triangles, wherein each of the at least two straight lines are represented by two triangles and the triangles representing two straight lines connected by one join are non-overlapping; and
create the mask based on the plurality of triangles.
40. An arrangement for rendering a path, wherein the path comprises at least two straight lines and at least one join connecting two of the at least two straight lines, and wherein the arrangement comprises at least one computational unit adapted to:
determine a mask associated with a stroke of the path;
render the path by filling the mask;
represent the mask by a plurality of triangles, wherein each of the at least two straight lines are represented by two triangles and the triangles representing two straight lines connected by one join are non-overlapping; and
create the mask based on the plurality of triangles.
41. The arrangement of claim 40, wherein the at least one computational unit comprises:
a central processing unit adapted to determine the mask and represent the mask by the plurality of triangles; and
a graphics processing unit adapted to create the mask based on the plurality of triangles and render the path by filling the mask.
42. The arrangement of claim 41, wherein the central processing unit is further adapted to define the plurality of triangles as a sequence of vertices and forward the sequence of vertices to the graphics processing unit, and wherein the graphics processing unit is adapted to create the mask based on the sequence of vertices.
43. The arrangement of claim 41, wherein the central processing unit is further adapted to post-process at least one of the at least one joins with a join shape stamp and forward parameters defining the join shape stamp to the graphics processing unit.
44. The arrangement of claim 43, wherein the graphics processing unit is further adapted to create the mask based on the parameters defining the join shape stamp andor the cap shape stamp.
45. The arrangement of claim 41, wherein the central processing unit is further adapted to post-process at least one of an end of a straight line that is not connected to another straight line with a cap shape stamp and forward parameters defining the cap shape stamp to the graphics processing unit.