ax_tree_unittest.cc 202 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324432543264327432843294330433143324333433443354336433743384339434043414342434343444345434643474348434943504351435243534354435543564357435843594360436143624363436443654366436743684369437043714372437343744375437643774378437943804381438243834384438543864387438843894390439143924393439443954396439743984399440044014402440344044405440644074408440944104411441244134414441544164417441844194420442144224423442444254426442744284429443044314432443344344435443644374438443944404441444244434444444544464447444844494450445144524453445444554456445744584459446044614462446344644465446644674468446944704471447244734474447544764477447844794480448144824483448444854486448744884489449044914492449344944495449644974498449945004501450245034504450545064507450845094510451145124513451445154516451745184519452045214522452345244525452645274528452945304531453245334534453545364537453845394540454145424543454445454546454745484549455045514552455345544555455645574558455945604561456245634564456545664567456845694570457145724573457445754576457745784579458045814582458345844585458645874588458945904591459245934594459545964597459845994600460146024603460446054606460746084609461046114612461346144615461646174618461946204621462246234624462546264627462846294630463146324633463446354636463746384639464046414642464346444645464646474648464946504651465246534654465546564657465846594660466146624663466446654666466746684669467046714672467346744675467646774678467946804681468246834684468546864687468846894690469146924693469446954696469746984699470047014702470347044705470647074708470947104711471247134714471547164717471847194720472147224723472447254726472747284729473047314732473347344735473647374738473947404741474247434744474547464747474847494750475147524753475447554756475747584759476047614762476347644765476647674768476947704771477247734774477547764777477847794780478147824783478447854786478747884789479047914792479347944795479647974798479948004801480248034804480548064807480848094810481148124813481448154816481748184819482048214822482348244825482648274828482948304831483248334834483548364837483848394840484148424843484448454846484748484849485048514852485348544855485648574858485948604861486248634864486548664867486848694870487148724873487448754876487748784879488048814882488348844885488648874888488948904891489248934894489548964897489848994900490149024903490449054906490749084909491049114912491349144915491649174918491949204921492249234924492549264927492849294930493149324933493449354936493749384939494049414942494349444945494649474948494949504951495249534954495549564957495849594960496149624963496449654966496749684969497049714972497349744975497649774978497949804981498249834984498549864987498849894990499149924993499449954996499749984999500050015002500350045005500650075008500950105011501250135014501550165017501850195020502150225023502450255026502750285029503050315032503350345035503650375038503950405041504250435044504550465047504850495050505150525053505450555056505750585059506050615062506350645065506650675068506950705071507250735074507550765077507850795080508150825083508450855086508750885089509050915092509350945095509650975098509951005101510251035104510551065107510851095110511151125113511451155116511751185119512051215122512351245125512651275128512951305131513251335134513551365137513851395140514151425143514451455146514751485149515051515152515351545155515651575158515951605161516251635164516551665167516851695170517151725173517451755176517751785179518051815182518351845185518651875188518951905191519251935194519551965197519851995200520152025203520452055206520752085209521052115212521352145215521652175218521952205221522252235224522552265227522852295230523152325233523452355236523752385239524052415242524352445245524652475248524952505251525252535254525552565257525852595260526152625263526452655266526752685269527052715272527352745275527652775278527952805281528252835284528552865287528852895290529152925293529452955296529752985299530053015302530353045305530653075308530953105311531253135314531553165317531853195320532153225323532453255326532753285329533053315332533353345335533653375338533953405341534253435344534553465347534853495350535153525353535453555356535753585359536053615362536353645365536653675368536953705371537253735374537553765377537853795380538153825383538453855386538753885389539053915392539353945395539653975398539954005401540254035404540554065407540854095410541154125413541454155416541754185419542054215422542354245425542654275428542954305431
  1. // Copyright 2013 The Chromium Authors. All rights reserved.
  2. // Use of this source code is governed by a BSD-style license that can be
  3. // found in the LICENSE file.
  4. #include "ui/accessibility/ax_tree.h"
  5. #include <stddef.h>
  6. #include <stdint.h>
  7. #include <memory>
  8. #include "base/containers/contains.h"
  9. #include "base/memory/raw_ptr.h"
  10. #include "base/strings/string_number_conversions.h"
  11. #include "base/strings/stringprintf.h"
  12. #include "base/test/metrics/histogram_tester.h"
  13. #include "testing/gmock/include/gmock/gmock-matchers.h"
  14. #include "testing/gtest/include/gtest/gtest.h"
  15. #include "ui/accessibility/ax_enum_util.h"
  16. #include "ui/accessibility/ax_node.h"
  17. #include "ui/accessibility/ax_node_position.h"
  18. #include "ui/accessibility/ax_serializable_tree.h"
  19. #include "ui/accessibility/ax_tree_data.h"
  20. #include "ui/accessibility/ax_tree_id.h"
  21. #include "ui/accessibility/ax_tree_observer.h"
  22. #include "ui/accessibility/ax_tree_serializer.h"
  23. #include "ui/accessibility/test_ax_tree_manager.h"
  24. #include "ui/gfx/geometry/transform.h"
  25. // Helper macro for testing selection values and maintain
  26. // correct stack tracing and failure causality.
  27. #define TEST_SELECTION(tree_update, tree, input, expected) \
  28. { \
  29. tree_update.has_tree_data = true; \
  30. tree_update.tree_data.sel_anchor_object_id = input.anchor_id; \
  31. tree_update.tree_data.sel_anchor_offset = input.anchor_offset; \
  32. tree_update.tree_data.sel_focus_object_id = input.focus_id; \
  33. tree_update.tree_data.sel_focus_offset = input.focus_offset; \
  34. EXPECT_TRUE(tree->Unserialize(tree_update)); \
  35. AXTree::Selection actual = tree->GetUnignoredSelection(); \
  36. EXPECT_EQ(expected.anchor_id, actual.anchor_object_id); \
  37. EXPECT_EQ(expected.anchor_offset, actual.anchor_offset); \
  38. EXPECT_EQ(expected.focus_id, actual.focus_object_id); \
  39. EXPECT_EQ(expected.focus_offset, actual.focus_offset); \
  40. }
  41. namespace ui {
  42. namespace {
  43. std::string IntVectorToString(const std::vector<int>& items) {
  44. std::string str;
  45. for (size_t i = 0; i < items.size(); ++i) {
  46. if (i > 0)
  47. str += ",";
  48. str += base::NumberToString(items[i]);
  49. }
  50. return str;
  51. }
  52. std::string GetBoundsAsString(const AXTree& tree, int32_t id) {
  53. AXNode* node = tree.GetFromId(id);
  54. gfx::RectF bounds = tree.GetTreeBounds(node);
  55. return base::StringPrintf("(%.0f, %.0f) size (%.0f x %.0f)", bounds.x(),
  56. bounds.y(), bounds.width(), bounds.height());
  57. }
  58. std::string GetUnclippedBoundsAsString(const AXTree& tree, int32_t id) {
  59. AXNode* node = tree.GetFromId(id);
  60. gfx::RectF bounds = tree.GetTreeBounds(node, nullptr, false);
  61. return base::StringPrintf("(%.0f, %.0f) size (%.0f x %.0f)", bounds.x(),
  62. bounds.y(), bounds.width(), bounds.height());
  63. }
  64. bool IsNodeOffscreen(const AXTree& tree, int32_t id) {
  65. AXNode* node = tree.GetFromId(id);
  66. bool result = false;
  67. tree.GetTreeBounds(node, &result);
  68. return result;
  69. }
  70. class TestAXTreeObserver final : public AXTreeObserver {
  71. public:
  72. explicit TestAXTreeObserver(AXTree* tree)
  73. : tree_(tree), tree_data_changed_(false), root_changed_(false) {
  74. tree_->AddObserver(this);
  75. }
  76. ~TestAXTreeObserver() override { tree_->RemoveObserver(this); }
  77. void OnNodeDataWillChange(AXTree* tree,
  78. const AXNodeData& old_node_data,
  79. const AXNodeData& new_node_data) override {}
  80. void OnNodeDataChanged(AXTree* tree,
  81. const AXNodeData& old_node_data,
  82. const AXNodeData& new_node_data) override {}
  83. void OnTreeDataChanged(AXTree* tree,
  84. const ui::AXTreeData& old_data,
  85. const ui::AXTreeData& new_data) override {
  86. tree_data_changed_ = true;
  87. }
  88. absl::optional<AXNodeID> unignored_parent_id_before_node_deleted;
  89. void OnNodeWillBeDeleted(AXTree* tree, AXNode* node) override {
  90. // When this observer function is called in an update, the actual node
  91. // deletion has not happened yet. Verify that node still exists in the tree.
  92. ASSERT_NE(nullptr, tree->GetFromId(node->id()));
  93. node_will_be_deleted_ids_.push_back(node->id());
  94. if (unignored_parent_id_before_node_deleted) {
  95. ASSERT_NE(nullptr, node->GetUnignoredParent());
  96. ASSERT_EQ(*unignored_parent_id_before_node_deleted,
  97. node->GetUnignoredParent()->id());
  98. }
  99. }
  100. void OnSubtreeWillBeDeleted(AXTree* tree, AXNode* node) override {
  101. subtree_deleted_ids_.push_back(node->id());
  102. }
  103. void OnNodeWillBeReparented(AXTree* tree, AXNode* node) override {
  104. node_will_be_reparented_ids_.push_back(node->id());
  105. }
  106. void OnSubtreeWillBeReparented(AXTree* tree, AXNode* node) override {
  107. subtree_will_be_reparented_ids_.push_back(node->id());
  108. }
  109. void OnNodeCreated(AXTree* tree, AXNode* node) override {
  110. created_ids_.push_back(node->id());
  111. }
  112. void OnNodeDeleted(AXTree* tree, int32_t node_id) override {
  113. // When this observer function is called in an update, node has already been
  114. // deleted from the tree. Verify that the node is absent from the tree.
  115. ASSERT_EQ(nullptr, tree->GetFromId(node_id));
  116. deleted_ids_.push_back(node_id);
  117. }
  118. void OnNodeReparented(AXTree* tree, AXNode* node) override {
  119. node_reparented_ids_.push_back(node->id());
  120. }
  121. void OnNodeChanged(AXTree* tree, AXNode* node) override {
  122. changed_ids_.push_back(node->id());
  123. }
  124. void OnAtomicUpdateFinished(AXTree* tree,
  125. bool root_changed,
  126. const std::vector<Change>& changes) override {
  127. root_changed_ = root_changed;
  128. for (size_t i = 0; i < changes.size(); ++i) {
  129. int id = changes[i].node->id();
  130. switch (changes[i].type) {
  131. case NODE_CREATED:
  132. node_creation_finished_ids_.push_back(id);
  133. break;
  134. case SUBTREE_CREATED:
  135. subtree_creation_finished_ids_.push_back(id);
  136. break;
  137. case NODE_REPARENTED:
  138. node_reparented_finished_ids_.push_back(id);
  139. break;
  140. case SUBTREE_REPARENTED:
  141. subtree_reparented_finished_ids_.push_back(id);
  142. break;
  143. case NODE_CHANGED:
  144. change_finished_ids_.push_back(id);
  145. break;
  146. }
  147. }
  148. }
  149. void OnRoleChanged(AXTree* tree,
  150. AXNode* node,
  151. ax::mojom::Role old_role,
  152. ax::mojom::Role new_role) override {
  153. attribute_change_log_.push_back(base::StringPrintf(
  154. "Role changed from %s to %s", ToString(old_role), ToString(new_role)));
  155. }
  156. void OnIgnoredChanged(AXTree* tree,
  157. AXNode* node,
  158. bool is_ignored_new_value) override {
  159. attribute_change_log_.push_back(
  160. base::StringPrintf("IsIgnored changed on node ID %d to %s", node->id(),
  161. is_ignored_new_value ? "true" : "false"));
  162. }
  163. void OnStateChanged(AXTree* tree,
  164. AXNode* node,
  165. ax::mojom::State state,
  166. bool new_value) override {
  167. attribute_change_log_.push_back(base::StringPrintf(
  168. "%s changed to %s", ToString(state), new_value ? "true" : "false"));
  169. }
  170. void OnStringAttributeChanged(AXTree* tree,
  171. AXNode* node,
  172. ax::mojom::StringAttribute attr,
  173. const std::string& old_value,
  174. const std::string& new_value) override {
  175. attribute_change_log_.push_back(
  176. base::StringPrintf("%s changed from %s to %s", ToString(attr),
  177. old_value.c_str(), new_value.c_str()));
  178. }
  179. void OnIntAttributeChanged(AXTree* tree,
  180. AXNode* node,
  181. ax::mojom::IntAttribute attr,
  182. int32_t old_value,
  183. int32_t new_value) override {
  184. attribute_change_log_.push_back(base::StringPrintf(
  185. "%s changed from %d to %d", ToString(attr), old_value, new_value));
  186. }
  187. void OnFloatAttributeChanged(AXTree* tree,
  188. AXNode* node,
  189. ax::mojom::FloatAttribute attr,
  190. float old_value,
  191. float new_value) override {
  192. attribute_change_log_.push_back(
  193. base::StringPrintf("%s changed from %s to %s", ToString(attr),
  194. base::NumberToString(old_value).c_str(),
  195. base::NumberToString(new_value).c_str()));
  196. }
  197. void OnBoolAttributeChanged(AXTree* tree,
  198. AXNode* node,
  199. ax::mojom::BoolAttribute attr,
  200. bool new_value) override {
  201. attribute_change_log_.push_back(base::StringPrintf(
  202. "%s changed to %s", ToString(attr), new_value ? "true" : "false"));
  203. }
  204. void OnIntListAttributeChanged(
  205. AXTree* tree,
  206. AXNode* node,
  207. ax::mojom::IntListAttribute attr,
  208. const std::vector<int32_t>& old_value,
  209. const std::vector<int32_t>& new_value) override {
  210. attribute_change_log_.push_back(
  211. base::StringPrintf("%s changed from %s to %s", ToString(attr),
  212. IntVectorToString(old_value).c_str(),
  213. IntVectorToString(new_value).c_str()));
  214. }
  215. bool tree_data_changed() const { return tree_data_changed_; }
  216. bool root_changed() const { return root_changed_; }
  217. const std::vector<int32_t>& deleted_ids() { return deleted_ids_; }
  218. const std::vector<int32_t>& subtree_deleted_ids() {
  219. return subtree_deleted_ids_;
  220. }
  221. const std::vector<int32_t>& created_ids() { return created_ids_; }
  222. const std::vector<int32_t>& node_creation_finished_ids() {
  223. return node_creation_finished_ids_;
  224. }
  225. const std::vector<int32_t>& subtree_creation_finished_ids() {
  226. return subtree_creation_finished_ids_;
  227. }
  228. const std::vector<int32_t>& node_reparented_finished_ids() {
  229. return node_reparented_finished_ids_;
  230. }
  231. const std::vector<int32_t>& subtree_will_be_reparented_ids() {
  232. return subtree_will_be_reparented_ids_;
  233. }
  234. const std::vector<int32_t>& node_will_be_reparented_ids() {
  235. return node_will_be_reparented_ids_;
  236. }
  237. const std::vector<int32_t>& node_will_be_deleted_ids() {
  238. return node_will_be_deleted_ids_;
  239. }
  240. const std::vector<int32_t>& node_reparented_ids() {
  241. return node_reparented_ids_;
  242. }
  243. const std::vector<int32_t>& subtree_reparented_finished_ids() {
  244. return subtree_reparented_finished_ids_;
  245. }
  246. const std::vector<int32_t>& change_finished_ids() {
  247. return change_finished_ids_;
  248. }
  249. const std::vector<std::string>& attribute_change_log() {
  250. return attribute_change_log_;
  251. }
  252. private:
  253. raw_ptr<AXTree> tree_;
  254. bool tree_data_changed_;
  255. bool root_changed_;
  256. std::vector<int32_t> deleted_ids_;
  257. std::vector<int32_t> subtree_deleted_ids_;
  258. std::vector<int32_t> created_ids_;
  259. std::vector<int32_t> changed_ids_;
  260. std::vector<int32_t> subtree_will_be_reparented_ids_;
  261. std::vector<int32_t> node_will_be_reparented_ids_;
  262. std::vector<int32_t> node_will_be_deleted_ids_;
  263. std::vector<int32_t> node_creation_finished_ids_;
  264. std::vector<int32_t> subtree_creation_finished_ids_;
  265. std::vector<int32_t> node_reparented_ids_;
  266. std::vector<int32_t> node_reparented_finished_ids_;
  267. std::vector<int32_t> subtree_reparented_finished_ids_;
  268. std::vector<int32_t> change_finished_ids_;
  269. std::vector<std::string> attribute_change_log_;
  270. };
  271. // UTF encodings that are tested by the `AXTreeTestWithMultipleUTFEncodings`
  272. // parameterized tests.
  273. enum class TestEncoding { kUTF8, kUTF16 };
  274. // Fixture for a test that needs to run multiple times with different UTF
  275. // encodings. For example, once with UTF8 encoding and once with UTF16.
  276. class AXTreeTestWithMultipleUTFEncodings
  277. : public ::testing::TestWithParam<TestEncoding> {
  278. public:
  279. AXTreeTestWithMultipleUTFEncodings() = default;
  280. ~AXTreeTestWithMultipleUTFEncodings() override = default;
  281. AXTreeTestWithMultipleUTFEncodings(
  282. const AXTreeTestWithMultipleUTFEncodings& other) = delete;
  283. AXTreeTestWithMultipleUTFEncodings& operator=(
  284. const AXTreeTestWithMultipleUTFEncodings& other) = delete;
  285. };
  286. } // namespace
  287. using ::testing::ElementsAre;
  288. // A macro for testing that a absl::optional has both a value and that its value
  289. // is set to a particular expectation.
  290. #define EXPECT_OPTIONAL_EQ(expected, actual) \
  291. EXPECT_TRUE(actual.has_value()); \
  292. if (actual) { \
  293. EXPECT_EQ(expected, actual.value()); \
  294. }
  295. TEST(AXTreeTest, SerializeSimpleAXTree) {
  296. AXNodeData root;
  297. root.id = 1;
  298. root.role = ax::mojom::Role::kDialog;
  299. root.AddState(ax::mojom::State::kFocusable);
  300. root.relative_bounds.bounds = gfx::RectF(0, 0, 800, 600);
  301. root.child_ids.push_back(2);
  302. root.child_ids.push_back(3);
  303. AXNodeData button;
  304. button.id = 2;
  305. button.role = ax::mojom::Role::kButton;
  306. button.relative_bounds.bounds = gfx::RectF(20, 20, 200, 30);
  307. AXNodeData checkbox;
  308. checkbox.id = 3;
  309. checkbox.role = ax::mojom::Role::kCheckBox;
  310. checkbox.relative_bounds.bounds = gfx::RectF(20, 50, 200, 30);
  311. AXTreeUpdate initial_state;
  312. initial_state.root_id = 1;
  313. initial_state.nodes.push_back(root);
  314. initial_state.nodes.push_back(button);
  315. initial_state.nodes.push_back(checkbox);
  316. initial_state.has_tree_data = true;
  317. initial_state.tree_data.title = "Title";
  318. AXSerializableTree src_tree(initial_state);
  319. std::unique_ptr<AXTreeSource<const AXNode*>> tree_source(
  320. src_tree.CreateTreeSource());
  321. AXTreeSerializer<const AXNode*> serializer(tree_source.get());
  322. AXTreeUpdate update;
  323. serializer.SerializeChanges(src_tree.root(), &update);
  324. AXTree dst_tree;
  325. ASSERT_TRUE(dst_tree.Unserialize(update));
  326. const AXNode* root_node = dst_tree.root();
  327. ASSERT_TRUE(root_node != nullptr);
  328. EXPECT_EQ(root.id, root_node->id());
  329. EXPECT_EQ(root.role, root_node->GetRole());
  330. ASSERT_EQ(2u, root_node->children().size());
  331. const AXNode* button_node = root_node->children()[0];
  332. EXPECT_EQ(button.id, button_node->id());
  333. EXPECT_EQ(button.role, button_node->GetRole());
  334. const AXNode* checkbox_node = root_node->children()[1];
  335. EXPECT_EQ(checkbox.id, checkbox_node->id());
  336. EXPECT_EQ(checkbox.role, checkbox_node->GetRole());
  337. EXPECT_EQ(
  338. "AXTree title=Title\n"
  339. "id=1 dialog FOCUSABLE (0, 0)-(800, 600) child_ids=2,3\n"
  340. " id=2 button (20, 20)-(200, 30)\n"
  341. " id=3 checkBox (20, 50)-(200, 30)\n",
  342. dst_tree.ToString());
  343. }
  344. TEST(AXTreeTest, SerializeAXTreeUpdate) {
  345. AXNodeData list;
  346. list.id = 3;
  347. list.role = ax::mojom::Role::kList;
  348. list.child_ids.push_back(4);
  349. list.child_ids.push_back(5);
  350. list.child_ids.push_back(6);
  351. AXNodeData list_item_2;
  352. list_item_2.id = 5;
  353. list_item_2.role = ax::mojom::Role::kListItem;
  354. AXNodeData list_item_3;
  355. list_item_3.id = 6;
  356. list_item_3.role = ax::mojom::Role::kListItem;
  357. AXNodeData button;
  358. button.id = 7;
  359. button.role = ax::mojom::Role::kButton;
  360. AXTreeUpdate update;
  361. update.root_id = 3;
  362. update.nodes.push_back(list);
  363. update.nodes.push_back(list_item_2);
  364. update.nodes.push_back(list_item_3);
  365. update.nodes.push_back(button);
  366. EXPECT_EQ(
  367. "AXTreeUpdate: root id 3\n"
  368. "id=3 list (0, 0)-(0, 0) child_ids=4,5,6\n"
  369. " id=5 listItem (0, 0)-(0, 0)\n"
  370. " id=6 listItem (0, 0)-(0, 0)\n"
  371. "id=7 button (0, 0)-(0, 0)\n",
  372. update.ToString());
  373. }
  374. TEST(AXTreeTest, LeaveOrphanedDeletedSubtreeFails) {
  375. base::HistogramTester histogram_tester;
  376. AXTreeUpdate initial_state;
  377. initial_state.root_id = 1;
  378. initial_state.nodes.resize(3);
  379. initial_state.nodes[0].id = 1;
  380. initial_state.nodes[0].child_ids.push_back(2);
  381. initial_state.nodes[0].child_ids.push_back(3);
  382. initial_state.nodes[1].id = 2;
  383. initial_state.nodes[2].id = 3;
  384. AXTree tree(initial_state);
  385. histogram_tester.ExpectTotalCount(
  386. "Accessibility.Performance.Tree.Unserialize", 1);
  387. // This should fail because we delete a subtree rooted at id=2
  388. // but never update it.
  389. AXTreeUpdate update;
  390. update.node_id_to_clear = 2;
  391. update.nodes.resize(1);
  392. update.nodes[0].id = 3;
  393. #if defined(AX_FAIL_FAST_BUILD)
  394. EXPECT_DEATH_IF_SUPPORTED(tree.Unserialize(update),
  395. "Nodes left pending by the update: 2");
  396. #else
  397. EXPECT_FALSE(tree.Unserialize(update));
  398. ASSERT_EQ("Nodes left pending by the update: 2", tree.error());
  399. histogram_tester.ExpectUniqueSample(
  400. "Accessibility.Reliability.Tree.UnserializeError",
  401. AXTreeUnserializeError::kPendingNodes, 1);
  402. histogram_tester.ExpectTotalCount(
  403. "Accessibility.Performance.Tree.Unserialize", 2);
  404. #endif
  405. }
  406. TEST(AXTreeTest, LeaveOrphanedNewChildFails) {
  407. base::HistogramTester histogram_tester;
  408. AXTreeUpdate initial_state;
  409. initial_state.root_id = 1;
  410. initial_state.nodes.resize(1);
  411. initial_state.nodes[0].id = 1;
  412. AXTree tree(initial_state);
  413. histogram_tester.ExpectTotalCount(
  414. "Accessibility.Performance.Tree.Unserialize", 1);
  415. // This should fail because we add a new child to the root node
  416. // but never update it.
  417. AXTreeUpdate update;
  418. update.nodes.resize(1);
  419. update.nodes[0].id = 1;
  420. update.nodes[0].child_ids.push_back(2);
  421. #if defined(AX_FAIL_FAST_BUILD)
  422. EXPECT_DEATH_IF_SUPPORTED(tree.Unserialize(update),
  423. "Nodes left pending by the update: 2");
  424. #else
  425. EXPECT_FALSE(tree.Unserialize(update));
  426. ASSERT_EQ("Nodes left pending by the update: 2", tree.error());
  427. histogram_tester.ExpectUniqueSample(
  428. "Accessibility.Reliability.Tree.UnserializeError",
  429. AXTreeUnserializeError::kPendingNodes, 1);
  430. histogram_tester.ExpectTotalCount(
  431. "Accessibility.Performance.Tree.Unserialize", 2);
  432. #endif
  433. }
  434. TEST(AXTreeTest, DuplicateChildIdFails) {
  435. base::HistogramTester histogram_tester;
  436. AXTreeUpdate initial_state;
  437. initial_state.root_id = 1;
  438. initial_state.nodes.resize(1);
  439. initial_state.nodes[0].id = 1;
  440. AXTree tree(initial_state);
  441. histogram_tester.ExpectTotalCount(
  442. "Accessibility.Performance.Tree.Unserialize", 1);
  443. // This should fail because a child id appears twice.
  444. AXTreeUpdate update;
  445. update.nodes.resize(2);
  446. update.nodes[0].id = 1;
  447. update.nodes[0].child_ids.push_back(2);
  448. update.nodes[0].child_ids.push_back(2);
  449. update.nodes[1].id = 2;
  450. #if defined(AX_FAIL_FAST_BUILD)
  451. EXPECT_DEATH_IF_SUPPORTED(tree.Unserialize(update),
  452. "Node 1 has duplicate child id 2");
  453. #else
  454. EXPECT_FALSE(tree.Unserialize(update));
  455. ASSERT_EQ("Node 1 has duplicate child id 2", tree.error());
  456. histogram_tester.ExpectUniqueSample(
  457. "Accessibility.Reliability.Tree.UnserializeError",
  458. AXTreeUnserializeError::kDuplicateChild, 1);
  459. histogram_tester.ExpectTotalCount(
  460. "Accessibility.Performance.Tree.Unserialize", 1);
  461. #endif
  462. }
  463. TEST(AXTreeTest, InvalidReparentingFails) {
  464. base::HistogramTester histogram_tester;
  465. AXTreeUpdate initial_state;
  466. initial_state.root_id = 1;
  467. initial_state.nodes.resize(3);
  468. initial_state.nodes[0].id = 1;
  469. initial_state.nodes[0].child_ids.push_back(2);
  470. initial_state.nodes[1].id = 2;
  471. initial_state.nodes[1].child_ids.push_back(3);
  472. initial_state.nodes[2].id = 3;
  473. AXTree tree(initial_state);
  474. histogram_tester.ExpectTotalCount(
  475. "Accessibility.Performance.Tree.Unserialize", 1);
  476. // This should fail because node 3 is reparented from node 2 to node 1
  477. // without deleting node 1's subtree first.
  478. AXTreeUpdate update;
  479. update.nodes.resize(3);
  480. update.nodes[0].id = 1;
  481. update.nodes[0].child_ids.push_back(3);
  482. update.nodes[0].child_ids.push_back(2);
  483. update.nodes[1].id = 2;
  484. update.nodes[2].id = 3;
  485. #if defined(AX_FAIL_FAST_BUILD)
  486. EXPECT_DEATH_IF_SUPPORTED(
  487. tree.Unserialize(update),
  488. "Node 3 is not marked for destruction, would be reparented to 1");
  489. #else
  490. EXPECT_FALSE(tree.Unserialize(update));
  491. ASSERT_EQ("Node 3 is not marked for destruction, would be reparented to 1",
  492. tree.error());
  493. histogram_tester.ExpectUniqueSample(
  494. "Accessibility.Reliability.Tree.UnserializeError",
  495. AXTreeUnserializeError::kReparent, 1);
  496. histogram_tester.ExpectTotalCount(
  497. "Accessibility.Performance.Tree.Unserialize", 1);
  498. #endif
  499. }
  500. TEST(AXTreeTest, NoReparentingOfRootIfNoNewRoot) {
  501. AXNodeData root;
  502. root.id = 1;
  503. AXNodeData child1;
  504. child1.id = 2;
  505. AXNodeData child2;
  506. child2.id = 3;
  507. root.child_ids = {child1.id};
  508. child1.child_ids = {child2.id};
  509. AXTreeUpdate initial_state;
  510. initial_state.root_id = root.id;
  511. initial_state.nodes = {root, child1, child2};
  512. AXTree tree(initial_state);
  513. // Update the root but don't change it by reparenting |child2| to be a child
  514. // of the root.
  515. root.child_ids = {child1.id, child2.id};
  516. child1.child_ids = {};
  517. AXTreeUpdate update;
  518. update.root_id = root.id;
  519. update.node_id_to_clear = root.id;
  520. update.nodes = {root, child1, child2};
  521. TestAXTreeObserver test_observer(&tree);
  522. ASSERT_TRUE(tree.Unserialize(update));
  523. EXPECT_EQ(0U, test_observer.deleted_ids().size());
  524. EXPECT_EQ(0U, test_observer.subtree_deleted_ids().size());
  525. EXPECT_EQ(0U, test_observer.created_ids().size());
  526. EXPECT_EQ(0U, test_observer.node_creation_finished_ids().size());
  527. EXPECT_EQ(0U, test_observer.subtree_creation_finished_ids().size());
  528. EXPECT_EQ(0U, test_observer.node_reparented_finished_ids().size());
  529. ASSERT_EQ(2U, test_observer.subtree_reparented_finished_ids().size());
  530. EXPECT_EQ(child1.id, test_observer.subtree_reparented_finished_ids()[0]);
  531. EXPECT_EQ(child2.id, test_observer.subtree_reparented_finished_ids()[1]);
  532. ASSERT_EQ(1U, test_observer.change_finished_ids().size());
  533. EXPECT_EQ(root.id, test_observer.change_finished_ids()[0]);
  534. EXPECT_FALSE(test_observer.root_changed());
  535. EXPECT_FALSE(test_observer.tree_data_changed());
  536. }
  537. TEST(AXTreeTest, NoReparentingIfOnlyRemovedAndChangedNotReAdded) {
  538. AXNodeData root;
  539. root.id = 1;
  540. AXNodeData child1;
  541. child1.id = 2;
  542. AXNodeData child2;
  543. child2.id = 3;
  544. root.child_ids = {child1.id};
  545. child1.child_ids = {child2.id};
  546. AXTreeUpdate initial_state;
  547. initial_state.root_id = root.id;
  548. initial_state.nodes = {root, child1, child2};
  549. AXTree tree(initial_state);
  550. // Change existing attributes.
  551. AXTreeUpdate update;
  552. update.nodes.resize(2);
  553. update.nodes[0].id = 2;
  554. update.nodes[0].AddIntAttribute(ax::mojom::IntAttribute::kActivedescendantId,
  555. 3);
  556. update.nodes[1].id = 1;
  557. TestAXTreeObserver test_observer(&tree);
  558. EXPECT_TRUE(tree.Unserialize(update)) << tree.error();
  559. EXPECT_EQ(2U, test_observer.deleted_ids().size());
  560. EXPECT_EQ(2U, test_observer.subtree_deleted_ids().size());
  561. EXPECT_EQ(0U, test_observer.created_ids().size());
  562. EXPECT_EQ(0U, test_observer.node_creation_finished_ids().size());
  563. EXPECT_EQ(0U, test_observer.subtree_creation_finished_ids().size());
  564. EXPECT_EQ(0U, test_observer.node_will_be_reparented_ids().size());
  565. EXPECT_EQ(2U, test_observer.node_will_be_deleted_ids().size());
  566. EXPECT_EQ(0U, test_observer.subtree_will_be_reparented_ids().size());
  567. EXPECT_EQ(0U, test_observer.node_reparented_ids().size());
  568. EXPECT_EQ(0U, test_observer.node_reparented_finished_ids().size());
  569. EXPECT_EQ(0U, test_observer.subtree_reparented_finished_ids().size());
  570. EXPECT_FALSE(test_observer.root_changed());
  571. EXPECT_FALSE(test_observer.tree_data_changed());
  572. }
  573. // Tests a fringe scenario that may happen if multiple AXTreeUpdates are merged.
  574. // Make sure that when a node is reparented then removed from the tree
  575. // that it notifies OnNodeDeleted rather than OnNodeReparented.
  576. TEST(AXTreeTest, NoReparentingIfRemovedMultipleTimesAndNotInFinalTree) {
  577. AXTreeUpdate initial_state;
  578. initial_state.root_id = 1;
  579. initial_state.nodes.resize(4);
  580. initial_state.nodes[0].id = 1;
  581. initial_state.nodes[0].child_ids = {2, 4};
  582. initial_state.nodes[1].id = 2;
  583. initial_state.nodes[1].child_ids = {3};
  584. initial_state.nodes[2].id = 3;
  585. initial_state.nodes[3].id = 4;
  586. AXTree tree(initial_state);
  587. AXTreeUpdate update;
  588. update.nodes.resize(4);
  589. // Delete AXID 3
  590. update.nodes[0].id = 2;
  591. // Reparent AXID 3 onto AXID 4
  592. update.nodes[1].id = 4;
  593. update.nodes[1].child_ids = {3};
  594. update.nodes[2].id = 3;
  595. // Delete AXID 3
  596. update.nodes[3].id = 4;
  597. TestAXTreeObserver test_observer(&tree);
  598. ASSERT_TRUE(tree.Unserialize(update)) << tree.error();
  599. EXPECT_EQ(1U, test_observer.deleted_ids().size());
  600. EXPECT_EQ(1U, test_observer.subtree_deleted_ids().size());
  601. EXPECT_EQ(0U, test_observer.created_ids().size());
  602. EXPECT_EQ(0U, test_observer.node_creation_finished_ids().size());
  603. EXPECT_EQ(0U, test_observer.subtree_creation_finished_ids().size());
  604. EXPECT_EQ(0U, test_observer.node_will_be_reparented_ids().size());
  605. EXPECT_EQ(1U, test_observer.node_will_be_deleted_ids().size());
  606. EXPECT_EQ(0U, test_observer.subtree_will_be_reparented_ids().size());
  607. EXPECT_EQ(0U, test_observer.node_reparented_ids().size());
  608. EXPECT_EQ(0U, test_observer.node_reparented_finished_ids().size());
  609. EXPECT_EQ(0U, test_observer.subtree_reparented_finished_ids().size());
  610. EXPECT_FALSE(test_observer.root_changed());
  611. EXPECT_FALSE(test_observer.tree_data_changed());
  612. }
  613. // Tests a fringe scenario that may happen if multiple AXTreeUpdates are merged.
  614. // Make sure that when a node is reparented multiple times and exists in the
  615. // final tree that it notifies OnNodeReparented rather than OnNodeDeleted.
  616. TEST(AXTreeTest, ReparentIfRemovedMultipleTimesButExistsInFinalTree) {
  617. AXTreeUpdate initial_state;
  618. initial_state.root_id = 1;
  619. initial_state.nodes.resize(4);
  620. initial_state.nodes[0].id = 1;
  621. initial_state.nodes[0].child_ids = {2, 4};
  622. initial_state.nodes[1].id = 2;
  623. initial_state.nodes[1].child_ids = {3};
  624. initial_state.nodes[2].id = 3;
  625. initial_state.nodes[3].id = 4;
  626. AXTree tree(initial_state);
  627. AXTreeUpdate update;
  628. update.nodes.resize(6);
  629. // Delete AXID 3
  630. update.nodes[0].id = 2;
  631. // Reparent AXID 3 onto AXID 4
  632. update.nodes[1].id = 4;
  633. update.nodes[1].child_ids = {3};
  634. update.nodes[2].id = 3;
  635. // Delete AXID 3
  636. update.nodes[3].id = 4;
  637. // Reparent AXID 3 onto AXID 2
  638. update.nodes[4].id = 2;
  639. update.nodes[4].child_ids = {3};
  640. update.nodes[5].id = 3;
  641. TestAXTreeObserver test_observer(&tree);
  642. ASSERT_TRUE(tree.Unserialize(update)) << tree.error();
  643. EXPECT_EQ(0U, test_observer.deleted_ids().size());
  644. EXPECT_EQ(0U, test_observer.subtree_deleted_ids().size());
  645. EXPECT_EQ(0U, test_observer.created_ids().size());
  646. EXPECT_EQ(0U, test_observer.node_creation_finished_ids().size());
  647. EXPECT_EQ(0U, test_observer.subtree_creation_finished_ids().size());
  648. EXPECT_EQ(1U, test_observer.node_will_be_reparented_ids().size());
  649. EXPECT_EQ(0U, test_observer.node_will_be_deleted_ids().size());
  650. EXPECT_EQ(1U, test_observer.subtree_will_be_reparented_ids().size());
  651. EXPECT_EQ(1U, test_observer.node_reparented_ids().size());
  652. EXPECT_EQ(0U, test_observer.node_reparented_finished_ids().size());
  653. EXPECT_EQ(1U, test_observer.subtree_reparented_finished_ids().size());
  654. EXPECT_FALSE(test_observer.root_changed());
  655. EXPECT_FALSE(test_observer.tree_data_changed());
  656. }
  657. TEST(AXTreeTest, ReparentRootIfRootChanged) {
  658. AXNodeData root;
  659. root.id = 1;
  660. AXNodeData child1;
  661. child1.id = 2;
  662. AXNodeData child2;
  663. child2.id = 3;
  664. root.child_ids = {child1.id};
  665. child1.child_ids = {child2.id};
  666. AXTreeUpdate initial_state;
  667. initial_state.root_id = root.id;
  668. initial_state.nodes = {root, child1, child2};
  669. AXTree tree(initial_state);
  670. // Create a new root and reparent |child2| to be a child of the new root.
  671. AXNodeData root2;
  672. root2.id = 4;
  673. root2.child_ids = {child1.id, child2.id};
  674. child1.child_ids = {};
  675. AXTreeUpdate update;
  676. update.root_id = root2.id;
  677. update.node_id_to_clear = root.id;
  678. update.nodes = {root2, child1, child2};
  679. TestAXTreeObserver test_observer(&tree);
  680. ASSERT_TRUE(tree.Unserialize(update));
  681. ASSERT_EQ(1U, test_observer.deleted_ids().size());
  682. EXPECT_EQ(root.id, test_observer.deleted_ids()[0]);
  683. ASSERT_EQ(1U, test_observer.subtree_deleted_ids().size());
  684. EXPECT_EQ(root.id, test_observer.subtree_deleted_ids()[0]);
  685. ASSERT_EQ(1U, test_observer.created_ids().size());
  686. EXPECT_EQ(root2.id, test_observer.created_ids()[0]);
  687. EXPECT_EQ(0U, test_observer.node_creation_finished_ids().size());
  688. ASSERT_EQ(1U, test_observer.subtree_creation_finished_ids().size());
  689. EXPECT_EQ(root2.id, test_observer.subtree_creation_finished_ids()[0]);
  690. ASSERT_EQ(2U, test_observer.node_reparented_finished_ids().size());
  691. EXPECT_EQ(child1.id, test_observer.node_reparented_finished_ids()[0]);
  692. EXPECT_EQ(child2.id, test_observer.node_reparented_finished_ids()[1]);
  693. EXPECT_EQ(0U, test_observer.subtree_reparented_finished_ids().size());
  694. EXPECT_EQ(0U, test_observer.change_finished_ids().size());
  695. EXPECT_TRUE(test_observer.root_changed());
  696. EXPECT_FALSE(test_observer.tree_data_changed());
  697. }
  698. TEST(AXTreeTest, ImplicitChildrenDelete) {
  699. // This test covers the case where an AXTreeUpdate includes a node without
  700. // mentioning that node's children, this should cause a delete of those child
  701. // nodes.
  702. // Setup initial tree state
  703. // Tree:
  704. // 1
  705. // 2 3
  706. AXTreeUpdate initial_state;
  707. initial_state.root_id = 1;
  708. initial_state.nodes.resize(3);
  709. initial_state.nodes[0].id = 1;
  710. initial_state.nodes[0].child_ids.resize(2);
  711. initial_state.nodes[0].child_ids[0] = 2;
  712. initial_state.nodes[0].child_ids[1] = 3;
  713. initial_state.nodes[1].id = 2;
  714. initial_state.nodes[2].id = 3;
  715. AXTree tree(initial_state);
  716. EXPECT_NE(tree.GetFromId(1), nullptr);
  717. EXPECT_NE(tree.GetFromId(2), nullptr);
  718. EXPECT_NE(tree.GetFromId(3), nullptr);
  719. // Perform a no-op update of node 1 but omit any mention of its children. This
  720. // should delete all of the node's children.
  721. AXTreeUpdate update;
  722. update.nodes.resize(1);
  723. update.nodes[0].id = 1;
  724. ASSERT_TRUE(tree.Unserialize(update));
  725. // Check that nodes 2 and 3 have been deleted.
  726. EXPECT_NE(tree.GetFromId(1), nullptr);
  727. EXPECT_EQ(tree.GetFromId(2), nullptr);
  728. EXPECT_EQ(tree.GetFromId(3), nullptr);
  729. }
  730. TEST(AXTreeTest, IndexInParentAfterReorder) {
  731. // This test covers the case where an AXTreeUpdate includes
  732. // reordered children. The unignored index in parent
  733. // values should be updated.
  734. // Setup initial tree state.
  735. // Tree:
  736. // 1
  737. // 2 3 4
  738. AXTreeUpdate initial_state;
  739. initial_state.root_id = 1;
  740. initial_state.nodes.resize(4);
  741. initial_state.nodes[0].id = 1;
  742. initial_state.nodes[0].child_ids.resize(3);
  743. initial_state.nodes[0].child_ids[0] = 2;
  744. initial_state.nodes[0].child_ids[1] = 3;
  745. initial_state.nodes[0].child_ids[2] = 4;
  746. initial_state.nodes[1].id = 2;
  747. initial_state.nodes[2].id = 3;
  748. initial_state.nodes[3].id = 4;
  749. AXTree tree(initial_state);
  750. // Index in parent correct.
  751. EXPECT_EQ(0U, tree.GetFromId(2)->GetUnignoredIndexInParent());
  752. EXPECT_EQ(1U, tree.GetFromId(3)->GetUnignoredIndexInParent());
  753. EXPECT_EQ(2U, tree.GetFromId(4)->GetUnignoredIndexInParent());
  754. // Perform an update where we reorder children to [ 4 3 2 ]
  755. AXTreeUpdate update;
  756. update.nodes.resize(4);
  757. update.root_id = 1;
  758. update.nodes[0].id = 1;
  759. update.nodes[0].child_ids.resize(3);
  760. update.nodes[0].child_ids[0] = 4;
  761. update.nodes[0].child_ids[1] = 3;
  762. update.nodes[0].child_ids[2] = 2;
  763. update.nodes[1].id = 2;
  764. update.nodes[2].id = 3;
  765. update.nodes[3].id = 4;
  766. ASSERT_TRUE(tree.Unserialize(update));
  767. // Index in parent should have changed as well.
  768. EXPECT_EQ(0U, tree.GetFromId(4)->GetUnignoredIndexInParent());
  769. EXPECT_EQ(1U, tree.GetFromId(3)->GetUnignoredIndexInParent());
  770. EXPECT_EQ(2U, tree.GetFromId(2)->GetUnignoredIndexInParent());
  771. }
  772. TEST(AXTreeTest, IndexInParentAfterReorderIgnoredNode) {
  773. // This test covers another case where an AXTreeUpdate includes
  774. // reordered children. If one of the reordered nodes is ignored, its
  775. // children's unignored index in parent should also be updated.
  776. // Setup initial tree state.
  777. // Tree:
  778. // 1
  779. // 2 3i 4
  780. // 5 6
  781. AXTreeUpdate initial_state;
  782. initial_state.root_id = 1;
  783. initial_state.nodes.resize(6);
  784. initial_state.nodes[0].id = 1;
  785. initial_state.nodes[0].child_ids.resize(3);
  786. initial_state.nodes[0].child_ids[0] = 2;
  787. initial_state.nodes[0].child_ids[1] = 3;
  788. initial_state.nodes[0].child_ids[2] = 4;
  789. initial_state.nodes[1].id = 2;
  790. initial_state.nodes[2].id = 3;
  791. initial_state.nodes[2].AddState(ax::mojom::State::kIgnored);
  792. initial_state.nodes[2].child_ids.resize(2);
  793. initial_state.nodes[2].child_ids[0] = 5;
  794. initial_state.nodes[2].child_ids[1] = 6;
  795. initial_state.nodes[3].id = 4;
  796. initial_state.nodes[4].id = 5;
  797. initial_state.nodes[5].id = 6;
  798. AXTree tree(initial_state);
  799. // Index in parent correct.
  800. EXPECT_EQ(0U, tree.GetFromId(2)->GetUnignoredIndexInParent());
  801. EXPECT_EQ(1U, tree.GetFromId(5)->GetUnignoredIndexInParent());
  802. EXPECT_EQ(2U, tree.GetFromId(6)->GetUnignoredIndexInParent());
  803. EXPECT_EQ(3U, tree.GetFromId(4)->GetUnignoredIndexInParent());
  804. // Perform an update where we reorder children to [ 3i 2 4 ]. The
  805. // unignored index in parent for the children of the ignored node (3) should
  806. // be updated.
  807. AXTreeUpdate update;
  808. update.root_id = 1;
  809. update.nodes.resize(6);
  810. update.nodes[0].id = 1;
  811. update.nodes[0].child_ids.resize(3);
  812. update.nodes[0].child_ids[0] = 3;
  813. update.nodes[0].child_ids[1] = 2;
  814. update.nodes[0].child_ids[2] = 4;
  815. update.nodes[1].id = 2;
  816. update.nodes[2].id = 3;
  817. update.nodes[2].AddState(ax::mojom::State::kIgnored);
  818. update.nodes[2].child_ids.resize(2);
  819. update.nodes[2].child_ids[0] = 5;
  820. update.nodes[2].child_ids[1] = 6;
  821. update.nodes[3].id = 4;
  822. update.nodes[4].id = 5;
  823. update.nodes[5].id = 6;
  824. ASSERT_TRUE(tree.Unserialize(update));
  825. EXPECT_EQ(2U, tree.GetFromId(2)->GetUnignoredIndexInParent());
  826. EXPECT_EQ(0U, tree.GetFromId(5)->GetUnignoredIndexInParent());
  827. EXPECT_EQ(1U, tree.GetFromId(6)->GetUnignoredIndexInParent());
  828. EXPECT_EQ(3U, tree.GetFromId(4)->GetUnignoredIndexInParent());
  829. }
  830. TEST(AXTreeTest, ImplicitAttributeDelete) {
  831. // This test covers the case where an AXTreeUpdate includes a node without
  832. // mentioning one of that node's attributes, this should cause a delete of any
  833. // unmentioned attribute that was previously set on the node.
  834. AXTreeUpdate initial_state;
  835. initial_state.root_id = 1;
  836. initial_state.nodes.resize(1);
  837. initial_state.nodes[0].id = 1;
  838. initial_state.nodes[0].role = ax::mojom::Role::kGroup;
  839. initial_state.nodes[0].SetName("Node 1 name");
  840. AXTree tree(initial_state);
  841. EXPECT_NE(tree.GetFromId(1), nullptr);
  842. EXPECT_EQ(
  843. tree.GetFromId(1)->GetStringAttribute(ax::mojom::StringAttribute::kName),
  844. "Node 1 name");
  845. // Perform a no-op update of node 1 but omit any mention of the name
  846. // attribute. This should delete the name attribute.
  847. AXTreeUpdate update;
  848. update.nodes.resize(1);
  849. update.nodes[0].id = 1;
  850. ASSERT_TRUE(tree.Unserialize(update));
  851. // Check that the name attribute is no longer present.
  852. EXPECT_NE(tree.GetFromId(1), nullptr);
  853. EXPECT_FALSE(
  854. tree.GetFromId(1)->HasStringAttribute(ax::mojom::StringAttribute::kName));
  855. }
  856. TEST(AXTreeTest, TreeObserverIsCalled) {
  857. AXTreeUpdate initial_state;
  858. initial_state.root_id = 1;
  859. initial_state.nodes.resize(2);
  860. initial_state.nodes[0].id = 1;
  861. initial_state.nodes[0].child_ids.push_back(2);
  862. initial_state.nodes[1].id = 2;
  863. AXTree tree(initial_state);
  864. AXTreeUpdate update;
  865. update.root_id = 3;
  866. update.node_id_to_clear = 1;
  867. update.nodes.resize(2);
  868. update.nodes[0].id = 3;
  869. update.nodes[0].child_ids.push_back(4);
  870. update.nodes[1].id = 4;
  871. TestAXTreeObserver test_observer(&tree);
  872. ASSERT_TRUE(tree.Unserialize(update));
  873. ASSERT_EQ(2U, test_observer.deleted_ids().size());
  874. EXPECT_EQ(1, test_observer.deleted_ids()[0]);
  875. EXPECT_EQ(2, test_observer.deleted_ids()[1]);
  876. ASSERT_EQ(1U, test_observer.subtree_deleted_ids().size());
  877. EXPECT_EQ(1, test_observer.subtree_deleted_ids()[0]);
  878. ASSERT_EQ(2U, test_observer.created_ids().size());
  879. EXPECT_EQ(3, test_observer.created_ids()[0]);
  880. EXPECT_EQ(4, test_observer.created_ids()[1]);
  881. ASSERT_EQ(1U, test_observer.subtree_creation_finished_ids().size());
  882. EXPECT_EQ(3, test_observer.subtree_creation_finished_ids()[0]);
  883. ASSERT_EQ(1U, test_observer.node_creation_finished_ids().size());
  884. EXPECT_EQ(4, test_observer.node_creation_finished_ids()[0]);
  885. ASSERT_TRUE(test_observer.root_changed());
  886. }
  887. TEST(AXTreeTest, TreeObserverIsCalledForTreeDataChanges) {
  888. AXTreeUpdate initial_state;
  889. initial_state.root_id = 1;
  890. initial_state.nodes.resize(1);
  891. initial_state.nodes[0].id = 1;
  892. initial_state.has_tree_data = true;
  893. initial_state.tree_data.title = "Initial";
  894. AXTree tree(initial_state);
  895. TestAXTreeObserver test_observer(&tree);
  896. // An empty update shouldn't change tree data.
  897. AXTreeUpdate empty_update;
  898. EXPECT_TRUE(tree.Unserialize(empty_update));
  899. EXPECT_FALSE(test_observer.tree_data_changed());
  900. EXPECT_EQ("Initial", tree.data().title);
  901. // An update with tree data shouldn't change tree data if
  902. // |has_tree_data| isn't set.
  903. AXTreeUpdate ignored_tree_data_update;
  904. ignored_tree_data_update.tree_data.title = "Ignore Me";
  905. EXPECT_TRUE(tree.Unserialize(ignored_tree_data_update));
  906. EXPECT_FALSE(test_observer.tree_data_changed());
  907. EXPECT_EQ("Initial", tree.data().title);
  908. // An update with |has_tree_data| set should update the tree data.
  909. AXTreeUpdate tree_data_update;
  910. tree_data_update.has_tree_data = true;
  911. tree_data_update.tree_data.title = "New Title";
  912. EXPECT_TRUE(tree.Unserialize(tree_data_update));
  913. EXPECT_TRUE(test_observer.tree_data_changed());
  914. EXPECT_EQ("New Title", tree.data().title);
  915. }
  916. TEST(AXTreeTest, ReparentingDoesNotTriggerNodeCreated) {
  917. AXTreeUpdate initial_state;
  918. initial_state.root_id = 1;
  919. initial_state.nodes.resize(3);
  920. initial_state.nodes[0].id = 1;
  921. initial_state.nodes[0].child_ids.push_back(2);
  922. initial_state.nodes[1].id = 2;
  923. initial_state.nodes[1].child_ids.push_back(3);
  924. initial_state.nodes[2].id = 3;
  925. AXTree tree(initial_state);
  926. TestAXTreeObserver test_observer(&tree);
  927. AXTreeUpdate update;
  928. update.nodes.resize(2);
  929. update.node_id_to_clear = 2;
  930. update.root_id = 1;
  931. update.nodes[0].id = 1;
  932. update.nodes[0].child_ids.push_back(3);
  933. update.nodes[1].id = 3;
  934. EXPECT_TRUE(tree.Unserialize(update)) << tree.error();
  935. std::vector<int> created = test_observer.node_creation_finished_ids();
  936. std::vector<int> subtree_reparented =
  937. test_observer.subtree_reparented_finished_ids();
  938. std::vector<int> node_reparented =
  939. test_observer.node_reparented_finished_ids();
  940. ASSERT_FALSE(base::Contains(created, 3));
  941. ASSERT_TRUE(base::Contains(subtree_reparented, 3));
  942. ASSERT_FALSE(base::Contains(node_reparented, 3));
  943. }
  944. TEST(AXTreeTest, MultipleIgnoredChangesDoesNotBreakCache) {
  945. AXTreeUpdate initial_state;
  946. initial_state.root_id = 1;
  947. initial_state.nodes.resize(3);
  948. initial_state.nodes[0].id = 1;
  949. initial_state.nodes[0].child_ids.push_back(2);
  950. initial_state.nodes[1].id = 2;
  951. initial_state.nodes[1].AddState(ax::mojom::State::kIgnored);
  952. initial_state.nodes[1].child_ids.push_back(3);
  953. initial_state.nodes[2].id = 3;
  954. AXTree tree(initial_state);
  955. TestAXTreeObserver test_observer(&tree);
  956. EXPECT_EQ(1u, tree.GetFromId(2)->GetUnignoredChildCount());
  957. AXTreeUpdate update;
  958. update.nodes.resize(2);
  959. update.nodes[0].id = 3;
  960. update.nodes[0].AddState(ax::mojom::State::kIgnored);
  961. update.nodes[1].id = 2;
  962. update.nodes[1].child_ids.push_back(3);
  963. EXPECT_TRUE(tree.Unserialize(update)) << tree.error();
  964. EXPECT_EQ(0u, tree.GetFromId(2)->GetUnignoredChildCount());
  965. EXPECT_FALSE(tree.GetFromId(2)->HasState(ax::mojom::State::kIgnored));
  966. EXPECT_TRUE(tree.GetFromId(3)->HasState(ax::mojom::State::kIgnored));
  967. }
  968. TEST(AXTreeTest, NodeToClearUpdatesParentUnignoredCount) {
  969. AXTreeUpdate initial_state;
  970. initial_state.root_id = 1;
  971. initial_state.nodes.resize(4);
  972. initial_state.nodes[0].id = 1;
  973. initial_state.nodes[0].child_ids.push_back(2);
  974. initial_state.nodes[1].id = 2;
  975. initial_state.nodes[1].AddState(ax::mojom::State::kIgnored);
  976. initial_state.nodes[1].child_ids.push_back(3);
  977. initial_state.nodes[1].child_ids.push_back(4);
  978. initial_state.nodes[2].id = 3;
  979. initial_state.nodes[3].id = 4;
  980. AXTree tree(initial_state);
  981. EXPECT_EQ(2u, tree.GetFromId(1)->GetUnignoredChildCount());
  982. EXPECT_EQ(2u, tree.GetFromId(2)->GetUnignoredChildCount());
  983. AXTreeUpdate update;
  984. update.nodes.resize(1);
  985. update.node_id_to_clear = 2;
  986. update.root_id = 1;
  987. update.nodes[0] = initial_state.nodes[1];
  988. update.nodes[0].state = 0;
  989. update.nodes[0].child_ids.resize(0);
  990. EXPECT_TRUE(tree.Unserialize(update)) << tree.error();
  991. EXPECT_EQ(1u, tree.GetFromId(1)->GetUnignoredChildCount());
  992. }
  993. TEST(AXTreeTest, TreeObserverIsNotCalledForReparenting) {
  994. AXTreeUpdate initial_state;
  995. initial_state.root_id = 1;
  996. initial_state.nodes.resize(2);
  997. initial_state.nodes[0].id = 1;
  998. initial_state.nodes[0].child_ids.push_back(2);
  999. initial_state.nodes[1].id = 2;
  1000. AXTree tree(initial_state);
  1001. AXTreeUpdate update;
  1002. update.node_id_to_clear = 1;
  1003. update.root_id = 2;
  1004. update.nodes.resize(2);
  1005. update.nodes[0].id = 2;
  1006. update.nodes[0].child_ids.push_back(4);
  1007. update.nodes[1].id = 4;
  1008. TestAXTreeObserver test_observer(&tree);
  1009. EXPECT_TRUE(tree.Unserialize(update));
  1010. ASSERT_EQ(1U, test_observer.deleted_ids().size());
  1011. EXPECT_EQ(1, test_observer.deleted_ids()[0]);
  1012. ASSERT_EQ(1U, test_observer.subtree_deleted_ids().size());
  1013. EXPECT_EQ(1, test_observer.subtree_deleted_ids()[0]);
  1014. ASSERT_EQ(1U, test_observer.created_ids().size());
  1015. EXPECT_EQ(4, test_observer.created_ids()[0]);
  1016. ASSERT_EQ(1U, test_observer.subtree_creation_finished_ids().size());
  1017. EXPECT_EQ(4, test_observer.subtree_creation_finished_ids()[0]);
  1018. ASSERT_EQ(1U, test_observer.subtree_reparented_finished_ids().size());
  1019. EXPECT_EQ(2, test_observer.subtree_reparented_finished_ids()[0]);
  1020. EXPECT_EQ(0U, test_observer.node_creation_finished_ids().size());
  1021. EXPECT_EQ(0U, test_observer.node_reparented_finished_ids().size());
  1022. ASSERT_TRUE(test_observer.root_changed());
  1023. }
  1024. // UAF caught by ax_tree_fuzzer
  1025. TEST(AXTreeTest, BogusAXTree) {
  1026. AXTreeUpdate initial_state;
  1027. AXNodeData node;
  1028. node.id = 0;
  1029. initial_state.nodes.push_back(node);
  1030. initial_state.nodes.push_back(node);
  1031. ui::AXTree tree;
  1032. tree.Unserialize(initial_state);
  1033. }
  1034. // UAF caught by ax_tree_fuzzer
  1035. TEST(AXTreeTest, BogusAXTree2) {
  1036. AXTreeUpdate initial_state;
  1037. AXNodeData node;
  1038. node.id = 0;
  1039. initial_state.nodes.push_back(node);
  1040. AXNodeData node2;
  1041. node2.id = 0;
  1042. node2.child_ids.push_back(0);
  1043. node2.child_ids.push_back(0);
  1044. initial_state.nodes.push_back(node2);
  1045. ui::AXTree tree;
  1046. #if defined(AX_FAIL_FAST_BUILD)
  1047. EXPECT_DEATH_IF_SUPPORTED(tree.Unserialize(initial_state),
  1048. "Node 0 has duplicate child id 0");
  1049. #else
  1050. EXPECT_FALSE(tree.Unserialize(initial_state));
  1051. EXPECT_EQ("Node 0 has duplicate child id 0", tree.error());
  1052. #endif
  1053. }
  1054. // UAF caught by ax_tree_fuzzer
  1055. TEST(AXTreeTest, BogusAXTree3) {
  1056. AXTreeUpdate initial_state;
  1057. AXNodeData node;
  1058. node.id = 0;
  1059. node.child_ids.push_back(1);
  1060. initial_state.nodes.push_back(node);
  1061. AXNodeData node2;
  1062. node2.id = 1;
  1063. node2.child_ids.push_back(1);
  1064. node2.child_ids.push_back(1);
  1065. initial_state.nodes.push_back(node2);
  1066. ui::AXTree tree;
  1067. #if defined(AX_FAIL_FAST_BUILD)
  1068. EXPECT_DEATH_IF_SUPPORTED(tree.Unserialize(initial_state),
  1069. "Node 1 has duplicate child id 1");
  1070. #else
  1071. EXPECT_FALSE(tree.Unserialize(initial_state));
  1072. EXPECT_EQ("Node 1 has duplicate child id 1", tree.error());
  1073. #endif
  1074. }
  1075. TEST(AXTreeTest, RoleAndStateChangeCallbacks) {
  1076. AXTreeUpdate initial_state;
  1077. initial_state.root_id = 1;
  1078. initial_state.nodes.resize(1);
  1079. initial_state.nodes[0].id = 1;
  1080. initial_state.nodes[0].role = ax::mojom::Role::kButton;
  1081. initial_state.nodes[0].SetCheckedState(ax::mojom::CheckedState::kTrue);
  1082. initial_state.nodes[0].AddState(ax::mojom::State::kFocusable);
  1083. AXTree tree(initial_state);
  1084. TestAXTreeObserver test_observer(&tree);
  1085. // Change the role and state.
  1086. AXTreeUpdate update;
  1087. update.root_id = 1;
  1088. update.nodes.resize(1);
  1089. update.nodes[0].id = 1;
  1090. update.nodes[0].role = ax::mojom::Role::kCheckBox;
  1091. update.nodes[0].SetCheckedState(ax::mojom::CheckedState::kFalse);
  1092. update.nodes[0].AddState(ax::mojom::State::kFocusable);
  1093. update.nodes[0].AddState(ax::mojom::State::kVisited);
  1094. EXPECT_TRUE(tree.Unserialize(update));
  1095. const std::vector<std::string>& change_log =
  1096. test_observer.attribute_change_log();
  1097. ASSERT_EQ(3U, change_log.size());
  1098. EXPECT_EQ("Role changed from button to checkBox", change_log[0]);
  1099. EXPECT_EQ("visited changed to true", change_log[1]);
  1100. EXPECT_EQ("checkedState changed from 2 to 1", change_log[2]);
  1101. }
  1102. TEST(AXTreeTest, AttributeChangeCallbacks) {
  1103. AXTreeUpdate initial_state;
  1104. initial_state.root_id = 1;
  1105. initial_state.nodes.resize(1);
  1106. initial_state.nodes[0].id = 1;
  1107. initial_state.nodes[0].AddStringAttribute(ax::mojom::StringAttribute::kName,
  1108. "N1");
  1109. initial_state.nodes[0].AddStringAttribute(
  1110. ax::mojom::StringAttribute::kDescription, "D1");
  1111. initial_state.nodes[0].AddBoolAttribute(ax::mojom::BoolAttribute::kLiveAtomic,
  1112. true);
  1113. initial_state.nodes[0].AddBoolAttribute(ax::mojom::BoolAttribute::kBusy,
  1114. false);
  1115. initial_state.nodes[0].AddFloatAttribute(
  1116. ax::mojom::FloatAttribute::kMinValueForRange, 1.0);
  1117. initial_state.nodes[0].AddFloatAttribute(
  1118. ax::mojom::FloatAttribute::kMaxValueForRange, 10.0);
  1119. initial_state.nodes[0].AddFloatAttribute(
  1120. ax::mojom::FloatAttribute::kStepValueForRange, 3.0);
  1121. initial_state.nodes[0].AddIntAttribute(ax::mojom::IntAttribute::kScrollX, 5);
  1122. initial_state.nodes[0].AddIntAttribute(ax::mojom::IntAttribute::kScrollXMin,
  1123. 1);
  1124. AXTree tree(initial_state);
  1125. TestAXTreeObserver test_observer(&tree);
  1126. // Change existing attributes.
  1127. AXTreeUpdate update0;
  1128. update0.root_id = 1;
  1129. update0.nodes.resize(1);
  1130. update0.nodes[0].id = 1;
  1131. update0.nodes[0].AddStringAttribute(ax::mojom::StringAttribute::kName, "N2");
  1132. update0.nodes[0].AddStringAttribute(ax::mojom::StringAttribute::kDescription,
  1133. "D2");
  1134. update0.nodes[0].AddBoolAttribute(ax::mojom::BoolAttribute::kLiveAtomic,
  1135. false);
  1136. update0.nodes[0].AddBoolAttribute(ax::mojom::BoolAttribute::kBusy, true);
  1137. update0.nodes[0].AddFloatAttribute(
  1138. ax::mojom::FloatAttribute::kMinValueForRange, 2.0);
  1139. update0.nodes[0].AddFloatAttribute(
  1140. ax::mojom::FloatAttribute::kMaxValueForRange, 9.0);
  1141. update0.nodes[0].AddFloatAttribute(
  1142. ax::mojom::FloatAttribute::kStepValueForRange, 0.5);
  1143. update0.nodes[0].AddIntAttribute(ax::mojom::IntAttribute::kScrollX, 6);
  1144. update0.nodes[0].AddIntAttribute(ax::mojom::IntAttribute::kScrollXMin, 2);
  1145. EXPECT_TRUE(tree.Unserialize(update0));
  1146. const std::vector<std::string>& change_log =
  1147. test_observer.attribute_change_log();
  1148. ASSERT_EQ(9U, change_log.size());
  1149. EXPECT_EQ("name changed from N1 to N2", change_log[0]);
  1150. EXPECT_EQ("description changed from D1 to D2", change_log[1]);
  1151. EXPECT_EQ("liveAtomic changed to false", change_log[2]);
  1152. EXPECT_EQ("busy changed to true", change_log[3]);
  1153. EXPECT_EQ("minValueForRange changed from 1 to 2", change_log[4]);
  1154. EXPECT_EQ("maxValueForRange changed from 10 to 9", change_log[5]);
  1155. EXPECT_EQ("stepValueForRange changed from 3 to 0.5", change_log[6]);
  1156. EXPECT_EQ("scrollX changed from 5 to 6", change_log[7]);
  1157. EXPECT_EQ("scrollXMin changed from 1 to 2", change_log[8]);
  1158. TestAXTreeObserver test_observer2(&tree);
  1159. // Add and remove attributes.
  1160. AXTreeUpdate update1;
  1161. update1.root_id = 1;
  1162. update1.nodes.resize(1);
  1163. update1.nodes[0].id = 1;
  1164. update1.nodes[0].AddStringAttribute(ax::mojom::StringAttribute::kDescription,
  1165. "D3");
  1166. update1.nodes[0].AddStringAttribute(ax::mojom::StringAttribute::kValue, "V3");
  1167. update1.nodes[0].AddBoolAttribute(ax::mojom::BoolAttribute::kModal, true);
  1168. update1.nodes[0].AddFloatAttribute(ax::mojom::FloatAttribute::kValueForRange,
  1169. 5.0);
  1170. update1.nodes[0].AddFloatAttribute(
  1171. ax::mojom::FloatAttribute::kMaxValueForRange, 9.0);
  1172. update1.nodes[0].AddIntAttribute(ax::mojom::IntAttribute::kScrollX, 7);
  1173. update1.nodes[0].AddIntAttribute(ax::mojom::IntAttribute::kScrollXMax, 10);
  1174. EXPECT_TRUE(tree.Unserialize(update1));
  1175. const std::vector<std::string>& change_log2 =
  1176. test_observer2.attribute_change_log();
  1177. ASSERT_EQ(11U, change_log2.size());
  1178. EXPECT_EQ("name changed from N2 to ", change_log2[0]);
  1179. EXPECT_EQ("description changed from D2 to D3", change_log2[1]);
  1180. EXPECT_EQ("value changed from to V3", change_log2[2]);
  1181. EXPECT_EQ("busy changed to false", change_log2[3]);
  1182. EXPECT_EQ("modal changed to true", change_log2[4]);
  1183. EXPECT_EQ("minValueForRange changed from 2 to 0", change_log2[5]);
  1184. EXPECT_EQ("stepValueForRange changed from 3 to 0.5", change_log[6]);
  1185. EXPECT_EQ("valueForRange changed from 0 to 5", change_log2[7]);
  1186. EXPECT_EQ("scrollXMin changed from 2 to 0", change_log2[8]);
  1187. EXPECT_EQ("scrollX changed from 6 to 7", change_log2[9]);
  1188. EXPECT_EQ("scrollXMax changed from 0 to 10", change_log2[10]);
  1189. }
  1190. TEST(AXTreeTest, IntListChangeCallbacks) {
  1191. std::vector<int32_t> one;
  1192. one.push_back(1);
  1193. std::vector<int32_t> two;
  1194. two.push_back(2);
  1195. two.push_back(2);
  1196. std::vector<int32_t> three;
  1197. three.push_back(3);
  1198. AXTreeUpdate initial_state;
  1199. initial_state.root_id = 1;
  1200. initial_state.nodes.resize(1);
  1201. initial_state.nodes[0].id = 1;
  1202. initial_state.nodes[0].AddIntListAttribute(
  1203. ax::mojom::IntListAttribute::kControlsIds, one);
  1204. initial_state.nodes[0].AddIntListAttribute(
  1205. ax::mojom::IntListAttribute::kRadioGroupIds, two);
  1206. AXTree tree(initial_state);
  1207. TestAXTreeObserver test_observer(&tree);
  1208. // Change existing attributes.
  1209. AXTreeUpdate update0;
  1210. update0.root_id = 1;
  1211. update0.nodes.resize(1);
  1212. update0.nodes[0].id = 1;
  1213. update0.nodes[0].AddIntListAttribute(
  1214. ax::mojom::IntListAttribute::kControlsIds, two);
  1215. update0.nodes[0].AddIntListAttribute(
  1216. ax::mojom::IntListAttribute::kRadioGroupIds, three);
  1217. EXPECT_TRUE(tree.Unserialize(update0));
  1218. const std::vector<std::string>& change_log =
  1219. test_observer.attribute_change_log();
  1220. ASSERT_EQ(2U, change_log.size());
  1221. EXPECT_EQ("controlsIds changed from 1 to 2,2", change_log[0]);
  1222. EXPECT_EQ("radioGroupIds changed from 2,2 to 3", change_log[1]);
  1223. TestAXTreeObserver test_observer2(&tree);
  1224. // Add and remove attributes.
  1225. AXTreeUpdate update1;
  1226. update1.root_id = 1;
  1227. update1.nodes.resize(1);
  1228. update1.nodes[0].id = 1;
  1229. update1.nodes[0].AddIntListAttribute(
  1230. ax::mojom::IntListAttribute::kRadioGroupIds, two);
  1231. update1.nodes[0].AddIntListAttribute(ax::mojom::IntListAttribute::kFlowtoIds,
  1232. three);
  1233. EXPECT_TRUE(tree.Unserialize(update1));
  1234. const std::vector<std::string>& change_log2 =
  1235. test_observer2.attribute_change_log();
  1236. ASSERT_EQ(3U, change_log2.size());
  1237. EXPECT_EQ("controlsIds changed from 2,2 to ", change_log2[0]);
  1238. EXPECT_EQ("radioGroupIds changed from 3 to 2,2", change_log2[1]);
  1239. EXPECT_EQ("flowtoIds changed from to 3", change_log2[2]);
  1240. }
  1241. // Create a very simple tree and make sure that we can get the bounds of
  1242. // any node.
  1243. TEST(AXTreeTest, GetBoundsBasic) {
  1244. AXTreeUpdate tree_update;
  1245. tree_update.root_id = 1;
  1246. tree_update.nodes.resize(2);
  1247. tree_update.nodes[0].id = 1;
  1248. tree_update.nodes[0].relative_bounds.bounds = gfx::RectF(0, 0, 800, 600);
  1249. tree_update.nodes[0].child_ids.push_back(2);
  1250. tree_update.nodes[1].id = 2;
  1251. tree_update.nodes[1].relative_bounds.bounds = gfx::RectF(100, 10, 400, 300);
  1252. AXTree tree(tree_update);
  1253. EXPECT_EQ("(0, 0) size (800 x 600)", GetBoundsAsString(tree, 1));
  1254. EXPECT_EQ("(100, 10) size (400 x 300)", GetBoundsAsString(tree, 2));
  1255. }
  1256. // If a node doesn't specify its location but at least one child does have
  1257. // a location, its computed bounds should be the union of all child bounds.
  1258. TEST(AXTreeTest, EmptyNodeBoundsIsUnionOfChildren) {
  1259. AXTreeUpdate tree_update;
  1260. tree_update.root_id = 1;
  1261. tree_update.nodes.resize(4);
  1262. tree_update.nodes[0].id = 1;
  1263. tree_update.nodes[0].relative_bounds.bounds = gfx::RectF(0, 0, 800, 600);
  1264. tree_update.nodes[0].child_ids.push_back(2);
  1265. tree_update.nodes[1].id = 2;
  1266. tree_update.nodes[1].relative_bounds.bounds =
  1267. gfx::RectF(); // Deliberately empty.
  1268. tree_update.nodes[1].child_ids.push_back(3);
  1269. tree_update.nodes[1].child_ids.push_back(4);
  1270. tree_update.nodes[2].id = 3;
  1271. tree_update.nodes[2].relative_bounds.bounds = gfx::RectF(100, 10, 400, 20);
  1272. tree_update.nodes[3].id = 4;
  1273. tree_update.nodes[3].relative_bounds.bounds = gfx::RectF(200, 30, 400, 20);
  1274. AXTree tree(tree_update);
  1275. EXPECT_EQ("(100, 10) size (500 x 40)", GetBoundsAsString(tree, 2));
  1276. }
  1277. // If a node doesn't specify its location but at least one child does have
  1278. // a location, it will be offscreen if all of its children are offscreen.
  1279. TEST(AXTreeTest, EmptyNodeNotOffscreenEvenIfAllChildrenOffscreen) {
  1280. AXTreeUpdate tree_update;
  1281. tree_update.root_id = 1;
  1282. tree_update.nodes.resize(4);
  1283. tree_update.nodes[0].id = 1;
  1284. tree_update.nodes[0].relative_bounds.bounds = gfx::RectF(0, 0, 800, 600);
  1285. tree_update.nodes[0].role = ax::mojom::Role::kRootWebArea;
  1286. tree_update.nodes[0].AddBoolAttribute(
  1287. ax::mojom::BoolAttribute::kClipsChildren, true);
  1288. tree_update.nodes[0].child_ids.push_back(2);
  1289. tree_update.nodes[1].id = 2;
  1290. tree_update.nodes[1].relative_bounds.bounds =
  1291. gfx::RectF(); // Deliberately empty.
  1292. tree_update.nodes[1].child_ids.push_back(3);
  1293. tree_update.nodes[1].child_ids.push_back(4);
  1294. // Both children are offscreen
  1295. tree_update.nodes[2].id = 3;
  1296. tree_update.nodes[2].relative_bounds.bounds = gfx::RectF(900, 10, 400, 20);
  1297. tree_update.nodes[3].id = 4;
  1298. tree_update.nodes[3].relative_bounds.bounds = gfx::RectF(1000, 30, 400, 20);
  1299. AXTree tree(tree_update);
  1300. EXPECT_FALSE(IsNodeOffscreen(tree, 2));
  1301. EXPECT_TRUE(IsNodeOffscreen(tree, 3));
  1302. EXPECT_TRUE(IsNodeOffscreen(tree, 4));
  1303. }
  1304. // Test that getting the bounds of a node works when there's a transform.
  1305. TEST(AXTreeTest, GetBoundsWithTransform) {
  1306. AXTreeUpdate tree_update;
  1307. tree_update.root_id = 1;
  1308. tree_update.nodes.resize(3);
  1309. tree_update.nodes[0].id = 1;
  1310. tree_update.nodes[0].relative_bounds.bounds = gfx::RectF(0, 0, 400, 300);
  1311. tree_update.nodes[0].relative_bounds.transform =
  1312. std::make_unique<gfx::Transform>();
  1313. tree_update.nodes[0].relative_bounds.transform->Scale(2.0, 2.0);
  1314. tree_update.nodes[0].child_ids.push_back(2);
  1315. tree_update.nodes[0].child_ids.push_back(3);
  1316. tree_update.nodes[1].id = 2;
  1317. tree_update.nodes[1].relative_bounds.bounds = gfx::RectF(20, 10, 50, 5);
  1318. tree_update.nodes[2].id = 3;
  1319. tree_update.nodes[2].relative_bounds.bounds = gfx::RectF(20, 30, 50, 5);
  1320. tree_update.nodes[2].relative_bounds.transform =
  1321. std::make_unique<gfx::Transform>();
  1322. tree_update.nodes[2].relative_bounds.transform->Scale(2.0, 2.0);
  1323. AXTree tree(tree_update);
  1324. EXPECT_EQ("(0, 0) size (800 x 600)", GetBoundsAsString(tree, 1));
  1325. EXPECT_EQ("(40, 20) size (100 x 10)", GetBoundsAsString(tree, 2));
  1326. EXPECT_EQ("(80, 120) size (200 x 20)", GetBoundsAsString(tree, 3));
  1327. }
  1328. // Test that getting the bounds of a node that's inside a container
  1329. // works correctly.
  1330. TEST(AXTreeTest, GetBoundsWithContainerId) {
  1331. AXTreeUpdate tree_update;
  1332. tree_update.root_id = 1;
  1333. tree_update.nodes.resize(4);
  1334. tree_update.nodes[0].id = 1;
  1335. tree_update.nodes[0].relative_bounds.bounds = gfx::RectF(0, 0, 800, 600);
  1336. tree_update.nodes[0].child_ids.push_back(2);
  1337. tree_update.nodes[1].id = 2;
  1338. tree_update.nodes[1].relative_bounds.bounds = gfx::RectF(100, 50, 600, 500);
  1339. tree_update.nodes[1].child_ids.push_back(3);
  1340. tree_update.nodes[1].child_ids.push_back(4);
  1341. tree_update.nodes[2].id = 3;
  1342. tree_update.nodes[2].relative_bounds.offset_container_id = 2;
  1343. tree_update.nodes[2].relative_bounds.bounds = gfx::RectF(20, 30, 50, 5);
  1344. tree_update.nodes[3].id = 4;
  1345. tree_update.nodes[3].relative_bounds.bounds = gfx::RectF(20, 30, 50, 5);
  1346. AXTree tree(tree_update);
  1347. EXPECT_EQ("(120, 80) size (50 x 5)", GetBoundsAsString(tree, 3));
  1348. EXPECT_EQ("(20, 30) size (50 x 5)", GetBoundsAsString(tree, 4));
  1349. }
  1350. // Test that getting the bounds of a node that's inside a scrolling container
  1351. // works correctly.
  1352. TEST(AXTreeTest, GetBoundsWithScrolling) {
  1353. AXTreeUpdate tree_update;
  1354. tree_update.root_id = 1;
  1355. tree_update.nodes.resize(3);
  1356. tree_update.nodes[0].id = 1;
  1357. tree_update.nodes[0].relative_bounds.bounds = gfx::RectF(0, 0, 800, 600);
  1358. tree_update.nodes[0].child_ids.push_back(2);
  1359. tree_update.nodes[1].id = 2;
  1360. tree_update.nodes[1].relative_bounds.bounds = gfx::RectF(100, 50, 600, 500);
  1361. tree_update.nodes[1].AddIntAttribute(ax::mojom::IntAttribute::kScrollX, 5);
  1362. tree_update.nodes[1].AddIntAttribute(ax::mojom::IntAttribute::kScrollY, 10);
  1363. tree_update.nodes[1].child_ids.push_back(3);
  1364. tree_update.nodes[2].id = 3;
  1365. tree_update.nodes[2].relative_bounds.offset_container_id = 2;
  1366. tree_update.nodes[2].relative_bounds.bounds = gfx::RectF(20, 30, 50, 5);
  1367. AXTree tree(tree_update);
  1368. EXPECT_EQ("(115, 70) size (50 x 5)", GetBoundsAsString(tree, 3));
  1369. }
  1370. // When a node has zero size, we try to get the bounds from an ancestor.
  1371. TEST(AXTreeTest, GetBoundsOfNodeWithZeroSize) {
  1372. AXTreeUpdate tree_update;
  1373. tree_update.root_id = 1;
  1374. tree_update.nodes.resize(5);
  1375. tree_update.nodes[0].id = 1;
  1376. tree_update.nodes[0].relative_bounds.bounds = gfx::RectF(0, 0, 800, 600);
  1377. tree_update.nodes[0].child_ids = {2};
  1378. tree_update.nodes[1].id = 2;
  1379. tree_update.nodes[1].relative_bounds.bounds = gfx::RectF(100, 100, 300, 200);
  1380. tree_update.nodes[1].child_ids = {3, 4, 5};
  1381. // This child has relative coordinates and no offset and no size.
  1382. tree_update.nodes[2].id = 3;
  1383. tree_update.nodes[2].relative_bounds.offset_container_id = 2;
  1384. tree_update.nodes[2].relative_bounds.bounds = gfx::RectF(0, 0, 0, 0);
  1385. // This child has relative coordinates and an offset, but no size.
  1386. tree_update.nodes[3].id = 4;
  1387. tree_update.nodes[3].relative_bounds.offset_container_id = 2;
  1388. tree_update.nodes[3].relative_bounds.bounds = gfx::RectF(20, 20, 0, 0);
  1389. // This child has absolute coordinates, an offset, and no size.
  1390. tree_update.nodes[4].id = 5;
  1391. tree_update.nodes[4].relative_bounds.bounds = gfx::RectF(120, 120, 0, 0);
  1392. AXTree tree(tree_update);
  1393. EXPECT_EQ("(100, 100) size (300 x 200)", GetBoundsAsString(tree, 3));
  1394. EXPECT_EQ("(120, 120) size (280 x 180)", GetBoundsAsString(tree, 4));
  1395. EXPECT_EQ("(120, 120) size (280 x 180)", GetBoundsAsString(tree, 5));
  1396. }
  1397. TEST(AXTreeTest, GetBoundsEmptyBoundsInheritsFromParent) {
  1398. AXTreeUpdate tree_update;
  1399. tree_update.root_id = 1;
  1400. tree_update.nodes.resize(3);
  1401. tree_update.nodes[0].id = 1;
  1402. tree_update.nodes[0].relative_bounds.bounds = gfx::RectF(0, 0, 800, 600);
  1403. tree_update.nodes[1].AddBoolAttribute(
  1404. ax::mojom::BoolAttribute::kClipsChildren, true);
  1405. tree_update.nodes[0].child_ids.push_back(2);
  1406. tree_update.nodes[1].id = 2;
  1407. tree_update.nodes[1].relative_bounds.bounds = gfx::RectF(300, 200, 100, 100);
  1408. tree_update.nodes[1].child_ids.push_back(3);
  1409. tree_update.nodes[2].id = 3;
  1410. tree_update.nodes[2].relative_bounds.bounds = gfx::RectF();
  1411. AXTree tree(tree_update);
  1412. EXPECT_EQ("(0, 0) size (800 x 600)", GetBoundsAsString(tree, 1));
  1413. EXPECT_EQ("(300, 200) size (100 x 100)", GetBoundsAsString(tree, 2));
  1414. EXPECT_EQ("(300, 200) size (100 x 100)", GetBoundsAsString(tree, 3));
  1415. EXPECT_EQ("(0, 0) size (800 x 600)", GetUnclippedBoundsAsString(tree, 1));
  1416. EXPECT_EQ("(300, 200) size (100 x 100)", GetUnclippedBoundsAsString(tree, 2));
  1417. EXPECT_EQ("(300, 200) size (100 x 100)", GetUnclippedBoundsAsString(tree, 3));
  1418. EXPECT_FALSE(IsNodeOffscreen(tree, 1));
  1419. EXPECT_FALSE(IsNodeOffscreen(tree, 2));
  1420. EXPECT_TRUE(IsNodeOffscreen(tree, 3));
  1421. }
  1422. TEST(AXTreeTest, GetBoundsCropsChildToRoot) {
  1423. AXTreeUpdate tree_update;
  1424. tree_update.root_id = 1;
  1425. tree_update.nodes.resize(5);
  1426. tree_update.nodes[0].id = 1;
  1427. tree_update.nodes[0].relative_bounds.bounds = gfx::RectF(0, 0, 800, 600);
  1428. tree_update.nodes[0].AddBoolAttribute(
  1429. ax::mojom::BoolAttribute::kClipsChildren, true);
  1430. tree_update.nodes[0].child_ids.push_back(2);
  1431. tree_update.nodes[0].child_ids.push_back(3);
  1432. tree_update.nodes[0].child_ids.push_back(4);
  1433. tree_update.nodes[0].child_ids.push_back(5);
  1434. // Cropped in the top left
  1435. tree_update.nodes[1].id = 2;
  1436. tree_update.nodes[1].relative_bounds.bounds =
  1437. gfx::RectF(-100, -100, 150, 150);
  1438. // Cropped in the bottom right
  1439. tree_update.nodes[2].id = 3;
  1440. tree_update.nodes[2].relative_bounds.bounds = gfx::RectF(700, 500, 150, 150);
  1441. // Offscreen on the top
  1442. tree_update.nodes[3].id = 4;
  1443. tree_update.nodes[3].relative_bounds.bounds = gfx::RectF(50, -200, 150, 150);
  1444. // Offscreen on the bottom
  1445. tree_update.nodes[4].id = 5;
  1446. tree_update.nodes[4].relative_bounds.bounds = gfx::RectF(50, 700, 150, 150);
  1447. AXTree tree(tree_update);
  1448. EXPECT_EQ("(0, 0) size (50 x 50)", GetBoundsAsString(tree, 2));
  1449. EXPECT_EQ("(700, 500) size (100 x 100)", GetBoundsAsString(tree, 3));
  1450. EXPECT_EQ("(50, 0) size (150 x 1)", GetBoundsAsString(tree, 4));
  1451. EXPECT_EQ("(50, 599) size (150 x 1)", GetBoundsAsString(tree, 5));
  1452. // Check the unclipped bounds are as expected.
  1453. EXPECT_EQ("(-100, -100) size (150 x 150)",
  1454. GetUnclippedBoundsAsString(tree, 2));
  1455. EXPECT_EQ("(700, 500) size (150 x 150)", GetUnclippedBoundsAsString(tree, 3));
  1456. EXPECT_EQ("(50, -200) size (150 x 150)", GetUnclippedBoundsAsString(tree, 4));
  1457. EXPECT_EQ("(50, 700) size (150 x 150)", GetUnclippedBoundsAsString(tree, 5));
  1458. }
  1459. TEST(AXTreeTest, GetBoundsSetsOffscreenIfClipsChildren) {
  1460. AXTreeUpdate tree_update;
  1461. tree_update.root_id = 1;
  1462. tree_update.nodes.resize(5);
  1463. tree_update.nodes[0].id = 1;
  1464. tree_update.nodes[0].relative_bounds.bounds = gfx::RectF(0, 0, 800, 600);
  1465. tree_update.nodes[0].AddBoolAttribute(
  1466. ax::mojom::BoolAttribute::kClipsChildren, true);
  1467. tree_update.nodes[0].child_ids.push_back(2);
  1468. tree_update.nodes[0].child_ids.push_back(3);
  1469. tree_update.nodes[1].id = 2;
  1470. tree_update.nodes[1].relative_bounds.bounds = gfx::RectF(0, 0, 200, 200);
  1471. tree_update.nodes[1].AddBoolAttribute(
  1472. ax::mojom::BoolAttribute::kClipsChildren, true);
  1473. tree_update.nodes[1].child_ids.push_back(4);
  1474. tree_update.nodes[2].id = 3;
  1475. tree_update.nodes[2].relative_bounds.bounds = gfx::RectF(0, 0, 200, 200);
  1476. tree_update.nodes[2].child_ids.push_back(5);
  1477. // Clipped by its parent
  1478. tree_update.nodes[3].id = 4;
  1479. tree_update.nodes[3].relative_bounds.bounds = gfx::RectF(250, 250, 100, 100);
  1480. tree_update.nodes[3].relative_bounds.offset_container_id = 2;
  1481. // Outside of its parent, but its parent does not clip children,
  1482. // so it should not be offscreen.
  1483. tree_update.nodes[4].id = 5;
  1484. tree_update.nodes[4].relative_bounds.bounds = gfx::RectF(250, 250, 100, 100);
  1485. tree_update.nodes[4].relative_bounds.offset_container_id = 3;
  1486. AXTree tree(tree_update);
  1487. EXPECT_TRUE(IsNodeOffscreen(tree, 4));
  1488. EXPECT_FALSE(IsNodeOffscreen(tree, 5));
  1489. }
  1490. TEST(AXTreeTest, GetBoundsUpdatesOffscreen) {
  1491. AXTreeUpdate tree_update;
  1492. tree_update.root_id = 1;
  1493. tree_update.nodes.resize(5);
  1494. tree_update.nodes[0].id = 1;
  1495. tree_update.nodes[0].relative_bounds.bounds = gfx::RectF(0, 0, 800, 600);
  1496. tree_update.nodes[0].role = ax::mojom::Role::kRootWebArea;
  1497. tree_update.nodes[0].AddBoolAttribute(
  1498. ax::mojom::BoolAttribute::kClipsChildren, true);
  1499. tree_update.nodes[0].child_ids.push_back(2);
  1500. tree_update.nodes[0].child_ids.push_back(3);
  1501. tree_update.nodes[0].child_ids.push_back(4);
  1502. tree_update.nodes[0].child_ids.push_back(5);
  1503. // Fully onscreen
  1504. tree_update.nodes[1].id = 2;
  1505. tree_update.nodes[1].relative_bounds.bounds = gfx::RectF(10, 10, 150, 150);
  1506. // Cropped in the bottom right
  1507. tree_update.nodes[2].id = 3;
  1508. tree_update.nodes[2].relative_bounds.bounds = gfx::RectF(700, 500, 150, 150);
  1509. // Offscreen on the top
  1510. tree_update.nodes[3].id = 4;
  1511. tree_update.nodes[3].relative_bounds.bounds = gfx::RectF(50, -200, 150, 150);
  1512. // Offscreen on the bottom
  1513. tree_update.nodes[4].id = 5;
  1514. tree_update.nodes[4].relative_bounds.bounds = gfx::RectF(50, 700, 150, 150);
  1515. AXTree tree(tree_update);
  1516. EXPECT_FALSE(IsNodeOffscreen(tree, 2));
  1517. EXPECT_FALSE(IsNodeOffscreen(tree, 3));
  1518. EXPECT_TRUE(IsNodeOffscreen(tree, 4));
  1519. EXPECT_TRUE(IsNodeOffscreen(tree, 5));
  1520. }
  1521. TEST(AXTreeTest, IntReverseRelations) {
  1522. AXTreeUpdate initial_state;
  1523. initial_state.root_id = 1;
  1524. initial_state.nodes.resize(4);
  1525. initial_state.nodes[0].id = 1;
  1526. initial_state.nodes[0].AddIntAttribute(
  1527. ax::mojom::IntAttribute::kActivedescendantId, 2);
  1528. initial_state.nodes[0].child_ids.push_back(2);
  1529. initial_state.nodes[0].child_ids.push_back(3);
  1530. initial_state.nodes[0].child_ids.push_back(4);
  1531. initial_state.nodes[1].id = 2;
  1532. initial_state.nodes[2].id = 3;
  1533. initial_state.nodes[2].AddIntAttribute(ax::mojom::IntAttribute::kMemberOfId,
  1534. 1);
  1535. initial_state.nodes[3].id = 4;
  1536. initial_state.nodes[3].AddIntAttribute(ax::mojom::IntAttribute::kMemberOfId,
  1537. 1);
  1538. AXTree tree(initial_state);
  1539. auto reverse_active_descendant =
  1540. tree.GetReverseRelations(ax::mojom::IntAttribute::kActivedescendantId, 2);
  1541. ASSERT_EQ(1U, reverse_active_descendant.size());
  1542. EXPECT_TRUE(base::Contains(reverse_active_descendant, 1));
  1543. reverse_active_descendant =
  1544. tree.GetReverseRelations(ax::mojom::IntAttribute::kActivedescendantId, 1);
  1545. ASSERT_EQ(0U, reverse_active_descendant.size());
  1546. auto reverse_errormessage =
  1547. tree.GetReverseRelations(ax::mojom::IntAttribute::kErrormessageId, 1);
  1548. ASSERT_EQ(0U, reverse_errormessage.size());
  1549. auto reverse_member_of =
  1550. tree.GetReverseRelations(ax::mojom::IntAttribute::kMemberOfId, 1);
  1551. ASSERT_EQ(2U, reverse_member_of.size());
  1552. EXPECT_TRUE(base::Contains(reverse_member_of, 3));
  1553. EXPECT_TRUE(base::Contains(reverse_member_of, 4));
  1554. AXTreeUpdate update = initial_state;
  1555. update.nodes.resize(5);
  1556. update.nodes[0].int_attributes.clear();
  1557. update.nodes[0].AddIntAttribute(ax::mojom::IntAttribute::kActivedescendantId,
  1558. 5);
  1559. update.nodes[0].child_ids.push_back(5);
  1560. update.nodes[2].int_attributes.clear();
  1561. update.nodes[4].id = 5;
  1562. update.nodes[4].AddIntAttribute(ax::mojom::IntAttribute::kMemberOfId, 1);
  1563. EXPECT_TRUE(tree.Unserialize(update));
  1564. reverse_active_descendant =
  1565. tree.GetReverseRelations(ax::mojom::IntAttribute::kActivedescendantId, 2);
  1566. ASSERT_EQ(0U, reverse_active_descendant.size());
  1567. reverse_active_descendant =
  1568. tree.GetReverseRelations(ax::mojom::IntAttribute::kActivedescendantId, 5);
  1569. ASSERT_EQ(1U, reverse_active_descendant.size());
  1570. EXPECT_TRUE(base::Contains(reverse_active_descendant, 1));
  1571. reverse_member_of =
  1572. tree.GetReverseRelations(ax::mojom::IntAttribute::kMemberOfId, 1);
  1573. ASSERT_EQ(2U, reverse_member_of.size());
  1574. EXPECT_TRUE(base::Contains(reverse_member_of, 4));
  1575. EXPECT_TRUE(base::Contains(reverse_member_of, 5));
  1576. }
  1577. TEST(AXTreeTest, IntListReverseRelations) {
  1578. std::vector<int32_t> node_two;
  1579. node_two.push_back(2);
  1580. std::vector<int32_t> nodes_two_three;
  1581. nodes_two_three.push_back(2);
  1582. nodes_two_three.push_back(3);
  1583. AXTreeUpdate initial_state;
  1584. initial_state.root_id = 1;
  1585. initial_state.nodes.resize(3);
  1586. initial_state.nodes[0].id = 1;
  1587. initial_state.nodes[0].AddIntListAttribute(
  1588. ax::mojom::IntListAttribute::kLabelledbyIds, node_two);
  1589. initial_state.nodes[0].child_ids.push_back(2);
  1590. initial_state.nodes[0].child_ids.push_back(3);
  1591. initial_state.nodes[1].id = 2;
  1592. initial_state.nodes[2].id = 3;
  1593. AXTree tree(initial_state);
  1594. auto reverse_labelled_by =
  1595. tree.GetReverseRelations(ax::mojom::IntListAttribute::kLabelledbyIds, 2);
  1596. ASSERT_EQ(1U, reverse_labelled_by.size());
  1597. EXPECT_TRUE(base::Contains(reverse_labelled_by, 1));
  1598. reverse_labelled_by =
  1599. tree.GetReverseRelations(ax::mojom::IntListAttribute::kLabelledbyIds, 3);
  1600. ASSERT_EQ(0U, reverse_labelled_by.size());
  1601. // Change existing attributes.
  1602. AXTreeUpdate update = initial_state;
  1603. update.nodes[0].intlist_attributes.clear();
  1604. update.nodes[0].AddIntListAttribute(
  1605. ax::mojom::IntListAttribute::kLabelledbyIds, nodes_two_three);
  1606. EXPECT_TRUE(tree.Unserialize(update));
  1607. reverse_labelled_by =
  1608. tree.GetReverseRelations(ax::mojom::IntListAttribute::kLabelledbyIds, 3);
  1609. ASSERT_EQ(1U, reverse_labelled_by.size());
  1610. EXPECT_TRUE(base::Contains(reverse_labelled_by, 1));
  1611. }
  1612. TEST(AXTreeTest, DeletingNodeUpdatesReverseRelations) {
  1613. AXTreeUpdate initial_state;
  1614. initial_state.root_id = 1;
  1615. initial_state.nodes.resize(3);
  1616. initial_state.nodes[0].id = 1;
  1617. initial_state.nodes[0].child_ids = {2, 3};
  1618. initial_state.nodes[1].id = 2;
  1619. initial_state.nodes[2].id = 3;
  1620. initial_state.nodes[2].AddIntAttribute(
  1621. ax::mojom::IntAttribute::kActivedescendantId, 2);
  1622. AXTree tree(initial_state);
  1623. auto reverse_active_descendant =
  1624. tree.GetReverseRelations(ax::mojom::IntAttribute::kActivedescendantId, 2);
  1625. ASSERT_EQ(1U, reverse_active_descendant.size());
  1626. EXPECT_TRUE(base::Contains(reverse_active_descendant, 3));
  1627. AXTreeUpdate update;
  1628. update.root_id = 1;
  1629. update.nodes.resize(1);
  1630. update.nodes[0].id = 1;
  1631. update.nodes[0].child_ids = {2};
  1632. EXPECT_TRUE(tree.Unserialize(update));
  1633. reverse_active_descendant =
  1634. tree.GetReverseRelations(ax::mojom::IntAttribute::kActivedescendantId, 2);
  1635. ASSERT_EQ(0U, reverse_active_descendant.size());
  1636. }
  1637. TEST(AXTreeTest, ReverseRelationsDoNotKeepGrowing) {
  1638. // The number of total entries in int_reverse_relations and
  1639. // intlist_reverse_relations should not keep growing as the tree
  1640. // changes.
  1641. AXTreeUpdate initial_state;
  1642. initial_state.root_id = 1;
  1643. initial_state.nodes.resize(2);
  1644. initial_state.nodes[0].id = 1;
  1645. initial_state.nodes[0].AddIntAttribute(
  1646. ax::mojom::IntAttribute::kActivedescendantId, 2);
  1647. initial_state.nodes[0].AddIntListAttribute(
  1648. ax::mojom::IntListAttribute::kLabelledbyIds, {2});
  1649. initial_state.nodes[0].child_ids.push_back(2);
  1650. initial_state.nodes[1].id = 2;
  1651. AXTree tree(initial_state);
  1652. for (int i = 0; i < 1000; ++i) {
  1653. AXTreeUpdate update;
  1654. update.root_id = 1;
  1655. update.nodes.resize(2);
  1656. update.nodes[0].id = 1;
  1657. update.nodes[1].id = i + 3;
  1658. update.nodes[0].AddIntAttribute(
  1659. ax::mojom::IntAttribute::kActivedescendantId, update.nodes[1].id);
  1660. update.nodes[0].AddIntListAttribute(
  1661. ax::mojom::IntListAttribute::kLabelledbyIds, {update.nodes[1].id});
  1662. update.nodes[1].AddIntAttribute(ax::mojom::IntAttribute::kMemberOfId, 1);
  1663. update.nodes[0].child_ids.push_back(update.nodes[1].id);
  1664. EXPECT_TRUE(tree.Unserialize(update));
  1665. }
  1666. size_t map_key_count = 0;
  1667. size_t set_entry_count = 0;
  1668. for (auto& iter : tree.int_reverse_relations()) {
  1669. map_key_count += iter.second.size() + 1;
  1670. for (auto it2 = iter.second.begin(); it2 != iter.second.end(); ++it2) {
  1671. set_entry_count += it2->second.size();
  1672. }
  1673. }
  1674. // Note: 10 is arbitary, the idea here is just that we mutated the tree
  1675. // 1000 times, so if we have fewer than 10 entries in the maps / sets then
  1676. // the map isn't growing / leaking. Same below.
  1677. EXPECT_LT(map_key_count, 10U);
  1678. EXPECT_LT(set_entry_count, 10U);
  1679. map_key_count = 0;
  1680. set_entry_count = 0;
  1681. for (auto& iter : tree.intlist_reverse_relations()) {
  1682. map_key_count += iter.second.size() + 1;
  1683. for (auto it2 = iter.second.begin(); it2 != iter.second.end(); ++it2) {
  1684. set_entry_count += it2->second.size();
  1685. }
  1686. }
  1687. EXPECT_LT(map_key_count, 10U);
  1688. EXPECT_LT(set_entry_count, 10U);
  1689. }
  1690. TEST(AXTreeTest, SkipIgnoredNodes) {
  1691. AXTreeUpdate tree_update;
  1692. tree_update.root_id = 1;
  1693. tree_update.nodes.resize(5);
  1694. tree_update.nodes[0].id = 1;
  1695. tree_update.nodes[0].child_ids = {2, 3};
  1696. tree_update.nodes[1].id = 2;
  1697. tree_update.nodes[1].AddState(ax::mojom::State::kIgnored);
  1698. tree_update.nodes[1].child_ids = {4, 5};
  1699. tree_update.nodes[2].id = 3;
  1700. tree_update.nodes[3].id = 4;
  1701. tree_update.nodes[4].id = 5;
  1702. AXTree tree(tree_update);
  1703. AXNode* root = tree.root();
  1704. ASSERT_EQ(2u, root->children().size());
  1705. ASSERT_EQ(2, root->children()[0]->id());
  1706. ASSERT_EQ(3, root->children()[1]->id());
  1707. EXPECT_EQ(3u, root->GetUnignoredChildCount());
  1708. EXPECT_EQ(4, root->GetUnignoredChildAtIndex(0)->id());
  1709. EXPECT_EQ(5, root->GetUnignoredChildAtIndex(1)->id());
  1710. EXPECT_EQ(3, root->GetUnignoredChildAtIndex(2)->id());
  1711. EXPECT_EQ(0u, root->GetUnignoredChildAtIndex(0)->GetUnignoredIndexInParent());
  1712. EXPECT_EQ(1u, root->GetUnignoredChildAtIndex(1)->GetUnignoredIndexInParent());
  1713. EXPECT_EQ(2u, root->GetUnignoredChildAtIndex(2)->GetUnignoredIndexInParent());
  1714. EXPECT_EQ(1, root->GetUnignoredChildAtIndex(0)->GetUnignoredParent()->id());
  1715. }
  1716. TEST(AXTreeTest, CachedUnignoredValues) {
  1717. AXTreeUpdate initial_state;
  1718. initial_state.root_id = 1;
  1719. initial_state.nodes.resize(5);
  1720. initial_state.nodes[0].id = 1;
  1721. initial_state.nodes[0].child_ids = {2, 3};
  1722. initial_state.nodes[1].id = 2;
  1723. initial_state.nodes[1].AddState(ax::mojom::State::kIgnored);
  1724. initial_state.nodes[1].child_ids = {4, 5};
  1725. initial_state.nodes[2].id = 3;
  1726. initial_state.nodes[3].id = 4;
  1727. initial_state.nodes[4].id = 5;
  1728. AXTree tree(initial_state);
  1729. AXNode* root = tree.root();
  1730. ASSERT_EQ(2u, root->children().size());
  1731. ASSERT_EQ(2, root->children()[0]->id());
  1732. ASSERT_EQ(3, root->children()[1]->id());
  1733. EXPECT_EQ(3u, root->GetUnignoredChildCount());
  1734. EXPECT_EQ(4, root->GetUnignoredChildAtIndex(0)->id());
  1735. EXPECT_EQ(5, root->GetUnignoredChildAtIndex(1)->id());
  1736. EXPECT_EQ(3, root->GetUnignoredChildAtIndex(2)->id());
  1737. EXPECT_EQ(0u, root->GetUnignoredChildAtIndex(0)->GetUnignoredIndexInParent());
  1738. EXPECT_EQ(1u, root->GetUnignoredChildAtIndex(1)->GetUnignoredIndexInParent());
  1739. EXPECT_EQ(2u, root->GetUnignoredChildAtIndex(2)->GetUnignoredIndexInParent());
  1740. EXPECT_EQ(1, root->GetUnignoredChildAtIndex(0)->GetUnignoredParent()->id());
  1741. // Ensure when a node goes from ignored to unignored, its children have their
  1742. // unignored_index_in_parent updated.
  1743. AXTreeUpdate update = initial_state;
  1744. update.nodes[1].RemoveState(ax::mojom::State::kIgnored);
  1745. EXPECT_TRUE(tree.Unserialize(update));
  1746. root = tree.root();
  1747. EXPECT_EQ(2u, root->GetUnignoredChildCount());
  1748. EXPECT_EQ(2, root->GetUnignoredChildAtIndex(0)->id());
  1749. EXPECT_EQ(2u, tree.GetFromId(2)->GetUnignoredChildCount());
  1750. EXPECT_EQ(0u, tree.GetFromId(4)->GetUnignoredIndexInParent());
  1751. EXPECT_EQ(1u, tree.GetFromId(5)->GetUnignoredIndexInParent());
  1752. // Ensure when a node goes from unignored to unignored, siblings are correctly
  1753. // updated.
  1754. AXTreeUpdate update2 = update;
  1755. update2.nodes[3].AddState(ax::mojom::State::kIgnored);
  1756. EXPECT_TRUE(tree.Unserialize(update2));
  1757. EXPECT_EQ(1u, tree.GetFromId(2)->GetUnignoredChildCount());
  1758. EXPECT_EQ(0u, tree.GetFromId(5)->GetUnignoredIndexInParent());
  1759. // Ensure siblings of a deleted node are updated.
  1760. AXTreeUpdate update3 = update2;
  1761. update3.nodes.resize(1);
  1762. update3.nodes[0].id = 1;
  1763. update3.nodes[0].child_ids = {3};
  1764. EXPECT_TRUE(tree.Unserialize(update3));
  1765. EXPECT_EQ(1u, tree.GetFromId(1)->GetUnignoredChildCount());
  1766. EXPECT_EQ(0u, tree.GetFromId(3)->GetUnignoredIndexInParent());
  1767. // Ensure new nodes are correctly updated.
  1768. AXTreeUpdate update4 = update3;
  1769. update4.nodes.resize(3);
  1770. update4.nodes[0].id = 1;
  1771. update4.nodes[0].child_ids = {3, 6};
  1772. update4.nodes[1].id = 6;
  1773. update4.nodes[1].child_ids = {7};
  1774. update4.nodes[2].id = 7;
  1775. EXPECT_TRUE(tree.Unserialize(update4));
  1776. EXPECT_EQ(2u, tree.GetFromId(1)->GetUnignoredChildCount());
  1777. EXPECT_EQ(0u, tree.GetFromId(3)->GetUnignoredIndexInParent());
  1778. EXPECT_EQ(1u, tree.GetFromId(6)->GetUnignoredIndexInParent());
  1779. EXPECT_EQ(0u, tree.GetFromId(7)->GetUnignoredIndexInParent());
  1780. // Ensure reparented nodes are correctly updated.
  1781. AXTreeUpdate update5 = update4;
  1782. update5.nodes.resize(2);
  1783. update5.node_id_to_clear = 6;
  1784. update5.nodes[0].id = 1;
  1785. update5.nodes[0].child_ids = {3, 7};
  1786. update5.nodes[1].id = 7;
  1787. update5.nodes[1].child_ids = {};
  1788. EXPECT_TRUE(tree.Unserialize(update5));
  1789. EXPECT_EQ(2u, tree.GetFromId(1)->GetUnignoredChildCount());
  1790. EXPECT_EQ(0u, tree.GetFromId(3)->GetUnignoredIndexInParent());
  1791. EXPECT_EQ(1u, tree.GetFromId(7)->GetUnignoredIndexInParent());
  1792. AXTreeUpdate update6;
  1793. update6.nodes.resize(1);
  1794. update6.nodes[0].id = 7;
  1795. update6.nodes[0].AddState(ax::mojom::State::kIgnored);
  1796. EXPECT_TRUE(tree.Unserialize(update6));
  1797. EXPECT_EQ(1u, tree.GetFromId(1)->GetUnignoredChildCount());
  1798. EXPECT_EQ(0u, tree.GetFromId(3)->GetUnignoredIndexInParent());
  1799. AXTreeUpdate update7 = update6;
  1800. update7.nodes.resize(2);
  1801. update7.nodes[0].id = 7;
  1802. update7.nodes[0].child_ids = {8};
  1803. update7.nodes[1].id = 8;
  1804. EXPECT_TRUE(tree.Unserialize(update7));
  1805. EXPECT_EQ(2u, tree.GetFromId(1)->GetUnignoredChildCount());
  1806. EXPECT_EQ(0u, tree.GetFromId(3)->GetUnignoredIndexInParent());
  1807. }
  1808. TEST(AXTreeTest, TestRecursionUnignoredChildCount) {
  1809. AXTreeUpdate tree_update;
  1810. tree_update.root_id = 1;
  1811. tree_update.nodes.resize(5);
  1812. tree_update.nodes[0].id = 1;
  1813. tree_update.nodes[0].child_ids = {2, 3};
  1814. tree_update.nodes[1].id = 2;
  1815. tree_update.nodes[1].AddState(ax::mojom::State::kIgnored);
  1816. tree_update.nodes[1].child_ids = {4};
  1817. tree_update.nodes[2].id = 3;
  1818. tree_update.nodes[2].AddState(ax::mojom::State::kIgnored);
  1819. tree_update.nodes[3].id = 4;
  1820. tree_update.nodes[3].child_ids = {5};
  1821. tree_update.nodes[3].AddState(ax::mojom::State::kIgnored);
  1822. tree_update.nodes[4].id = 5;
  1823. AXTree tree(tree_update);
  1824. AXNode* root = tree.root();
  1825. EXPECT_EQ(2u, root->children().size());
  1826. EXPECT_EQ(1u, root->GetUnignoredChildCount());
  1827. EXPECT_EQ(5, root->GetUnignoredChildAtIndex(0)->id());
  1828. AXNode* unignored = tree.GetFromId(5);
  1829. EXPECT_EQ(0u, unignored->GetUnignoredChildCount());
  1830. }
  1831. TEST(AXTreeTest, NullUnignoredChildren) {
  1832. AXTreeUpdate tree_update;
  1833. tree_update.root_id = 1;
  1834. tree_update.nodes.resize(3);
  1835. tree_update.nodes[0].id = 1;
  1836. tree_update.nodes[0].child_ids = {2, 3};
  1837. tree_update.nodes[1].id = 2;
  1838. tree_update.nodes[1].AddState(ax::mojom::State::kIgnored);
  1839. tree_update.nodes[2].id = 3;
  1840. tree_update.nodes[2].AddState(ax::mojom::State::kIgnored);
  1841. AXTree tree(tree_update);
  1842. AXNode* root = tree.root();
  1843. EXPECT_EQ(2u, root->children().size());
  1844. EXPECT_EQ(0u, root->GetUnignoredChildCount());
  1845. EXPECT_EQ(nullptr, root->GetUnignoredChildAtIndex(0));
  1846. EXPECT_EQ(nullptr, root->GetUnignoredChildAtIndex(1));
  1847. }
  1848. TEST(AXTreeTest, UnignoredChildIteratorIncrementDecrementPastEnd) {
  1849. AXTreeUpdate tree_update;
  1850. // RootWebArea #1
  1851. // ++StaticText "text1" #2
  1852. tree_update.root_id = 1;
  1853. tree_update.nodes.resize(2);
  1854. tree_update.nodes[0].id = 1;
  1855. tree_update.nodes[0].role = ax::mojom::Role::kRootWebArea;
  1856. tree_update.nodes[0].child_ids = {2};
  1857. tree_update.nodes[1].id = 2;
  1858. tree_update.nodes[1].role = ax::mojom::Role::kStaticText;
  1859. tree_update.nodes[1].SetName("text1");
  1860. AXTree tree(tree_update);
  1861. AXNode* root = tree.root();
  1862. {
  1863. {
  1864. AXNode::UnignoredChildIterator root_unignored_iter =
  1865. root->UnignoredChildrenBegin();
  1866. EXPECT_EQ(2, root_unignored_iter->id());
  1867. EXPECT_EQ("text1", root_unignored_iter->GetStringAttribute(
  1868. ax::mojom::StringAttribute::kName));
  1869. // Call unignored child iterator on root and increment, we should reach
  1870. // the end since there is only one iterator element.
  1871. EXPECT_EQ(root->UnignoredChildrenEnd(), ++root_unignored_iter);
  1872. // We increment past the end, and we should still stay at the end.
  1873. EXPECT_EQ(root->UnignoredChildrenEnd(), ++root_unignored_iter);
  1874. // When we decrement from the end, we should get the last iterator element
  1875. // "text1".
  1876. --root_unignored_iter;
  1877. EXPECT_EQ(2, root_unignored_iter->id());
  1878. EXPECT_EQ("text1", root_unignored_iter->GetStringAttribute(
  1879. ax::mojom::StringAttribute::kName));
  1880. }
  1881. {
  1882. AXNode::UnignoredChildIterator root_unignored_iter =
  1883. root->UnignoredChildrenBegin();
  1884. EXPECT_EQ(2, root_unignored_iter->id());
  1885. EXPECT_EQ("text1", root_unignored_iter->GetStringAttribute(
  1886. ax::mojom::StringAttribute::kName));
  1887. // Call unignored child iterator on root and decrement from the beginning,
  1888. // we should stay at the beginning.
  1889. --root_unignored_iter;
  1890. EXPECT_EQ(2, root_unignored_iter->id());
  1891. EXPECT_EQ("text1", root_unignored_iter->GetStringAttribute(
  1892. ax::mojom::StringAttribute::kName));
  1893. // When we decrement past the beginning, we should still stay at the
  1894. // beginning.
  1895. --root_unignored_iter;
  1896. EXPECT_EQ(2, root_unignored_iter->id());
  1897. EXPECT_EQ("text1", root_unignored_iter->GetStringAttribute(
  1898. ax::mojom::StringAttribute::kName));
  1899. // We increment past the end, and we should still reach the end.
  1900. EXPECT_EQ(root->UnignoredChildrenEnd(), ++root_unignored_iter);
  1901. }
  1902. }
  1903. }
  1904. TEST(AXTreeTest, UnignoredChildIteratorIgnoredContainerSiblings) {
  1905. AXTreeUpdate tree_update;
  1906. // RootWebArea #1
  1907. // ++genericContainer IGNORED #2
  1908. // ++++StaticText "text1" #3
  1909. // ++genericContainer IGNORED #4
  1910. // ++++StaticText "text2" #5
  1911. // ++genericContainer IGNORED #6
  1912. // ++++StaticText "text3" #7
  1913. tree_update.root_id = 1;
  1914. tree_update.nodes.resize(7);
  1915. tree_update.nodes[0].id = 1;
  1916. tree_update.nodes[0].role = ax::mojom::Role::kRootWebArea;
  1917. tree_update.nodes[0].child_ids = {2, 4, 6};
  1918. tree_update.nodes[1].id = 2;
  1919. tree_update.nodes[1].child_ids = {3};
  1920. tree_update.nodes[1].role = ax::mojom::Role::kGenericContainer;
  1921. tree_update.nodes[1].AddState(ax::mojom::State::kIgnored);
  1922. tree_update.nodes[2].id = 3;
  1923. tree_update.nodes[2].role = ax::mojom::Role::kStaticText;
  1924. tree_update.nodes[2].SetName("text1");
  1925. tree_update.nodes[3].id = 4;
  1926. tree_update.nodes[3].child_ids = {5};
  1927. tree_update.nodes[3].role = ax::mojom::Role::kGenericContainer;
  1928. tree_update.nodes[3].AddState(ax::mojom::State::kIgnored);
  1929. tree_update.nodes[4].id = 5;
  1930. tree_update.nodes[4].role = ax::mojom::Role::kStaticText;
  1931. tree_update.nodes[4].SetName("text2");
  1932. tree_update.nodes[5].id = 6;
  1933. tree_update.nodes[5].child_ids = {7};
  1934. tree_update.nodes[5].role = ax::mojom::Role::kGenericContainer;
  1935. tree_update.nodes[5].AddState(ax::mojom::State::kIgnored);
  1936. tree_update.nodes[6].id = 7;
  1937. tree_update.nodes[6].role = ax::mojom::Role::kStaticText;
  1938. tree_update.nodes[6].SetName("text3");
  1939. AXTree tree(tree_update);
  1940. {
  1941. // Call unignored child iterator on root and iterate till the end, we should
  1942. // get "text1", "text2", "text3" respectively because the sibling text nodes
  1943. // share the same parent (i.e. root) as |unignored_iter|.
  1944. AXNode* root = tree.root();
  1945. AXNode::UnignoredChildIterator root_unignored_iter =
  1946. root->UnignoredChildrenBegin();
  1947. EXPECT_EQ(3, root_unignored_iter->id());
  1948. EXPECT_EQ("text1", root_unignored_iter->GetStringAttribute(
  1949. ax::mojom::StringAttribute::kName));
  1950. EXPECT_EQ(5, (++root_unignored_iter)->id());
  1951. EXPECT_EQ("text2",
  1952. (*root_unignored_iter)
  1953. .GetStringAttribute(ax::mojom::StringAttribute::kName));
  1954. EXPECT_EQ(7, (++root_unignored_iter)->id());
  1955. EXPECT_EQ("text3", root_unignored_iter->GetStringAttribute(
  1956. ax::mojom::StringAttribute::kName));
  1957. EXPECT_EQ(root->UnignoredChildrenEnd(), ++root_unignored_iter);
  1958. }
  1959. {
  1960. // Call unignored child iterator on the ignored generic container of "text1"
  1961. // (id=2), When we iterate to the next of "text1", we should
  1962. // reach the end because the sibling text node "text2" does not share the
  1963. // same parent as |unignored_iter| of "text1".
  1964. AXNode* text1_ignored_container = tree.GetFromId(2);
  1965. AXNode::UnignoredChildIterator unignored_iter =
  1966. text1_ignored_container->UnignoredChildrenBegin();
  1967. EXPECT_EQ(3, unignored_iter->id());
  1968. EXPECT_EQ("text1", unignored_iter->GetStringAttribute(
  1969. ax::mojom::StringAttribute::kName));
  1970. // The next child of "text1" should be the end.
  1971. EXPECT_EQ(text1_ignored_container->UnignoredChildrenEnd(),
  1972. ++unignored_iter);
  1973. // Call unignored child iterator on the ignored generic container of "text2"
  1974. // (id=4), When we iterate to the previous of "text2", we should
  1975. // reach the end because the sibling text node "text1" does not share the
  1976. // same parent as |unignored_iter| of "text2".
  1977. AXNode* text2_ignored_container = tree.GetFromId(4);
  1978. unignored_iter = text2_ignored_container->UnignoredChildrenBegin();
  1979. EXPECT_EQ(5, unignored_iter->id());
  1980. EXPECT_EQ("text2", unignored_iter->GetStringAttribute(
  1981. ax::mojom::StringAttribute::kName));
  1982. // Decrement the iterator of "text2" should still remain on "text2" since
  1983. // the beginning of iterator is "text2."
  1984. --unignored_iter;
  1985. EXPECT_EQ(5, unignored_iter->id());
  1986. EXPECT_EQ("text2", unignored_iter->GetStringAttribute(
  1987. ax::mojom::StringAttribute::kName));
  1988. }
  1989. }
  1990. TEST(AXTreeTest, UnignoredChildIterator) {
  1991. AXTreeUpdate tree_update;
  1992. // (i) => node is ignored
  1993. // 1
  1994. // |__________
  1995. // | | |
  1996. // 2(i) 3 4
  1997. // |_______________________
  1998. // | | | |
  1999. // 5 6 7(i) 8(i)
  2000. // | | |________
  2001. // | | | |
  2002. // 9 10(i) 11(i) 12
  2003. // | |____
  2004. // | | |
  2005. // 13(i) 14 15
  2006. tree_update.root_id = 1;
  2007. tree_update.nodes.resize(15);
  2008. tree_update.nodes[0].id = 1;
  2009. tree_update.nodes[0].child_ids = {2, 3, 4};
  2010. tree_update.nodes[1].id = 2;
  2011. tree_update.nodes[1].child_ids = {5, 6, 7, 8};
  2012. tree_update.nodes[1].AddState(ax::mojom::State::kIgnored);
  2013. tree_update.nodes[2].id = 3;
  2014. tree_update.nodes[3].id = 4;
  2015. tree_update.nodes[4].id = 5;
  2016. tree_update.nodes[4].child_ids = {9};
  2017. tree_update.nodes[5].id = 6;
  2018. tree_update.nodes[5].child_ids = {10};
  2019. tree_update.nodes[6].id = 7;
  2020. tree_update.nodes[6].child_ids = {11, 12};
  2021. tree_update.nodes[6].AddState(ax::mojom::State::kIgnored);
  2022. tree_update.nodes[7].id = 8;
  2023. tree_update.nodes[7].AddState(ax::mojom::State::kIgnored);
  2024. tree_update.nodes[8].id = 9;
  2025. tree_update.nodes[9].id = 10;
  2026. tree_update.nodes[9].child_ids = {13};
  2027. tree_update.nodes[9].AddState(ax::mojom::State::kIgnored);
  2028. tree_update.nodes[10].id = 11;
  2029. tree_update.nodes[10].child_ids = {14, 15};
  2030. tree_update.nodes[10].AddState(ax::mojom::State::kIgnored);
  2031. tree_update.nodes[11].id = 12;
  2032. tree_update.nodes[12].id = 13;
  2033. tree_update.nodes[12].AddState(ax::mojom::State::kIgnored);
  2034. tree_update.nodes[13].id = 14;
  2035. tree_update.nodes[14].id = 15;
  2036. AXTree tree(tree_update);
  2037. AXNode* root = tree.root();
  2038. // Test traversal
  2039. // UnignoredChildren(root) = {5, 6, 14, 15, 12, 3, 4}
  2040. AXNode::UnignoredChildIterator unignored_iterator =
  2041. root->UnignoredChildrenBegin();
  2042. EXPECT_EQ(5, unignored_iterator->id());
  2043. EXPECT_EQ(6, (++unignored_iterator)->id());
  2044. EXPECT_EQ(14, (++unignored_iterator)->id());
  2045. EXPECT_EQ(15, (++unignored_iterator)->id());
  2046. EXPECT_EQ(14, (--unignored_iterator)->id());
  2047. EXPECT_EQ(6, (--unignored_iterator)->id());
  2048. EXPECT_EQ(14, (++unignored_iterator)->id());
  2049. EXPECT_EQ(15, (++unignored_iterator)->id());
  2050. EXPECT_EQ(12, (++unignored_iterator)->id());
  2051. EXPECT_EQ(3, (++unignored_iterator)->id());
  2052. EXPECT_EQ(4, (++unignored_iterator)->id());
  2053. EXPECT_EQ(root->UnignoredChildrenEnd(), ++unignored_iterator);
  2054. // test empty list
  2055. // UnignoredChildren(3) = {}
  2056. AXNode* node3 = tree.GetFromId(3);
  2057. unignored_iterator = node3->UnignoredChildrenBegin();
  2058. EXPECT_EQ(node3->UnignoredChildrenEnd(), unignored_iterator);
  2059. // empty list from ignored node with no children
  2060. // UnignoredChildren(8) = {}
  2061. AXNode* node8 = tree.GetFromId(8);
  2062. unignored_iterator = node8->UnignoredChildrenBegin();
  2063. EXPECT_EQ(node8->UnignoredChildrenEnd(), unignored_iterator);
  2064. // empty list from ignored node with unignored children
  2065. // UnignoredChildren(11) = {}
  2066. AXNode* node11 = tree.GetFromId(11);
  2067. unignored_iterator = node11->UnignoredChildrenBegin();
  2068. EXPECT_EQ(14, unignored_iterator->id());
  2069. // Two UnignoredChildIterators from the same parent at the same position
  2070. // should be equivalent, even in end position.
  2071. unignored_iterator = root->UnignoredChildrenBegin();
  2072. AXNode::UnignoredChildIterator unignored_iterator2 =
  2073. root->UnignoredChildrenBegin();
  2074. auto end = root->UnignoredChildrenEnd();
  2075. while (unignored_iterator != end) {
  2076. ASSERT_EQ(unignored_iterator, unignored_iterator2);
  2077. ++unignored_iterator;
  2078. ++unignored_iterator2;
  2079. }
  2080. ASSERT_EQ(unignored_iterator, unignored_iterator2);
  2081. }
  2082. TEST(AXTreeTest, UnignoredAccessors) {
  2083. AXTreeUpdate tree_update;
  2084. // (i) => node is ignored
  2085. // 1
  2086. // |__________
  2087. // | | |
  2088. // 2(i) 3 4
  2089. // |_______________________
  2090. // | | | |
  2091. // 5 6 7(i) 8(i)
  2092. // | | |________
  2093. // | | | |
  2094. // 9 10(i) 11(i) 12
  2095. // | |____
  2096. // | | |
  2097. // 13(i) 14 15
  2098. // | |
  2099. // 16 17(i)
  2100. tree_update.root_id = 1;
  2101. tree_update.nodes.resize(17);
  2102. tree_update.nodes[0].id = 1;
  2103. tree_update.nodes[0].child_ids = {2, 3, 4};
  2104. tree_update.nodes[1].id = 2;
  2105. tree_update.nodes[1].child_ids = {5, 6, 7, 8};
  2106. tree_update.nodes[1].AddState(ax::mojom::State::kIgnored);
  2107. tree_update.nodes[2].id = 3;
  2108. tree_update.nodes[3].id = 4;
  2109. tree_update.nodes[4].id = 5;
  2110. tree_update.nodes[4].child_ids = {9};
  2111. tree_update.nodes[5].id = 6;
  2112. tree_update.nodes[5].child_ids = {10};
  2113. tree_update.nodes[6].id = 7;
  2114. tree_update.nodes[6].child_ids = {11, 12};
  2115. tree_update.nodes[6].AddState(ax::mojom::State::kIgnored);
  2116. tree_update.nodes[7].id = 8;
  2117. tree_update.nodes[7].AddState(ax::mojom::State::kIgnored);
  2118. tree_update.nodes[8].id = 9;
  2119. tree_update.nodes[9].id = 10;
  2120. tree_update.nodes[9].child_ids = {13};
  2121. tree_update.nodes[9].AddState(ax::mojom::State::kIgnored);
  2122. tree_update.nodes[10].id = 11;
  2123. tree_update.nodes[10].child_ids = {14, 15};
  2124. tree_update.nodes[10].AddState(ax::mojom::State::kIgnored);
  2125. tree_update.nodes[11].id = 12;
  2126. tree_update.nodes[12].id = 13;
  2127. tree_update.nodes[12].child_ids = {16};
  2128. tree_update.nodes[12].AddState(ax::mojom::State::kIgnored);
  2129. tree_update.nodes[13].id = 14;
  2130. tree_update.nodes[13].child_ids = {17};
  2131. tree_update.nodes[14].id = 15;
  2132. tree_update.nodes[15].id = 16;
  2133. tree_update.nodes[16].id = 17;
  2134. tree_update.nodes[16].AddState(ax::mojom::State::kIgnored);
  2135. AXTree tree(tree_update);
  2136. EXPECT_EQ(4, tree.GetFromId(1)->GetLastUnignoredChild()->id());
  2137. EXPECT_EQ(12, tree.GetFromId(2)->GetLastUnignoredChild()->id());
  2138. EXPECT_EQ(nullptr, tree.GetFromId(3)->GetLastUnignoredChild());
  2139. EXPECT_EQ(nullptr, tree.GetFromId(4)->GetLastUnignoredChild());
  2140. EXPECT_EQ(9, tree.GetFromId(5)->GetLastUnignoredChild()->id());
  2141. EXPECT_EQ(16, tree.GetFromId(6)->GetLastUnignoredChild()->id());
  2142. EXPECT_EQ(12, tree.GetFromId(7)->GetLastUnignoredChild()->id());
  2143. EXPECT_EQ(nullptr, tree.GetFromId(8)->GetLastUnignoredChild());
  2144. EXPECT_EQ(nullptr, tree.GetFromId(9)->GetLastUnignoredChild());
  2145. EXPECT_EQ(16, tree.GetFromId(10)->GetLastUnignoredChild()->id());
  2146. EXPECT_EQ(15, tree.GetFromId(11)->GetLastUnignoredChild()->id());
  2147. EXPECT_EQ(nullptr, tree.GetFromId(12)->GetLastUnignoredChild());
  2148. EXPECT_EQ(16, tree.GetFromId(13)->GetLastUnignoredChild()->id());
  2149. EXPECT_EQ(nullptr, tree.GetFromId(14)->GetLastUnignoredChild());
  2150. EXPECT_EQ(nullptr, tree.GetFromId(15)->GetLastUnignoredChild());
  2151. EXPECT_EQ(nullptr, tree.GetFromId(16)->GetLastUnignoredChild());
  2152. EXPECT_EQ(nullptr, tree.GetFromId(17)->GetLastUnignoredChild());
  2153. }
  2154. TEST(AXTreeTest, UnignoredNextPreviousChild) {
  2155. AXTreeUpdate tree_update;
  2156. // (i) => node is ignored
  2157. // 1
  2158. // |__________
  2159. // | | |
  2160. // 2(i) 3 4
  2161. // |_______________________
  2162. // | | | |
  2163. // 5 6 7(i) 8(i)
  2164. // | | |________
  2165. // | | | |
  2166. // 9 10(i) 11(i) 12
  2167. // | |____
  2168. // | | |
  2169. // 13(i) 14 15
  2170. // |
  2171. // 16
  2172. tree_update.root_id = 1;
  2173. tree_update.nodes.resize(16);
  2174. tree_update.nodes[0].id = 1;
  2175. tree_update.nodes[0].child_ids = {2, 3, 4};
  2176. tree_update.nodes[1].id = 2;
  2177. tree_update.nodes[1].child_ids = {5, 6, 7, 8};
  2178. tree_update.nodes[1].AddState(ax::mojom::State::kIgnored);
  2179. tree_update.nodes[2].id = 3;
  2180. tree_update.nodes[3].id = 4;
  2181. tree_update.nodes[4].id = 5;
  2182. tree_update.nodes[4].child_ids = {9};
  2183. tree_update.nodes[5].id = 6;
  2184. tree_update.nodes[5].child_ids = {10};
  2185. tree_update.nodes[6].id = 7;
  2186. tree_update.nodes[6].child_ids = {11, 12};
  2187. tree_update.nodes[6].AddState(ax::mojom::State::kIgnored);
  2188. tree_update.nodes[7].id = 8;
  2189. tree_update.nodes[7].AddState(ax::mojom::State::kIgnored);
  2190. tree_update.nodes[8].id = 9;
  2191. tree_update.nodes[9].id = 10;
  2192. tree_update.nodes[9].child_ids = {13};
  2193. tree_update.nodes[9].AddState(ax::mojom::State::kIgnored);
  2194. tree_update.nodes[10].id = 11;
  2195. tree_update.nodes[10].child_ids = {14, 15};
  2196. tree_update.nodes[10].AddState(ax::mojom::State::kIgnored);
  2197. tree_update.nodes[11].id = 12;
  2198. tree_update.nodes[12].id = 13;
  2199. tree_update.nodes[12].child_ids = {16};
  2200. tree_update.nodes[12].AddState(ax::mojom::State::kIgnored);
  2201. tree_update.nodes[13].id = 14;
  2202. tree_update.nodes[14].id = 15;
  2203. tree_update.nodes[15].id = 16;
  2204. AXTree tree(tree_update);
  2205. EXPECT_EQ(nullptr, tree.GetFromId(1)->GetNextUnignoredSibling());
  2206. EXPECT_EQ(nullptr, tree.GetFromId(1)->GetPreviousUnignoredSibling());
  2207. EXPECT_EQ(tree.GetFromId(3), tree.GetFromId(2)->GetNextUnignoredSibling());
  2208. EXPECT_EQ(nullptr, tree.GetFromId(2)->GetPreviousUnignoredSibling());
  2209. EXPECT_EQ(tree.GetFromId(4), tree.GetFromId(3)->GetNextUnignoredSibling());
  2210. EXPECT_EQ(tree.GetFromId(12),
  2211. tree.GetFromId(3)->GetPreviousUnignoredSibling());
  2212. EXPECT_EQ(nullptr, tree.GetFromId(4)->GetNextUnignoredSibling());
  2213. EXPECT_EQ(tree.GetFromId(3),
  2214. tree.GetFromId(4)->GetPreviousUnignoredSibling());
  2215. EXPECT_EQ(tree.GetFromId(6), tree.GetFromId(5)->GetNextUnignoredSibling());
  2216. EXPECT_EQ(nullptr, tree.GetFromId(5)->GetPreviousUnignoredSibling());
  2217. EXPECT_EQ(tree.GetFromId(14), tree.GetFromId(6)->GetNextUnignoredSibling());
  2218. EXPECT_EQ(tree.GetFromId(5),
  2219. tree.GetFromId(6)->GetPreviousUnignoredSibling());
  2220. EXPECT_EQ(tree.GetFromId(3), tree.GetFromId(7)->GetNextUnignoredSibling());
  2221. EXPECT_EQ(tree.GetFromId(6),
  2222. tree.GetFromId(7)->GetPreviousUnignoredSibling());
  2223. EXPECT_EQ(tree.GetFromId(3), tree.GetFromId(8)->GetNextUnignoredSibling());
  2224. EXPECT_EQ(tree.GetFromId(12),
  2225. tree.GetFromId(8)->GetPreviousUnignoredSibling());
  2226. EXPECT_EQ(nullptr, tree.GetFromId(9)->GetNextUnignoredSibling());
  2227. EXPECT_EQ(nullptr, tree.GetFromId(9)->GetPreviousUnignoredSibling());
  2228. EXPECT_EQ(nullptr, tree.GetFromId(10)->GetNextUnignoredSibling());
  2229. EXPECT_EQ(nullptr, tree.GetFromId(10)->GetPreviousUnignoredSibling());
  2230. EXPECT_EQ(tree.GetFromId(12), tree.GetFromId(11)->GetNextUnignoredSibling());
  2231. EXPECT_EQ(tree.GetFromId(6),
  2232. tree.GetFromId(11)->GetPreviousUnignoredSibling());
  2233. EXPECT_EQ(tree.GetFromId(3), tree.GetFromId(12)->GetNextUnignoredSibling());
  2234. EXPECT_EQ(tree.GetFromId(15),
  2235. tree.GetFromId(12)->GetPreviousUnignoredSibling());
  2236. EXPECT_EQ(nullptr, tree.GetFromId(13)->GetNextUnignoredSibling());
  2237. EXPECT_EQ(nullptr, tree.GetFromId(13)->GetPreviousUnignoredSibling());
  2238. EXPECT_EQ(tree.GetFromId(15), tree.GetFromId(14)->GetNextUnignoredSibling());
  2239. EXPECT_EQ(tree.GetFromId(6),
  2240. tree.GetFromId(14)->GetPreviousUnignoredSibling());
  2241. EXPECT_EQ(tree.GetFromId(12), tree.GetFromId(15)->GetNextUnignoredSibling());
  2242. EXPECT_EQ(tree.GetFromId(14),
  2243. tree.GetFromId(15)->GetPreviousUnignoredSibling());
  2244. EXPECT_EQ(nullptr, tree.GetFromId(16)->GetNextUnignoredSibling());
  2245. EXPECT_EQ(nullptr, tree.GetFromId(16)->GetPreviousUnignoredSibling());
  2246. }
  2247. TEST(AXTreeTest, GetSiblingsNoIgnored) {
  2248. // Since this tree contains no ignored nodes, PreviousSibling and NextSibling
  2249. // are equivalent to their unignored counterparts.
  2250. //
  2251. // 1
  2252. // ├── 2
  2253. // │ └── 4
  2254. // └── 3
  2255. AXTreeUpdate tree_update;
  2256. tree_update.root_id = 1;
  2257. tree_update.nodes.resize(4);
  2258. tree_update.nodes[0].id = 1;
  2259. tree_update.nodes[0].child_ids = {2, 3};
  2260. tree_update.nodes[1].id = 2;
  2261. tree_update.nodes[1].child_ids = {4};
  2262. tree_update.nodes[2].id = 3;
  2263. tree_update.nodes[3].id = 4;
  2264. AXTree tree(tree_update);
  2265. EXPECT_EQ(nullptr, tree.GetFromId(1)->GetPreviousSibling());
  2266. EXPECT_EQ(nullptr, tree.GetFromId(1)->GetPreviousUnignoredSibling());
  2267. EXPECT_EQ(nullptr, tree.GetFromId(1)->GetNextSibling());
  2268. EXPECT_EQ(nullptr, tree.GetFromId(1)->GetNextUnignoredSibling());
  2269. EXPECT_EQ(nullptr, tree.GetFromId(2)->GetPreviousSibling());
  2270. EXPECT_EQ(nullptr, tree.GetFromId(2)->GetPreviousUnignoredSibling());
  2271. EXPECT_EQ(tree.GetFromId(3), tree.GetFromId(2)->GetNextSibling());
  2272. EXPECT_EQ(tree.GetFromId(3), tree.GetFromId(2)->GetNextUnignoredSibling());
  2273. EXPECT_EQ(tree.GetFromId(2), tree.GetFromId(3)->GetPreviousSibling());
  2274. EXPECT_EQ(tree.GetFromId(2),
  2275. tree.GetFromId(3)->GetPreviousUnignoredSibling());
  2276. EXPECT_EQ(nullptr, tree.GetFromId(3)->GetNextSibling());
  2277. EXPECT_EQ(nullptr, tree.GetFromId(3)->GetNextUnignoredSibling());
  2278. EXPECT_EQ(nullptr, tree.GetFromId(4)->GetPreviousSibling());
  2279. EXPECT_EQ(nullptr, tree.GetFromId(4)->GetPreviousUnignoredSibling());
  2280. EXPECT_EQ(nullptr, tree.GetFromId(4)->GetNextSibling());
  2281. EXPECT_EQ(nullptr, tree.GetFromId(4)->GetNextUnignoredSibling());
  2282. }
  2283. TEST(AXTreeTest, GetUnignoredSiblingsChildrenPromoted) {
  2284. // An ignored node has its' children considered as though they were promoted
  2285. // to their parents place.
  2286. //
  2287. // (i) => node is ignored.
  2288. //
  2289. // 1
  2290. // ├── 2(i)
  2291. // │ ├── 4
  2292. // │ └── 5
  2293. // └── 3
  2294. AXTreeUpdate tree_update;
  2295. tree_update.root_id = 1;
  2296. tree_update.nodes.resize(5);
  2297. tree_update.nodes[0].id = 1;
  2298. tree_update.nodes[0].child_ids = {2, 3};
  2299. tree_update.nodes[1].id = 2;
  2300. tree_update.nodes[1].AddState(ax::mojom::State::kIgnored);
  2301. tree_update.nodes[1].child_ids = {4, 5};
  2302. tree_update.nodes[2].id = 3;
  2303. tree_update.nodes[3].id = 4;
  2304. tree_update.nodes[4].id = 5;
  2305. AXTree tree(tree_update);
  2306. // Root node has no siblings.
  2307. EXPECT_EQ(nullptr, tree.GetFromId(1)->GetPreviousUnignoredSibling());
  2308. EXPECT_EQ(nullptr, tree.GetFromId(2)->GetPreviousUnignoredSibling());
  2309. // Node 2's view of siblings:
  2310. // literal tree: null <-- [2(i)] --> 3
  2311. // unignored tree: null <-- [2(i)] --> 3
  2312. EXPECT_EQ(nullptr, tree.GetFromId(2)->GetPreviousSibling());
  2313. EXPECT_EQ(nullptr, tree.GetFromId(2)->GetPreviousUnignoredSibling());
  2314. EXPECT_EQ(tree.GetFromId(3), tree.GetFromId(2)->GetNextSibling());
  2315. EXPECT_EQ(tree.GetFromId(3), tree.GetFromId(2)->GetNextUnignoredSibling());
  2316. // Node 3's view of siblings:
  2317. // literal tree: 2(i) <-- [3] --> null
  2318. // unignored tree: 5 <-- [4] --> null
  2319. EXPECT_EQ(tree.GetFromId(2), tree.GetFromId(3)->GetPreviousSibling());
  2320. EXPECT_EQ(tree.GetFromId(5),
  2321. tree.GetFromId(3)->GetPreviousUnignoredSibling());
  2322. EXPECT_EQ(nullptr, tree.GetFromId(3)->GetNextSibling());
  2323. EXPECT_EQ(nullptr, tree.GetFromId(3)->GetNextUnignoredSibling());
  2324. // Node 4's view of siblings:
  2325. // literal tree: null <-- [4] --> 5
  2326. // unignored tree: null <-- [4] --> 5
  2327. EXPECT_EQ(nullptr, tree.GetFromId(4)->GetPreviousSibling());
  2328. EXPECT_EQ(nullptr, tree.GetFromId(4)->GetPreviousUnignoredSibling());
  2329. EXPECT_EQ(tree.GetFromId(5), tree.GetFromId(4)->GetNextSibling());
  2330. EXPECT_EQ(tree.GetFromId(5), tree.GetFromId(4)->GetNextUnignoredSibling());
  2331. // Node 5's view of siblings:
  2332. // literal tree: 4 <-- [5] --> null
  2333. // unignored tree: 4 <-- [5] --> 3
  2334. EXPECT_EQ(tree.GetFromId(4), tree.GetFromId(5)->GetPreviousSibling());
  2335. EXPECT_EQ(tree.GetFromId(4),
  2336. tree.GetFromId(5)->GetPreviousUnignoredSibling());
  2337. EXPECT_EQ(nullptr, tree.GetFromId(5)->GetNextSibling());
  2338. EXPECT_EQ(tree.GetFromId(3), tree.GetFromId(5)->GetNextUnignoredSibling());
  2339. }
  2340. TEST(AXTreeTest, GetUnignoredSiblingsIgnoredChildSkipped) {
  2341. // Ignored children of ignored parents are skipped over.
  2342. //
  2343. // (i) => node is ignored.
  2344. //
  2345. // 1
  2346. // ├── 2(i)
  2347. // │ ├── 4
  2348. // │ └── 5(i)
  2349. // └── 3
  2350. AXTreeUpdate tree_update;
  2351. tree_update.root_id = 1;
  2352. tree_update.nodes.resize(5);
  2353. tree_update.nodes[0].id = 1;
  2354. tree_update.nodes[0].child_ids = {2, 3};
  2355. tree_update.nodes[1].id = 2;
  2356. tree_update.nodes[1].AddState(ax::mojom::State::kIgnored);
  2357. tree_update.nodes[1].child_ids = {4, 5};
  2358. tree_update.nodes[2].id = 3;
  2359. tree_update.nodes[3].id = 4;
  2360. tree_update.nodes[4].id = 5;
  2361. tree_update.nodes[4].AddState(ax::mojom::State::kIgnored);
  2362. AXTree tree(tree_update);
  2363. // Root node has no siblings.
  2364. EXPECT_EQ(nullptr, tree.GetFromId(1)->GetPreviousUnignoredSibling());
  2365. EXPECT_EQ(nullptr, tree.GetFromId(1)->GetNextUnignoredSibling());
  2366. // Node 2's view of siblings:
  2367. // literal tree: null <-- [2(i)] --> 3
  2368. // unignored tree: null <-- [2(i)] --> 3
  2369. EXPECT_EQ(nullptr, tree.GetFromId(2)->GetPreviousSibling());
  2370. EXPECT_EQ(nullptr, tree.GetFromId(2)->GetPreviousUnignoredSibling());
  2371. EXPECT_EQ(tree.GetFromId(3), tree.GetFromId(2)->GetNextSibling());
  2372. EXPECT_EQ(tree.GetFromId(3), tree.GetFromId(2)->GetNextUnignoredSibling());
  2373. // Node 3's view of siblings:
  2374. // literal tree: 2(i) <-- [3] --> null
  2375. // unignored tree: 4 <-- [3] --> null
  2376. EXPECT_EQ(tree.GetFromId(2), tree.GetFromId(3)->GetPreviousSibling());
  2377. EXPECT_EQ(tree.GetFromId(4),
  2378. tree.GetFromId(3)->GetPreviousUnignoredSibling());
  2379. EXPECT_EQ(nullptr, tree.GetFromId(3)->GetNextSibling());
  2380. EXPECT_EQ(nullptr, tree.GetFromId(3)->GetNextUnignoredSibling());
  2381. // Node 4's view of siblings:
  2382. // literal tree: null <-- [4] --> 5(i)
  2383. // unignored tree: null <-- [4] --> 3
  2384. EXPECT_EQ(nullptr, tree.GetFromId(4)->GetPreviousSibling());
  2385. EXPECT_EQ(nullptr, tree.GetFromId(4)->GetPreviousUnignoredSibling());
  2386. EXPECT_EQ(tree.GetFromId(5), tree.GetFromId(4)->GetNextSibling());
  2387. EXPECT_EQ(tree.GetFromId(3), tree.GetFromId(4)->GetNextUnignoredSibling());
  2388. // Node 5's view of siblings:
  2389. // literal tree: 4 <-- [5(i)] --> null
  2390. // unignored tree: 4 <-- [5(i)] --> 3
  2391. EXPECT_EQ(tree.GetFromId(4), tree.GetFromId(5)->GetPreviousSibling());
  2392. EXPECT_EQ(tree.GetFromId(4),
  2393. tree.GetFromId(5)->GetPreviousUnignoredSibling());
  2394. EXPECT_EQ(nullptr, tree.GetFromId(5)->GetNextSibling());
  2395. EXPECT_EQ(tree.GetFromId(3), tree.GetFromId(5)->GetNextUnignoredSibling());
  2396. }
  2397. TEST(AXTreeTest, GetUnignoredSiblingIgnoredParentIrrelevant) {
  2398. // An ignored parent is not relevant unless the search would need to continue
  2399. // up through it.
  2400. //
  2401. // (i) => node is ignored.
  2402. //
  2403. // 1(i)
  2404. // ├── 2
  2405. // └── 3
  2406. AXTreeUpdate tree_update;
  2407. tree_update.root_id = 1;
  2408. tree_update.nodes.resize(3);
  2409. tree_update.nodes[0].id = 1;
  2410. tree_update.nodes[0].AddState(ax::mojom::State::kIgnored);
  2411. tree_update.nodes[0].child_ids = {2, 3};
  2412. tree_update.nodes[1].id = 2;
  2413. tree_update.nodes[2].id = 3;
  2414. AXTree tree(tree_update);
  2415. // Node 2 and 3 are each other's unignored siblings, the parent's ignored
  2416. // status is not relevant for this search.
  2417. EXPECT_EQ(tree.GetFromId(3), tree.GetFromId(2)->GetNextUnignoredSibling());
  2418. EXPECT_EQ(tree.GetFromId(2),
  2419. tree.GetFromId(3)->GetPreviousUnignoredSibling());
  2420. }
  2421. TEST(AXTreeTest, GetUnignoredSiblingsAllIgnored) {
  2422. // Test termination when all nodes, including the root node, are ignored.
  2423. //
  2424. // (i) => node is ignored.
  2425. //
  2426. // 1(i)
  2427. // └── 2(i)
  2428. AXTreeUpdate tree_update;
  2429. tree_update.root_id = 1;
  2430. tree_update.nodes.resize(2);
  2431. tree_update.nodes[0].id = 1;
  2432. tree_update.nodes[0].AddState(ax::mojom::State::kIgnored);
  2433. tree_update.nodes[0].child_ids = {2};
  2434. tree_update.nodes[1].id = 2;
  2435. tree_update.nodes[1].AddState(ax::mojom::State::kIgnored);
  2436. AXTree tree(tree_update);
  2437. EXPECT_EQ(nullptr, tree.GetFromId(1)->GetPreviousUnignoredSibling());
  2438. EXPECT_EQ(nullptr, tree.GetFromId(1)->GetNextUnignoredSibling());
  2439. EXPECT_EQ(nullptr, tree.GetFromId(2)->GetPreviousUnignoredSibling());
  2440. EXPECT_EQ(nullptr, tree.GetFromId(2)->GetNextUnignoredSibling());
  2441. }
  2442. TEST(AXTreeTest, GetUnignoredSiblingsNestedIgnored) {
  2443. // Test promotion of children through multiple layers of ignored parents.
  2444. // (i) => node is ignored.
  2445. //
  2446. // 1
  2447. // ├── 2
  2448. // ├── 3(i)
  2449. // │ └── 5(i)
  2450. // │ └── 6
  2451. // └── 4
  2452. AXTreeUpdate tree_update;
  2453. tree_update.root_id = 1;
  2454. tree_update.nodes.resize(6);
  2455. tree_update.nodes[0].id = 1;
  2456. tree_update.nodes[0].child_ids = {2, 3, 4};
  2457. tree_update.nodes[1].id = 2;
  2458. tree_update.nodes[2].id = 3;
  2459. tree_update.nodes[2].AddState(ax::mojom::State::kIgnored);
  2460. tree_update.nodes[2].child_ids = {5};
  2461. tree_update.nodes[3].id = 4;
  2462. tree_update.nodes[4].id = 5;
  2463. tree_update.nodes[4].AddState(ax::mojom::State::kIgnored);
  2464. tree_update.nodes[4].child_ids = {6};
  2465. tree_update.nodes[5].id = 6;
  2466. AXTree tree(tree_update);
  2467. EXPECT_EQ(nullptr, tree.GetFromId(1)->GetPreviousUnignoredSibling());
  2468. const AXNode* node2 = tree.GetFromId(2);
  2469. const AXNode* node3 = tree.GetFromId(3);
  2470. const AXNode* node4 = tree.GetFromId(4);
  2471. const AXNode* node5 = tree.GetFromId(5);
  2472. const AXNode* node6 = tree.GetFromId(6);
  2473. ASSERT_NE(nullptr, node2);
  2474. ASSERT_NE(nullptr, node3);
  2475. ASSERT_NE(nullptr, node4);
  2476. ASSERT_NE(nullptr, node5);
  2477. ASSERT_NE(nullptr, node6);
  2478. // Node 2's view of siblings:
  2479. // literal tree: null <-- [2] --> 3
  2480. // unignored tree: null <-- [2] --> 6
  2481. EXPECT_EQ(nullptr, node2->GetPreviousSibling());
  2482. EXPECT_EQ(nullptr, node2->GetPreviousUnignoredSibling());
  2483. EXPECT_EQ(node3, node2->GetNextSibling());
  2484. EXPECT_EQ(node6, node2->GetNextUnignoredSibling());
  2485. // Node 3's view of siblings:
  2486. // literal tree: 2 <-- [3(i)] --> 4
  2487. // unignored tree: 2 <-- [3(i)] --> 4
  2488. EXPECT_EQ(node2, node3->GetPreviousSibling());
  2489. EXPECT_EQ(node2, node3->GetPreviousUnignoredSibling());
  2490. EXPECT_EQ(node4, node3->GetNextSibling());
  2491. EXPECT_EQ(node4, node3->GetNextUnignoredSibling());
  2492. // Node 4's view of siblings:
  2493. // literal tree: 3 <-- [4] --> null
  2494. // unignored tree: 6 <-- [4] --> null
  2495. EXPECT_EQ(node3, node4->GetPreviousSibling());
  2496. EXPECT_EQ(node6, node4->GetPreviousUnignoredSibling());
  2497. EXPECT_EQ(nullptr, node4->GetNextSibling());
  2498. EXPECT_EQ(nullptr, node4->GetNextUnignoredSibling());
  2499. // Node 5's view of siblings:
  2500. // literal tree: null <-- [5(i)] --> null
  2501. // unignored tree: 2 <-- [5(i)] --> 4
  2502. EXPECT_EQ(nullptr, node5->GetPreviousSibling());
  2503. EXPECT_EQ(node2, node5->GetPreviousUnignoredSibling());
  2504. EXPECT_EQ(nullptr, node5->GetNextSibling());
  2505. EXPECT_EQ(node4, node5->GetNextUnignoredSibling());
  2506. // Node 6's view of siblings:
  2507. // literal tree: null <-- [6] --> null
  2508. // unignored tree: 2 <-- [6] --> 4
  2509. EXPECT_EQ(nullptr, node6->GetPreviousSibling());
  2510. EXPECT_EQ(node2, node6->GetPreviousUnignoredSibling());
  2511. EXPECT_EQ(nullptr, node6->GetNextSibling());
  2512. EXPECT_EQ(node4, node6->GetNextUnignoredSibling());
  2513. }
  2514. TEST(AXTreeTest, UnignoredSelection) {
  2515. AXTreeUpdate tree_update;
  2516. // (i) => node is ignored
  2517. // 1
  2518. // |__________
  2519. // | | |
  2520. // 2(i) 3 4
  2521. // |_______________________
  2522. // | | | |
  2523. // 5 6 7(i) 8(i)
  2524. // | | |________
  2525. // | | | |
  2526. // 9 10(i) 11(i) 12
  2527. // | |____
  2528. // | | |
  2529. // 13(i) 14 15
  2530. // |
  2531. // 16
  2532. // Unignored Tree (conceptual)
  2533. // 1
  2534. // |______________________
  2535. // | | | | | | |
  2536. // 5 6 14 15 12 3 4
  2537. // | |
  2538. // 9 16
  2539. tree_update.has_tree_data = true;
  2540. tree_update.tree_data.tree_id = AXTreeID::CreateNewAXTreeID();
  2541. tree_update.root_id = 1;
  2542. tree_update.nodes.resize(16);
  2543. tree_update.nodes[0].id = 1;
  2544. tree_update.nodes[0].role = ax::mojom::Role::kGenericContainer;
  2545. tree_update.nodes[0].child_ids = {2, 3, 4};
  2546. tree_update.nodes[1].id = 2;
  2547. tree_update.nodes[1].child_ids = {5, 6, 7, 8};
  2548. tree_update.nodes[1].role = ax::mojom::Role::kGenericContainer;
  2549. tree_update.nodes[1].AddState(ax::mojom::State::kIgnored);
  2550. tree_update.nodes[2].id = 3;
  2551. tree_update.nodes[2].role = ax::mojom::Role::kStaticText;
  2552. tree_update.nodes[2].SetName("text");
  2553. tree_update.nodes[3].id = 4;
  2554. tree_update.nodes[3].role = ax::mojom::Role::kStaticText;
  2555. tree_update.nodes[3].SetName("text");
  2556. tree_update.nodes[4].id = 5;
  2557. tree_update.nodes[4].role = ax::mojom::Role::kGenericContainer;
  2558. tree_update.nodes[4].child_ids = {9};
  2559. tree_update.nodes[5].id = 6;
  2560. tree_update.nodes[5].role = ax::mojom::Role::kGenericContainer;
  2561. tree_update.nodes[5].child_ids = {10};
  2562. tree_update.nodes[6].id = 7;
  2563. tree_update.nodes[6].child_ids = {11, 12};
  2564. tree_update.nodes[6].role = ax::mojom::Role::kGenericContainer;
  2565. tree_update.nodes[6].AddState(ax::mojom::State::kIgnored);
  2566. tree_update.nodes[7].id = 8;
  2567. tree_update.nodes[7].role = ax::mojom::Role::kGenericContainer;
  2568. tree_update.nodes[7].AddState(ax::mojom::State::kIgnored);
  2569. tree_update.nodes[8].id = 9;
  2570. tree_update.nodes[8].role = ax::mojom::Role::kStaticText;
  2571. tree_update.nodes[8].SetName("text");
  2572. tree_update.nodes[9].id = 10;
  2573. tree_update.nodes[9].child_ids = {13};
  2574. tree_update.nodes[9].role = ax::mojom::Role::kGenericContainer;
  2575. tree_update.nodes[9].AddState(ax::mojom::State::kIgnored);
  2576. tree_update.nodes[10].id = 11;
  2577. tree_update.nodes[10].child_ids = {14, 15};
  2578. tree_update.nodes[10].role = ax::mojom::Role::kGenericContainer;
  2579. tree_update.nodes[10].AddState(ax::mojom::State::kIgnored);
  2580. tree_update.nodes[11].id = 12;
  2581. tree_update.nodes[11].role = ax::mojom::Role::kStaticText;
  2582. tree_update.nodes[11].SetName("text");
  2583. tree_update.nodes[12].id = 13;
  2584. tree_update.nodes[12].child_ids = {16};
  2585. tree_update.nodes[12].role = ax::mojom::Role::kGenericContainer;
  2586. tree_update.nodes[12].AddState(ax::mojom::State::kIgnored);
  2587. tree_update.nodes[13].id = 14;
  2588. tree_update.nodes[13].role = ax::mojom::Role::kStaticText;
  2589. tree_update.nodes[13].SetName("text");
  2590. tree_update.nodes[14].id = 15;
  2591. tree_update.nodes[14].role = ax::mojom::Role::kStaticText;
  2592. tree_update.nodes[14].SetName("text");
  2593. tree_update.nodes[15].id = 16;
  2594. tree_update.nodes[15].role = ax::mojom::Role::kStaticText;
  2595. tree_update.nodes[15].SetName("text");
  2596. TestAXTreeManager test_ax_tree_manager(std::make_unique<AXTree>(tree_update));
  2597. AXTree::Selection unignored_selection =
  2598. test_ax_tree_manager.GetTree()->GetUnignoredSelection();
  2599. EXPECT_EQ(kInvalidAXNodeID, unignored_selection.anchor_object_id);
  2600. EXPECT_EQ(-1, unignored_selection.anchor_offset);
  2601. EXPECT_EQ(kInvalidAXNodeID, unignored_selection.focus_object_id);
  2602. EXPECT_EQ(-1, unignored_selection.focus_offset);
  2603. struct SelectionData {
  2604. int32_t anchor_id;
  2605. int32_t anchor_offset;
  2606. int32_t focus_id;
  2607. int32_t focus_offset;
  2608. };
  2609. SelectionData input = {1, 0, 1, 0};
  2610. SelectionData expected = {9, 0, 9, 0};
  2611. TEST_SELECTION(tree_update, test_ax_tree_manager.GetTree(), input, expected);
  2612. input = {1, 0, 2, 2};
  2613. expected = {9, 0, 14, 0};
  2614. TEST_SELECTION(tree_update, test_ax_tree_manager.GetTree(), input, expected);
  2615. input = {2, 1, 5, 0};
  2616. expected = {16, 0, 5, 0};
  2617. TEST_SELECTION(tree_update, test_ax_tree_manager.GetTree(), input, expected);
  2618. input = {5, 0, 9, 0};
  2619. expected = {5, 0, 9, 0};
  2620. TEST_SELECTION(tree_update, test_ax_tree_manager.GetTree(), input, expected);
  2621. input = {9, 0, 6, 0};
  2622. expected = {9, 0, 16, 0};
  2623. TEST_SELECTION(tree_update, test_ax_tree_manager.GetTree(), input, expected);
  2624. input = {6, 0, 10, 0};
  2625. expected = {16, 0, 16, 0};
  2626. TEST_SELECTION(tree_update, test_ax_tree_manager.GetTree(), input, expected);
  2627. input = {10, 0, 13, 0};
  2628. expected = {16, 0, 16, 0};
  2629. TEST_SELECTION(tree_update, test_ax_tree_manager.GetTree(), input, expected);
  2630. input = {13, 0, 16, 0};
  2631. expected = {16, 0, 16, 0};
  2632. TEST_SELECTION(tree_update, test_ax_tree_manager.GetTree(), input, expected);
  2633. input = {16, 0, 7, 0};
  2634. expected = {16, 0, 14, 0};
  2635. TEST_SELECTION(tree_update, test_ax_tree_manager.GetTree(), input, expected);
  2636. input = {7, 0, 11, 0};
  2637. expected = {14, 0, 14, 0};
  2638. TEST_SELECTION(tree_update, test_ax_tree_manager.GetTree(), input, expected);
  2639. input = {11, 1, 14, 2};
  2640. expected = {15, 0, 14, 2};
  2641. TEST_SELECTION(tree_update, test_ax_tree_manager.GetTree(), input, expected);
  2642. input = {14, 2, 15, 3};
  2643. expected = {14, 2, 15, 3};
  2644. TEST_SELECTION(tree_update, test_ax_tree_manager.GetTree(), input, expected);
  2645. input = {15, 0, 12, 0};
  2646. expected = {15, 0, 12, 0};
  2647. TEST_SELECTION(tree_update, test_ax_tree_manager.GetTree(), input, expected);
  2648. input = {12, 0, 8, 0};
  2649. expected = {12, 0, 3, 0};
  2650. TEST_SELECTION(tree_update, test_ax_tree_manager.GetTree(), input, expected);
  2651. input = {8, 0, 3, 0};
  2652. expected = {12, 4, 3, 0};
  2653. TEST_SELECTION(tree_update, test_ax_tree_manager.GetTree(), input, expected);
  2654. input = {3, 0, 4, 0};
  2655. expected = {3, 0, 4, 0};
  2656. TEST_SELECTION(tree_update, test_ax_tree_manager.GetTree(), input, expected);
  2657. input = {4, 0, 4, 0};
  2658. expected = {4, 0, 4, 0};
  2659. TEST_SELECTION(tree_update, test_ax_tree_manager.GetTree(), input, expected);
  2660. }
  2661. TEST(AXTreeTest, GetChildrenOrSiblings) {
  2662. // 1
  2663. // ├── 2
  2664. // │ └── 5
  2665. // ├── 3
  2666. // └── 4
  2667. AXTreeUpdate tree_update;
  2668. tree_update.root_id = 1;
  2669. tree_update.nodes.resize(5);
  2670. tree_update.nodes[0].id = 1;
  2671. tree_update.nodes[0].child_ids = {2, 3, 4};
  2672. tree_update.nodes[1].id = 2;
  2673. tree_update.nodes[1].child_ids = {5};
  2674. tree_update.nodes[2].id = 3;
  2675. tree_update.nodes[3].id = 4;
  2676. tree_update.nodes[4].id = 5;
  2677. AXTree tree(tree_update);
  2678. EXPECT_EQ(tree.GetFromId(2), tree.GetFromId(1)->GetFirstChild());
  2679. EXPECT_EQ(tree.GetFromId(5), tree.GetFromId(2)->GetFirstChild());
  2680. EXPECT_EQ(nullptr, tree.GetFromId(3)->GetFirstChild());
  2681. EXPECT_EQ(nullptr, tree.GetFromId(4)->GetFirstChild());
  2682. EXPECT_EQ(nullptr, tree.GetFromId(5)->GetFirstChild());
  2683. EXPECT_EQ(tree.GetFromId(4), tree.GetFromId(1)->GetLastChild());
  2684. EXPECT_EQ(tree.GetFromId(5), tree.GetFromId(2)->GetLastChild());
  2685. EXPECT_EQ(nullptr, tree.GetFromId(3)->GetLastChild());
  2686. EXPECT_EQ(nullptr, tree.GetFromId(4)->GetLastChild());
  2687. EXPECT_EQ(nullptr, tree.GetFromId(5)->GetLastChild());
  2688. EXPECT_EQ(nullptr, tree.GetFromId(1)->GetPreviousSibling());
  2689. EXPECT_EQ(nullptr, tree.GetFromId(2)->GetPreviousSibling());
  2690. EXPECT_EQ(tree.GetFromId(2), tree.GetFromId(3)->GetPreviousSibling());
  2691. EXPECT_EQ(tree.GetFromId(3), tree.GetFromId(4)->GetPreviousSibling());
  2692. EXPECT_EQ(nullptr, tree.GetFromId(5)->GetPreviousSibling());
  2693. EXPECT_EQ(nullptr, tree.GetFromId(1)->GetNextSibling());
  2694. EXPECT_EQ(tree.GetFromId(3), tree.GetFromId(2)->GetNextSibling());
  2695. EXPECT_EQ(tree.GetFromId(4), tree.GetFromId(3)->GetNextSibling());
  2696. EXPECT_EQ(nullptr, tree.GetFromId(4)->GetNextSibling());
  2697. EXPECT_EQ(nullptr, tree.GetFromId(5)->GetNextSibling());
  2698. }
  2699. TEST(AXTreeTest, ChildTreeIds) {
  2700. AXTreeID tree_id_1 = AXTreeID::CreateNewAXTreeID();
  2701. AXTreeID tree_id_2 = AXTreeID::CreateNewAXTreeID();
  2702. AXTreeID tree_id_3 = AXTreeID::CreateNewAXTreeID();
  2703. AXTreeUpdate initial_state;
  2704. initial_state.root_id = 1;
  2705. initial_state.nodes.resize(4);
  2706. initial_state.nodes[0].id = 1;
  2707. initial_state.nodes[0].child_ids.push_back(2);
  2708. initial_state.nodes[0].child_ids.push_back(3);
  2709. initial_state.nodes[0].child_ids.push_back(4);
  2710. initial_state.nodes[1].id = 2;
  2711. initial_state.nodes[1].AddChildTreeId(tree_id_2);
  2712. initial_state.nodes[2].id = 3;
  2713. initial_state.nodes[2].AddChildTreeId(tree_id_3);
  2714. initial_state.nodes[3].id = 4;
  2715. initial_state.nodes[3].AddChildTreeId(tree_id_3);
  2716. AXTree tree(initial_state);
  2717. auto child_tree_1_nodes = tree.GetNodeIdsForChildTreeId(tree_id_1);
  2718. EXPECT_EQ(0U, child_tree_1_nodes.size());
  2719. auto child_tree_2_nodes = tree.GetNodeIdsForChildTreeId(tree_id_2);
  2720. EXPECT_EQ(1U, child_tree_2_nodes.size());
  2721. EXPECT_TRUE(base::Contains(child_tree_2_nodes, 2));
  2722. auto child_tree_3_nodes = tree.GetNodeIdsForChildTreeId(tree_id_3);
  2723. EXPECT_EQ(2U, child_tree_3_nodes.size());
  2724. EXPECT_TRUE(base::Contains(child_tree_3_nodes, 3));
  2725. EXPECT_TRUE(base::Contains(child_tree_3_nodes, 4));
  2726. AXTreeUpdate update = initial_state;
  2727. update.nodes[2].string_attributes.clear();
  2728. update.nodes[2].AddChildTreeId(tree_id_2);
  2729. update.nodes[3].string_attributes.clear();
  2730. EXPECT_TRUE(tree.Unserialize(update));
  2731. child_tree_2_nodes = tree.GetNodeIdsForChildTreeId(tree_id_2);
  2732. EXPECT_EQ(2U, child_tree_2_nodes.size());
  2733. EXPECT_TRUE(base::Contains(child_tree_2_nodes, 2));
  2734. EXPECT_TRUE(base::Contains(child_tree_2_nodes, 3));
  2735. child_tree_3_nodes = tree.GetNodeIdsForChildTreeId(tree_id_3);
  2736. EXPECT_EQ(0U, child_tree_3_nodes.size());
  2737. }
  2738. TEST_P(AXTreeTestWithMultipleUTFEncodings, ComputedNodeData) {
  2739. // kRootWebArea
  2740. // ++kTextField (contenteditable)
  2741. // ++++kGenericContainer
  2742. // ++++++kStaticText "Line 1"
  2743. // ++++++kLineBreak '\n'
  2744. // ++++++kStaticText "Line 2"
  2745. // ++kParagraph
  2746. // ++++kGenericContainer (span) IGNORED
  2747. // ++++++kStaticText "span text" IGNORED
  2748. // ++++kLink
  2749. // ++++++kStaticText "Link text"
  2750. AXNodeData root;
  2751. root.id = 1;
  2752. AXNodeData rich_text_field;
  2753. rich_text_field.id = 2;
  2754. AXNodeData rich_text_field_text_container;
  2755. rich_text_field_text_container.id = 3;
  2756. AXNodeData rich_text_field_line_1;
  2757. rich_text_field_line_1.id = 4;
  2758. AXNodeData rich_text_field_line_break;
  2759. rich_text_field_line_break.id = 5;
  2760. AXNodeData rich_text_field_line_2;
  2761. rich_text_field_line_2.id = 6;
  2762. AXNodeData paragraph;
  2763. paragraph.id = 7;
  2764. AXNodeData paragraph_span;
  2765. paragraph_span.id = 8;
  2766. AXNodeData paragraph_span_text;
  2767. paragraph_span_text.id = 9;
  2768. AXNodeData paragraph_link;
  2769. paragraph_link.id = 10;
  2770. AXNodeData paragraph_link_text;
  2771. paragraph_link_text.id = 11;
  2772. root.role = ax::mojom::Role::kRootWebArea;
  2773. root.child_ids = {rich_text_field.id, paragraph.id};
  2774. rich_text_field.role = ax::mojom::Role::kTextField;
  2775. rich_text_field.AddState(ax::mojom::State::kEditable);
  2776. rich_text_field.AddState(ax::mojom::State::kRichlyEditable);
  2777. rich_text_field.AddBoolAttribute(
  2778. ax::mojom::BoolAttribute::kNonAtomicTextFieldRoot, true);
  2779. rich_text_field.SetName("Rich text field");
  2780. rich_text_field.SetValue("Line 1\nLine 2");
  2781. rich_text_field.child_ids = {rich_text_field_text_container.id};
  2782. rich_text_field_text_container.role = ax::mojom::Role::kGenericContainer;
  2783. rich_text_field_text_container.AddState(ax::mojom::State::kIgnored);
  2784. rich_text_field_text_container.child_ids = {rich_text_field_line_1.id,
  2785. rich_text_field_line_break.id,
  2786. rich_text_field_line_2.id};
  2787. rich_text_field_line_1.role = ax::mojom::Role::kStaticText;
  2788. rich_text_field_line_1.AddState(ax::mojom::State::kEditable);
  2789. rich_text_field_line_1.AddState(ax::mojom::State::kRichlyEditable);
  2790. rich_text_field_line_1.SetName("Line 1");
  2791. rich_text_field_line_break.role = ax::mojom::Role::kLineBreak;
  2792. rich_text_field_line_break.AddState(ax::mojom::State::kEditable);
  2793. rich_text_field_line_break.AddState(ax::mojom::State::kRichlyEditable);
  2794. rich_text_field_line_break.SetName("\n");
  2795. rich_text_field_line_2.role = ax::mojom::Role::kStaticText;
  2796. rich_text_field_line_2.AddState(ax::mojom::State::kEditable);
  2797. rich_text_field_line_2.AddState(ax::mojom::State::kRichlyEditable);
  2798. rich_text_field_line_2.SetName("Line 2");
  2799. paragraph.role = ax::mojom::Role::kParagraph;
  2800. paragraph.child_ids = {paragraph_span.id, paragraph_link.id};
  2801. paragraph_span.role = ax::mojom::Role::kGenericContainer;
  2802. paragraph_span.AddState(ax::mojom::State::kIgnored);
  2803. paragraph_span.child_ids = {paragraph_span_text.id};
  2804. paragraph_span_text.role = ax::mojom::Role::kStaticText;
  2805. paragraph_span_text.AddState(ax::mojom::State::kIgnored);
  2806. paragraph_span_text.SetName("span text");
  2807. paragraph_link.role = ax::mojom::Role::kLink;
  2808. paragraph_link.AddState(ax::mojom::State::kLinked);
  2809. paragraph_link.child_ids = {paragraph_link_text.id};
  2810. paragraph_link_text.role = ax::mojom::Role::kStaticText;
  2811. paragraph_link_text.SetName("Link text");
  2812. AXTreeUpdate update;
  2813. update.has_tree_data = true;
  2814. update.tree_data.tree_id = AXTreeID::CreateNewAXTreeID();
  2815. update.root_id = root.id;
  2816. update.nodes = {root,
  2817. rich_text_field,
  2818. rich_text_field_text_container,
  2819. rich_text_field_line_1,
  2820. rich_text_field_line_break,
  2821. rich_text_field_line_2,
  2822. paragraph,
  2823. paragraph_span,
  2824. paragraph_span_text,
  2825. paragraph_link,
  2826. paragraph_link_text};
  2827. AXTree tree(update);
  2828. TestAXTreeObserver test_observer(&tree);
  2829. ASSERT_NE(nullptr, tree.root());
  2830. ASSERT_EQ(2u, tree.root()->children().size());
  2831. if (GetParam() == TestEncoding::kUTF8) {
  2832. EXPECT_EQ("Line 1\nLine 2Link text", tree.root()->GetTextContentUTF8());
  2833. EXPECT_EQ(22, tree.root()->GetTextContentLengthUTF8());
  2834. } else if (GetParam() == TestEncoding::kUTF16) {
  2835. EXPECT_EQ(u"Line 1\nLine 2Link text", tree.root()->GetTextContentUTF16());
  2836. EXPECT_EQ(22, tree.root()->GetTextContentLengthUTF16());
  2837. }
  2838. if (GetParam() == TestEncoding::kUTF8) {
  2839. EXPECT_EQ("Line 1\nLine 2",
  2840. tree.root()->GetChildAtIndex(0)->GetTextContentUTF8());
  2841. EXPECT_EQ(13, tree.root()->GetChildAtIndex(0)->GetTextContentLengthUTF8());
  2842. } else if (GetParam() == TestEncoding::kUTF16) {
  2843. EXPECT_EQ(u"Line 1\nLine 2",
  2844. tree.root()->GetChildAtIndex(0)->GetTextContentUTF16());
  2845. EXPECT_EQ(13, tree.root()->GetChildAtIndex(0)->GetTextContentLengthUTF16());
  2846. }
  2847. if (GetParam() == TestEncoding::kUTF8) {
  2848. EXPECT_EQ("Link text",
  2849. tree.root()->GetChildAtIndex(1)->GetTextContentUTF8());
  2850. EXPECT_EQ(9, tree.root()->GetChildAtIndex(1)->GetTextContentLengthUTF8());
  2851. } else if (GetParam() == TestEncoding::kUTF16) {
  2852. EXPECT_EQ(u"Link text",
  2853. tree.root()->GetChildAtIndex(1)->GetTextContentUTF16());
  2854. EXPECT_EQ(9, tree.root()->GetChildAtIndex(1)->GetTextContentLengthUTF16());
  2855. }
  2856. //
  2857. // Flip the ignored state of the span, the link and the line break, and delete
  2858. // the second line in the rich text field, all of which should change their
  2859. // cached text content.
  2860. // kRootWebArea
  2861. // ++kTextField (contenteditable)
  2862. // ++++kGenericContainer
  2863. // ++++++kStaticText "Line 1"
  2864. // ++++++kLineBreak '\n' IGNORED
  2865. // ++kParagraph
  2866. // ++++kGenericContainer (span)
  2867. // ++++++kStaticText "span text"
  2868. // ++++kLink IGNORED
  2869. // ++++++kStaticText "Link text"
  2870. rich_text_field_line_break.AddState(ax::mojom::State::kIgnored);
  2871. paragraph_span.RemoveState(ax::mojom::State::kIgnored);
  2872. paragraph_span_text.RemoveState(ax::mojom::State::kIgnored);
  2873. // Do not add the ignored state to the link's text on purpose.
  2874. paragraph_link.AddState(ax::mojom::State::kIgnored);
  2875. rich_text_field_text_container.child_ids = {rich_text_field_line_1.id,
  2876. rich_text_field_line_break.id};
  2877. AXTreeUpdate update_2;
  2878. update_2.node_id_to_clear = rich_text_field_line_2.id;
  2879. update_2.nodes = {rich_text_field_text_container, rich_text_field_line_break,
  2880. paragraph_span, paragraph_span_text, paragraph_link};
  2881. ASSERT_TRUE(tree.Unserialize(update_2)) << tree.error();
  2882. ASSERT_EQ(2u, tree.root()->children().size());
  2883. if (GetParam() == TestEncoding::kUTF8) {
  2884. EXPECT_EQ("Line 1span textLink text", tree.root()->GetTextContentUTF8());
  2885. EXPECT_EQ(24, tree.root()->GetTextContentLengthUTF8());
  2886. } else if (GetParam() == TestEncoding::kUTF16) {
  2887. EXPECT_EQ(u"Line 1span textLink text", tree.root()->GetTextContentUTF16());
  2888. EXPECT_EQ(24, tree.root()->GetTextContentLengthUTF16());
  2889. }
  2890. if (GetParam() == TestEncoding::kUTF8) {
  2891. EXPECT_EQ("Line 1", tree.root()->GetChildAtIndex(0)->GetTextContentUTF8());
  2892. EXPECT_EQ(6, tree.root()->GetChildAtIndex(0)->GetTextContentLengthUTF8());
  2893. } else if (GetParam() == TestEncoding::kUTF16) {
  2894. EXPECT_EQ(u"Line 1",
  2895. tree.root()->GetChildAtIndex(0)->GetTextContentUTF16());
  2896. EXPECT_EQ(6, tree.root()->GetChildAtIndex(0)->GetTextContentLengthUTF16());
  2897. }
  2898. if (GetParam() == TestEncoding::kUTF8) {
  2899. EXPECT_EQ("span textLink text",
  2900. tree.root()->GetChildAtIndex(1)->GetTextContentUTF8());
  2901. EXPECT_EQ(18, tree.root()->GetChildAtIndex(1)->GetTextContentLengthUTF8());
  2902. } else if (GetParam() == TestEncoding::kUTF16) {
  2903. EXPECT_EQ(u"span textLink text",
  2904. tree.root()->GetChildAtIndex(1)->GetTextContentUTF16());
  2905. EXPECT_EQ(18, tree.root()->GetChildAtIndex(1)->GetTextContentLengthUTF16());
  2906. }
  2907. const std::vector<std::string>& change_log =
  2908. test_observer.attribute_change_log();
  2909. EXPECT_THAT(change_log,
  2910. ElementsAre("IsIgnored changed on node ID 5 to true",
  2911. "IsIgnored changed on node ID 8 to false",
  2912. "IsIgnored changed on node ID 9 to false",
  2913. "IsIgnored changed on node ID 10 to true"));
  2914. }
  2915. INSTANTIATE_TEST_SUITE_P(MultipleUTFEncodingTest,
  2916. AXTreeTestWithMultipleUTFEncodings,
  2917. ::testing::Values(TestEncoding::kUTF8,
  2918. TestEncoding::kUTF16));
  2919. // Tests GetPosInSet and GetSetSize return the assigned int attribute values.
  2920. TEST(AXTreeTest, SetSizePosInSetAssigned) {
  2921. AXTreeUpdate tree_update;
  2922. tree_update.root_id = 1;
  2923. tree_update.nodes.resize(4);
  2924. tree_update.nodes[0].id = 1;
  2925. tree_update.nodes[0].role = ax::mojom::Role::kList;
  2926. tree_update.nodes[0].child_ids = {2, 3, 4};
  2927. tree_update.nodes[1].id = 2;
  2928. tree_update.nodes[1].role = ax::mojom::Role::kListItem;
  2929. tree_update.nodes[1].AddIntAttribute(ax::mojom::IntAttribute::kPosInSet, 2);
  2930. tree_update.nodes[1].AddIntAttribute(ax::mojom::IntAttribute::kSetSize, 12);
  2931. tree_update.nodes[2].id = 3;
  2932. tree_update.nodes[2].role = ax::mojom::Role::kListItem;
  2933. tree_update.nodes[2].AddIntAttribute(ax::mojom::IntAttribute::kPosInSet, 5);
  2934. tree_update.nodes[2].AddIntAttribute(ax::mojom::IntAttribute::kSetSize, 12);
  2935. tree_update.nodes[3].id = 4;
  2936. tree_update.nodes[3].role = ax::mojom::Role::kListItem;
  2937. tree_update.nodes[3].AddIntAttribute(ax::mojom::IntAttribute::kPosInSet, 9);
  2938. tree_update.nodes[3].AddIntAttribute(ax::mojom::IntAttribute::kSetSize, 12);
  2939. AXTree tree(tree_update);
  2940. AXNode* item1 = tree.GetFromId(2);
  2941. EXPECT_OPTIONAL_EQ(2, item1->GetPosInSet());
  2942. EXPECT_OPTIONAL_EQ(12, item1->GetSetSize());
  2943. AXNode* item2 = tree.GetFromId(3);
  2944. EXPECT_OPTIONAL_EQ(5, item2->GetPosInSet());
  2945. EXPECT_OPTIONAL_EQ(12, item2->GetSetSize());
  2946. AXNode* item3 = tree.GetFromId(4);
  2947. EXPECT_OPTIONAL_EQ(9, item3->GetPosInSet());
  2948. EXPECT_OPTIONAL_EQ(12, item3->GetSetSize());
  2949. }
  2950. // Tests that PosInSet and SetSize can be calculated if not assigned.
  2951. TEST(AXTreeTest, SetSizePosInSetUnassigned) {
  2952. AXTreeUpdate tree_update;
  2953. tree_update.root_id = 1;
  2954. tree_update.nodes.resize(4);
  2955. tree_update.nodes[0].id = 1;
  2956. tree_update.nodes[0].role = ax::mojom::Role::kList;
  2957. tree_update.nodes[0].child_ids = {2, 3, 4};
  2958. tree_update.nodes[1].id = 2;
  2959. tree_update.nodes[1].role = ax::mojom::Role::kListItem;
  2960. tree_update.nodes[2].id = 3;
  2961. tree_update.nodes[2].role = ax::mojom::Role::kListItem;
  2962. tree_update.nodes[3].id = 4;
  2963. tree_update.nodes[3].role = ax::mojom::Role::kListItem;
  2964. AXTree tree(tree_update);
  2965. AXNode* item1 = tree.GetFromId(2);
  2966. EXPECT_OPTIONAL_EQ(1, item1->GetPosInSet());
  2967. EXPECT_OPTIONAL_EQ(3, item1->GetSetSize());
  2968. AXNode* item2 = tree.GetFromId(3);
  2969. EXPECT_OPTIONAL_EQ(2, item2->GetPosInSet());
  2970. EXPECT_OPTIONAL_EQ(3, item2->GetSetSize());
  2971. AXNode* item3 = tree.GetFromId(4);
  2972. EXPECT_OPTIONAL_EQ(3, item3->GetPosInSet());
  2973. EXPECT_OPTIONAL_EQ(3, item3->GetSetSize());
  2974. }
  2975. // Tests that PosInSet and SetSize can be calculated for TreeGrid rows if not
  2976. // assigned.
  2977. TEST(AXTreeTest, SetSizePosInSetInTreeGridUnassigned) {
  2978. AXTreeUpdate tree_update;
  2979. tree_update.root_id = 1;
  2980. tree_update.nodes.resize(4);
  2981. tree_update.nodes[0].id = 1;
  2982. tree_update.nodes[0].role = ax::mojom::Role::kTreeGrid;
  2983. tree_update.nodes[0].child_ids = {2, 3, 4};
  2984. tree_update.nodes[1].id = 2;
  2985. tree_update.nodes[1].role = ax::mojom::Role::kRow;
  2986. tree_update.nodes[1].AddState(ax::mojom::State::kFocusable);
  2987. tree_update.nodes[2].id = 3;
  2988. tree_update.nodes[2].role = ax::mojom::Role::kRow;
  2989. tree_update.nodes[2].AddState(ax::mojom::State::kFocusable);
  2990. tree_update.nodes[3].id = 4;
  2991. tree_update.nodes[3].role = ax::mojom::Role::kRow;
  2992. tree_update.nodes[3].AddState(ax::mojom::State::kFocusable);
  2993. AXTree tree(tree_update);
  2994. AXNode* item1 = tree.GetFromId(2);
  2995. EXPECT_OPTIONAL_EQ(1, item1->GetPosInSet());
  2996. EXPECT_OPTIONAL_EQ(3, item1->GetSetSize());
  2997. AXNode* item2 = tree.GetFromId(3);
  2998. EXPECT_OPTIONAL_EQ(2, item2->GetPosInSet());
  2999. EXPECT_OPTIONAL_EQ(3, item2->GetSetSize());
  3000. AXNode* item3 = tree.GetFromId(4);
  3001. EXPECT_OPTIONAL_EQ(3, item3->GetPosInSet());
  3002. EXPECT_OPTIONAL_EQ(3, item3->GetSetSize());
  3003. }
  3004. // Tests PosInSet can be calculated if unassigned, and SetSize can be
  3005. // assigned on the outerlying ordered set.
  3006. TEST(AXTreeTest, SetSizeAssignedOnContainer) {
  3007. AXTreeUpdate tree_update;
  3008. tree_update.root_id = 1;
  3009. tree_update.nodes.resize(4);
  3010. tree_update.nodes[0].id = 1;
  3011. tree_update.nodes[0].role = ax::mojom::Role::kList;
  3012. tree_update.nodes[0].child_ids = {2, 3, 4};
  3013. tree_update.nodes[0].AddIntAttribute(ax::mojom::IntAttribute::kSetSize, 7);
  3014. tree_update.nodes[1].id = 2;
  3015. tree_update.nodes[1].role = ax::mojom::Role::kListItem;
  3016. tree_update.nodes[2].id = 3;
  3017. tree_update.nodes[2].role = ax::mojom::Role::kListItem;
  3018. tree_update.nodes[3].id = 4;
  3019. tree_update.nodes[3].role = ax::mojom::Role::kListItem;
  3020. AXTree tree(tree_update);
  3021. // Items should inherit SetSize from ordered set if not specified.
  3022. AXNode* item1 = tree.GetFromId(2);
  3023. EXPECT_OPTIONAL_EQ(7, item1->GetSetSize());
  3024. EXPECT_OPTIONAL_EQ(1, item1->GetPosInSet());
  3025. AXNode* item2 = tree.GetFromId(3);
  3026. EXPECT_OPTIONAL_EQ(7, item2->GetSetSize());
  3027. EXPECT_OPTIONAL_EQ(2, item2->GetPosInSet());
  3028. AXNode* item3 = tree.GetFromId(4);
  3029. EXPECT_OPTIONAL_EQ(7, item3->GetSetSize());
  3030. EXPECT_OPTIONAL_EQ(3, item3->GetPosInSet());
  3031. }
  3032. // Tests GetPosInSet and GetSetSize on a list containing various roles.
  3033. // Roles for items and associated ordered set should match up.
  3034. TEST(AXTreeTest, SetSizePosInSetDiverseList) {
  3035. AXTreeUpdate tree_update;
  3036. tree_update.root_id = 1;
  3037. tree_update.nodes.resize(6);
  3038. tree_update.nodes[0].id = 1;
  3039. tree_update.nodes[0].role = ax::mojom::Role::kMenu;
  3040. tree_update.nodes[0].child_ids = {2, 3, 4, 5, 6};
  3041. tree_update.nodes[1].id = 2;
  3042. tree_update.nodes[1].role = ax::mojom::Role::kMenuItem; // 1 of 4
  3043. tree_update.nodes[2].id = 3;
  3044. tree_update.nodes[2].role = ax::mojom::Role::kMenuItemCheckBox; // 2 of 4
  3045. tree_update.nodes[3].id = 4;
  3046. tree_update.nodes[3].role = ax::mojom::Role::kMenuItemRadio; // 3 of 4
  3047. tree_update.nodes[4].id = 5;
  3048. tree_update.nodes[4].role = ax::mojom::Role::kMenuItem; // 4 of 4
  3049. tree_update.nodes[5].id = 6;
  3050. tree_update.nodes[5].role = ax::mojom::Role::kTab; // 0 of 0
  3051. AXTree tree(tree_update);
  3052. // kMenu is allowed to contain: kMenuItem, kMenuItemCheckbox,
  3053. // and kMenuItemRadio. For PosInSet and SetSize purposes, these items
  3054. // are treated as the same role.
  3055. AXNode* item1 = tree.GetFromId(2);
  3056. EXPECT_OPTIONAL_EQ(1, item1->GetPosInSet());
  3057. EXPECT_OPTIONAL_EQ(4, item1->GetSetSize());
  3058. AXNode* checkbox = tree.GetFromId(3);
  3059. EXPECT_OPTIONAL_EQ(2, checkbox->GetPosInSet());
  3060. EXPECT_OPTIONAL_EQ(4, checkbox->GetSetSize());
  3061. AXNode* radio = tree.GetFromId(4);
  3062. EXPECT_OPTIONAL_EQ(3, radio->GetPosInSet());
  3063. EXPECT_OPTIONAL_EQ(4, radio->GetSetSize());
  3064. AXNode* item3 = tree.GetFromId(5);
  3065. EXPECT_OPTIONAL_EQ(4, item3->GetPosInSet());
  3066. EXPECT_OPTIONAL_EQ(4, item3->GetSetSize());
  3067. AXNode* tab = tree.GetFromId(6);
  3068. EXPECT_FALSE(tab->GetPosInSet());
  3069. EXPECT_FALSE(tab->GetSetSize());
  3070. }
  3071. // Tests GetPosInSet and GetSetSize on a nested list.
  3072. TEST(AXTreeTest, SetSizePosInSetNestedList) {
  3073. AXTreeUpdate tree_update;
  3074. tree_update.root_id = 1;
  3075. tree_update.nodes.resize(7);
  3076. tree_update.nodes[0].id = 1;
  3077. tree_update.nodes[0].role = ax::mojom::Role::kList;
  3078. tree_update.nodes[0].child_ids = {2, 3, 4, 7};
  3079. tree_update.nodes[1].id = 2;
  3080. tree_update.nodes[1].role = ax::mojom::Role::kListItem;
  3081. tree_update.nodes[2].id = 3;
  3082. tree_update.nodes[2].role = ax::mojom::Role::kListItem;
  3083. tree_update.nodes[3].id = 4;
  3084. tree_update.nodes[3].role = ax::mojom::Role::kList;
  3085. tree_update.nodes[3].child_ids = {5, 6};
  3086. tree_update.nodes[4].id = 5;
  3087. tree_update.nodes[4].role = ax::mojom::Role::kListItem;
  3088. tree_update.nodes[5].id = 6;
  3089. tree_update.nodes[5].role = ax::mojom::Role::kListItem;
  3090. tree_update.nodes[6].id = 7;
  3091. tree_update.nodes[6].role = ax::mojom::Role::kListItem;
  3092. AXTree tree(tree_update);
  3093. AXNode* outer_item1 = tree.GetFromId(2);
  3094. EXPECT_OPTIONAL_EQ(1, outer_item1->GetPosInSet());
  3095. EXPECT_OPTIONAL_EQ(3, outer_item1->GetSetSize());
  3096. AXNode* outer_item2 = tree.GetFromId(3);
  3097. EXPECT_OPTIONAL_EQ(2, outer_item2->GetPosInSet());
  3098. EXPECT_OPTIONAL_EQ(3, outer_item2->GetSetSize());
  3099. AXNode* inner_item1 = tree.GetFromId(5);
  3100. EXPECT_OPTIONAL_EQ(1, inner_item1->GetPosInSet());
  3101. EXPECT_OPTIONAL_EQ(2, inner_item1->GetSetSize());
  3102. AXNode* inner_item2 = tree.GetFromId(6);
  3103. EXPECT_OPTIONAL_EQ(2, inner_item2->GetPosInSet());
  3104. EXPECT_OPTIONAL_EQ(2, inner_item2->GetSetSize());
  3105. AXNode* outer_item3 = tree.GetFromId(7);
  3106. EXPECT_OPTIONAL_EQ(3, outer_item3->GetPosInSet());
  3107. EXPECT_OPTIONAL_EQ(3, outer_item3->GetSetSize());
  3108. }
  3109. // Tests PosInSet can be calculated if one item specifies PosInSet, but
  3110. // other assignments are missing.
  3111. TEST(AXTreeTest, PosInSetMissing) {
  3112. AXTreeUpdate tree_update;
  3113. tree_update.root_id = 1;
  3114. tree_update.nodes.resize(4);
  3115. tree_update.nodes[0].id = 1;
  3116. tree_update.nodes[0].role = ax::mojom::Role::kList;
  3117. tree_update.nodes[0].child_ids = {2, 3, 4};
  3118. tree_update.nodes[0].AddIntAttribute(ax::mojom::IntAttribute::kSetSize, 20);
  3119. tree_update.nodes[1].id = 2;
  3120. tree_update.nodes[1].role = ax::mojom::Role::kListItem;
  3121. tree_update.nodes[2].id = 3;
  3122. tree_update.nodes[2].role = ax::mojom::Role::kListItem;
  3123. tree_update.nodes[2].AddIntAttribute(ax::mojom::IntAttribute::kPosInSet, 13);
  3124. tree_update.nodes[3].id = 4;
  3125. tree_update.nodes[3].role = ax::mojom::Role::kListItem;
  3126. AXTree tree(tree_update);
  3127. // Item1 should have pos of 12, since item2 is assigned a pos of 13.
  3128. AXNode* item1 = tree.GetFromId(2);
  3129. EXPECT_OPTIONAL_EQ(1, item1->GetPosInSet());
  3130. EXPECT_OPTIONAL_EQ(20, item1->GetSetSize());
  3131. AXNode* item2 = tree.GetFromId(3);
  3132. EXPECT_OPTIONAL_EQ(13, item2->GetPosInSet());
  3133. EXPECT_OPTIONAL_EQ(20, item2->GetSetSize());
  3134. // Item2 should have pos of 14, since item2 is assigned a pos of 13.
  3135. AXNode* item3 = tree.GetFromId(4);
  3136. EXPECT_OPTIONAL_EQ(14, item3->GetPosInSet());
  3137. EXPECT_OPTIONAL_EQ(20, item3->GetSetSize());
  3138. }
  3139. // A more difficult test that involves missing PosInSet and SetSize values.
  3140. TEST(AXTreeTest, SetSizePosInSetMissingDifficult) {
  3141. AXTreeUpdate tree_update;
  3142. tree_update.root_id = 1;
  3143. tree_update.nodes.resize(6);
  3144. tree_update.nodes[0].id = 1;
  3145. tree_update.nodes[0].role = ax::mojom::Role::kList;
  3146. tree_update.nodes[0].child_ids = {2, 3, 4, 5, 6};
  3147. tree_update.nodes[1].id = 2;
  3148. tree_update.nodes[1].role = ax::mojom::Role::kListItem; // 1 of 11
  3149. tree_update.nodes[2].id = 3;
  3150. tree_update.nodes[2].role = ax::mojom::Role::kListItem;
  3151. tree_update.nodes[2].AddIntAttribute(ax::mojom::IntAttribute::kPosInSet,
  3152. 5); // 5 of 11
  3153. tree_update.nodes[3].id = 4;
  3154. tree_update.nodes[3].role = ax::mojom::Role::kListItem; // 6 of 11
  3155. tree_update.nodes[4].id = 5;
  3156. tree_update.nodes[4].role = ax::mojom::Role::kListItem;
  3157. tree_update.nodes[4].AddIntAttribute(ax::mojom::IntAttribute::kPosInSet,
  3158. 10); // 10 of 11
  3159. tree_update.nodes[5].id = 6;
  3160. tree_update.nodes[5].role = ax::mojom::Role::kListItem; // 11 of 11
  3161. AXTree tree(tree_update);
  3162. AXNode* item1 = tree.GetFromId(2);
  3163. EXPECT_OPTIONAL_EQ(1, item1->GetPosInSet());
  3164. EXPECT_OPTIONAL_EQ(11, item1->GetSetSize());
  3165. AXNode* item2 = tree.GetFromId(3);
  3166. EXPECT_OPTIONAL_EQ(5, item2->GetPosInSet());
  3167. EXPECT_OPTIONAL_EQ(11, item2->GetSetSize());
  3168. AXNode* item3 = tree.GetFromId(4);
  3169. EXPECT_OPTIONAL_EQ(6, item3->GetPosInSet());
  3170. EXPECT_OPTIONAL_EQ(11, item3->GetSetSize());
  3171. AXNode* item4 = tree.GetFromId(5);
  3172. EXPECT_OPTIONAL_EQ(10, item4->GetPosInSet());
  3173. EXPECT_OPTIONAL_EQ(11, item4->GetSetSize());
  3174. AXNode* item5 = tree.GetFromId(6);
  3175. EXPECT_OPTIONAL_EQ(11, item5->GetPosInSet());
  3176. EXPECT_OPTIONAL_EQ(11, item5->GetSetSize());
  3177. }
  3178. // Tests that code overwrites decreasing SetSize assignments to largest of
  3179. // assigned values.
  3180. TEST(AXTreeTest, SetSizeDecreasing) {
  3181. AXTreeUpdate tree_update;
  3182. tree_update.root_id = 1;
  3183. tree_update.nodes.resize(4);
  3184. tree_update.nodes[0].id = 1;
  3185. tree_update.nodes[0].role = ax::mojom::Role::kList;
  3186. tree_update.nodes[0].child_ids = {2, 3, 4};
  3187. tree_update.nodes[1].id = 2;
  3188. tree_update.nodes[1].role = ax::mojom::Role::kListItem; // 1 of 5
  3189. tree_update.nodes[2].id = 3;
  3190. tree_update.nodes[2].role = ax::mojom::Role::kListItem; // 2 of 5
  3191. tree_update.nodes[2].AddIntAttribute(ax::mojom::IntAttribute::kSetSize, 5);
  3192. tree_update.nodes[3].id = 4;
  3193. tree_update.nodes[3].role = ax::mojom::Role::kListItem; // 3 of 5
  3194. tree_update.nodes[3].AddIntAttribute(ax::mojom::IntAttribute::kSetSize, 4);
  3195. AXTree tree(tree_update);
  3196. AXNode* item1 = tree.GetFromId(2);
  3197. EXPECT_OPTIONAL_EQ(1, item1->GetPosInSet());
  3198. EXPECT_OPTIONAL_EQ(5, item1->GetSetSize());
  3199. AXNode* item2 = tree.GetFromId(3);
  3200. EXPECT_OPTIONAL_EQ(2, item2->GetPosInSet());
  3201. EXPECT_OPTIONAL_EQ(5, item2->GetSetSize());
  3202. AXNode* item3 = tree.GetFromId(4);
  3203. EXPECT_OPTIONAL_EQ(3, item3->GetPosInSet());
  3204. EXPECT_OPTIONAL_EQ(5, item3->GetSetSize());
  3205. }
  3206. // Tests that code overwrites decreasing PosInSet values.
  3207. TEST(AXTreeTest, PosInSetDecreasing) {
  3208. AXTreeUpdate tree_update;
  3209. tree_update.root_id = 1;
  3210. tree_update.nodes.resize(4);
  3211. tree_update.nodes[0].id = 1;
  3212. tree_update.nodes[0].role = ax::mojom::Role::kList;
  3213. tree_update.nodes[0].child_ids = {2, 3, 4};
  3214. tree_update.nodes[1].id = 2;
  3215. tree_update.nodes[1].role = ax::mojom::Role::kListItem; // 1 of 8
  3216. tree_update.nodes[2].id = 3;
  3217. tree_update.nodes[2].role = ax::mojom::Role::kListItem; // 7 of 8
  3218. tree_update.nodes[2].AddIntAttribute(ax::mojom::IntAttribute::kPosInSet, 7);
  3219. tree_update.nodes[3].id = 4;
  3220. tree_update.nodes[3].role = ax::mojom::Role::kListItem; // 8 of 8
  3221. tree_update.nodes[3].AddIntAttribute(ax::mojom::IntAttribute::kPosInSet, 3);
  3222. AXTree tree(tree_update);
  3223. AXNode* item1 = tree.GetFromId(2);
  3224. EXPECT_OPTIONAL_EQ(1, item1->GetPosInSet());
  3225. EXPECT_OPTIONAL_EQ(8, item1->GetSetSize());
  3226. AXNode* item2 = tree.GetFromId(3);
  3227. EXPECT_OPTIONAL_EQ(7, item2->GetPosInSet());
  3228. EXPECT_OPTIONAL_EQ(8, item2->GetSetSize());
  3229. AXNode* item3 = tree.GetFromId(4);
  3230. EXPECT_OPTIONAL_EQ(8, item3->GetPosInSet());
  3231. EXPECT_OPTIONAL_EQ(8, item3->GetSetSize());
  3232. }
  3233. // Tests that code overwrites duplicate PosInSet values. Note this case is
  3234. // tricky; an update to the second element causes an update to the third
  3235. // element.
  3236. TEST(AXTreeTest, PosInSetDuplicates) {
  3237. AXTreeUpdate tree_update;
  3238. tree_update.root_id = 1;
  3239. tree_update.nodes.resize(4);
  3240. tree_update.nodes[0].id = 1;
  3241. tree_update.nodes[0].role = ax::mojom::Role::kList;
  3242. tree_update.nodes[0].child_ids = {2, 3, 4};
  3243. tree_update.nodes[1].id = 2;
  3244. tree_update.nodes[1].role = ax::mojom::Role::kListItem; // 6 of 8
  3245. tree_update.nodes[1].AddIntAttribute(ax::mojom::IntAttribute::kPosInSet, 6);
  3246. tree_update.nodes[2].id = 3;
  3247. tree_update.nodes[2].role = ax::mojom::Role::kListItem; // 7 of 8
  3248. tree_update.nodes[2].AddIntAttribute(ax::mojom::IntAttribute::kPosInSet, 6);
  3249. tree_update.nodes[3].id = 4;
  3250. tree_update.nodes[3].role = ax::mojom::Role::kListItem; // 8 of 8
  3251. tree_update.nodes[3].AddIntAttribute(ax::mojom::IntAttribute::kPosInSet, 7);
  3252. AXTree tree(tree_update);
  3253. AXNode* item1 = tree.GetFromId(2);
  3254. EXPECT_OPTIONAL_EQ(6, item1->GetPosInSet());
  3255. EXPECT_OPTIONAL_EQ(8, item1->GetSetSize());
  3256. AXNode* item2 = tree.GetFromId(3);
  3257. EXPECT_OPTIONAL_EQ(7, item2->GetPosInSet());
  3258. EXPECT_OPTIONAL_EQ(8, item2->GetSetSize());
  3259. AXNode* item3 = tree.GetFromId(4);
  3260. EXPECT_OPTIONAL_EQ(8, item3->GetPosInSet());
  3261. EXPECT_OPTIONAL_EQ(8, item3->GetSetSize());
  3262. }
  3263. // Tests GetPosInSet and GetSetSize when some list items are nested in a generic
  3264. // container.
  3265. TEST(AXTreeTest, SetSizePosInSetNestedContainer) {
  3266. AXTreeUpdate tree_update;
  3267. tree_update.root_id = 1;
  3268. tree_update.nodes.resize(7);
  3269. tree_update.nodes[0].id = 1;
  3270. tree_update.nodes[0].role = ax::mojom::Role::kList;
  3271. tree_update.nodes[0].child_ids = {2, 3, 7};
  3272. tree_update.nodes[1].id = 2;
  3273. tree_update.nodes[1].role = ax::mojom::Role::kListItem; // 1 of 4
  3274. tree_update.nodes[2].id = 3;
  3275. tree_update.nodes[2].role = ax::mojom::Role::kGenericContainer;
  3276. tree_update.nodes[2].child_ids = {4, 5};
  3277. tree_update.nodes[3].id = 4;
  3278. tree_update.nodes[3].role = ax::mojom::Role::kListItem; // 2 of 4
  3279. tree_update.nodes[4].id = 5;
  3280. tree_update.nodes[4].role = ax::mojom::Role::kNone;
  3281. tree_update.nodes[4].child_ids = {6};
  3282. tree_update.nodes[5].id = 6;
  3283. tree_update.nodes[5].role = ax::mojom::Role::kListItem; // 3 of 4
  3284. tree_update.nodes[6].id = 7;
  3285. tree_update.nodes[6].role = ax::mojom::Role::kListItem; // 4 of 4
  3286. AXTree tree(tree_update);
  3287. AXNode* item1 = tree.GetFromId(2);
  3288. EXPECT_OPTIONAL_EQ(1, item1->GetPosInSet());
  3289. EXPECT_OPTIONAL_EQ(4, item1->GetSetSize());
  3290. AXNode* g_container = tree.GetFromId(3);
  3291. EXPECT_FALSE(g_container->GetPosInSet());
  3292. EXPECT_FALSE(g_container->GetSetSize());
  3293. AXNode* item2 = tree.GetFromId(4);
  3294. EXPECT_OPTIONAL_EQ(2, item2->GetPosInSet());
  3295. EXPECT_OPTIONAL_EQ(4, item2->GetSetSize());
  3296. AXNode* ignored = tree.GetFromId(5);
  3297. EXPECT_FALSE(ignored->GetPosInSet());
  3298. EXPECT_FALSE(ignored->GetSetSize());
  3299. AXNode* item3 = tree.GetFromId(6);
  3300. EXPECT_OPTIONAL_EQ(3, item3->GetPosInSet());
  3301. EXPECT_OPTIONAL_EQ(4, item3->GetSetSize());
  3302. AXNode* item4 = tree.GetFromId(7);
  3303. EXPECT_OPTIONAL_EQ(4, item4->GetPosInSet());
  3304. EXPECT_OPTIONAL_EQ(4, item4->GetSetSize());
  3305. }
  3306. // Tests GetSetSize and GetPosInSet are correct, even when list items change.
  3307. // Tests that previously calculated values are not used after tree is updated.
  3308. TEST(AXTreeTest, SetSizePosInSetDeleteItem) {
  3309. AXTreeUpdate initial_state;
  3310. initial_state.root_id = 1;
  3311. initial_state.nodes.resize(4);
  3312. initial_state.nodes[0].id = 1;
  3313. initial_state.nodes[0].role = ax::mojom::Role::kList;
  3314. initial_state.nodes[0].child_ids = {2, 3, 4};
  3315. initial_state.nodes[1].id = 2;
  3316. initial_state.nodes[1].role = ax::mojom::Role::kListItem; // 1 of 3
  3317. initial_state.nodes[2].id = 3;
  3318. initial_state.nodes[2].role = ax::mojom::Role::kListItem; // 2 of 3
  3319. initial_state.nodes[3].id = 4;
  3320. initial_state.nodes[3].role = ax::mojom::Role::kListItem; // 3 of 3
  3321. AXTree tree(initial_state);
  3322. AXNode* item1 = tree.GetFromId(2);
  3323. EXPECT_OPTIONAL_EQ(1, item1->GetPosInSet());
  3324. EXPECT_OPTIONAL_EQ(3, item1->GetSetSize());
  3325. AXNode* item2 = tree.GetFromId(3);
  3326. EXPECT_OPTIONAL_EQ(2, item2->GetPosInSet());
  3327. EXPECT_OPTIONAL_EQ(3, item2->GetSetSize());
  3328. AXNode* item3 = tree.GetFromId(4);
  3329. EXPECT_OPTIONAL_EQ(3, item3->GetPosInSet());
  3330. EXPECT_OPTIONAL_EQ(3, item3->GetSetSize());
  3331. // TreeUpdates only need to describe what changed in tree.
  3332. AXTreeUpdate update = initial_state;
  3333. update.nodes.resize(1);
  3334. update.nodes[0].child_ids = {2, 4}; // Delete item 2 of 3 from list.
  3335. ASSERT_TRUE(tree.Unserialize(update));
  3336. AXNode* new_item1 = tree.GetFromId(2);
  3337. EXPECT_OPTIONAL_EQ(1, new_item1->GetPosInSet());
  3338. EXPECT_OPTIONAL_EQ(2, new_item1->GetSetSize());
  3339. AXNode* new_item2 = tree.GetFromId(4);
  3340. EXPECT_OPTIONAL_EQ(2, new_item2->GetPosInSet());
  3341. EXPECT_OPTIONAL_EQ(2, new_item2->GetSetSize());
  3342. }
  3343. // Tests GetSetSize and GetPosInSet are correct, even when list items change.
  3344. // This test adds an item to the front of a list, which invalidates previously
  3345. // calculated PosInSet and SetSize values. Tests that old values are not
  3346. // used after tree is updated.
  3347. TEST(AXTreeTest, SetSizePosInSetAddItem) {
  3348. AXTreeUpdate initial_state;
  3349. initial_state.root_id = 1;
  3350. initial_state.nodes.resize(4);
  3351. initial_state.nodes[0].id = 1;
  3352. initial_state.nodes[0].role = ax::mojom::Role::kList;
  3353. initial_state.nodes[0].child_ids = {2, 3, 4};
  3354. initial_state.nodes[1].id = 2;
  3355. initial_state.nodes[1].role = ax::mojom::Role::kListItem; // 1 of 3
  3356. initial_state.nodes[2].id = 3;
  3357. initial_state.nodes[2].role = ax::mojom::Role::kListItem; // 2 of 3
  3358. initial_state.nodes[3].id = 4;
  3359. initial_state.nodes[3].role = ax::mojom::Role::kListItem; // 3 of 3
  3360. AXTree tree(initial_state);
  3361. AXNode* item1 = tree.GetFromId(2);
  3362. EXPECT_OPTIONAL_EQ(1, item1->GetPosInSet());
  3363. EXPECT_OPTIONAL_EQ(3, item1->GetSetSize());
  3364. AXNode* item2 = tree.GetFromId(3);
  3365. EXPECT_OPTIONAL_EQ(2, item2->GetPosInSet());
  3366. EXPECT_OPTIONAL_EQ(3, item2->GetSetSize());
  3367. AXNode* item3 = tree.GetFromId(4);
  3368. EXPECT_OPTIONAL_EQ(3, item3->GetPosInSet());
  3369. EXPECT_OPTIONAL_EQ(3, item3->GetSetSize());
  3370. // Insert an item at the beginning of the list.
  3371. AXTreeUpdate update = initial_state;
  3372. update.nodes.resize(2);
  3373. update.nodes[0].id = 1;
  3374. update.nodes[0].child_ids = {5, 2, 3, 4};
  3375. update.nodes[1].id = 5;
  3376. update.nodes[1].role = ax::mojom::Role::kListItem;
  3377. ASSERT_TRUE(tree.Unserialize(update));
  3378. AXNode* new_item1 = tree.GetFromId(5);
  3379. EXPECT_OPTIONAL_EQ(1, new_item1->GetPosInSet());
  3380. EXPECT_OPTIONAL_EQ(4, new_item1->GetSetSize());
  3381. AXNode* new_item2 = tree.GetFromId(2);
  3382. EXPECT_OPTIONAL_EQ(2, new_item2->GetPosInSet());
  3383. EXPECT_OPTIONAL_EQ(4, new_item2->GetSetSize());
  3384. AXNode* new_item3 = tree.GetFromId(3);
  3385. EXPECT_OPTIONAL_EQ(3, new_item3->GetPosInSet());
  3386. EXPECT_OPTIONAL_EQ(4, new_item3->GetSetSize());
  3387. AXNode* new_item4 = tree.GetFromId(4);
  3388. EXPECT_OPTIONAL_EQ(4, new_item4->GetPosInSet());
  3389. EXPECT_OPTIONAL_EQ(4, new_item4->GetSetSize());
  3390. }
  3391. // Tests that the outerlying ordered set reports a SetSize. Ordered sets
  3392. // should not report a PosInSet value other than 0, since they are not
  3393. // considered to be items within a set (even when nested).
  3394. TEST(AXTreeTest, OrderedSetReportsSetSize) {
  3395. AXTreeUpdate tree_update;
  3396. tree_update.root_id = 1;
  3397. tree_update.nodes.resize(12);
  3398. tree_update.nodes[0].id = 1;
  3399. tree_update.nodes[0].role = ax::mojom::Role::kList; // SetSize = 3
  3400. tree_update.nodes[0].child_ids = {2, 3, 4, 7, 8, 9, 12};
  3401. tree_update.nodes[1].id = 2;
  3402. tree_update.nodes[1].role = ax::mojom::Role::kListItem; // 1 of 3
  3403. tree_update.nodes[2].id = 3;
  3404. tree_update.nodes[2].role = ax::mojom::Role::kListItem; // 2 of 3
  3405. tree_update.nodes[3].id = 4;
  3406. tree_update.nodes[3].role = ax::mojom::Role::kList; // SetSize = 2
  3407. tree_update.nodes[3].child_ids = {5, 6};
  3408. tree_update.nodes[4].id = 5;
  3409. tree_update.nodes[4].role = ax::mojom::Role::kListItem; // 1 of 2
  3410. tree_update.nodes[5].id = 6;
  3411. tree_update.nodes[5].role = ax::mojom::Role::kListItem; // 2 of 2
  3412. tree_update.nodes[6].id = 7;
  3413. tree_update.nodes[6].role = ax::mojom::Role::kListItem; // 3 of 3
  3414. tree_update.nodes[7].id = 8;
  3415. tree_update.nodes[7].role = ax::mojom::Role::kList; // SetSize = 0
  3416. tree_update.nodes[8].id = 9;
  3417. tree_update.nodes[8].role =
  3418. ax::mojom::Role::kList; // SetSize = 1 because only 1 item whose role
  3419. // matches
  3420. tree_update.nodes[8].child_ids = {10, 11};
  3421. tree_update.nodes[9].id = 10;
  3422. tree_update.nodes[9].role = ax::mojom::Role::kArticle;
  3423. tree_update.nodes[10].id = 11;
  3424. tree_update.nodes[10].role = ax::mojom::Role::kListItem;
  3425. tree_update.nodes[11].id = 12;
  3426. tree_update.nodes[11].role = ax::mojom::Role::kList;
  3427. tree_update.nodes[11].AddIntAttribute(ax::mojom::IntAttribute::kSetSize, 5);
  3428. AXTree tree(tree_update);
  3429. AXNode* outer_list = tree.GetFromId(1);
  3430. EXPECT_FALSE(outer_list->GetPosInSet());
  3431. EXPECT_OPTIONAL_EQ(3, outer_list->GetSetSize());
  3432. AXNode* outer_list_item1 = tree.GetFromId(2);
  3433. EXPECT_OPTIONAL_EQ(1, outer_list_item1->GetPosInSet());
  3434. EXPECT_OPTIONAL_EQ(3, outer_list_item1->GetSetSize());
  3435. AXNode* outer_list_item2 = tree.GetFromId(3);
  3436. EXPECT_OPTIONAL_EQ(2, outer_list_item2->GetPosInSet());
  3437. EXPECT_OPTIONAL_EQ(3, outer_list_item2->GetSetSize());
  3438. AXNode* outer_list_item3 = tree.GetFromId(7);
  3439. EXPECT_OPTIONAL_EQ(3, outer_list_item3->GetPosInSet());
  3440. EXPECT_OPTIONAL_EQ(3, outer_list_item3->GetSetSize());
  3441. AXNode* inner_list1 = tree.GetFromId(4);
  3442. EXPECT_FALSE(inner_list1->GetPosInSet());
  3443. EXPECT_OPTIONAL_EQ(2, inner_list1->GetSetSize());
  3444. AXNode* inner_list1_item1 = tree.GetFromId(5);
  3445. EXPECT_OPTIONAL_EQ(1, inner_list1_item1->GetPosInSet());
  3446. EXPECT_OPTIONAL_EQ(2, inner_list1_item1->GetSetSize());
  3447. AXNode* inner_list1_item2 = tree.GetFromId(6);
  3448. EXPECT_OPTIONAL_EQ(2, inner_list1_item2->GetPosInSet());
  3449. EXPECT_OPTIONAL_EQ(2, inner_list1_item2->GetSetSize());
  3450. AXNode* inner_list2 = tree.GetFromId(8); // Empty list
  3451. EXPECT_FALSE(inner_list2->GetPosInSet());
  3452. EXPECT_OPTIONAL_EQ(0, inner_list2->GetSetSize());
  3453. AXNode* inner_list3 = tree.GetFromId(9);
  3454. EXPECT_FALSE(inner_list3->GetPosInSet());
  3455. // Only 1 item whose role matches.
  3456. EXPECT_OPTIONAL_EQ(1, inner_list3->GetSetSize());
  3457. AXNode* inner_list3_article1 = tree.GetFromId(10);
  3458. EXPECT_FALSE(inner_list3_article1->GetPosInSet());
  3459. EXPECT_FALSE(inner_list3_article1->GetSetSize());
  3460. AXNode* inner_list3_item1 = tree.GetFromId(11);
  3461. EXPECT_OPTIONAL_EQ(1, inner_list3_item1->GetPosInSet());
  3462. EXPECT_OPTIONAL_EQ(1, inner_list3_item1->GetSetSize());
  3463. AXNode* inner_list4 = tree.GetFromId(12);
  3464. EXPECT_FALSE(inner_list4->GetPosInSet());
  3465. // Even though list is empty, kSetSize attribute was set, so it takes
  3466. // precedence
  3467. EXPECT_OPTIONAL_EQ(5, inner_list4->GetSetSize());
  3468. }
  3469. // Tests GetPosInSet and GetSetSize code on invalid input.
  3470. TEST(AXTreeTest, SetSizePosInSetInvalid) {
  3471. AXTreeUpdate tree_update;
  3472. tree_update.root_id = 1;
  3473. tree_update.nodes.resize(3);
  3474. tree_update.nodes[0].id = 1;
  3475. tree_update.nodes[0].role = ax::mojom::Role::kListItem; // 0 of 0
  3476. tree_update.nodes[0].child_ids = {2, 3};
  3477. tree_update.nodes[1].id = 2;
  3478. tree_update.nodes[1].role = ax::mojom::Role::kListItem;
  3479. tree_update.nodes[1].AddIntAttribute(ax::mojom::IntAttribute::kPosInSet,
  3480. 4); // 0 of 0
  3481. tree_update.nodes[2].id = 3;
  3482. tree_update.nodes[2].role = ax::mojom::Role::kListItem;
  3483. AXTree tree(tree_update);
  3484. AXNode* item1 = tree.GetFromId(1);
  3485. EXPECT_FALSE(item1->GetPosInSet());
  3486. EXPECT_FALSE(item1->GetSetSize());
  3487. AXNode* item2 = tree.GetFromId(2);
  3488. EXPECT_FALSE(item2->GetPosInSet());
  3489. EXPECT_FALSE(item2->GetSetSize());
  3490. AXNode* item3 = tree.GetFromId(3);
  3491. EXPECT_FALSE(item3->GetPosInSet());
  3492. EXPECT_FALSE(item3->GetSetSize());
  3493. }
  3494. // Tests GetPosInSet and GetSetSize code on kRadioButtons. Radio buttons
  3495. // behave differently than other item-like elements; most notably, they do not
  3496. // need to be contained within an ordered set to report a PosInSet or SetSize.
  3497. TEST(AXTreeTest, SetSizePosInSetRadioButtons) {
  3498. AXTreeUpdate tree_update;
  3499. tree_update.root_id = 1;
  3500. tree_update.nodes.resize(13);
  3501. tree_update.nodes[0].id = 1;
  3502. tree_update.nodes[0].child_ids = {2, 3, 4, 10, 13};
  3503. // This test passes because the root node is a kRadioGroup.
  3504. tree_update.nodes[0].role = ax::mojom::Role::kRadioGroup; // Setsize = 5;
  3505. // Radio buttons are not required to be contained within an ordered set.
  3506. tree_update.nodes[1].id = 2;
  3507. tree_update.nodes[1].role = ax::mojom::Role::kRadioButton; // 1 of 5
  3508. tree_update.nodes[1].AddStringAttribute(ax::mojom::StringAttribute::kName,
  3509. "sports");
  3510. tree_update.nodes[1].AddIntAttribute(ax::mojom::IntAttribute::kPosInSet, 1);
  3511. tree_update.nodes[2].id = 3;
  3512. tree_update.nodes[2].role = ax::mojom::Role::kRadioButton; // 2 of 5
  3513. tree_update.nodes[2].AddStringAttribute(ax::mojom::StringAttribute::kName,
  3514. "books");
  3515. tree_update.nodes[2].AddIntAttribute(ax::mojom::IntAttribute::kPosInSet, 2);
  3516. tree_update.nodes[2].AddIntAttribute(ax::mojom::IntAttribute::kSetSize, 5);
  3517. // Radio group with nested generic container.
  3518. tree_update.nodes[3].id = 4;
  3519. tree_update.nodes[3].role = ax::mojom::Role::kRadioGroup; // setsize = 4
  3520. tree_update.nodes[3].child_ids = {5, 6, 7};
  3521. tree_update.nodes[4].id = 5;
  3522. tree_update.nodes[4].role = ax::mojom::Role::kRadioButton;
  3523. tree_update.nodes[4].AddStringAttribute(ax::mojom::StringAttribute::kName,
  3524. "recipes"); // 1 of 4
  3525. tree_update.nodes[5].id = 6;
  3526. tree_update.nodes[5].role = ax::mojom::Role::kRadioButton;
  3527. tree_update.nodes[5].AddStringAttribute(ax::mojom::StringAttribute::kName,
  3528. "recipes"); // 2 of 4
  3529. tree_update.nodes[6].id = 7;
  3530. tree_update.nodes[6].role = ax::mojom::Role::kGenericContainer;
  3531. tree_update.nodes[6].child_ids = {8, 9};
  3532. tree_update.nodes[7].id = 8;
  3533. tree_update.nodes[7].role = ax::mojom::Role::kRadioButton;
  3534. tree_update.nodes[7].AddStringAttribute(ax::mojom::StringAttribute::kName,
  3535. "recipes"); // 3 of 4
  3536. tree_update.nodes[8].id = 9;
  3537. tree_update.nodes[8].role = ax::mojom::Role::kRadioButton;
  3538. tree_update.nodes[8].AddStringAttribute(ax::mojom::StringAttribute::kName,
  3539. "recipes"); // 4 of 4
  3540. // Radio buttons are allowed to be contained within forms.
  3541. tree_update.nodes[9].id = 10;
  3542. tree_update.nodes[9].role = ax::mojom::Role::kForm;
  3543. tree_update.nodes[9].child_ids = {11, 12};
  3544. tree_update.nodes[10].id = 11;
  3545. tree_update.nodes[10].role = ax::mojom::Role::kRadioButton;
  3546. tree_update.nodes[10].AddStringAttribute(ax::mojom::StringAttribute::kName,
  3547. "cities"); // 1 of 2
  3548. tree_update.nodes[11].id = 12;
  3549. tree_update.nodes[11].role = ax::mojom::Role::kRadioButton;
  3550. tree_update.nodes[11].AddStringAttribute(ax::mojom::StringAttribute::kName,
  3551. "cities"); // 2 of 2
  3552. tree_update.nodes[12].id = 13;
  3553. tree_update.nodes[12].role = ax::mojom::Role::kRadioButton; // 4 of 5
  3554. tree_update.nodes[12].AddStringAttribute(ax::mojom::StringAttribute::kName,
  3555. "sports");
  3556. tree_update.nodes[12].AddIntAttribute(ax::mojom::IntAttribute::kPosInSet, 4);
  3557. AXTree tree(tree_update);
  3558. AXNode* sports_button1 = tree.GetFromId(2);
  3559. EXPECT_OPTIONAL_EQ(1, sports_button1->GetPosInSet());
  3560. EXPECT_OPTIONAL_EQ(5, sports_button1->GetSetSize());
  3561. AXNode* books_button = tree.GetFromId(3);
  3562. EXPECT_OPTIONAL_EQ(2, books_button->GetPosInSet());
  3563. EXPECT_OPTIONAL_EQ(5, books_button->GetSetSize());
  3564. AXNode* radiogroup1 = tree.GetFromId(4);
  3565. EXPECT_FALSE(radiogroup1->GetPosInSet());
  3566. EXPECT_OPTIONAL_EQ(4, radiogroup1->GetSetSize());
  3567. AXNode* recipes_button1 = tree.GetFromId(5);
  3568. EXPECT_OPTIONAL_EQ(1, recipes_button1->GetPosInSet());
  3569. EXPECT_OPTIONAL_EQ(4, recipes_button1->GetSetSize());
  3570. AXNode* recipes_button2 = tree.GetFromId(6);
  3571. EXPECT_OPTIONAL_EQ(2, recipes_button2->GetPosInSet());
  3572. EXPECT_OPTIONAL_EQ(4, recipes_button2->GetSetSize());
  3573. AXNode* generic_container = tree.GetFromId(7);
  3574. EXPECT_FALSE(generic_container->GetPosInSet());
  3575. EXPECT_FALSE(generic_container->GetSetSize());
  3576. AXNode* recipes_button3 = tree.GetFromId(8);
  3577. EXPECT_OPTIONAL_EQ(3, recipes_button3->GetPosInSet());
  3578. EXPECT_OPTIONAL_EQ(4, recipes_button3->GetSetSize());
  3579. AXNode* recipes_button4 = tree.GetFromId(9);
  3580. EXPECT_OPTIONAL_EQ(4, recipes_button4->GetPosInSet());
  3581. EXPECT_OPTIONAL_EQ(4, recipes_button4->GetSetSize());
  3582. // Elements with role kForm shouldn't report posinset or setsize
  3583. AXNode* form = tree.GetFromId(10);
  3584. EXPECT_FALSE(form->GetPosInSet());
  3585. EXPECT_FALSE(form->GetSetSize());
  3586. AXNode* cities_button1 = tree.GetFromId(11);
  3587. EXPECT_OPTIONAL_EQ(1, cities_button1->GetPosInSet());
  3588. EXPECT_OPTIONAL_EQ(2, cities_button1->GetSetSize());
  3589. AXNode* cities_button2 = tree.GetFromId(12);
  3590. EXPECT_OPTIONAL_EQ(2, cities_button2->GetPosInSet());
  3591. EXPECT_OPTIONAL_EQ(2, cities_button2->GetSetSize());
  3592. AXNode* sports_button2 = tree.GetFromId(13);
  3593. EXPECT_OPTIONAL_EQ(4, sports_button2->GetPosInSet());
  3594. EXPECT_OPTIONAL_EQ(5, sports_button2->GetSetSize());
  3595. }
  3596. // Tests GetPosInSet and GetSetSize on a list that includes radio buttons.
  3597. // Note that radio buttons do not contribute to the SetSize of the outerlying
  3598. // list.
  3599. TEST(AXTreeTest, SetSizePosInSetRadioButtonsInList) {
  3600. AXTreeUpdate tree_update;
  3601. tree_update.root_id = 1;
  3602. tree_update.nodes.resize(6);
  3603. tree_update.nodes[0].id = 1;
  3604. tree_update.nodes[0].role =
  3605. ax::mojom::Role::kList; // SetSize = 2, since only contains 2 ListItems
  3606. tree_update.nodes[0].child_ids = {2, 3, 4, 5, 6};
  3607. tree_update.nodes[1].id = 2;
  3608. tree_update.nodes[1].role = ax::mojom::Role::kRadioButton; // 1 of 3
  3609. tree_update.nodes[2].id = 3;
  3610. tree_update.nodes[2].role = ax::mojom::Role::kListItem; // 1 of 2
  3611. tree_update.nodes[3].id = 4;
  3612. tree_update.nodes[3].role = ax::mojom::Role::kRadioButton; // 2 of 3
  3613. tree_update.nodes[4].id = 5;
  3614. tree_update.nodes[4].role = ax::mojom::Role::kListItem; // 2 of 2
  3615. tree_update.nodes[5].id = 6;
  3616. tree_update.nodes[5].role = ax::mojom::Role::kRadioButton; // 3 of 3
  3617. AXTree tree(tree_update);
  3618. AXNode* list = tree.GetFromId(1);
  3619. EXPECT_FALSE(list->GetPosInSet());
  3620. EXPECT_OPTIONAL_EQ(2, list->GetSetSize());
  3621. AXNode* radiobutton1 = tree.GetFromId(2);
  3622. EXPECT_OPTIONAL_EQ(1, radiobutton1->GetPosInSet());
  3623. EXPECT_OPTIONAL_EQ(3, radiobutton1->GetSetSize());
  3624. AXNode* item1 = tree.GetFromId(3);
  3625. EXPECT_OPTIONAL_EQ(1, item1->GetPosInSet());
  3626. EXPECT_OPTIONAL_EQ(2, item1->GetSetSize());
  3627. AXNode* radiobutton2 = tree.GetFromId(4);
  3628. EXPECT_OPTIONAL_EQ(2, radiobutton2->GetPosInSet());
  3629. EXPECT_OPTIONAL_EQ(3, radiobutton2->GetSetSize());
  3630. AXNode* item2 = tree.GetFromId(5);
  3631. EXPECT_OPTIONAL_EQ(2, item2->GetPosInSet());
  3632. EXPECT_OPTIONAL_EQ(2, item2->GetSetSize());
  3633. AXNode* radiobutton3 = tree.GetFromId(6);
  3634. EXPECT_OPTIONAL_EQ(3, radiobutton3->GetPosInSet());
  3635. EXPECT_OPTIONAL_EQ(3, radiobutton3->GetSetSize());
  3636. // Ensure that the setsize of list was not modified after calling GetPosInSet
  3637. // and GetSetSize on kRadioButtons.
  3638. EXPECT_FALSE(list->GetPosInSet());
  3639. EXPECT_OPTIONAL_EQ(2, list->GetSetSize());
  3640. }
  3641. // Tests GetPosInSet and GetSetSize on a flat tree representation. According
  3642. // to the tree representation, the three elements are siblings. However,
  3643. // due to the presence of the kHierarchicalLevel attribute, they all belong
  3644. // to different sets.
  3645. TEST(AXTreeTest, SetSizePosInSetFlatTree) {
  3646. AXTreeUpdate tree_update;
  3647. tree_update.root_id = 1;
  3648. tree_update.nodes.resize(4);
  3649. tree_update.nodes[0].id = 1;
  3650. tree_update.nodes[0].role = ax::mojom::Role::kTree;
  3651. tree_update.nodes[0].child_ids = {2, 3, 4};
  3652. tree_update.nodes[1].id = 2;
  3653. tree_update.nodes[1].role = ax::mojom::Role::kTreeItem; // 1 of 1
  3654. tree_update.nodes[1].AddIntAttribute(
  3655. ax::mojom::IntAttribute::kHierarchicalLevel, 1);
  3656. tree_update.nodes[2].id = 3;
  3657. tree_update.nodes[2].role = ax::mojom::Role::kTreeItem; // 1 of 1
  3658. tree_update.nodes[2].AddIntAttribute(
  3659. ax::mojom::IntAttribute::kHierarchicalLevel, 2);
  3660. tree_update.nodes[3].id = 4;
  3661. tree_update.nodes[3].role = ax::mojom::Role::kTreeItem; // 1 of 1
  3662. tree_update.nodes[3].AddIntAttribute(
  3663. ax::mojom::IntAttribute::kHierarchicalLevel, 3);
  3664. AXTree tree(tree_update);
  3665. AXNode* item1_level1 = tree.GetFromId(2);
  3666. EXPECT_OPTIONAL_EQ(1, item1_level1->GetPosInSet());
  3667. EXPECT_OPTIONAL_EQ(1, item1_level1->GetSetSize());
  3668. AXNode* item1_level2 = tree.GetFromId(3);
  3669. EXPECT_OPTIONAL_EQ(1, item1_level2->GetPosInSet());
  3670. EXPECT_OPTIONAL_EQ(1, item1_level2->GetSetSize());
  3671. AXNode* item1_level3 = tree.GetFromId(4);
  3672. EXPECT_OPTIONAL_EQ(1, item1_level3->GetPosInSet());
  3673. EXPECT_OPTIONAL_EQ(1, item1_level3->GetSetSize());
  3674. }
  3675. // Tests GetPosInSet and GetSetSize on a flat tree representation, where only
  3676. // the level is specified.
  3677. TEST(AXTreeTest, SetSizePosInSetFlatTreeLevelsOnly) {
  3678. AXTreeUpdate tree_update;
  3679. tree_update.root_id = 1;
  3680. tree_update.nodes.resize(9);
  3681. tree_update.nodes[0].id = 1;
  3682. tree_update.nodes[0].role = ax::mojom::Role::kTree;
  3683. tree_update.nodes[0].child_ids = {2, 3, 4, 5, 6, 7, 8, 9};
  3684. tree_update.nodes[1].id = 2;
  3685. tree_update.nodes[1].role = ax::mojom::Role::kTreeItem; // 1 of 3
  3686. tree_update.nodes[1].AddIntAttribute(
  3687. ax::mojom::IntAttribute::kHierarchicalLevel, 1);
  3688. tree_update.nodes[2].id = 3;
  3689. tree_update.nodes[2].role = ax::mojom::Role::kTreeItem; // 1 of 2
  3690. tree_update.nodes[2].AddIntAttribute(
  3691. ax::mojom::IntAttribute::kHierarchicalLevel, 2);
  3692. tree_update.nodes[3].id = 4;
  3693. tree_update.nodes[3].role = ax::mojom::Role::kTreeItem; // 2 of 2
  3694. tree_update.nodes[3].AddIntAttribute(
  3695. ax::mojom::IntAttribute::kHierarchicalLevel, 2);
  3696. tree_update.nodes[4].id = 5;
  3697. tree_update.nodes[4].role = ax::mojom::Role::kTreeItem; // 2 of 3
  3698. tree_update.nodes[4].AddIntAttribute(
  3699. ax::mojom::IntAttribute::kHierarchicalLevel, 1);
  3700. tree_update.nodes[5].id = 6;
  3701. tree_update.nodes[5].role = ax::mojom::Role::kTreeItem; // 1 of 3
  3702. tree_update.nodes[5].AddIntAttribute(
  3703. ax::mojom::IntAttribute::kHierarchicalLevel, 2);
  3704. tree_update.nodes[6].id = 7;
  3705. tree_update.nodes[6].role = ax::mojom::Role::kTreeItem; // 2 of 3
  3706. tree_update.nodes[6].AddIntAttribute(
  3707. ax::mojom::IntAttribute::kHierarchicalLevel, 2);
  3708. tree_update.nodes[7].id = 8;
  3709. tree_update.nodes[7].role = ax::mojom::Role::kTreeItem; // 3 of 3
  3710. tree_update.nodes[7].AddIntAttribute(
  3711. ax::mojom::IntAttribute::kHierarchicalLevel, 2);
  3712. tree_update.nodes[8].id = 9;
  3713. tree_update.nodes[8].role = ax::mojom::Role::kTreeItem; // 3 of 3
  3714. tree_update.nodes[8].AddIntAttribute(
  3715. ax::mojom::IntAttribute::kHierarchicalLevel, 1);
  3716. AXTree tree(tree_update);
  3717. // The order in which we query the nodes should not matter.
  3718. AXNode* item3_level1 = tree.GetFromId(9);
  3719. EXPECT_OPTIONAL_EQ(3, item3_level1->GetPosInSet());
  3720. EXPECT_OPTIONAL_EQ(3, item3_level1->GetSetSize());
  3721. AXNode* item3_level2a = tree.GetFromId(8);
  3722. EXPECT_OPTIONAL_EQ(3, item3_level2a->GetPosInSet());
  3723. EXPECT_OPTIONAL_EQ(3, item3_level2a->GetSetSize());
  3724. AXNode* item2_level2a = tree.GetFromId(7);
  3725. EXPECT_OPTIONAL_EQ(2, item2_level2a->GetPosInSet());
  3726. EXPECT_OPTIONAL_EQ(3, item2_level2a->GetSetSize());
  3727. AXNode* item1_level2a = tree.GetFromId(6);
  3728. EXPECT_OPTIONAL_EQ(1, item1_level2a->GetPosInSet());
  3729. EXPECT_OPTIONAL_EQ(3, item1_level2a->GetSetSize());
  3730. AXNode* item2_level1 = tree.GetFromId(5);
  3731. EXPECT_OPTIONAL_EQ(2, item2_level1->GetPosInSet());
  3732. EXPECT_OPTIONAL_EQ(3, item2_level1->GetSetSize());
  3733. AXNode* item2_level2 = tree.GetFromId(4);
  3734. EXPECT_OPTIONAL_EQ(2, item2_level2->GetPosInSet());
  3735. EXPECT_OPTIONAL_EQ(2, item2_level2->GetSetSize());
  3736. AXNode* item1_level2 = tree.GetFromId(3);
  3737. EXPECT_OPTIONAL_EQ(1, item1_level2->GetPosInSet());
  3738. EXPECT_OPTIONAL_EQ(2, item1_level2->GetSetSize());
  3739. AXNode* item1_level1 = tree.GetFromId(2);
  3740. EXPECT_OPTIONAL_EQ(1, item1_level1->GetPosInSet());
  3741. EXPECT_OPTIONAL_EQ(3, item1_level1->GetSetSize());
  3742. AXNode* ordered_set = tree.GetFromId(1);
  3743. EXPECT_OPTIONAL_EQ(3, ordered_set->GetSetSize());
  3744. }
  3745. // Tests that GetPosInSet and GetSetSize work while a tree is being
  3746. // unserialized.
  3747. TEST(AXTreeTest, SetSizePosInSetSubtreeDeleted) {
  3748. AXTreeUpdate initial_state;
  3749. initial_state.root_id = 1;
  3750. initial_state.nodes.resize(3);
  3751. initial_state.nodes[0].id = 1;
  3752. initial_state.nodes[0].role = ax::mojom::Role::kTree;
  3753. initial_state.nodes[0].child_ids = {2, 3};
  3754. initial_state.nodes[1].id = 2;
  3755. initial_state.nodes[1].role = ax::mojom::Role::kTreeItem;
  3756. initial_state.nodes[2].id = 3;
  3757. initial_state.nodes[2].role = ax::mojom::Role::kTreeItem;
  3758. AXTree tree(initial_state);
  3759. AXNode* tree_node = tree.GetFromId(1);
  3760. AXNode* item = tree.GetFromId(3);
  3761. // This should work normally.
  3762. EXPECT_OPTIONAL_EQ(2, item->GetPosInSet());
  3763. EXPECT_OPTIONAL_EQ(2, item->GetSetSize());
  3764. // Remove item from tree.
  3765. AXTreeUpdate tree_update = initial_state;
  3766. tree_update.nodes.resize(1);
  3767. tree_update.nodes[0].child_ids = {2};
  3768. ASSERT_TRUE(tree.Unserialize(tree_update));
  3769. // These values are lazily created, so to test that they fail when
  3770. // called in the middle of a tree update, fake the update state.
  3771. {
  3772. ScopedTreeUpdateInProgressStateSetter tree_update_in_progress(tree);
  3773. ASSERT_FALSE(tree_node->GetPosInSet());
  3774. ASSERT_FALSE(tree_node->GetSetSize());
  3775. // Then reset the state to make sure we have the expected values after
  3776. // |Unserialize|.
  3777. } // tree_update_in_progress.
  3778. ASSERT_FALSE(tree_node->GetPosInSet());
  3779. EXPECT_OPTIONAL_EQ(1, tree_node->GetSetSize());
  3780. }
  3781. // Tests that GetPosInSet and GetSetSize work when there are ignored nodes.
  3782. TEST(AXTreeTest, SetSizePosInSetIgnoredItem) {
  3783. AXTreeUpdate initial_state;
  3784. initial_state.root_id = 1;
  3785. initial_state.nodes.resize(3);
  3786. initial_state.nodes[0].id = 1;
  3787. initial_state.nodes[0].role = ax::mojom::Role::kTree;
  3788. initial_state.nodes[0].child_ids = {2, 3};
  3789. initial_state.nodes[1].id = 2;
  3790. initial_state.nodes[1].role = ax::mojom::Role::kTreeItem;
  3791. initial_state.nodes[2].id = 3;
  3792. initial_state.nodes[2].role = ax::mojom::Role::kTreeItem;
  3793. AXTree tree(initial_state);
  3794. AXNode* tree_node = tree.GetFromId(1);
  3795. AXNode* item1 = tree.GetFromId(2);
  3796. AXNode* item2 = tree.GetFromId(3);
  3797. // This should work normally.
  3798. ASSERT_FALSE(tree_node->GetPosInSet());
  3799. EXPECT_OPTIONAL_EQ(2, tree_node->GetSetSize());
  3800. EXPECT_OPTIONAL_EQ(1, item1->GetPosInSet());
  3801. EXPECT_OPTIONAL_EQ(2, item1->GetSetSize());
  3802. EXPECT_OPTIONAL_EQ(2, item2->GetPosInSet());
  3803. EXPECT_OPTIONAL_EQ(2, item2->GetSetSize());
  3804. // Remove item from tree.
  3805. AXTreeUpdate tree_update;
  3806. tree_update.nodes.resize(1);
  3807. tree_update.nodes[0] = initial_state.nodes[1];
  3808. tree_update.nodes[0].AddState(ax::mojom::State::kIgnored);
  3809. ASSERT_TRUE(tree.Unserialize(tree_update));
  3810. ASSERT_FALSE(tree_node->GetPosInSet());
  3811. EXPECT_OPTIONAL_EQ(1, tree_node->GetSetSize());
  3812. // Ignored nodes are not part of ordered sets.
  3813. EXPECT_FALSE(item1->GetPosInSet());
  3814. EXPECT_FALSE(item1->GetSetSize());
  3815. EXPECT_OPTIONAL_EQ(1, item2->GetPosInSet());
  3816. EXPECT_OPTIONAL_EQ(1, item2->GetSetSize());
  3817. }
  3818. // Tests that kPopUpButtons are assigned the SetSize of the wrapped
  3819. // kMenuListPopup, if one is present.
  3820. TEST(AXTreeTest, SetSizePosInSetPopUpButton) {
  3821. AXTreeUpdate initial_state;
  3822. initial_state.root_id = 1;
  3823. initial_state.nodes.resize(6);
  3824. initial_state.nodes[0].id = 1;
  3825. initial_state.nodes[0].child_ids = {2, 3};
  3826. initial_state.nodes[1].id = 2;
  3827. initial_state.nodes[1].role = ax::mojom::Role::kPopUpButton;
  3828. initial_state.nodes[2].id = 3;
  3829. initial_state.nodes[2].role = ax::mojom::Role::kPopUpButton;
  3830. initial_state.nodes[2].child_ids = {4};
  3831. initial_state.nodes[3].id = 4;
  3832. initial_state.nodes[3].role = ax::mojom::Role::kMenuListPopup;
  3833. initial_state.nodes[3].child_ids = {5, 6};
  3834. initial_state.nodes[4].id = 5;
  3835. initial_state.nodes[4].role = ax::mojom::Role::kMenuListOption;
  3836. initial_state.nodes[5].id = 6;
  3837. initial_state.nodes[5].role = ax::mojom::Role::kMenuListOption;
  3838. AXTree tree(initial_state);
  3839. // The first popupbutton should have SetSize of 0.
  3840. AXNode* popup_button_1 = tree.GetFromId(2);
  3841. EXPECT_OPTIONAL_EQ(0, popup_button_1->GetSetSize());
  3842. // The second popupbutton should have SetSize of 2, since the menulistpopup
  3843. // that it wraps has a SetSize of 2.
  3844. AXNode* popup_button_2 = tree.GetFromId(3);
  3845. EXPECT_OPTIONAL_EQ(2, popup_button_2->GetSetSize());
  3846. }
  3847. // Tests that PosInSet and SetSize are still correctly calculated when there
  3848. // are nodes with role of kUnknown layered between items and ordered set.
  3849. TEST(AXTreeTest, SetSizePosInSetUnkown) {
  3850. AXTreeUpdate initial_state;
  3851. initial_state.root_id = 1;
  3852. initial_state.nodes.resize(5);
  3853. initial_state.nodes[0].id = 1;
  3854. initial_state.nodes[0].child_ids = {2};
  3855. initial_state.nodes[0].role = ax::mojom::Role::kMenu;
  3856. initial_state.nodes[1].id = 2;
  3857. initial_state.nodes[1].role = ax::mojom::Role::kUnknown;
  3858. initial_state.nodes[1].child_ids = {3};
  3859. initial_state.nodes[2].id = 3;
  3860. initial_state.nodes[2].role = ax::mojom::Role::kUnknown;
  3861. initial_state.nodes[2].child_ids = {4, 5};
  3862. initial_state.nodes[3].id = 4;
  3863. initial_state.nodes[3].role = ax::mojom::Role::kMenuItem;
  3864. initial_state.nodes[4].id = 5;
  3865. initial_state.nodes[4].role = ax::mojom::Role::kMenuItem;
  3866. AXTree tree(initial_state);
  3867. AXNode* menu = tree.GetFromId(1);
  3868. EXPECT_OPTIONAL_EQ(2, menu->GetSetSize());
  3869. AXNode* item1 = tree.GetFromId(4);
  3870. EXPECT_OPTIONAL_EQ(1, item1->GetPosInSet());
  3871. EXPECT_OPTIONAL_EQ(2, item1->GetSetSize());
  3872. AXNode* item2 = tree.GetFromId(5);
  3873. EXPECT_OPTIONAL_EQ(2, item2->GetPosInSet());
  3874. EXPECT_OPTIONAL_EQ(2, item2->GetSetSize());
  3875. }
  3876. TEST(AXTreeTest, SetSizePosInSetMenuItemValidChildOfMenuListPopup) {
  3877. AXTreeUpdate initial_state;
  3878. initial_state.root_id = 1;
  3879. initial_state.nodes.resize(3);
  3880. initial_state.nodes[0].id = 1;
  3881. initial_state.nodes[0].child_ids = {2, 3};
  3882. initial_state.nodes[0].role = ax::mojom::Role::kMenuListPopup;
  3883. initial_state.nodes[1].id = 2;
  3884. initial_state.nodes[1].role = ax::mojom::Role::kMenuItem;
  3885. initial_state.nodes[2].id = 3;
  3886. initial_state.nodes[2].role = ax::mojom::Role::kMenuListOption;
  3887. AXTree tree(initial_state);
  3888. AXNode* menu = tree.GetFromId(1);
  3889. EXPECT_OPTIONAL_EQ(2, menu->GetSetSize());
  3890. AXNode* item1 = tree.GetFromId(2);
  3891. EXPECT_OPTIONAL_EQ(1, item1->GetPosInSet());
  3892. EXPECT_OPTIONAL_EQ(2, item1->GetSetSize());
  3893. AXNode* item2 = tree.GetFromId(3);
  3894. EXPECT_OPTIONAL_EQ(2, item2->GetPosInSet());
  3895. EXPECT_OPTIONAL_EQ(2, item2->GetSetSize());
  3896. }
  3897. TEST(AXTreeTest, SetSizePostInSetListBoxOptionWithGroup) {
  3898. AXTreeUpdate initial_state;
  3899. initial_state.root_id = 1;
  3900. initial_state.nodes.resize(7);
  3901. initial_state.nodes[0].id = 1;
  3902. initial_state.nodes[0].child_ids = {2, 3};
  3903. initial_state.nodes[0].role = ax::mojom::Role::kListBox;
  3904. initial_state.nodes[1].id = 2;
  3905. initial_state.nodes[1].child_ids = {4, 5};
  3906. initial_state.nodes[1].role = ax::mojom::Role::kGroup;
  3907. initial_state.nodes[2].id = 3;
  3908. initial_state.nodes[2].child_ids = {6, 7};
  3909. initial_state.nodes[2].role = ax::mojom::Role::kGroup;
  3910. initial_state.nodes[3].id = 4;
  3911. initial_state.nodes[3].role = ax::mojom::Role::kListBoxOption;
  3912. initial_state.nodes[4].id = 5;
  3913. initial_state.nodes[4].role = ax::mojom::Role::kListBoxOption;
  3914. initial_state.nodes[5].id = 6;
  3915. initial_state.nodes[5].role = ax::mojom::Role::kListBoxOption;
  3916. initial_state.nodes[6].id = 7;
  3917. initial_state.nodes[6].role = ax::mojom::Role::kListBoxOption;
  3918. AXTree tree(initial_state);
  3919. AXNode* listbox_option1 = tree.GetFromId(4);
  3920. EXPECT_OPTIONAL_EQ(1, listbox_option1->GetPosInSet());
  3921. EXPECT_OPTIONAL_EQ(4, listbox_option1->GetSetSize());
  3922. AXNode* listbox_option2 = tree.GetFromId(5);
  3923. EXPECT_OPTIONAL_EQ(2, listbox_option2->GetPosInSet());
  3924. EXPECT_OPTIONAL_EQ(4, listbox_option2->GetSetSize());
  3925. AXNode* listbox_option3 = tree.GetFromId(6);
  3926. EXPECT_OPTIONAL_EQ(3, listbox_option3->GetPosInSet());
  3927. EXPECT_OPTIONAL_EQ(4, listbox_option3->GetSetSize());
  3928. AXNode* listbox_option4 = tree.GetFromId(7);
  3929. EXPECT_OPTIONAL_EQ(4, listbox_option4->GetPosInSet());
  3930. EXPECT_OPTIONAL_EQ(4, listbox_option4->GetSetSize());
  3931. }
  3932. TEST(AXTreeTest, SetSizePosInSetGroup) {
  3933. // The behavior of a group changes depending on the context it appears in
  3934. // i.e. if it appears alone vs. if it is contained within another set-like
  3935. // element. The below example shows a group standing alone:
  3936. //
  3937. // <ul role="group"> <!-- SetSize = 3 -->
  3938. // <li role="menuitemradio" aria-checked="true">Small</li>
  3939. // <li role="menuitemradio" aria-checked="false">Medium</li>
  3940. // <li role="menuitemradio" aria-checked="false">Large</li>
  3941. // </ul>
  3942. //
  3943. // However, when it is contained within another set-like element, like a
  3944. // listbox, it should simply act like a generic container:
  3945. //
  3946. // <div role="listbox"> <!-- SetSize = 3 -->
  3947. // <div role="option">Red</div> <!-- 1 of 3 -->
  3948. // <div role="option">Yellow</div> <!-- 2 of 3 -->
  3949. // <div role="group"> <!-- SetSize = 0 -->
  3950. // <div role="option">Blue</div> <!-- 3 of 3 -->
  3951. // </div>
  3952. // </div>
  3953. //
  3954. // Please note: the GetPosInSet and GetSetSize functions take slightly
  3955. // different code paths when initially run on items vs. the container.
  3956. // Exercise both code paths in this test.
  3957. AXTreeUpdate tree_update;
  3958. tree_update.root_id = 1;
  3959. tree_update.nodes.resize(6);
  3960. tree_update.nodes[0].id = 1;
  3961. tree_update.nodes[0].role = ax::mojom::Role::kMenu; // SetSize = 4
  3962. tree_update.nodes[0].child_ids = {2, 6};
  3963. tree_update.nodes[1].id = 2;
  3964. tree_update.nodes[1].role = ax::mojom::Role::kGroup; // SetSize = 0
  3965. tree_update.nodes[1].child_ids = {3, 4, 5};
  3966. tree_update.nodes[2].id = 3;
  3967. tree_update.nodes[2].role = ax::mojom::Role::kMenuItemRadio; // 1 of 4
  3968. tree_update.nodes[3].id = 4;
  3969. tree_update.nodes[3].role = ax::mojom::Role::kMenuItemRadio; // 2 of 4
  3970. tree_update.nodes[4].id = 5;
  3971. tree_update.nodes[4].role = ax::mojom::Role::kMenuItemRadio; // 3 of 4
  3972. tree_update.nodes[5].id = 6;
  3973. tree_update.nodes[5].role = ax::mojom::Role::kMenuItemRadio; // 4 of 4
  3974. AXTree tree(tree_update);
  3975. // Get data on kMenu first.
  3976. AXNode* menu = tree.GetFromId(1);
  3977. EXPECT_OPTIONAL_EQ(4, menu->GetSetSize());
  3978. AXNode* group = tree.GetFromId(2);
  3979. EXPECT_FALSE(group->GetSetSize());
  3980. // The below values should have already been computed and cached.
  3981. AXNode* item1 = tree.GetFromId(3);
  3982. EXPECT_OPTIONAL_EQ(1, item1->GetPosInSet());
  3983. EXPECT_OPTIONAL_EQ(4, item1->GetSetSize());
  3984. AXNode* item4 = tree.GetFromId(6);
  3985. EXPECT_OPTIONAL_EQ(4, item4->GetPosInSet());
  3986. EXPECT_OPTIONAL_EQ(4, item4->GetSetSize());
  3987. AXTreeUpdate next_tree_update;
  3988. next_tree_update.root_id = 1;
  3989. next_tree_update.nodes.resize(6);
  3990. next_tree_update.nodes[0].id = 1;
  3991. next_tree_update.nodes[0].role = ax::mojom::Role::kListBox; // SetSize = 4
  3992. next_tree_update.nodes[0].child_ids = {2, 6};
  3993. next_tree_update.nodes[1].id = 2;
  3994. next_tree_update.nodes[1].role = ax::mojom::Role::kGroup; // SetSize = 0
  3995. next_tree_update.nodes[1].child_ids = {3, 4, 5};
  3996. next_tree_update.nodes[2].id = 3;
  3997. next_tree_update.nodes[2].role = ax::mojom::Role::kListBoxOption; // 1 of 4
  3998. next_tree_update.nodes[3].id = 4;
  3999. next_tree_update.nodes[3].role = ax::mojom::Role::kListBoxOption; // 2 of 4
  4000. next_tree_update.nodes[4].id = 5;
  4001. next_tree_update.nodes[4].role = ax::mojom::Role::kListBoxOption; // 3 of 4
  4002. next_tree_update.nodes[5].id = 6;
  4003. next_tree_update.nodes[5].role = ax::mojom::Role::kListBoxOption; // 4 of 4
  4004. AXTree next_tree(next_tree_update);
  4005. // Get data on kListBoxOption first.
  4006. AXNode* option1 = next_tree.GetFromId(3);
  4007. EXPECT_OPTIONAL_EQ(1, option1->GetPosInSet());
  4008. EXPECT_OPTIONAL_EQ(4, option1->GetSetSize());
  4009. AXNode* option2 = next_tree.GetFromId(4);
  4010. EXPECT_OPTIONAL_EQ(2, option2->GetPosInSet());
  4011. EXPECT_OPTIONAL_EQ(4, option2->GetSetSize());
  4012. AXNode* option3 = next_tree.GetFromId(5);
  4013. EXPECT_OPTIONAL_EQ(3, option3->GetPosInSet());
  4014. EXPECT_OPTIONAL_EQ(4, option3->GetSetSize());
  4015. AXNode* option4 = next_tree.GetFromId(6);
  4016. EXPECT_OPTIONAL_EQ(4, option4->GetPosInSet());
  4017. EXPECT_OPTIONAL_EQ(4, option4->GetSetSize());
  4018. AXNode* next_group = next_tree.GetFromId(2);
  4019. EXPECT_FALSE(next_group->GetSetSize());
  4020. // The below value should have already been computed and cached.
  4021. AXNode* listbox = next_tree.GetFromId(1);
  4022. EXPECT_OPTIONAL_EQ(4, listbox->GetSetSize());
  4023. // Standalone groups are allowed.
  4024. AXTreeUpdate third_tree_update;
  4025. third_tree_update.root_id = 1;
  4026. third_tree_update.nodes.resize(3);
  4027. third_tree_update.nodes[0].id = 1;
  4028. third_tree_update.nodes[0].role = ax::mojom::Role::kGroup;
  4029. third_tree_update.nodes[0].child_ids = {2, 3};
  4030. third_tree_update.nodes[1].id = 2;
  4031. third_tree_update.nodes[1].role = ax::mojom::Role::kListItem;
  4032. third_tree_update.nodes[2].id = 3;
  4033. third_tree_update.nodes[2].role = ax::mojom::Role::kListItem;
  4034. AXTree third_tree(third_tree_update);
  4035. // Ensure that groups can't also stand alone.
  4036. AXNode* last_group = third_tree.GetFromId(1);
  4037. EXPECT_OPTIONAL_EQ(2, last_group->GetSetSize());
  4038. AXNode* list_item1 = third_tree.GetFromId(2);
  4039. EXPECT_OPTIONAL_EQ(1, list_item1->GetPosInSet());
  4040. EXPECT_OPTIONAL_EQ(2, list_item1->GetSetSize());
  4041. AXNode* list_item2 = third_tree.GetFromId(3);
  4042. EXPECT_OPTIONAL_EQ(2, list_item2->GetPosInSet());
  4043. EXPECT_OPTIONAL_EQ(2, list_item2->GetSetSize());
  4044. // Test nested groups.
  4045. AXTreeUpdate last_tree_update;
  4046. last_tree_update.root_id = 1;
  4047. last_tree_update.nodes.resize(6);
  4048. last_tree_update.nodes[0].id = 1;
  4049. last_tree_update.nodes[0].role = ax::mojom::Role::kMenuBar;
  4050. last_tree_update.nodes[0].child_ids = {2};
  4051. last_tree_update.nodes[1].id = 2;
  4052. last_tree_update.nodes[1].role = ax::mojom::Role::kGroup;
  4053. last_tree_update.nodes[1].child_ids = {3, 4};
  4054. last_tree_update.nodes[2].id = 3;
  4055. last_tree_update.nodes[2].role = ax::mojom::Role::kMenuItemCheckBox;
  4056. last_tree_update.nodes[3].id = 4;
  4057. last_tree_update.nodes[3].role = ax::mojom::Role::kGroup;
  4058. last_tree_update.nodes[3].child_ids = {5, 6};
  4059. last_tree_update.nodes[4].id = 5;
  4060. last_tree_update.nodes[4].role = ax::mojom::Role::kMenuItemCheckBox;
  4061. last_tree_update.nodes[5].id = 6;
  4062. last_tree_update.nodes[5].role = ax::mojom::Role::kMenuItemCheckBox;
  4063. AXTree last_tree(last_tree_update);
  4064. AXNode* checkbox1 = last_tree.GetFromId(3);
  4065. EXPECT_OPTIONAL_EQ(1, checkbox1->GetPosInSet());
  4066. EXPECT_OPTIONAL_EQ(3, checkbox1->GetSetSize());
  4067. AXNode* checkbox2 = last_tree.GetFromId(5);
  4068. EXPECT_OPTIONAL_EQ(2, checkbox2->GetPosInSet());
  4069. EXPECT_OPTIONAL_EQ(3, checkbox2->GetSetSize());
  4070. AXNode* checkbox3 = last_tree.GetFromId(6);
  4071. EXPECT_OPTIONAL_EQ(3, checkbox3->GetPosInSet());
  4072. EXPECT_OPTIONAL_EQ(3, checkbox3->GetSetSize());
  4073. AXNode* menu_bar = last_tree.GetFromId(1);
  4074. EXPECT_OPTIONAL_EQ(3, menu_bar->GetSetSize());
  4075. AXNode* outer_group = last_tree.GetFromId(2);
  4076. EXPECT_FALSE(outer_group->GetSetSize());
  4077. AXNode* inner_group = last_tree.GetFromId(4);
  4078. EXPECT_FALSE(inner_group->GetSetSize());
  4079. }
  4080. TEST(AXTreeTest, SetSizePosInSetHidden) {
  4081. AXTreeUpdate tree_update;
  4082. tree_update.root_id = 1;
  4083. tree_update.nodes.resize(6);
  4084. tree_update.nodes[0].id = 1;
  4085. tree_update.nodes[0].role = ax::mojom::Role::kListBox; // SetSize = 4
  4086. tree_update.nodes[0].child_ids = {2, 3, 4, 5, 6};
  4087. tree_update.nodes[1].id = 2;
  4088. tree_update.nodes[1].role = ax::mojom::Role::kListBoxOption; // 1 of 4
  4089. tree_update.nodes[2].id = 3;
  4090. tree_update.nodes[2].role = ax::mojom::Role::kListBoxOption; // 2 of 4
  4091. tree_update.nodes[3].id = 4;
  4092. tree_update.nodes[3].role = ax::mojom::Role::kListBoxOption; // Hidden
  4093. tree_update.nodes[3].AddState(ax::mojom::State::kInvisible);
  4094. tree_update.nodes[4].id = 5;
  4095. tree_update.nodes[4].role = ax::mojom::Role::kListBoxOption; // 3 of 4
  4096. tree_update.nodes[5].id = 6;
  4097. tree_update.nodes[5].role = ax::mojom::Role::kListBoxOption; // 4 of 4
  4098. AXTree tree(tree_update);
  4099. AXNode* list_box = tree.GetFromId(1);
  4100. EXPECT_OPTIONAL_EQ(4, list_box->GetSetSize());
  4101. AXNode* option1 = tree.GetFromId(2);
  4102. EXPECT_OPTIONAL_EQ(1, option1->GetPosInSet());
  4103. EXPECT_OPTIONAL_EQ(4, option1->GetSetSize());
  4104. AXNode* option2 = tree.GetFromId(3);
  4105. EXPECT_OPTIONAL_EQ(2, option2->GetPosInSet());
  4106. EXPECT_OPTIONAL_EQ(4, option2->GetSetSize());
  4107. AXNode* option_hidden = tree.GetFromId(4);
  4108. EXPECT_FALSE(option_hidden->GetPosInSet());
  4109. EXPECT_FALSE(option_hidden->GetSetSize());
  4110. AXNode* option3 = tree.GetFromId(5);
  4111. EXPECT_OPTIONAL_EQ(3, option3->GetPosInSet());
  4112. EXPECT_OPTIONAL_EQ(4, option3->GetSetSize());
  4113. AXNode* option4 = tree.GetFromId(6);
  4114. EXPECT_OPTIONAL_EQ(4, option4->GetPosInSet());
  4115. EXPECT_OPTIONAL_EQ(4, option4->GetSetSize());
  4116. }
  4117. // Tests that we get the correct PosInSet and SetSize values when using an
  4118. // aria-controls relationship.
  4119. TEST(AXTreeTest, SetSizePosInSetControls) {
  4120. std::vector<int32_t> three;
  4121. three.push_back(3);
  4122. std::vector<int32_t> hundred;
  4123. hundred.push_back(100);
  4124. std::vector<int32_t> eight;
  4125. eight.push_back(8);
  4126. AXTreeUpdate tree_update;
  4127. tree_update.root_id = 1;
  4128. tree_update.nodes.resize(8);
  4129. tree_update.nodes[0].id = 1;
  4130. tree_update.nodes[0].role = ax::mojom::Role::kGenericContainer;
  4131. tree_update.nodes[0].child_ids = {2, 3, 7, 8};
  4132. tree_update.nodes[1].id = 2;
  4133. tree_update.nodes[1].role = ax::mojom::Role::kPopUpButton; // SetSize = 3
  4134. tree_update.nodes[1].AddIntListAttribute(
  4135. ax::mojom::IntListAttribute::kControlsIds, three);
  4136. tree_update.nodes[1].SetHasPopup(ax::mojom::HasPopup::kMenu);
  4137. tree_update.nodes[2].id = 3;
  4138. tree_update.nodes[2].role = ax::mojom::Role::kMenu; // SetSize = 3
  4139. tree_update.nodes[2].child_ids = {4, 5, 6};
  4140. tree_update.nodes[3].id = 4;
  4141. tree_update.nodes[3].role = ax::mojom::Role::kMenuItem; // 1 of 3
  4142. tree_update.nodes[4].id = 5;
  4143. tree_update.nodes[4].role = ax::mojom::Role::kMenuItem; // 2 of 3
  4144. tree_update.nodes[5].id = 6;
  4145. tree_update.nodes[5].role = ax::mojom::Role::kMenuItem; // 3 of 3
  4146. tree_update.nodes[6].id = 7;
  4147. tree_update.nodes[6].role =
  4148. ax::mojom::Role::kPopUpButton; // Test an invalid controls id.
  4149. tree_update.nodes[6].AddIntListAttribute(
  4150. ax::mojom::IntListAttribute::kControlsIds, hundred);
  4151. // GetSetSize should handle self-references e.g. if a popup button controls
  4152. // itself.
  4153. tree_update.nodes[7].id = 8;
  4154. tree_update.nodes[7].role = ax::mojom::Role::kPopUpButton;
  4155. tree_update.nodes[7].AddIntListAttribute(
  4156. ax::mojom::IntListAttribute::kControlsIds, eight);
  4157. AXTree tree(tree_update);
  4158. AXNode* button = tree.GetFromId(2);
  4159. EXPECT_OPTIONAL_EQ(3, button->GetSetSize());
  4160. EXPECT_FALSE(button->GetPosInSet());
  4161. AXNode* menu = tree.GetFromId(3);
  4162. EXPECT_OPTIONAL_EQ(3, menu->GetSetSize());
  4163. AXNode* item = tree.GetFromId(4);
  4164. EXPECT_OPTIONAL_EQ(1, item->GetPosInSet());
  4165. EXPECT_OPTIONAL_EQ(3, item->GetSetSize());
  4166. item = tree.GetFromId(5);
  4167. EXPECT_OPTIONAL_EQ(2, item->GetPosInSet());
  4168. EXPECT_OPTIONAL_EQ(3, item->GetSetSize());
  4169. item = tree.GetFromId(6);
  4170. EXPECT_OPTIONAL_EQ(3, item->GetPosInSet());
  4171. EXPECT_OPTIONAL_EQ(3, item->GetSetSize());
  4172. button = tree.GetFromId(7);
  4173. EXPECT_OPTIONAL_EQ(0, button->GetSetSize());
  4174. button = tree.GetFromId(8);
  4175. EXPECT_OPTIONAL_EQ(0, button->GetSetSize());
  4176. }
  4177. // Tests GetPosInSet and GetSetSize return the assigned int attribute values
  4178. // when a pop-up button is a leaf node.
  4179. TEST(AXTreeTest, SetSizePosInSetLeafPopUpButton) {
  4180. AXTreeUpdate tree_update;
  4181. tree_update.root_id = 1;
  4182. tree_update.nodes.resize(2);
  4183. tree_update.nodes[0].id = 1;
  4184. tree_update.nodes[0].role = ax::mojom::Role::kGenericContainer;
  4185. tree_update.nodes[0].child_ids = {2};
  4186. tree_update.nodes[1].id = 2;
  4187. tree_update.nodes[1].role = ax::mojom::Role::kPopUpButton;
  4188. tree_update.nodes[1].AddIntAttribute(ax::mojom::IntAttribute::kPosInSet, 3);
  4189. tree_update.nodes[1].AddIntAttribute(ax::mojom::IntAttribute::kSetSize, 77);
  4190. AXTree tree(tree_update);
  4191. AXNode* pop_up_button = tree.GetFromId(2);
  4192. EXPECT_OPTIONAL_EQ(3, pop_up_button->GetPosInSet());
  4193. EXPECT_OPTIONAL_EQ(77, pop_up_button->GetSetSize());
  4194. }
  4195. TEST(AXTreeTest, OnNodeWillBeDeletedHasValidUnignoredParent) {
  4196. AXTreeUpdate initial_state;
  4197. initial_state.root_id = 1;
  4198. initial_state.nodes.resize(3);
  4199. initial_state.nodes[0].id = 1;
  4200. initial_state.nodes[0].role = ax::mojom::Role::kRootWebArea;
  4201. initial_state.nodes[0].child_ids = {2};
  4202. initial_state.nodes[1].id = 2;
  4203. initial_state.nodes[1].role = ax::mojom::Role::kGenericContainer;
  4204. initial_state.nodes[1].child_ids = {3};
  4205. initial_state.nodes[2].id = 3;
  4206. initial_state.nodes[2].role = ax::mojom::Role::kGenericContainer;
  4207. AXTree tree(initial_state);
  4208. AXTreeUpdate tree_update;
  4209. tree_update.nodes.resize(1);
  4210. // Remove child from node:2, and add State::kIgnored
  4211. tree_update.nodes[0] = initial_state.nodes[1];
  4212. tree_update.nodes[0].AddState(ax::mojom::State::kIgnored);
  4213. tree_update.nodes[0].child_ids.clear();
  4214. // Before node:3 is deleted, the unignored parent is node:2.
  4215. // Assert that this is the case in |OnNodeWillBeDeleted|.
  4216. TestAXTreeObserver test_observer(&tree);
  4217. test_observer.unignored_parent_id_before_node_deleted = 2;
  4218. ASSERT_TRUE(tree.Unserialize(tree_update));
  4219. }
  4220. TEST(AXTreeTest, OnNodeHasBeenDeleted) {
  4221. AXTreeUpdate initial_state;
  4222. initial_state.root_id = 1;
  4223. initial_state.nodes.resize(6);
  4224. initial_state.nodes[0].id = 1;
  4225. initial_state.nodes[0].role = ax::mojom::Role::kRootWebArea;
  4226. initial_state.nodes[0].child_ids = {2};
  4227. initial_state.nodes[1].id = 2;
  4228. initial_state.nodes[1].role = ax::mojom::Role::kButton;
  4229. initial_state.nodes[1].child_ids = {3, 4};
  4230. initial_state.nodes[2].id = 3;
  4231. initial_state.nodes[2].role = ax::mojom::Role::kCheckBox;
  4232. initial_state.nodes[3].id = 4;
  4233. initial_state.nodes[3].role = ax::mojom::Role::kStaticText;
  4234. initial_state.nodes[3].child_ids = {5, 6};
  4235. initial_state.nodes[4].id = 5;
  4236. initial_state.nodes[4].role = ax::mojom::Role::kInlineTextBox;
  4237. initial_state.nodes[5].id = 6;
  4238. initial_state.nodes[5].role = ax::mojom::Role::kInlineTextBox;
  4239. AXTree tree(initial_state);
  4240. AXTreeUpdate update;
  4241. update.nodes.resize(2);
  4242. update.nodes[0] = initial_state.nodes[1];
  4243. update.nodes[0].child_ids = {4};
  4244. update.nodes[1] = initial_state.nodes[3];
  4245. update.nodes[1].child_ids = {};
  4246. TestAXTreeObserver test_observer(&tree);
  4247. ASSERT_TRUE(tree.Unserialize(update));
  4248. EXPECT_EQ(3U, test_observer.deleted_ids().size());
  4249. EXPECT_EQ(3, test_observer.deleted_ids()[0]);
  4250. EXPECT_EQ(5, test_observer.deleted_ids()[1]);
  4251. EXPECT_EQ(6, test_observer.deleted_ids()[2]);
  4252. // Verify that the nodes we intend to delete in the update are actually
  4253. // absent from the tree.
  4254. for (auto id : test_observer.deleted_ids()) {
  4255. SCOPED_TRACE(::testing::Message()
  4256. << "Node with id=" << id << ", should not exist in the tree");
  4257. EXPECT_EQ(nullptr, tree.GetFromId(id));
  4258. }
  4259. }
  4260. // Tests a fringe scenario that may happen if multiple AXTreeUpdates are merged.
  4261. // Make sure that we correctly Unserialize if a newly created node is deleted,
  4262. // and possibly recreated later.
  4263. TEST(AXTreeTest, SingleUpdateDeletesNewlyCreatedChildNode) {
  4264. AXTreeUpdate initial_state;
  4265. initial_state.root_id = 1;
  4266. initial_state.nodes.resize(1);
  4267. initial_state.nodes[0].id = 1;
  4268. initial_state.nodes[0].role = ax::mojom::Role::kRootWebArea;
  4269. AXTree tree(initial_state);
  4270. AXTreeUpdate tree_update;
  4271. tree_update.nodes.resize(6);
  4272. // Add child node:2
  4273. tree_update.nodes[0] = initial_state.nodes[0];
  4274. tree_update.nodes[0].child_ids = {2};
  4275. tree_update.nodes[1].id = 2;
  4276. tree_update.nodes[1].role = ax::mojom::Role::kGenericContainer;
  4277. // Remove child node:2
  4278. tree_update.nodes[2] = initial_state.nodes[0];
  4279. // Add child node:2
  4280. tree_update.nodes[3] = initial_state.nodes[0];
  4281. tree_update.nodes[3].child_ids = {2};
  4282. tree_update.nodes[4].id = 2;
  4283. tree_update.nodes[4].role = ax::mojom::Role::kGenericContainer;
  4284. // Remove child node:2
  4285. tree_update.nodes[5] = initial_state.nodes[0];
  4286. ASSERT_TRUE(tree.Unserialize(tree_update)) << tree.error();
  4287. ASSERT_EQ(
  4288. "AXTree\n"
  4289. "id=1 rootWebArea (0, 0)-(0, 0)\n",
  4290. tree.ToString());
  4291. // Unserialize again, but with another add child.
  4292. tree_update.nodes.resize(8);
  4293. tree_update.nodes[6] = initial_state.nodes[0];
  4294. tree_update.nodes[6].child_ids = {2};
  4295. tree_update.nodes[7].id = 2;
  4296. tree_update.nodes[7].role = ax::mojom::Role::kGenericContainer;
  4297. ASSERT_TRUE(tree.Unserialize(tree_update)) << tree.error();
  4298. ASSERT_EQ(
  4299. "AXTree\n"
  4300. "id=1 rootWebArea (0, 0)-(0, 0) child_ids=2\n"
  4301. " id=2 genericContainer (0, 0)-(0, 0)\n",
  4302. tree.ToString());
  4303. }
  4304. // Tests a fringe scenario that may happen if multiple AXTreeUpdates are merged.
  4305. // Make sure that we correctly Unserialize if a node is reparented multiple
  4306. // times.
  4307. TEST(AXTreeTest, SingleUpdateReparentsNodeMultipleTimes) {
  4308. // ++{kRootWebArea, 1}
  4309. // ++++{kList, 2}
  4310. // ++++++{kListItem, 4}
  4311. // ++++{kList, 3}
  4312. AXTreeUpdate initial_state;
  4313. initial_state.root_id = 1;
  4314. initial_state.nodes.resize(4);
  4315. initial_state.nodes[0].id = 1;
  4316. initial_state.nodes[0].role = ax::mojom::Role::kRootWebArea;
  4317. initial_state.nodes[0].child_ids = {2, 3};
  4318. initial_state.nodes[1].id = 2;
  4319. initial_state.nodes[1].role = ax::mojom::Role::kList;
  4320. initial_state.nodes[1].child_ids = {4};
  4321. initial_state.nodes[2].id = 3;
  4322. initial_state.nodes[2].role = ax::mojom::Role::kList;
  4323. initial_state.nodes[3].id = 4;
  4324. initial_state.nodes[3].role = ax::mojom::Role::kListItem;
  4325. AXTree tree(initial_state);
  4326. AXTreeUpdate tree_update;
  4327. tree_update.nodes.resize(6);
  4328. // Remove child node:4
  4329. tree_update.nodes[0].id = 2;
  4330. tree_update.nodes[0].role = ax::mojom::Role::kList;
  4331. // Reparent child node:4 onto node:3
  4332. tree_update.nodes[1].id = 3;
  4333. tree_update.nodes[1].role = ax::mojom::Role::kList;
  4334. tree_update.nodes[1].child_ids = {4};
  4335. tree_update.nodes[2].id = 4;
  4336. tree_update.nodes[2].role = ax::mojom::Role::kListItem;
  4337. // Remove child ndoe:4
  4338. tree_update.nodes[3].id = 3;
  4339. tree_update.nodes[3].role = ax::mojom::Role::kList;
  4340. // Reparent child node:4 onto node:2
  4341. tree_update.nodes[4].id = 2;
  4342. tree_update.nodes[4].role = ax::mojom::Role::kList;
  4343. tree_update.nodes[4].child_ids = {4};
  4344. tree_update.nodes[5].id = 4;
  4345. tree_update.nodes[5].role = ax::mojom::Role::kListItem;
  4346. ASSERT_TRUE(tree.Unserialize(tree_update)) << tree.error();
  4347. EXPECT_EQ(
  4348. "AXTree\nid=1 rootWebArea (0, 0)-(0, 0) child_ids=2,3\n"
  4349. " id=2 list (0, 0)-(0, 0) child_ids=4\n"
  4350. " id=4 listItem (0, 0)-(0, 0)\n"
  4351. " id=3 list (0, 0)-(0, 0)\n",
  4352. tree.ToString());
  4353. // Unserialize again, but with another reparent.
  4354. tree_update.nodes.resize(9);
  4355. tree_update.nodes[6] = tree_update.nodes[0];
  4356. tree_update.nodes[7] = tree_update.nodes[1];
  4357. tree_update.nodes[8] = tree_update.nodes[2];
  4358. ASSERT_TRUE(tree.Unserialize(tree_update)) << tree.error();
  4359. EXPECT_EQ(
  4360. "AXTree\nid=1 rootWebArea (0, 0)-(0, 0) child_ids=2,3\n"
  4361. " id=2 list (0, 0)-(0, 0)\n"
  4362. " id=3 list (0, 0)-(0, 0) child_ids=4\n"
  4363. " id=4 listItem (0, 0)-(0, 0)\n",
  4364. tree.ToString());
  4365. }
  4366. // Tests a fringe scenario that may happen if multiple AXTreeUpdates are merged.
  4367. // Make sure that we correctly Unserialize if a newly created node toggles its
  4368. // ignored state.
  4369. TEST(AXTreeTest, SingleUpdateIgnoresNewlyCreatedUnignoredChildNode) {
  4370. AXTreeUpdate initial_state;
  4371. initial_state.root_id = 1;
  4372. initial_state.nodes.resize(1);
  4373. initial_state.nodes[0].id = 1;
  4374. initial_state.nodes[0].role = ax::mojom::Role::kRootWebArea;
  4375. AXTree tree(initial_state);
  4376. AXTreeUpdate tree_update;
  4377. tree_update.nodes.resize(3);
  4378. // Add child node:2
  4379. tree_update.nodes[0] = initial_state.nodes[0];
  4380. tree_update.nodes[0].child_ids = {2};
  4381. tree_update.nodes[1].id = 2;
  4382. tree_update.nodes[1].role = ax::mojom::Role::kGenericContainer;
  4383. // Add State::kIgnored to node:2
  4384. tree_update.nodes[2] = tree_update.nodes[1];
  4385. tree_update.nodes[2].AddState(ax::mojom::State::kIgnored);
  4386. ASSERT_TRUE(tree.Unserialize(tree_update)) << tree.error();
  4387. ASSERT_EQ(
  4388. "AXTree\n"
  4389. "id=1 rootWebArea (0, 0)-(0, 0) child_ids=2\n"
  4390. " id=2 genericContainer IGNORED (0, 0)-(0, 0)\n",
  4391. tree.ToString());
  4392. }
  4393. // Tests a fringe scenario that may happen if multiple AXTreeUpdates are merged.
  4394. // Make sure that we correctly Unserialize if a newly created node toggles its
  4395. // ignored state.
  4396. TEST(AXTreeTest, SingleUpdateTogglesIgnoredStateAfterCreatingNode) {
  4397. AXTreeUpdate initial_state;
  4398. initial_state.root_id = 1;
  4399. initial_state.nodes.resize(1);
  4400. initial_state.nodes[0].id = 1;
  4401. initial_state.nodes[0].role = ax::mojom::Role::kRootWebArea;
  4402. AXTree tree(initial_state);
  4403. ASSERT_EQ(
  4404. "AXTree\n"
  4405. "id=1 rootWebArea (0, 0)-(0, 0)\n",
  4406. tree.ToString());
  4407. AXTreeUpdate tree_update;
  4408. tree_update.nodes.resize(5);
  4409. // Add child node:2, node:3
  4410. tree_update.nodes[0] = initial_state.nodes[0];
  4411. tree_update.nodes[0].child_ids = {2, 3};
  4412. tree_update.nodes[1].id = 2;
  4413. tree_update.nodes[1].role = ax::mojom::Role::kGenericContainer;
  4414. tree_update.nodes[2].id = 3;
  4415. tree_update.nodes[2].role = ax::mojom::Role::kGenericContainer;
  4416. tree_update.nodes[2].AddState(ax::mojom::State::kIgnored);
  4417. // Add State::kIgnored to node:2
  4418. tree_update.nodes[3] = tree_update.nodes[1];
  4419. tree_update.nodes[3].AddState(ax::mojom::State::kIgnored);
  4420. // Remove State::kIgnored from node:3
  4421. tree_update.nodes[4] = tree_update.nodes[2];
  4422. tree_update.nodes[4].RemoveState(ax::mojom::State::kIgnored);
  4423. ASSERT_TRUE(tree.Unserialize(tree_update)) << tree.error();
  4424. ASSERT_EQ(
  4425. "AXTree\n"
  4426. "id=1 rootWebArea (0, 0)-(0, 0) child_ids=2,3\n"
  4427. " id=2 genericContainer IGNORED (0, 0)-(0, 0)\n"
  4428. " id=3 genericContainer (0, 0)-(0, 0)\n",
  4429. tree.ToString());
  4430. }
  4431. // Tests a fringe scenario that may happen if multiple AXTreeUpdates are merged.
  4432. // Make sure that we correctly Unserialize if a node toggles its ignored state
  4433. // and is then removed from the tree.
  4434. TEST(AXTreeTest, SingleUpdateTogglesIgnoredStateBeforeDestroyingNode) {
  4435. AXTreeUpdate initial_state;
  4436. initial_state.root_id = 1;
  4437. initial_state.nodes.resize(3);
  4438. initial_state.nodes[0].id = 1;
  4439. initial_state.nodes[0].role = ax::mojom::Role::kRootWebArea;
  4440. initial_state.nodes[0].child_ids = {2, 3};
  4441. initial_state.nodes[1].id = 2;
  4442. initial_state.nodes[1].role = ax::mojom::Role::kGenericContainer;
  4443. initial_state.nodes[2].id = 3;
  4444. initial_state.nodes[2].role = ax::mojom::Role::kGenericContainer;
  4445. initial_state.nodes[2].AddState(ax::mojom::State::kIgnored);
  4446. AXTree tree(initial_state);
  4447. ASSERT_EQ(
  4448. "AXTree\n"
  4449. "id=1 rootWebArea (0, 0)-(0, 0) child_ids=2,3\n"
  4450. " id=2 genericContainer (0, 0)-(0, 0)\n"
  4451. " id=3 genericContainer IGNORED (0, 0)-(0, 0)\n",
  4452. tree.ToString());
  4453. AXTreeUpdate tree_update;
  4454. tree_update.nodes.resize(3);
  4455. // Add State::kIgnored to node:2
  4456. tree_update.nodes[0] = initial_state.nodes[1];
  4457. tree_update.nodes[0].AddState(ax::mojom::State::kIgnored);
  4458. // Remove State::kIgnored from node:3
  4459. tree_update.nodes[1] = initial_state.nodes[2];
  4460. tree_update.nodes[1].RemoveState(ax::mojom::State::kIgnored);
  4461. // Remove child node:2, node:3
  4462. tree_update.nodes[2] = initial_state.nodes[0];
  4463. tree_update.nodes[2].child_ids.clear();
  4464. ASSERT_TRUE(tree.Unserialize(tree_update)) << tree.error();
  4465. ASSERT_EQ(
  4466. "AXTree\n"
  4467. "id=1 rootWebArea (0, 0)-(0, 0)\n",
  4468. tree.ToString());
  4469. }
  4470. TEST(AXTreeTest, FocusChangeTogglesIgnoredState) {
  4471. AXTree::SetFocusedNodeShouldNeverBeIgnored();
  4472. AXNodeData root;
  4473. AXNodeData text_field;
  4474. AXNodeData button_1;
  4475. AXNodeData button_2;
  4476. root.id = 1;
  4477. text_field.id = 2;
  4478. button_1.id = 3;
  4479. button_2.id = 4;
  4480. root.role = ax::mojom::Role::kRootWebArea;
  4481. root.child_ids = {text_field.id, button_1.id, button_2.id};
  4482. text_field.role = ax::mojom::Role::kTextField;
  4483. text_field.AddState(ax::mojom::State::kEditable);
  4484. button_1.role = ax::mojom::Role::kButton;
  4485. button_1.AddState(ax::mojom::State::kIgnored);
  4486. button_2.role = ax::mojom::Role::kButton;
  4487. button_2.AddState(ax::mojom::State::kIgnored);
  4488. AXTreeUpdate update;
  4489. update.root_id = root.id;
  4490. update.nodes = {root, text_field, button_1, button_2};
  4491. AXTree tree(update);
  4492. TestAXTreeObserver test_observer(&tree);
  4493. ASSERT_NE(nullptr, tree.root());
  4494. ASSERT_EQ(3u, tree.root()->children().size());
  4495. EXPECT_EQ(1u, tree.root()->GetUnignoredChildCount());
  4496. EXPECT_EQ(0u, tree.root()->children()[0]->GetUnignoredIndexInParent());
  4497. EXPECT_EQ(0u, tree.root()->children()[1]->GetUnignoredIndexInParent());
  4498. EXPECT_EQ(0u, tree.root()->children()[2]->GetUnignoredIndexInParent());
  4499. EXPECT_FALSE(tree.root()->children()[0]->IsIgnored());
  4500. EXPECT_TRUE(tree.root()->children()[1]->IsIgnored());
  4501. EXPECT_TRUE(tree.root()->children()[2]->IsIgnored());
  4502. EXPECT_EQ(
  4503. "AXTree\n"
  4504. "id=1 rootWebArea (0, 0)-(0, 0) child_ids=2,3,4\n"
  4505. " id=2 textField EDITABLE (0, 0)-(0, 0)\n"
  4506. " id=3 button IGNORED (0, 0)-(0, 0)\n"
  4507. " id=4 button IGNORED (0, 0)-(0, 0)\n",
  4508. tree.ToString());
  4509. //
  4510. // Focus the first button which should change its ignored state.
  4511. //
  4512. AXTreeData tree_data = tree.data();
  4513. tree_data.focus_id = button_1.id;
  4514. AXTreeUpdate update_2;
  4515. update_2.has_tree_data = true;
  4516. update_2.tree_data = tree_data;
  4517. update_2.nodes = {button_1};
  4518. ASSERT_TRUE(tree.Unserialize(update_2)) << tree.error();
  4519. ASSERT_EQ(3u, tree.root()->children().size());
  4520. EXPECT_EQ(2u, tree.root()->GetUnignoredChildCount());
  4521. EXPECT_EQ(0u, tree.root()->children()[0]->GetUnignoredIndexInParent());
  4522. EXPECT_EQ(1u, tree.root()->children()[1]->GetUnignoredIndexInParent());
  4523. EXPECT_EQ(0u, tree.root()->children()[2]->GetUnignoredIndexInParent());
  4524. EXPECT_FALSE(tree.root()->children()[0]->IsIgnored());
  4525. EXPECT_FALSE(tree.root()->children()[1]->IsIgnored());
  4526. EXPECT_TRUE(tree.root()->children()[2]->IsIgnored());
  4527. EXPECT_EQ(
  4528. "AXTree focus_id=3\n"
  4529. "id=1 rootWebArea (0, 0)-(0, 0) child_ids=2,3,4\n"
  4530. " id=2 textField EDITABLE (0, 0)-(0, 0)\n"
  4531. " id=3 button IGNORED (0, 0)-(0, 0)\n"
  4532. " id=4 button IGNORED (0, 0)-(0, 0)\n",
  4533. tree.ToString());
  4534. {
  4535. const std::vector<std::string>& change_log =
  4536. test_observer.attribute_change_log();
  4537. ASSERT_EQ(1U, change_log.size());
  4538. // Button_1 has an ID of 3.
  4539. EXPECT_EQ("IsIgnored changed on node ID 3 to false", change_log[0]);
  4540. }
  4541. //
  4542. // Focus the second button which should change its ignored state.
  4543. //
  4544. tree_data.focus_id = button_2.id;
  4545. update_2.has_tree_data = true;
  4546. update_2.tree_data = tree_data;
  4547. update_2.nodes = {button_1, button_2};
  4548. ASSERT_TRUE(tree.Unserialize(update_2)) << tree.error();
  4549. ASSERT_EQ(3u, tree.root()->children().size());
  4550. EXPECT_EQ(2u, tree.root()->GetUnignoredChildCount());
  4551. EXPECT_EQ(0u, tree.root()->children()[0]->GetUnignoredIndexInParent());
  4552. EXPECT_EQ(0u, tree.root()->children()[1]->GetUnignoredIndexInParent());
  4553. EXPECT_EQ(1u, tree.root()->children()[2]->GetUnignoredIndexInParent());
  4554. EXPECT_FALSE(tree.root()->children()[0]->IsIgnored());
  4555. EXPECT_TRUE(tree.root()->children()[1]->IsIgnored());
  4556. EXPECT_FALSE(tree.root()->children()[2]->IsIgnored());
  4557. EXPECT_EQ(
  4558. "AXTree focus_id=4\n"
  4559. "id=1 rootWebArea (0, 0)-(0, 0) child_ids=2,3,4\n"
  4560. " id=2 textField EDITABLE (0, 0)-(0, 0)\n"
  4561. " id=3 button IGNORED (0, 0)-(0, 0)\n"
  4562. " id=4 button IGNORED (0, 0)-(0, 0)\n",
  4563. tree.ToString());
  4564. {
  4565. const std::vector<std::string>& change_log =
  4566. test_observer.attribute_change_log();
  4567. ASSERT_EQ(3U, change_log.size());
  4568. // Button_1 has an ID of 3 and button_2 an ID of 4.
  4569. EXPECT_EQ("IsIgnored changed on node ID 3 to true", change_log[1]);
  4570. EXPECT_EQ("IsIgnored changed on node ID 4 to false", change_log[2]);
  4571. }
  4572. //
  4573. // Remove the focus completely, which should reset the ignored state of both
  4574. // buttons.
  4575. //
  4576. tree_data.focus_id = kInvalidAXNodeID;
  4577. update_2.has_tree_data = true;
  4578. update_2.tree_data = tree_data;
  4579. update_2.nodes = {button_1, button_2};
  4580. ASSERT_TRUE(tree.Unserialize(update_2)) << tree.error();
  4581. ASSERT_EQ(3u, tree.root()->children().size());
  4582. EXPECT_EQ(1u, tree.root()->GetUnignoredChildCount());
  4583. EXPECT_EQ(0u, tree.root()->children()[0]->GetUnignoredIndexInParent());
  4584. EXPECT_EQ(0u, tree.root()->children()[1]->GetUnignoredIndexInParent());
  4585. EXPECT_EQ(0u, tree.root()->children()[2]->GetUnignoredIndexInParent());
  4586. EXPECT_FALSE(tree.root()->children()[0]->IsIgnored());
  4587. EXPECT_TRUE(tree.root()->children()[1]->IsIgnored());
  4588. EXPECT_TRUE(tree.root()->children()[2]->IsIgnored());
  4589. EXPECT_EQ(
  4590. "AXTree\n"
  4591. "id=1 rootWebArea (0, 0)-(0, 0) child_ids=2,3,4\n"
  4592. " id=2 textField EDITABLE (0, 0)-(0, 0)\n"
  4593. " id=3 button IGNORED (0, 0)-(0, 0)\n"
  4594. " id=4 button IGNORED (0, 0)-(0, 0)\n",
  4595. tree.ToString());
  4596. {
  4597. const std::vector<std::string>& change_log =
  4598. test_observer.attribute_change_log();
  4599. ASSERT_EQ(4U, change_log.size());
  4600. EXPECT_EQ("IsIgnored changed on node ID 4 to true", change_log[3]);
  4601. }
  4602. //
  4603. // Focus the first button using a special "...ForTesting" method in AXTree.
  4604. //
  4605. tree_data.focus_id = button_1.id;
  4606. tree.UpdateDataForTesting(tree_data);
  4607. ASSERT_EQ(3u, tree.root()->children().size());
  4608. EXPECT_EQ(2u, tree.root()->GetUnignoredChildCount());
  4609. EXPECT_EQ(0u, tree.root()->children()[0]->GetUnignoredIndexInParent());
  4610. EXPECT_EQ(1u, tree.root()->children()[1]->GetUnignoredIndexInParent());
  4611. EXPECT_EQ(0u, tree.root()->children()[2]->GetUnignoredIndexInParent());
  4612. EXPECT_FALSE(tree.root()->children()[0]->IsIgnored());
  4613. EXPECT_FALSE(tree.root()->children()[1]->IsIgnored());
  4614. EXPECT_TRUE(tree.root()->children()[2]->IsIgnored());
  4615. EXPECT_EQ(
  4616. "AXTree focus_id=3\n"
  4617. "id=1 rootWebArea (0, 0)-(0, 0) child_ids=2,3,4\n"
  4618. " id=2 textField EDITABLE (0, 0)-(0, 0)\n"
  4619. " id=3 button IGNORED (0, 0)-(0, 0)\n"
  4620. " id=4 button IGNORED (0, 0)-(0, 0)\n",
  4621. tree.ToString());
  4622. {
  4623. const std::vector<std::string>& change_log =
  4624. test_observer.attribute_change_log();
  4625. ASSERT_EQ(5U, change_log.size());
  4626. // Button_1 has an ID of 3.
  4627. EXPECT_EQ("IsIgnored changed on node ID 3 to false", change_log[4]);
  4628. }
  4629. }
  4630. // Tests that the IsInListMarker() method returns true if the current node is a
  4631. // list marker or if it's a descendant node of a list marker.
  4632. TEST(AXTreeTest, TestIsInListMarker) {
  4633. // This test uses the template of a list of one element: "1. List item"
  4634. AXTreeUpdate tree_update;
  4635. tree_update.root_id = 1;
  4636. tree_update.nodes.resize(8);
  4637. tree_update.nodes[0].id = 1;
  4638. tree_update.nodes[0].role = ax::mojom::Role::kList;
  4639. tree_update.nodes[0].child_ids = {2, 3};
  4640. tree_update.nodes[1].id = 2;
  4641. tree_update.nodes[1].role = ax::mojom::Role::kListItem;
  4642. tree_update.nodes[2].id = 3;
  4643. tree_update.nodes[2].child_ids = {4, 7};
  4644. tree_update.nodes[3].id = 4;
  4645. tree_update.nodes[3].role = ax::mojom::Role::kListMarker;
  4646. tree_update.nodes[3].child_ids = {5};
  4647. tree_update.nodes[4].id = 5;
  4648. tree_update.nodes[4].role = ax::mojom::Role::kStaticText; // "1. "
  4649. tree_update.nodes[4].child_ids = {6};
  4650. tree_update.nodes[5].id = 6;
  4651. tree_update.nodes[5].role = ax::mojom::Role::kInlineTextBox; // "1. "
  4652. tree_update.nodes[6].id = 7;
  4653. tree_update.nodes[6].role = ax::mojom::Role::kStaticText; // "List item"
  4654. tree_update.nodes[6].child_ids = {8};
  4655. tree_update.nodes[7].id = 8;
  4656. tree_update.nodes[7].role = ax::mojom::Role::kInlineTextBox; // "List item"
  4657. AXTree tree(tree_update);
  4658. AXNode* list_node = tree.GetFromId(1);
  4659. ASSERT_EQ(false, list_node->IsInListMarker());
  4660. AXNode* list_item_node = tree.GetFromId(2);
  4661. ASSERT_EQ(false, list_item_node->IsInListMarker());
  4662. AXNode* list_marker1 = tree.GetFromId(4);
  4663. ASSERT_EQ(true, list_marker1->IsInListMarker());
  4664. AXNode* static_node1 = tree.GetFromId(5);
  4665. ASSERT_EQ(true, static_node1->IsInListMarker());
  4666. AXNode* inline_node1 = tree.GetFromId(6);
  4667. ASSERT_EQ(true, inline_node1->IsInListMarker());
  4668. AXNode* static_node2 = tree.GetFromId(7);
  4669. ASSERT_EQ(false, static_node2->IsInListMarker());
  4670. AXNode* inline_node2 = tree.GetFromId(8);
  4671. ASSERT_EQ(false, inline_node2->IsInListMarker());
  4672. }
  4673. TEST(AXTreeTest, UpdateFromOutOfSyncTree) {
  4674. ui::AXNodeData empty_document;
  4675. empty_document.id = 1;
  4676. empty_document.role = ax::mojom::Role::kRootWebArea;
  4677. ui::AXTreeUpdate empty_document_initial_update;
  4678. empty_document_initial_update.root_id = empty_document.id;
  4679. empty_document_initial_update.nodes.push_back(empty_document);
  4680. AXTree tree;
  4681. EXPECT_TRUE(tree.Unserialize(empty_document_initial_update));
  4682. ui::AXNodeData root;
  4683. root.id = 3;
  4684. root.role = ax::mojom::Role::kRootWebArea;
  4685. root.child_ids = {1};
  4686. ui::AXNodeData div;
  4687. div.id = 1;
  4688. div.role = ax::mojom::Role::kGenericContainer;
  4689. ui::AXTreeUpdate first_update;
  4690. first_update.root_id = root.id;
  4691. first_update.node_id_to_clear = root.id;
  4692. first_update.nodes = {root, div};
  4693. EXPECT_TRUE(tree.Unserialize(first_update));
  4694. }
  4695. TEST(AXTreeTest, UnserializeErrors) {
  4696. base::HistogramTester histogram_tester;
  4697. ui::AXNodeData empty_document;
  4698. empty_document.id = 1;
  4699. empty_document.role = ax::mojom::Role::kRootWebArea;
  4700. ui::AXTreeUpdate tree_update;
  4701. tree_update.root_id = empty_document.id;
  4702. tree_update.nodes.push_back(empty_document);
  4703. AXTree tree;
  4704. EXPECT_TRUE(tree.Unserialize(tree_update));
  4705. ui::AXTreeUpdate tree_update_3;
  4706. tree_update_3.root_id = empty_document.id;
  4707. ui::AXNodeData disconnected_node;
  4708. disconnected_node.id = 2;
  4709. tree_update_3.nodes.push_back(disconnected_node);
  4710. #if defined(AX_FAIL_FAST_BUILD)
  4711. EXPECT_DEATH_IF_SUPPORTED(
  4712. tree.Unserialize(tree_update_3),
  4713. "2 will not be in the tree and is not the new root");
  4714. #else
  4715. EXPECT_FALSE(tree.Unserialize(tree_update_3));
  4716. EXPECT_EQ("2 will not be in the tree and is not the new root", tree.error());
  4717. histogram_tester.ExpectUniqueSample(
  4718. "Accessibility.Reliability.Tree.UnserializeError",
  4719. AXTreeUnserializeError::kNotInTree, 1);
  4720. #endif
  4721. }
  4722. } // namespace ui