1. Aspectual Components Part 2 April 5, 1999

2. Composition example Use three aspects simultaneously with three classes. Three aspects: –ShowReadWriteAccess –InstanceLogging –AutoReset Three classes: Point, Line, Rectangle

3. Shapes (Point, Line, Rectangle)AutoReset ShowReadWriteAccess InstanceLogging Point Line Rectangle Weaved Code

4. Inheritance between components component ShowReadWriteAccess extends ShowReadAccess { participant DataToAccess { expect void writeOp(Object[] args); replace void writeOp(Object[] args){ System.out.println( "Write access on " + this.toString()); expected(args);}} }

5. InstanceLogging component (first part) component InstanceLogging { participant DataToLog { expect public DataToLog(Object[] args); replace public DataToLog(Object[] args) { expected(args); long time = System.currentTimeMillis(); try { String class = this.class.getName() + " "; logObject.writeBytes(""New instance of " + class + at "" " + time + "" " \n"); } catch (IOException e) {System.out.println(e.toString());} }

6. InstanceLogging component (second part) protected DataOutputStream logObject = null; public init() { try {logObject = new DataOutputStream( new FileOutputStream(log));} catch (IOException e) {System.out.println(e.toString());} }

7. AutoReset component component AutoReset { participant DataToReset { expect void setOp(Object[] args); expect void reset(); protected int count = 0; replace void setOp(Object[] args) { if ( ++count >= 100 ) { expected(args); count = 0; reset(); }} }

8. Composition of components connector CompositionConn1 { {Line, Point} is ShowReadWriteAccess.DataToAccess with { readOp = get*; writeOp = set*;}; Point is AutoReset.DataToReset with { setOp = set*; void reset() { x = 0; y = 0; } }; {Line, Point, Rectangle} is InstanceLogging.DataToLog;}

9. ShapesAutoReset ShowReadWriteAccesses InstanceLogging Point Line Rectangle Weaved Code

10. Composition of components Connector graph CompositionConn1 Line, Point, Rectangle ShowReadWriteAccess.DataToAccess * * AutoReset.DataToReset * InstanceLogging.DataToLog * * *

11. Modified composition connector CompositionConn2 extends CompositionConn1 { Line is AutoReset.DataToReset with { setOp = set*; void reset() {init();} }; }

12. Composition of components Connector graph CompositionConn1 Line, Point, Rectangle ShowReadWriteAccess.DataToAccess * * AutoReset.DataToReset * InstanceLogging.DataToLog * * * Connector graph CompositionConn2 Line, Point, Rectangle ShowReadWriteAccess.DataToAccess * * AutoReset.DataToReset * * InstanceLogging.DataToLog * * *

13. Modify existing connection statements connector CompositionConn3 extends CompositionConn1 { Point is AutoReset.DataToReset with { { setOp = set; void reset() { x = 0; y = 0; }} { setOp = setX; void reset() { x = 0;}} { setOp = setY; void reset() { y = 0;}} }; }

14. Composition of components Connector graph CompositionConn3 Line, Point, Rectangle ShowReadWriteAccess.DataToAccess * * AutoReset.DataToReset *** InstanceLogging.DataToLog * * * overridden: ***

15. New example: Feature-oriented Programming Dependent aspects Order of deployment is relevant

16. DataWithCounter component pairwise interaction Data/Counter component DataWithCounter { private participant Counter { int i=0; void reset(){i=0;}; void inc(){…}; void dec(){…};} participant DataStructure { protected Counter counter; expect void initCounter(); expect void make_empty(); expect void push(Object a); expect void pop(); replace void make_empty(){counter.reset();expected();} replace void push(Object a){counter.inc(); expected(a);} replace void pop() {counter.dec();expected();} }

17. DataWithLock Component pairwise interaction Data/Lock component DataWithLock { participant Data { Lock lock; expect void initLock(); expect AnyType method_to_wrap(Object[] args); replace AnyType method_to_wrap(Object[] args) { if (lock.is_unlocked()) { lock.lock(); expected(Object[] args); lock.unlock(); }}} private participant Lock {boolean l = true; void lock(){…}; void unlock(){…}; boolean is_unlocked(){return l};}

18. StackImpl QueueImpl DataWithCounter DataWithLock Counter Lock

19. First connector connector addCounter&Lock { StackImpl is DataWithCounter.DataStructure with { void initCounter() {counter = new Counter();} void push(Object obj) {push(obj));} // use name map instead Object top() {return top();}... } is DataWithLock.Data with { method_to_wrap = {pop, push, top, make_empty, initCounter}; }; QueueImpl is DataWithCounter.DataStructure with {... } is DataWithLock.Data with {... }; }

20. DataWithCounter DataWithLock DataWithCounter&Lock

21. Create composed aspects prior to deployment component DataWithCounterAndLock { participant Data = DataWithCounter.DataStructure is DataWithLock.Data with { method-to-wrap = {make_empty, pop, top, push}}; }

22. Second connector: Deploy composed component connector addCounter&Lock { StackImpl is DataWithCounterAndLock.Data with { void make_empty() {empty();} void initCounter() { counter = new Counter();} void push(Object obj) {push(obj);}... }; QueueImpl is DataWithCounterAndLock.Data with {...}; }

23. Defining New Behavior: The Publisher- Subscriber Aspect an aspect can be multiply deployed with the same application, each deployment with its own mappings.

24. Publisher component PublisherSubscriberProtocol { participant Publisher { expect void changeOp(Object[] args); protected Vector subscribers = new Vector(); public void attach(Subscriber subsc) { subscribers.addElement(subsc);} public void detach(Subscriber subsc) { subscribers.removeElement(subsc);} replace void changeOp() { expected(); for (int i = 0; i < subscribers.size(); i++) {((Subscriber)subscribers.elementAt(i)). newUpdate(this);}}

25. Subscriber participant Subscriber { expect void subUpdate(Publisher publ); protected Publisher publ; public void newUpdate(Publisher aPubl) { publ = aPubl; subUpdate(publ);} }

26. Class for deployment class ChangePrinter { void public printR() { System.out.println("Printer: " + this.toString() + " read access has occurred..." + \n); } void public printW() { System.out.println("Printer: " + this.toString() + " write access has occurred..." + \n); } void public notifyChange() { System.out.println("CHANGE..."); }

27. Deployment 1 connector PubSubConn1 { Point is Publisher with { changeOp = {set*, get*};} ChangePrinter is Subscriber with { void subUpdate(Publisher publ) { notifyChange(); System.out.println(”on Point object " + ((Point) publ).toString()); }

28. Deployment 2 connector PubSubConn2 { TicTacToe is Publisher with { changeOp = {startGame, newPlayer, putMark, endGame}}; {BoardDisplay, StatusDisplay} is Subscriber with { void subUpdate(Publisher publ) { setGame((Game) publ); repaint(); } }; }

29. Deployment/write connector PubSubConn3 { Point is Publisher with { changeOp = set*;} ChangePrinter is Subscriber with { void subUpdate(Publisher publ) { printW(); System.out.println("on point object " + ((Point) publ).toString()); }

30. Deployment/read connector PubSubConn4 { Point is Publisher with { changeOp = get*;} ChangePrinter is Subscriber with { void subUpdate(Publisher publ) { printR(); System.out.println("on point object " + ((Point) publ).toString()); }

31. Overlap between connectors The sets of operations of Point that are mapped to different notification operations of the subscriber participant need not be disjoint. For instance, we may want to distinguish between set operations that affect the x-coordinate, respectively, the y- coordinate of a point. The set(int, int), however, will then fall in both categories. This is expressed by the connectors PubSubConn3_1 and PubSubConn3_2 below.

32. Deployment/write connector PubSubConn3_1 { Point is Publisher with { changeOp = {set,setX};} ChangePrinter is Subscriber with { void subUpdate(Publisher publ) { printW(); System.out.println("on point object " + ((Point) publ).toString()); }

33. Deployment/write connector PubSubConn3_2 { Point is Publisher with { changeOp = {set, setY};} ChangePrinter is Subscriber with { void subUpdate(Publisher publ) { printW(); System.out.println("on point object " + ((Point) publ).toString()); }

34. Mapping Participant Graphs Is the deployment of a component giving the intended result? Example: Three participants: A, B, C –A has 0..* B; B has 1..* C. –A::f(int x1){for each b: f(x1);} –B::f(int x1){for each c: f(x);} // x a data member local to B –C::f(int x1){print(“at C: number at previous B”); print(x1);}

35. Expected output at C: number at previous B 78 at C: number at previous B 8

36. Mapping A C B A B C 1..* 0..*

37. Refinement This property must hold between a PG and a corresponding CG or another PG. The intent of the refinement relation is to ensure that the behavior in the component will be properly instantiated at the place of use without ``surprising'' behavior.

38. A A BB C C D D E E F F G1G1 G2G2 G 1 refinement G 2 refinement: connectivity of G 2 is in pure form in G 1 Allows extra connectivity.

39. A A BB C C D D E E F F G1G1 G2G2 G 1 refinement G 2 refinement: connectivity of G 2 is in pure form in G 1

40. A A BB C C D D E E F F G1G1 G2G2 G 1 compatible G 2 Compatible: connectivity of G 2 is in G 1

41. A A BB C C D D E E F F G1G1 G2G2 G 1 strong refinement G 2 refinement: connectivity of G 2 is in pure form in G 1 and G 1 contains no new connections in terms of nodes of G 2

42. Key concepts: refinement Let G1=(V1,E1) and G2=(V2,E2) be directed graphs with V2 a subset of V1. Graph G 1 is a refinement of G 2 if for all u,v in V 2 we have that (u,v) in E 2 implies that there exists a path in G 1 between u and v which does not use in its interior a node in V 2. Polynomial time.

43. Refinement For each edge in G2 there must be a corresponding pure path in G1. Pure path = in interior no nodes of G2. Refinement = strong refinement with “if and only if” replaced by “implies”.

44. A A BB C C D D E E F F G1G1 G2G2 G 1 refinement G 2 Implementation: create strategy constraint map: bypassing all nodes

45. A A B B G1G1 G2G2 not G 1 refinement G 2 C C Refinement means: no surprises

46. A A B B G1G1 G2G2 G 1 refinement G 2 C C Refinement means: no surprises X

47. A B G2G2 G1G1 not G 1 refinement G 2 C Refinement means: no surprises A B C

48. Alternative definition a graph G is a refinement of a graph S, if S is a connected subgraph of the pure transitive closure of G with respect to the node set of S.

49. Pure transitive closure The pure transitive closure of G=(V,E) with respect to a subset W of V is the graph G*=(V,E*), where E*={(i,j): there is a W- pure path from vertex i to vertex j in G}. A W-pure path from i to j is a path where i and j are in W and none of the inner nodes of the path are in W.

50. Implementation issues Translate to AspectJ: requires source code access. What if aspectual components only in binary? Want separate compilation of application and aspectual components.

51. Interfaces between components and application Usage interface –expected in order to be used by participants Modification interface –expected in order to be replaced by the aspect

52. Writing components directly in Java Benefit: no new language to learn

53. Participants as abstract classes class AutoReset { abstract class DataToReset { abstract void reset(); protected int count = 0; void replaced_setOp(Object thisObject, Class thisClass, Method expected_setOp, Object[] args) { if ( ++count >= 100 ) { expected_setOp.invoke(thisObject, args); count = 0; reset(); }

54. AutoReset component component AutoReset { participant DataToReset { expect void setOp(Object[] args); expect void reset(); protected int count = 0; replace void setOp(Object[] args) { if ( ++count >= 100 ) { expected(args); count = 0; reset(); }} }

55. What about connectors in Java? Translation to Java not straight-forward

56. Approach Methods in –usage interface: abstract methods –modification interface: x() translated to replaced_x(). Expected implementation of x() will be a parameter to replaced_x(). x=setOp void replaced_setOp(Object thisObject, Class thisClass, Method expected_setOp, Object[] args) { if ( ++count >= 100 ) { expected_setOp.invoke(thisObject, args);

57. Approach Question: Why is thisClass used as an argument? Is not used in this example. void replaced_setOp(Object thisObject, Class thisClass, Method expected_setOp, Object[] args) { if ( ++count >= 100 ) { expected_setOp.invoke(thisObject, args);

58. Binary Adaptation of Application Classes Application classes are turned into event publishers by adding a field that stores a set of subscribers (from connectors). Any application operation op that is mapped to expected operation in modification interface: renamed to expected_op new implementation of op : invokes notify on subscribers

59. Pseudo-code simulating binary adaptation class Point { public static java.util.Vector aspectSubscribers; // added variable public void addSubscriber(AspectSubscriber sub) { // added operation aspectSubscribers.addElement((Object) sub);} private int x = 0; private int y = 0;

60. Pseudo-code simulating binary adaptation void expected_set(int x, int y) { // renamed this.x = x; this.y = y;} void set(int x, int y) { // reimplemented Object[] args = {(Object) new Integer(x), (Object) new Integer(y)}; Class[] argTypes = {Integer.TYPE, Integer.TYPE}; Method expected_set = thisClass.getMethod("expected_set", argTypes); Enumeration subscribers = aspectSubscribers.elements(); while (subscribers.hasElements()) { Object sub = subscribers.next(); sub.notify(this, this.getClass(), expected_set, args);}} …}

61. Generating Connector Classes Generate a class for each connector Example: CompositionConn3

62. Recall: CompositionConn1 connector CompositionConn1 { {Line, Point} is ShowReadWriteAccess.DataToAccess with { readOp = get*; writeOp = set*;}; Point is AutoReset.DataToReset with { setOp = set*; void reset() { x = 0; y = 0; } }; {Line, Point, Rectangle} is InstanceLogging.DataToLog;}

63. Recall: CompositionConn3 connector CompositionConn3 extends CompositionConn1 { Point is AutoReset.DataToReset with { { setOp = set; void reset() { x = 0; y = 0; }} { setOp = setX; void reset() { x = 0;}} { setOp = setY; void reset() { y = 0;}} }; }

64. Connector Class code interface AspectSubscriber { void notify(Object thisObject, Class thisClass, Method expected_meth, Object[] args);} interface Evaluable { void eval(Object thisObject, Class thisClass, Method expected_meth, Object[] args);}

65. Connector class generated class CompositionConn3 implements AspectSubscriber { public static singleInstance = new CompositionConn3(); java.util.Hashtable mappings = new java.util.Hashtable(); abstract class Point_DataToReset_setOp extends AutoReset.DataToReset implements Evaluable { private Point host; public void eval(Object thisObject, Class thisClass, Method expected_meth, Object[] args) { host = (Point) thisObject; replaced_setOp(thisObject, thisClass, expected_meth, args); }

66. public CompositionConn3() { Object[] argTypes = {Integer.TYPE, Integer.TYPE}; Method expected_set = Point.getMethod("expected_set", argTypes); argTypes = {Integer.TYPE}; Method expected_setX = Point.getMethod("expected_setX", argTypes); Method expected_setY = Point.getMethod("expected_setY", argTypes); mappings.put((Object) expected_set, (Object) new Point_DataToReset_setOp() { void reset() {host.expected_set(0, 0);}}); mappings.put((Object) expected_setX, (Object) new Point_DataToReset_setOp() { void reset() {host.expected_setX(0);}}); mappings.put((Object) expected_setY, (Object) (Object) new Point_DataToReset_setOp() { void reset() {host.expected_setY(0);}}); Point.addSubscriber(this);}

67. ComponentPackage Component Participant expectedOp() Op(){expectedOp(); getHost()} getHost() ConnectorPackage HostPackage Host // to play role of participant toModify(){} // to be mapped to Op() Johan’s solution 1 based on Mira’s inner class solution. Modification interface is represented also by abstract class, not by Method argument as proposed by Mira. “outer.super.toModify()” simulated with aux() is not elegant MyHost toModify(){part.Op();}// override aux(){super.toModify()} part ParticipantAnonymousExtended expectedOp(){aux()} getHost(){MyHost.this} main(){new MyHost().toModify() }

68. ComponentPackage Component Participant expectedOp() Op(){expectedOp(); getHost()} getHost() ConnectorPackage MyHost toModify(){part.Op();} aux(){super.toModify()} part HostPackage ParticipantAnonymousExtended expectedOp(){aux()} getHost(){MyHost.this} main(){new MyHost().toModify() } Host toModify(){} Does it work with multiple participants? With multiple hosts? Looks like. Problem: when we have a Host-object and want to get modified behavior, need to create a MyHost object.

69. ComponentPackage Component Participant expectedOp() Op(){expectedOp(); getHost()} getHost() ConnectorPackage More complex connector: one host but multiple methods are modified. Creates multiple inheritance!? Is this why Mira’s implementation is more complex? part2 ParticipantAnonymousExtended expectedOp(){aux2()} getHost(){MyHost.this} main(){new MyHost().toModify2()} toModify2(){part2.Op();}//override aux2(){super.toModify2()} ParticipantAnonymousExtended expectedOp(){aux1()} getHost(){MyHost.this} main(){new MyHost().toModify1()} MyHost toModify1(){part1.Op();}//overrride aux1(){super.toModify1()} part1